Kalman decomposition of linear fractional transformation representations and minimality
- 1 January 1997
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 6 (07431619) , 3557-3561 vol.6
- https://doi.org/10.1109/acc.1997.609484
Abstract
A method of decomposing systems captured as linear fractional transformations on noncommuting operators into a Kalman type of decomposition is presented. By considering the operators as acting on vector valued discrete time signals, we generalize the standard notions of controllability and observability to the uncertain case. These notions can then be used to establish the minimality of a given representation, and form the basis for tractable algorithms which can be used to construct minimal representations.Keywords
This publication has 7 references indexed in Scilit:
- Realizations of uncertain systems and formal power seriesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Approximate behaviorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Minimality, controllability and observability for uncertain systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1997
- Model reduction of multidimensional and uncertain systemsIEEE Transactions on Automatic Control, 1996
- Robust stability with time-varying structured uncertaintyIEEE Transactions on Automatic Control, 1994
- Gain scheduling via linear fractional transformationsSystems & Control Letters, 1994
- The complex structured singular valueAutomatica, 1993