New methods for estimating the distance to uncontrollability

SIAM Journal on Matrix Analysis and Applications

Volumn 21, Issue 3, 2000, Pages 989-1003

  Gu, Ming ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Complexity; Controllability; Numerical stability; QR factorization

Indexed keywords

EID: 0034342240     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479897328856     Document Type: Article

References (31)

1. F. ALIZADEH, Interior-point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim., 5 (1995), pp. 13-51.
2. T. BEELEN AND P. VAN DOOREN, An improved algorithm for the computation of Kronecker's canonical form of a singular pencil, Linear Algebra Appl., 105 (1988), pp. 9-65.
3. T. BEELEN, P. VAN DOOREN, AND M. VERHAEGEN, A class of staircase algorithms for generalized state space systems, in Proceedings of the American Control Conference, Seattle, WA, 1986, pp. 425-426.
4. D. BOLEY, Computing the Controllability/Observability Decomposition of a Linear Time-Invariant Dynamic System: A Numerical Approach, Ph.D. thesis, Stanford University, Stanford, CA, 1981.
5. D. BOLEY AND G. GOLUB, The Lanczos-Arnoldi algorithm and controllability, Systems Control Lett., 4 (1984), pp. 317-324.
6. D. L. BOLEY, Computing rank-deficiency of rectangular matrix pencils, Systems Control Lett., 9 (1987), pp. 207-214.
7. D. L. BOLEY AND W.-S. LU, Measuring how far a controllable system is from uncontrollable one, IEEE Trans. Automat. Control, AC-31 (1986), pp. 249-251.
8. S. BOYD AND V. BALAKRISHNAN, A regularity result for the singular values of a transfer matrix and a quadratically convergent algorithm for computing its L∞-norm, Systems Control Lett., 15 (1990), pp. 1-7.
9. S. BOYD, V. BALAKRISHNAN, AND P. KABAMBA, A bisection method for computing the H∞ norm of a transfer matrix and related problems, Math. Control Signals Systems, 2 (1989), pp. 207-219.
10. R. BYERS, A bisection method for measuring the distance of a stable matrix to the unstable matrices, SIAM J. Sci. Statist. Comput., 9 (1988), pp. 875-881.
11. R. BYERS, Detecting nearly uncontrollable pairs, in Numerical Methods Proceedings of the International Symposium MTNS-89, vol. III, M. A. Kaashoek, J. H. van Schuppen, and A. C. M. Ran, eds., Springer-Verlag, New York, 1990, pp. 447-457.
12. J. DEMMEL, On condition numbers and the distance to the nearest ill-posed problem, Numer. Math., 51 (1987), pp. 251-289.
13. J. DEMMEL AND B. KÅGSTRÖM, Accurate solutions of ill-posed problems in control theory, SIAM J. Matrix Anal. Appl., 9 (1988), pp. 126-145.
14. J. DEMMEL AND B. KÅGSTRÖM, The generalized Schur decomposition of an arbitrary pencil A-λB: Robust software with error bounds and applications. Parts I and II, ACM Trans. Math. Software, 19 (1993), pp. 160-201.
15. R. EISING, The Distance Between a System and the Set of Uncontrollable Systems, Memo COSOR 82-19, Eindhoven Univ. Technol., Eindhoven, The Netherlands, 1982.
16. R. EISING, Between controllable and uncontrollable, Systems Control Lett., 4 (1984), pp. 263-264.
17. L. ELSNER AND C. HE, An algorithm for computing the distance to uncontrollability, Systems Control Lett., 17 (1991), pp. 453-464.
18. M. GAO AND M. NEUMANN, A global minimum search algorithm for estimating the distance to uncontrollability, Linear Algebra Appl., 188-189 (1993), pp. 305-350.
19. C. HE, Estimating the distance to uncontrollability: A fast method and a slow one, Systems Control Lett., 26 (1995), pp. 275-281.
20. T. KAILATH, Linear Systems, Prentice-Hall, Englewood Cliffs, NJ, 1980.
21. A. J. LAUB, Survey of computational methods in control theory, in Electric Power Problems: The Mathematical Challenge, A. M. Erisman, K. W. Neves, and M. H. Dwarakanath, eds., 1980, SIAM, Philadelphia, PA, pp. 231-260.
22. R. LEHOUCQ, Analysis and Implementation of an Implicitly Restarted Arnoldi Iteration, Ph.D. thesis, Rice University, Houston, TX, 1995.
23. R. B. LEHOUCQ AND D. C. SORENSEN, Deflation techniques for an implicitly restarted Arnoldi iteration, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 789-821.
24. G. MIMINIS, Numerical Algorithms for Controllability and Eigenvalue Location, Masters thesis, School of Computer Science, McGill University, Montreal, Quebec, Canada, 1981.
25. R. D. C. MONTEIRO, Primal-Dual Path Following Algorithms for Semidefinite Programming, manuscript, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, 1995.
26. C. C. PAIGE, Properties of numerical algorithms related to computing controllability, IEEE Trans. Automat. Control, AC-26 (1981), pp. 130-138.
27. R. V. PATEL, A. J. LAUB, AND P. M. VAN DOOREN, Numerical Linear Algebra Techniques for Systems and Control, IEEE Press, New York, 1994.
28. D. SORENSEN, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 357-385.
29. M. J. TODD, K. C. TOH, AND R. H. TÜTÜNCÜ, On the Nesterov-Todd Direction in Semidefinite Programming, Technical report 1154, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 1996.
30. P. VAN DOOREN, The computation of Kronecker's canonical form of a singular pencil, Linear Algebra Appl., 27 (1979), pp. 103-141.
31. M. WICKS AND R. A. DECARLO, Computing the distance to an uncontrollable system, IEEE Trans. Automat. Control, AC-36 (1991), pp. 39-49.