Computational study and comparisons of LFT reducibility methods
- 1 January 1998
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1013-1017 vol.2
- https://doi.org/10.1109/acc.1998.703562
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Approximate behaviorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Minimality for uncertain systems and IQCsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A new approach for analysis and synthesis of time-varying systemsIEEE Transactions on Automatic Control, 1999
- A necessary and sufficient minimality condition for uncertain systemsIEEE Transactions on Automatic Control, 1999
- Minimality, controllability and observability for uncertain systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1997
- Kalman decomposition of linear fractional transformation representations and minimalityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1997
- Model reduction of multidimensional and uncertain systemsIEEE Transactions on Automatic Control, 1996
- Gain scheduling via linear fractional transformationsSystems & Control Letters, 1994