Controllability of descriptor systems

From MaRDI portal





For singular or descriptor systems described by Eẋ\(=Ax+Bu\) (where the matrix E can be singular), different concepts of controllability have been suggested by various authors, e.g., \textit{V. A. Armentano} [Syst. Control Lett. 4, 199-202 (1984; Zbl 0538.93024)], \textit{G. C. Verghese, B. C. Levy} and \textit{T. Kailath} [IEEE Trans. Autom. Control AC-26, 811-831 (1981; Zbl 0541.34040)], \textit{E. L. Yip} and \textit{R. F. Sincovec} [ibid. AC-26, 702-707 (1981; Zbl 0482.93013)]. In this paper, the various concepts of controllability are analyzed comparatively, using the Kronecker canonical form of the matrix-pencil (\(\lambda\) E-A). Various properties and characterizations of the different concepts are presented. Implications on the regularity of the matrix-pencil (\(\lambda\) E-A), pole-assignment algorithms and robustness of such algorithms are also discussed briefly.











This page was built for publication: Controllability of descriptor systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777856)