Performance of the QZ algorithm in the presence of infinite eigenvalues

SIAM Journal on Matrix Analysis and Applications

Volumn 22, Issue 2, 2001, Pages 364-375

  Watkins, David S ^a  

^a WASHINGTON STATE UNIVERSITY   (United States)

Author keywords

Eigenvalue computation; Matrix pencil; QZ algorithm

Indexed keywords

EID: 0041911280     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479899360376     Document Type: Article

References (7)

1. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, 1996.
2. C. B. MOLER AND G. W. STEWART, An algorithm for generalized matrix eigenvalue problems, SIAM J. Numer. Anal., 10 (1973), pp. 241-256.
3. D. S. WATKINS, The transmission of shifts and shift blurring in the QR algorithm, Linear Algebra Appl., 241-243 (1996), pp. 877-896.
4. D. S. WATKINS, Bulge exchanges in algorithms of QR type, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 1074-1096.
5. D. S. WATKINS, Infinite eigenvalues and the QZ algorithm, Preprint SFB393/99-23, Technische Universität Chemnitz, Chemnitz, Germany, 1999; also available online from http://www.tuchemnitz.de/sfb393/.
6. D. S. WATKINS AND L. ELSNER, Convergence of algorithms of decomposition type for the eigenvalue, problem, Linear Algebra Appl., 143 (1991), pp. 19-47.
7. D. S. WATKINS AND L. ELSNER, Theory of decomposition and bulge-chasing algorithms for the generalized eigenvalue problem, SIAM J. Matrix Anal. Appl., 15 (1994), pp. 943-967.