Staircase failures explained by orthogonal versal forms

SIAM Journal on Matrix Analysis and Applications

Volumn 21, Issue 3, 2000, Pages 1004-1025

  Edelman, Alan ^a   Ma, Yanyuan ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Jordan structure; Kronecker structure; Staircase algorithm; SVD; Versal deformation

Indexed keywords

EID: 0034342260     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S089547989833574X     Document Type: Article

References (36)

1. V. ARNOLD, On matrices depending on parameters, Russian Math. Surveys, 26 (1971), pp. 29-43.
2. T. BEELEN AND P. V. 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. D. BOLEY, Estimating the sensitivity of the algebraic structure of pencils with simple eigenvalue estimates, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 632-643.
4. D. BOLEY, The algebraic structure of pencils and block Toeplitz matrices, Linear Algebra Appl., 279 (1998), pp. 255-279.
5. D. BOLEY AND P. V. DOOREN, Placing zeroes and the Kronecker canonical form, Circuits Systems Signal Process., 13 (1994), pp. 783-802.
6. F. CHAITIN-CHATELIN AND V. FRAYSSÉ, Lectures on Finite Precision Computations, SIAM, Philadelphia, 1996.
7. J. DEMMEL AND A. EDELMAN, The dimension of matrices (matrix pencils) with given Jordan (Kronecker) canonical forms, Linear Algebra Appl., 230 (1995), pp. 61-87.
8. J. DEMMEL AND B. KÅGSTRÖM, Stably computing the Kronecker structure and reducing subspace of singular pencils A - λB for uncertain data, in Large Scale Eigenvalue Problems, J. Cullum and R. Willoughby, eds., North-Holland Math. Stud. 127, 1986, pp. 283-323.
9. J. DEMMEL AND B. KÅGSTRÖM, Computing stable eigendecompositions of matrix pencils, Linear Algebra Appl., 88/89 (1987), pp. 139-186.
10. J. DEMMEL AND B. KÅGSTRÖM, The generalized Schur decomposition of an arbitrary pencil A - λB: Robust software with error bounds and applications. I. Theory and algorithms, ACM Trans. Math. Software, 19 (1993), pp. 160-174.
11. J. DEMMEL AND B. KÅGSTRÖM, The generalized Schur decomposition of an arbitrary pencil A-λB: Robust software with error bounds and applications. II. Software and applications, ACM Trans. Math. Software, 19 (1993), pp. 175-201.
12. 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.
13. P. V. DOOREN, The computation of Kronecker's canonical form of a singular pencil, Linear Algebra Appl., 27 (1979), pp. 103-140.
14. P. V. DOOREN, The generalized eigenstructure problem in linear system theory, IEEE Trans. Automat. Control, 26 (1981), pp. 111-129.
15. P. V. DOOREN, Reducing subspaces: Definitions, properties and algorithms, in Matrix Pencils, B. Kågström and A. Ruhe, eds., Lecture Notes in Math. 973, Springer-Verlag, Berlin, 1983, pp. 58-73.
16. P. V. DOOREN, private communication, 1996.
17. A. EDELMAN, E. ELMROTH, AND B. KÅGSTRÖM, A geometric approach to perturbation theory of matrices and matrix pencils. I. Versal deformations, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 653-692.
18. A. EDELMAN, E. ELMROTH, AND B. KÅGSTRÖM, A geometric approach to perturbation theory of matrices and matrix pencils. II. A Stratification-enhanced staircase algorithm, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 667-699.
19. E. ELMROTH AND B. KÅGSTRÖM, The set of 2-by-3 matrix pencils - Kronecker structures and their transitions under perturbations, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 1-34.
20. A. EMAMI-NAEINI AND P. V. DOOREN, Computation of zeros of linear multivariable systems, Automatica, 18 (1982), pp. 415-430.
21. T. F. FAIRGRIEVE, The Application of Singularity Theory to the Computation of Jordan Canonical Form, Master's thesis, Univ. of Toronto, Toronto, ON, Canada, 1986.
22. G. GOLUB AND C. V. LOAN, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, London, 1996.
23. G. H. GOLUB AND J. H. WILKINSON, Ill-conditioned eigensystems and the computation of the Jordan canonical form, SIAM Rev., 18 (1976), pp. 578-619.
24. M. GU, New methods for estimating the distance to uncontrollability, SIAM J. Matrix Anal. Appl., 21 (2000), pp. 989-1003.
25. S. HELGASON, Differential Geometry, Lie Groups, and Symmetric Spaces, Academic Press, New York, San Francisco, London, 1978.
26. B. KÅGSTRÖM, The generalized singular value decomposition and the general A - λB problem, BIT, 24 (1984), pp. 568-583.
27. B. KÅGSTRÖM, RGSVD - An algorithm for computing the Kronecker structure and reducing subspaces of singular A - λB pencils, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 185-211.
28. B. KÅGSTRÖM AND A. RUHE, ALGORITHM 560: JNF, an algorithm for numerical computation of the Jordan normal form of a complex matrix [F2], ACM Trans. Math. Software, 6 (1980), pp. 437-443.
29. B. KÅGSTRÖM AND A. RUHE, An algorithm for numerical computation of the Jordan normal form of a complex matrix, ACM Trans. Math. Software, 6 (1980), pp. 398-419.
30. B. KÅGSTRÖM AND A. RUHE, Matrix Pencils, Lecture Notes in Math. 973, Springer-Verlag, New York, 1982.
31. J. KAUTSKY, N. K. NICHOLS, AND P. V. DOOREN, Robust pole assignment in linear state feedback, Institute J. Control, 41 (1985), pp. 1129-1155.
32. V. KUBLANOVSKAYA, On a method of solving the complete eigenvalue problem of a degenerate matrix, USSR Comput. Math. Phys., 6 (1966), pp. 1-14.
33. V. KUBLANOVSKAYA, AB-algorithm and its modifications for the spectral problem of linear pencils of matrices, Numer. Math., 43 (1984), pp. 329-342.
34. R. LIPPERT AND A. EDELMAN, Nonlinear eigenvalue problems, in Templates for Eigenvalue Problems, Z. Bai, ed., to appear.
35. A. RUHE, An algorithm for numerical determination of the structure of a general matrix, BIT, 10 (1970), pp. 196-216.
36. M. WICKS AND R. DECARLO, Computing the distance to an uncontrollable system, IEEE Trans. Automat. Control, 36 (1991), pp. 39-49.