Reachability/Observability Gramians and Balanced Realization of Periodic Descriptor Systems (original) (raw)
Related papers
Reachability and observability indices of a discrete-time periodic descriptor system
Applied Mathematics and Computation, 2004
This work introduces the indices of reachability and observability of a discrete-time periodic descriptor linear system. The reachability and observability indices at time s, s 2 Z, of a periodic collection of nonproper transfer matrices are characterized. Using a special kind of coprime decompositions, the relationship between the indices at consecutive times is analyzed and an algorithm is constructed.
2007
From the necessary and sufficient conditions for complete reachability and observability of periodic descriptor systems with time-varying dimensions, the symmetric positive semidefinite reachability/observability Gramians are defined. These Gramians can be shown to satisfy some projected generalized discrete-time periodic Lyapunov equations. We propose a numerical method for solving these projected Lyapunov equations, and give an illustrative numerical example. As an application of our results, the balanced realization of periodic descriptor systems is discussed.
Model Reduction of Periodic Descriptor Systems Using Balanced Truncation
Lecture Notes in Electrical Engineering, 2011
Linear periodic descriptor systems represent a broad class of time evolutionary processes in micro-electronics and circuit simulation. In this paper, we consider discrete-time linear periodic descriptor systems and study the concepts of periodic reachability and observability Gramians. We also discuss a lifted representation of periodic descriptor systems and propose a balanced truncation model reduction method for such systems. The behaviour of the suggested model reduction technique is illustrated using a numerical example.
Positive N-periodic descriptor control systems
Systems & Control Letters, 2004
This paper establishes the relationship between the positive N -periodic descriptor system in discrete-time and its associated invariant systems. Reachability and controllability properties of these kinds of systems are analyzed. Transmission of structural properties from the N -periodic system to their associated invariant systems is studied. Finally, some comments on the stability property are made.
Some invariants of discrete-time descriptor systems
Applied Mathematics and Computation, 2002
Many papers analyze the role of controllability and observability indices of normal linear systems in control theory and their use in the study of structural properties. This work introduces these indices for linear discrete-time descriptor systems. Such indices are studied in two different ways, by means of the state-space approach and using its transfer matrix. A canonical form of the state-space system and a special decomposition of the nonproper transfer matrix are considered in order to discuss the reachability and observability indices.
Circuits, Systems, and Signal Processing, 1989
In this paper we study the system-theoretic properties of two related classes of shift-invariant two-point boundary-value descriptor systems (TPBVDSs), namely displacement systems for which Green's function is shift-invariant, and stationary systems for which the input-output map is stationary. For such systems it is possible to obtain detailed characterizations of the properties of weak reachability and observability introduced in [16] and of minimality as well. An important difference, that has also been noted before in a different context , is that there is a certain level of nonuniqueness in minimal realizations. Another property that is studied in this paper is that of extendibility, i.e., the concept of considering a TPBVDS as being defined on a sequence of intervals of increasing length. Necessary and sufficient conditions for extendibility are given. *
Representations and structural properties of periodic systems
Automatica, 2007
We consider periodic behavioral systems as introduced in . A behavioral framework for periodically time-varying systems. In analyze two main issues: behavioral representation, and controllability/autonomy. More concretely, we study the equivalence and the minimality of kernel representations, and introduce latent variable (and, in particular, image) representations. Moreover we relate the controllability of a periodic system with the controllability of an associated time-invariant system known as lifted system, and derive a controllability test. Further, we prove the existence of an autonomous/controllable decomposition similar to the time-invariant case. Finally, we introduce a new concept of free variables and inputs, which can be regarded as a generalization of the one adopted for time-invariant systems, but appears to be more adequate for the periodic case. ᭧
Geometrical conditions for the reachability and realizability of positive periodic discrete systems
Linear Algebra and Its Applications, 1997
Reachability and realizability of discrete-time linear systems, in which the state variable and the input are constrained to lie in the positive orthant n+, are studied. More precisely, a characterization of positive reachability is given in terms of certain geometrical conditions on the reachability cones. Further, it is shown that the existence of certain polyhedral cones is equivalent to positive periodic realizations. The connection between the above two kinds of cones is established.
Minimal realizations for discrete-time linear periodic systems
Linear Algebra and its Applications, 1992
Given an input-output periodic application, we prove that a periodii realization is minimal if and only if it is reachable and observable. We define the block Hankel matrix associated with the input-output periodic application, and we obtain the dimension of the minimal realization by means of the rank of it. This is the extension of the well-known result for the invariant case. Furthermore, we study similar periodic systems which are basic for getting minimal periodic realizations. 1.
Periodic Systems Realization Theory with Applications
New Trends in Design of Control Systems 1994, 1995
A general framework based on operators on sequences is presented. It is shown that it is very suitable for the description of periodic system. With it two liftings are derived which enable to represent a periodic system by a time invariant one. Conections are also made to the notion of operational transfer functions, and more generally the operational transfer inclusion. The realization of periodic systems from their impulse response data is given. Finally, this framework is shown to be advantageous in the computation of robust periodic controllers for time-invariant systems.