Jacobi-davidson style QR and QZ algorithms for the reduction of matrix pencils

SIAM Journal on Scientific Computing

Volumn 20, Issue 1, 1998, Pages 94-125

  Fokkema, Diederik R ^a,b   Sleijpen, Gerard L G ^a   Van Der Vorst, Henk A ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

^b SYNOPSYS SWITZERLAND LLC   (Switzerland)

Author keywords

Generalized eigenproblems; Generalized Schur form; Iterative methods; Jacobi Davidson; Linear eigenproblems; QR algorithm; QZ algorithm; Schur form

Indexed keywords

JACOBI-DAVIDSON SUBSPACE ITERATION METHOD; SCHUR FORM;

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; MATHEMATICAL OPERATORS; MATRIX ALGEBRA; PROBLEM SOLVING;

ITERATIVE METHODS;

EID: 0032131701     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827596300073     Document Type: Article

References (34)

1. E. ANDERSON, Z. BAI, C. BISCHOF, J. DEMMEL, J. DONGARRA, J. D. CROZ, A. GREENBAUM, S. HAMMARLING, A. MCKENNEY, S. OSTROUCHOV, AND D. C. SORENSEN, LAPACK Users' Guide, SIAM, Philadelphia, 1992.
2. Z. BAI, D. DAY, J. DEMMEL, AND J. DONGARRA, A Test Matrix Collection for Non-Hermitian Eigenvalue Problems, Technical Report CS-97-355, Department of Computer Science, University of Tennessee, Knoxville, TN, March, 1997.
3. J. G. L. BOOTEN, D. R. FOKKEMA, G. L. G. SLEIJPEN, AND H. A. VAN DER VORST, Jacobi-Davidson methods for generalized MHD-eigenvalue problems, in Proceeeding of ICIAM/GAMM 95, Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM), 76 (1996), pp. 131-134.
4. F. CHAITIN-CHATELlN AND V. FRAYSSÉ, Lectures on Finite Precision Computations, SIAM, Philadelphia, 1996.
5. E. R. DAVIDSON, The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real symmetric matrices, J. Comput. Phys., 17 (1975), pp. 87-94.
6. R. S. DEMBO, S. C. EISENSTAT, AND T. STEIHAUG, Inexact Newton methods, SIAM J. Numer. Anal., 19 (1982), pp. 400-408.
7. D. R. FOKKEMA, Subspace methods for linear, non-linear and eigen problems, Ph.D. thesis, Utrecht University, Utrecht, The Netherlands, 1996.
8. J. FRANCIS, The QR transformation: A unitary analogue to the LR transformation, parts I and II, Comput. J., 4 (1961), pp. 265-272, 332-345.
9. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd ed., The Johns Hopkins University Press, Baltimore, London, 1989.
10. I. GUSTAFSSON, A class of first order factorizations methods, BIT, 18 (1978), pp. 142-156.
11. C. JACOBI, Ueber ein leichtes Verfahren, die in der Theorie der Säcularstörungen vorkommenden Gleichungen numerisch aufzulösen, J. Reine Angew. Math., (1846), pp. 51-94.
12. R. B. LEHOUCQ AND J. A. SCOTT, An Evaluation of Software for Computing Eigenvalues of Sparse Nonsymmetric Matrices, Preprint MCS-P547-1195, Argonne National Laboratory, Argonne, IL, 1996.
13. R. B. LEHOUCQ AND D. C. SORENSEN, Deflation techniques within an implicitly restarted iteration, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 789-821.
14. J. A. MEIJERINK AND H. A. VAN DER VORST, An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix, Math. Comp., 31 (1977), pp. 148-162.
15. C. B. MOLER AND G. W. STEWART, An algorithm for generalized matrix eigenvalue problems, SIAM J. Numer. Anal., 10 (1973), pp. 241-256.
16. R. B. MORGAN, Computing interior eigenvalues of large matrices, Linear Algebra Appl., 154/156 (1991), pp. 289-309.
17. R. B. MORGAN On restarting the Arnoldi method for large nonsymmetric eigenvalue problems, Math. Comp., 65 (1996), pp. 1213-1230.
18. R. B. MORGAN AND D. S. SCOTT, Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices, SIAM J. Sci. Statist. Comput., 7 (1989), pp. 817-825.
19. C. C. PAIGE, B. N. PARLETT, AND H. A. VAN DER VORST, Approximate solutions and eigenvalue bounds from Krylov subspaces, Num. Linear Algebra Appl., 2 (1995), pp. 115-133.
20. A. RUHE, Perturbation bounds for means of eigenvalues and invariant subspaces, BIT, 10 (1970), pp. 343-354.
21. A. RUHE, Rational Krylov algorithms for nonsymmetric eigenvalue problems II. Matrix Pairs, Linear Algebra Appl., 197/198 (1994), pp. 283-295.
22. Y. SAAD, Numerical Methods for Large Eigenvalue Problems, Manchester University Press, Manchester, U.K., 1992.
23. Y. SAAD AND M. H. SCHULTZ, GMRES: A generalized minimum residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 856-869.
24. G. L. G. SLEIJPEN, J. G. L. BOOTEN, D. R. FOKKEMA, AND H. A. VAN DER VORST, Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems, BIT, 36 (1996), pp. 595-633.
25. G. L. G. SLEIJPEN AND D. R. FOKKEMA, BiCGstab(l) for linear equations involving matrices with complex spectrum, Elec. Trans. Numer. Anal., 1 (1993), pp. 11-32.
26. G. L. G. SLEIJPEN AND H. A. VAN DER VORST, A Jacobi-Davidson iteration method for linear eigenvalue problems, SIAM J. Matrix Anal. Appl., 17 (1996), pp. 401-425.
27. G. L. G. SLEIJPEN AND H. A. VAN DER VORST, The Jacobi-Davidson method for eigenvalue problems and its relation to accelerated inexact Newton schemes, in Iterative Methods in Linear Algebra, H, S. D. Margenov and P. S. Vassilevski, eds., Proceedings of the Second IMACS International Symposium on Iterative Methods in Linear Algebra, June 17-20, 1995, Blagoevgrad, Baltzer, Basel, IMACS Ann. Comput. Appl. Math. 3, 1996.
28. D. C. SORENSEN, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 357-385.
29. G. W. STEWART, Algorithm 406 HQR3 and EXCHNG: Fortran subroutines for calculating and ordering eigenvalues of a real upper Hessenberg matrix, ACM Trans. Math. Software, 2 (1976), pp. 275-280.
30. G. W. STEWART AND JI GUANG SUN, Matrix Perturbation Theory, Academic Press, San Diego, CA, 1990.
31. A. VAN DER SLUIS AND H. A. VAN DER VORST, The rate of convergence of conjugate gradients, Numer. Math., 48 (1986), pp. 543-560.
32. H. A. VAN DER VORST, Preconditioning by Incomplete Decompositions, Ph.D. thesis, Utrecht University, Utrecht, The Netherlands, 1982.
33. P. VAN DOOREN, A generalized eigenvalue approach for solving Ricatti equations, SIAM J. Sci. Statist. Comput., 2 (1981), pp. 121-135.
34. P. VAN DOOREN, Algorithm 590, DUSBSP and EXCHQZ: FORTRAN subroutines for computing deflating subspaces with specified spectrum, ACM Trans. Math. Software, 8 (1982), pp. 376-382.