The generalized eigenvalue problem for nonsquare pencils using a minimal perturbation approach

SIAM Journal on Matrix Analysis and Applications

Volumn 27, Issue 2, 2006, Pages 582-601

  Boutry, Gregory ^a   Elad, Michael ^b   Golub, Gene H ^a   Milanfar, Peyman ^c  

^a UNIVERSITÉ CATHOLIQUE DE LILLE   (France)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c University of California Santa Cruz   (United States)

Author keywords

Generalized eigenvalue; Nonsquare pencils; Pseudospectra

Indexed keywords

GENERALIZED EIGENVALUE; NONSQUARE PENCILS; PSEUDOSPECTRA;

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA; PERTURBATION TECHNIQUES; VECTORS;

PROBLEM SOLVING;

EID: 33644604346     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/S0895479803428795     Document Type: Article

References (26)

1. Z. BAI, J. DEMMEL, J. DONGARRA, A. RUHE, AND H. VAN DER VORST, Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide, SIAM, Philadelphia, 2000.
2. 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.
3. J. V. BURKE, A. S. LEWIS, AND M. L. OVERTON, Optimization and pseudospectra, with applications to robust stability, SIAM J. Matrix Anal. Appl., 25 (2003), pp. 80-104.
4. J. W. DEMMEL AND B. KÅGSTRÖM, Computing stable eigendecompositions of matrix pencils, Linear Algebra Appl., 88 (1987), pp. 139-186.
5. J. W. DEMMEL AND B. KÅGSTRÖM, The generalized Schür 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.
6. A. EDELMAN, E. ELMROTH, AND B. KÅGSTRÖM, A geometric approach to perturbation theory of matrices and matrix pencils. Part I: Versal deformations, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 653-692.
7. A. EDELMAN, E. ELMROTH, AND B. KÅGSTRÖM, A geometric approach to perturbation theory of matrices and matrix pencils. Part II: A stratification-enhanced staircase algorithm, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 667-699.
8. E. ELMROTH, P. JOHANSSON, AND B. KÅGSTRÖM, Bounds for the distance between nearby Jordan and Kronecker structures in a closure hierarchy, J. Math. Sci. (N. Y.), 112 (2003), pp. 1765-1779.
9. E. ELMROTH, P. JOHANSSON, AND B. KÅGSTRÖM, Computation and presentation of graphs displaying closure hierarchies of Jordan and Kronecker structures, Numer. Linear Algebra Appl., 8 (2001), pp. 381-399.
10. M. EMBREE AND L. N. TREFETHEN, Generalizing eigenvalue theorems to pseudospectra theorems, SIAM J. Sci. Comput., 23 (2001), pp. 583-590.
11. V. FRAYSSÉ, M. GUEURY, F. NICOUD, AND V. TOUMAZOU, Spectral Portraits for Matrix Pencils, Technical report TR/PA/96/19, CERFACS, Toulouse, France, 1996.
12. M. ELAD, P. MILANFAR, AND G. H. GOLUB, Shape from moments-An estimation theory perspective, IEEE Trans. Signal Process., 52 (2004), pp. 1814-1829.
13. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
14. G. H. GOLUB AND H. VAN DER VORST, Eigenvalue computation in the 20th century, J. Comput. Appl. Math., 123 (2000), pp. 35-65.
15. M. GU, New methods for estimating the distance to uncontrollability, SIAM J. Matrix Anal. Appl., 21 (2000), pp. 989-1003.
16. B. KÅGSTRÖM, The generalized singular value decomposition and the general A - λB problem, BIT, 24 (1984), pp. 568-583.
17. 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.
18. R. LIPPERT AND A. EDELMAN, The computation and sensitivity of double eigenvalues, in Advances in Computational Mathematics, Lecture Notes in Pure and Appl. Math. 202, Dekker, New York, 1999, pp. 353-393.
19. A. MALYSHEV, On Wilkinson's Problem, Tech. report 140, Department of Informatics, University of Bergen, Norway, 1997.
20. C. C. PAIGE AND M. A. SAUNDERS, Towards a generalized singular value decomposition, SIAM J. Numer. Anal., 18 (1981), pp. 398-405.
21. P. SPELLUCI AND W. M. HARTMANN, A QR decomposition for matrix pencils, BIT, 40 (1999), pp. 183-189.
22. G. W. STEWART, Perturbation theory for rectangular matrix pencils, Linear Algebra Appl., 208 (1994), pp. 297-301.
23. L. N. TREFETHEN, Computation of pseudospectra, Acta Numer., 8 (1999), pp. 247-295.
24. J. L. M. VAN DORSSELAER, Pseudospectra for matrix pencils and stability of equilibria, BIT, 37 (1997), pp. 833-845.
25. T. G. WRIGHT AND L. N. TREFETHEN, Pseudospectra of rectangular matrices, IMA J. Numer. Anal., 22 (2002), pp. 501-519.
26. T. G. WRIGHT AND L. N. TREFETHEN, Large-scale computation of pseudospectra using ARPACK and eigs, SIAM J. Sci. Comput., 23 (2001), pp. 591-605.