Computing the distance to an uncontrollable system
- 7 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2361-2366 vol.3
- https://doi.org/10.1109/cdc.1989.70596
Abstract
Algorithms for computing the distance from a particular controllable system to the closest uncontrollable system are presented. An interpretation of the problem is suggested, and some results from earlier research are unified. The interpretation suggested and the associated theoretical results lead to an efficient iterative algorithm for computing the closest system. Algorithms are presented for both the real and the complex perturbation problem, when the system under investigation is real or complex. Real perturbations occurring to complex systems are considered.Keywords
This publication has 7 references indexed in Scilit:
- Controllability and stability radii for companion form systemsMathematics of Control, Signals, and Systems, 1988
- Computing rank-deficiency of rectangular matrix pencilsSystems & Control Letters, 1987
- Measuring how far a controllable system is from an uncontrollable oneIEEE Transactions on Automatic Control, 1986
- How near is a stable matrix to an unstable matrix?Published by American Mathematical Society (AMS) ,1985
- Between controllable and uncontrollableSystems & Control Letters, 1984
- Properties of numerical algorithms related to computing controllabilityIEEE Transactions on Automatic Control, 1981
- The singular value decomposition: Its computation and some applicationsIEEE Transactions on Automatic Control, 1980