Reachability and observability indices of a discrete-time periodic descriptor system (original) (raw)
Related papers
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.
2015
In this paper, we establish a model reduction technique for periodic discrete-time descriptor systems exploiting the generalized inverses of the periodic singular matrix pairs associated with the systems. We compute the generalized inverses of periodic singular matrix pairs to implement a structure preserving iterative method for the solution of the periodic projected Lyapunov equations that arise in analysis and modelling of periodic discrete-time descriptor systems. We extend the Smith method to solve the large scale projected periodic discrete-time algebraic Lyapunov equations in lifted form. A low-rank version of this method is also presented, which avoids the explicit lifted formulation and works directly with the period matrix coefficients. Moreover, we consider an application of the Lyapunov solvers in balanced truncation model reduction of periodic discrete-time descriptor systems. Numerical results are given to illustrate the efficiency and accuracy of the proposed methods.
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.
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.
Computing the zeros of periodic descriptor systems
Systems & Control Letters, 2003
In this paper, we give a numerically reliable algorithm to compute the zeros of a periodic descriptor system. The algorithm is a variant of the staircase algorithm applied to the system pencil of an equivalent lifted time-invariant state-space system and extracts a low-order pencil which contains the zeros (both ÿnite and inÿnite) as well as the Kronecker structure of the periodic descriptor system. The proposed algorithm is e cient in terms of complexity by exploiting the structure of the pencil and is exclusively based on orthogonal transformations, which ensures some form of numerical stability.
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.
On observability of irregular descriptor systems
IFAC Proceedings Volumes, 2014
In this paper, a method is proposed to check the observability of irregular linear time invariant descriptor systems. The method is based on the properties of restricted system equivalent, derived here from a given descriptor system by means of simple matrix theory. Using restricted system equivalent form, equivalence between the observability of a given descriptor system and that of its corresponding normal system has been established.
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. *
An Approach to Factorization of Spectral Matrix for Discrete-Time Descriptor System
IFAC Proceedings Volumes, 1993
This paper deals with a spectral factorization problem for discrete-time descriptor systems. We first derive a factorization algorithm for the spectral matrix formed by an RH 00 transfer matrix, and a numerical method is presented based on the generalized eigenvalue problem associated with a descriptor form representation of the spectral matrix. The spectral factorization algorithm is then extended to the case where the spectral matrix is generated by an improper RLoo matrix.