Given a linear discrete system with initial state x0 and output function yi , we investigate a low dimensional linear systemthat produces, with a tolerance index ǫ, the same output function when the initial state belongs to a specified set, called ǫ-admissible set, that we characterize by a finite number of inequalities. We also give an algorithm which allows us to determine an ǫ-admissible set.
The paper addresses the problem of constrained pole placement in discrete-time linear systems. The design conditions are outlined in terms of linear matrix inequalities for the Dstable ellipse region in the complex Z plain. In addition, it is demonstrated that the D-stable circle region formulation is the special case of by this way formulated and solved pole placement problem. The proposed principle is enhanced for discrete-lime linear systems with polytopic uncertainties.
In this paper we study the dynamical behavior of linear discrete-time fractional systems. The first main result is that the norm of the difference of two different solutions of a time-varying discrete-time Caputo equation tends to zero not faster than polynomially. The second main result is a complete description of the decay to zero of the trajectories of one-dimensional time-invariant stable Caputo and Riemann-Liouville equations. Moreover, we present Volterra convolution equations, that are equivalent to Caputo and Riemann-Liouvile equations and we also show an explicit formula for the solution of systems of time-invariant Caputo equations.