Jacobi-Davidson iteration method for linear eigenvalue problems

SIAM Review

Volumn 42, Issue 2, 2000, Pages 267-293

  Sleijpen, Gerard L G ^a   Van Der Vorst, Henk A ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; PROBLEM SOLVING;

HARMONIC RITZ VALUES; JACOBI-DAVIDSON ITERATION METHOD;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 0034207349     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0036144599363084     Document Type: Article

References (42)

1. W. E. ARNOLDI, The principle of minimized iteration in the solution of the matrix eigenvalue problem, Quart. Appl. Math., 9 (1951), pp. 17-29.
2. J. G. L. BOOTEN, H. A. VAN DER VORST, P. M. MEIJER, AND H. J. J. TE RIELE, A Preconditioned Jacobi-Davidson Method for Solving Large Generalized Eigenvalue Problems, Report NM-R9414, Department of Numerical Mathematics, CWI, Amsterdam, the Netherlands, 1994.
3. M. CROUZEIX, B. PHILIPPE, AND M. SADKANE, The Davidson method, SIAM J. Sci. Comput., 15 (1994), pp. 62-76.
4. 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.
5. E. R. DAVIDSON, Matrix eigenvector methods in quantum mechanics, in Methods in Computational Molecular Physics, G. H. F. Diercksen and S. Wilson, eds., Reidel, Boston, 1983, pp. 95-113.
6. E. R. DAVIDSON, Monster matrices: Their eigenvalues and eigenvectors, Comput. Phys., 7 (1993), pp. 519-522.
7. A. DEN BOER, De Jacobi methode van 1845 tot 1990, Master's thesis, Department of Mathematics, Utrecht University, Utrecht, the Netherlands, 1991.
8. R. W. FREUND, Quasi-kernel polynomials and their use in non-Hermitian matrix iterations, J. Comput. Appl. Math., 43 (1992), pp. 135-158.
9. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., The John Hopkins University Press, Baltimore, London. 1996.
10. Y. Q. HUANG AND H. A. VAN DER VORST, Some observations on the convergence behavior of GMRES. I, Natur. Sci. J. Xiangtan Univ., 11 (1989), pp. 103-116.
11. C. G. J. JACOBI, Ueber eine neue Auflösungsart der bei der Methode der kleinsten Quadrate vorkommende linearen Gleichungen, Astronom. Nachr., (1845), pp. 297-306.
12. C. G. J. 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.
13. C. LANCZOS, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Res. Nat. Bur. Standards, 45 (1950), pp. 255-282.
14. J. A. MEIJERINK AND H. A. VAN DER VORST, Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems, J. Comput. Phys., 44 (1981), pp. 134-155.
15. R. B. MORGAN, Computing interior eigenvalues of large matrices, Linear Algebra Appl., 154/156 (1991), pp. 289-309.
16. R. B. MORGAN, Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices, J. Comput. Phys., 101 (1992), pp. 287-291.
17. 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 (1986), pp. 817-825.
18. R. B. MORGAN AND D. S. SCOTT, Preconditioning the Lanczos algorithm for sparse symmetric eigenvalue problems, SIAM J. Sci. Comput., 14 (1993), pp. 585-593.
19. J. OLSEN, P. JØRGENSEN, AND J. SIMONS, Passing the one-billion limit in full configuration-interaction (FCI) calculations, Chem. Phys. Lett., 169 (1990), pp. 463-472.
20. A. M. OSTROWSKI, On the convergence of the Rayleigh quotient iteration for the computation of the characteristic roots and vectors. V. (Usual Rayleigh quotient for non-Hermitian matrices and linear elementary divisors), Arch. Rational Mech. Anal., 3 (1959), pp. 472-481.
21. C. C. PAIGE, B. N. PARLETT, AND H. A. VAN DER VORST, Approximate solutions and eigenvalue bounds from Krylov subspaces, Numer. Linear Algebra Appl., 2 (1995), pp. 115-133.
22. B. N. PARLETT, The Rayleigh quotient iteration and some generalizations for nonnormal matrices, Math. Comp., 28 (1974), pp. 679-693.
23. B. N. PARLETT, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, NJ, 1980.
24. A. RUHE, Numerical aspects of Gram-Schmidt orthogonalization of vectors. Linear Algebra Appl., 52/53 (1983), pp. 591-601.
25. A. RUHE, Rational Krylov algorithms for nonsymmetric eigenvalue, problems II. Matrix pairs, Linear Algebra Appl., 197/198 (1994), pp. 283-295.
26. Y. SAAD, Numerical Methods for Large Eigenvalue Problems. Manchester University Press, Manchester, UK, 1992.
27. Y. SAAD AND M. H. SCHULTZ, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 7 (1986). pp. 856-869.
28. A. STATHOPOULOS, Y. SAAD, AND C. F. FISCHER, Robust preconditioning of large, sparse, symmetric eigenvalue problems, J. Comput. Appl. Math., 64 (1995), pp. 197-215.
29. H. J. J. VAN DAM, J. H. VAN LENTHE, G. L. G. SLEIJPEN, AND H. A. VAN DER VORST, An improvement of Davidson's iteration method: Applications to MRCI and MRCEPA calculations, J. Comput. Chem., 17 (1996), pp. 267-272.
30. A. VAN DER SLUIS AND H. A. VAN DER VORST, The convergence behavior of Ritz values in the presence of close eigenvalues, Linear Algebra Appl., 88/89 (1987), pp. 651-694.
31. M. B. VAN GIJZEN, Iterative Solution Methods for Linear Equations in Finite Element Computations, Ph.D. thesis, Delft University of Technology, Delft, the Netherlands, 1994.
32. J. H. VAN LENTHE AND P. PULAY, A space-saving modification of Davidson's eigenvector algorithm, J. Comput. Chem., 11 (1990), pp. 1164-1168.
33. Z. BAI, J. DEMMEL, J. DONGARRA, A. RUHE, AND H. VAN DER VORST, EDS., Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide, SIAM, Philadelphia, to appear.
34. E. BODEWIG, Matrix Calculus, North-Holland, Amsterdam, the Netherlands, 1956.
35. D. R. FOKKEMA, G. L. G. SLEIJPEN, AND H. A. VAN DER VORST, Accelerated inexact Newton schemes for large systems of nonlinear equations, SIAM J. Sci. Comput., 19 (1998), pp. 657-674.
36. D. R. FOKKEMA, G. L. G. SLEIJPEN, AND H. A. VAN DER VORST, Jacobi-Davidson style QR and QZ algorithms for the reduction of matrix pencils, SIAM J. Sci. Comput., 20 (1998), pp. 94-125.
37. R. S. HEEG, Stability and Transition of Attachment-Line Flow, Ph.D. Thesis, Universiteit Twente, Enschede, the Netherlands, 1998.
38. R. B. LEHOUCQ, D. C. SORENSEN, AND C. YANG, ARPACK Users' Guide. Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods, SIAM, Philadelphia, 1998.
39. G. L. G. SLEIJPEN, A. G. L. BOOTEN, D. R. FOKKEMA, AND H. A. VAN DER VORST, Jacobi-Davidson type methods for generalized eigenprobloms and polynomial eigenproblems, BIT, 36 (1996), pp. 595-633.
40. G. L. G. SLEIJPEN AND H. A. VAN DER VORST, The Jacobi-Davidson method for eigenvalue problems and its relation with accelerated inexact Newton schemes, in Iterative Methods in Linear Algebra, II, S. D. Margenov and P. S. Vassilevski, eds., IMACS Ser. Comput. Appl. Math. 3, New Brunswick, NJ, 1996, pp. 377-389.
41. G. L. G. SLEIJPEN, H. A. VAN DER VORST, AND E. MEIJERINK, Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems, Electron. Trans. Numer. Anal., 7 (1998), pp. 75-89 (electronic).
42. G. L. G. SLEIJPEN, H. A. VAN DER VORST, AND M. B. VAN GIJZEN, Quadratic eigenproblems are no problem, SIAM News, 8 (1996), pp. 9-10.