The computation of Luenberger canonical forms using elementary similarity transformations
- 1 January 1976
- journal article
- research article
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 7 (1) , 1-15
- https://doi.org/10.1080/00207727608941896
Abstract
In this paper algorithms far the computation of all four Luonbarger canonical forms are presented. The algorithms are based on an appropriate sequence of elementary similarity transformations and are well suited to digital computer implementation. They also provide considerable improvement over existing methods particularly when the transformation matrix as well as the canonical form is required.Keywords
This publication has 11 references indexed in Scilit:
- A computational procedure for transfer-function evaluationInternational Journal of Control, 1974
- An efficient algorithm for calculation of the Luenberger canonical formIEEE Transactions on Automatic Control, 1973
- Decouplable multivariable systems: canonical forms and pole assignmentProceedings of the Institution of Electrical Engineers, 1973
- Design of low-order observers for linear feedback control lawsIEEE Transactions on Automatic Control, 1972
- Invariant Description of Linear, Time-Invariant Controllable SystemsSIAM Journal on Control, 1972
- A new computational solution of the linear optimal regulator problemIEEE Transactions on Automatic Control, 1971
- Computation of minimal representations of a rational transfer-function matrixProceedings of the Institution of Electrical Engineers, 1968
- Transformation of time-variable systems to canonical (phase-variable) formIEEE Transactions on Automatic Control, 1966
- Observers for multivariable systemsIEEE Transactions on Automatic Control, 1966
- A note on the transformation to canonical (phase-variable) formIEEE Transactions on Automatic Control, 1964