Bulge exchanges in algorithms of QR type

SIAM Journal on Matrix Analysis and Applications

Volumn 19, Issue 4, 1998, Pages 1074-1096

  Watkins, David S ^a,b  

^a WASHINGTON STATE UNIVERSITY   (United States)

^b NONE   (United States)

Author keywords

Bulge exchanges; Eigenvalue computation; QR algorithm

Indexed keywords

EID: 0032348495     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479896299950     Document Type: Article

References (22)

1. Z. BAI AND J. W. DEMMEL, On swapping diagonal blocks in real Schur form, Linear Algebra Appl., 186 (1993), pp. 73-95.
2. R. BYERS, Hamiltonian and Symplectic Algorithms for the Algebraic Riccati Equation, Ph.D. thesis, Cornell University, Ithaca, NY, 1983.
3. R. BYERS, A Hamiltonian QR algorithm, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 212-229.
4. K.-W. E. CHU, The solution of the matrix equations AXB - CXD = E and (YA - DZ, YC - BZ) = (E, F), Linear Algebra Appl., 93 (1987), pp. 93-105.
5. J. J. DONGARRA, G. A. GEIST, AND C. H. ROMINE, Fortran subroutines for computing the eigenvalues and eigenvectors of a general matrix by reduction to general tridiagonal form, ACM Trans. Math. Software, 18 (1992), pp. 392-400.
6. E. ANDERSON, Z. BAI, C. BISCHOF, J. DEMMEL, J. DONGARRA, J. DU CROZ, A. GREENBAUM, A. MCKENNEY, S. OSTROUCHOV, AND D. SORENSEN, LAPACK Users' Guide, SIAM, Philadelphia, 1992.
7. J. G. F. FRANCIS, The QR transformation, parts I and II, Comput. J., 4 (1961), pp. 265-272; 332-345.
8. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, third ed., Johns Hopkins University Press, Baltimore, 1996.
9. B. KÅGSTRÖM AND P. POROMAA, Computing eigenspaces with specified eigenvalues of a regular matrix pair (A, B) and condition estimation: Theory, algorithms, software, Numer. Algorithms, 12 (1996), pp. 369-407.
10. B. KÅGSTRÖM AND P. POROMAA, Lapack-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairs, LAPACK Working Note 75, ACM Trans. Math. Software, 22 (1996), pp. 78-103.
11. C. B. MOLER AND G. W. STEWART, An algorithm for generalized matrix eigenvalue problems, SIAM J. Numer. Anal., 10 (1973), pp. 241-256.
12. H. RUTISHAUSER, Solution of eigenvalue problems with the LR-transformation, Nat. Bur. Stand. Appl. Math. Ser., 49 (1958), pp. 47-81.
13. G. W. STEWART, On the sensitivity of the eigenvalue problem Acursive Greek chi = λBcursive Greek chi, SIAM J. Numer. Anal., 9 (1972), pp. 669-686.
14. G. W. STEWART, Error and perturbation bounds for subspaces associated with certain eigenvalue problems, SIAM Rev., 15 (1973), pp. 727-764.
15. D. S. WATKINS, Fundamentals of Matrix Computations, John Wiley and Sons, New York, 1991.
16. D. S. WATKINS, Bi-directional chasing algorithms for the eigenvalue problem, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 166-179.
17. D. S. WATKINS, Shifting strategies for the parallel QR algorithm. SIAM J. Sci. Comput., 15 (1994), pp. 953-958.
18. D. S. WATKINS, The transmission of shifts and shift blurring in the QR algorithm, Linear Algebra Appl., 241/243 (1996), pp. 877-896.
19. D. S. WATKINS AND L. ELSNER, Chasing algorithms for the eigenvalue, problem, SIAM J. Matrix Anal. Appl., 12 (1991), pp. 374-384.
20. D. S. WATKINS AND L. ELSNER, Convergence, of algorithms of decomposition type for the eigenvalue problem, Linear Algebra Appl., 143 (1991), pp. 19-47.
21. 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.
22. J. H. WILKINSON, The Algebraic Eigenvalue Problem, Clarendon Press, Oxford, 1965.