论文信息 - Descriptor representations without direct feedthrough term

Descriptor representations without direct feedthrough term

Abstract Descriptor representations are considered that are given by ( E , A , B , C , D ) with D = 0. Minimality under external equivalence is characterized in terms of the matrices E , A , B and C . Also, transformations are given by which minimal ( E , A , B , C ) representations are related under external equivalence. The transformations turn out to be more simple than in the “ D ≠ 0” case. Algorithms for rewriting an ( E , A , B , C , D ) representation in ( E , A , B , C ) form are also given. Finally, a realization procedure is presented for obtaining a minimal ( E , A , B , C ) representation for a system that is given in polynomial matrix fractional form.

Margreta Kuijper | M. Kuijper

[1] H. Rosenbrock. Structural properties of linear dynamical systems , 1974 .

[2] Jan C. Willems,et al. From time series to linear system - Part I. Finite dimensional linear time invariant systems , 1986, Autom..

[3] T. Kailath,et al. A generalized state-space for singular systems , 1981 .

[4] J. Schumacher,et al. Realization of autoregressive equations in pencil and descriptor form , 1990 .

[5] J. M. Schumacher,et al. Minimality of descriptor representations under external equivalence , 1991, Autom..

[6] J. Willems. Input-output and state-space representations of finite-dimensional linear time-invariant systems , 1983 .

[7] A. Willsky,et al. Boundary-value descriptor systems: well-posedness, reachability and observability , 1987 .

[8] A. Perdon,et al. Generalized state space realizations of non-proper rational transfer functions , 1982 .