Related papers: Polynomial methods to construct inputs for uniform…

This document presents a combinatorial framework for analyzing assembly systems using generating functions. We explore the theory through concrete examples, such as linear polymers, and develop recursive equations to characterize valid…

A singularly perturbed linear system of second order ordinary differential equations of reaction-diffusion type with given boundary conditions is considered. The leading term of each equation is multiplied by a small positive parameter.…

Discrete Search of integer spaces for tool parameter values provides a powerful methodology for modeling and finding a heuristically optimal parameter list for a given system. Current tools and implementations that exist focus primarily on…

Projection algorithms are well known for their simplicity and flexibility in solving feasibility problems. They are particularly important in practice due to minimal requirements for software implementation and maintenance. In this work, we…

Exploiting tools from algebraic geometry, the problem of finiteness of determination of accessibility/strong accessibility is investigated for polynomial systems and also for analytic systems that are immersible into polynomial systems. The…

We study an ancient problem that in a static or dynamical system, sought an optimal path, which the context always means within an extremal condition. In fact, through those discussions about this theme, we established a universal essential…

We calculate the probability that random polynomial matrices over a finite field with certain structures are right prime or left prime, respectively. In particular, we give an asymptotic formula for the probability that finitely many…

In this work we present a new simple but efficient scheme - Subsquares approach - for development of algorithms for enclosing the solution set of overdetermined interval linear systems. We are going to show two algorithms based on this…

This work studies the average complexity of solving structured polynomial systems that are characterized by a low evaluation cost, as opposed to the dense random model previously used. Firstly, we design a continuation algorithm that…

In this paper, the reachability of dimension-bounded linear systems is investigated.Since state dimensions of dimension-bounded linear systems vary with time, the expression of state dimension at each time is provided.A method for judging…

The main purpose of this paper is to formulate new conditions for smooth linearization of nonautonomous systems with discrete and continuous time. Our results assume that the linear part admits a nonuniform polynomial dichotomy and that the…

In this paper we generalize the involutive methods and algorithms devised for polynomial ideals to differential ones generated by a finite set of linear differential polynomials in the differential polynomial ring over a zero characteristic…

While the design of optimal peak-to-peak controllers/observers for linear systems is known to be a difficult problem, this problem becomes interestingly much easier in the context of interval observers because of the positive nature of the…

We provide algorithmically verifiable necessary and sufficient conditions for fundamental system theoretic properties of discrete time linear systems subject to data losses. More precisely, the systems in our modeling framework are subject…

In this paper, we consider the problem of scheduling an application on a parallel computational platform. The application is a particular task graph, either a linear chain of tasks, or a set of independent tasks. The platform is made of…

This work develops a class of probabilistic algorithms for the numerical solution of nonlinear, time-dependent partial differential equations (PDEs). Current state-of-the-art PDE solvers treat the space- and time-dimensions separately,…

In this paper a novel computational technique for finite discrete approximation of continuous dynamical systems suitable for a significant class of biochemical dynamical systems is introduced. The method is parameterized in order to affect…

Ensemble control, an emerging research field focusing on the study of large populations of dynamical systems, has demonstrated great potential in numerous scientific and practical applications. Striking examples include pulse design for…

In this paper, we study the control properties of a new class of stochastic ensemble systems that consists of families of random variables. These random variables provide an increasingly good approximation of an unknown discrete,…

We present a method of computing backward reachable sets for nonlinear discrete-time control systems possessing continuous symmetries. The starting point is a dynamic game formulation of reachability analysis where control inputs aim to…