A Jacobi-Davidson Iteration Method for Linear Eigenvalue Problems

In this paper we propose a new method for the iterative computation of a few of the extremal eigenvalues of a symmetric matrix and their associated eigenvectors. The method is based on an old and almost unknown method of Jacobi. Jacobi's approach, combined with Davidson's method, leads to a new method that has improved convergence properties and that may be used for general matrices. We also propose a variant of the new method that may be useful for the computation of nonextremal eigenvalues as well.

[1]  C. Jacobi.  Ueber eine neue Auflösungsart der bei der Methode der kleinsten Quadrate vorkommenden lineären Gleichungen , 1845 .

[2]  C. Jacobi,et al.  C. G. J. Jacobi's Gesammelte Werke: Über ein leichtes Verfahren, die in der Theorie der Sacularstorungen vorkommenden Gleichungen numerisch aufzulosen , 1846 .

[3]  C. Lanczos.  An iteration method for the solution of the eigenvalue problem of linear differential and integral operators , 1950 .

[4]  W. Arnoldi.  The principle of minimized iterations in the solution of the matrix eigenvalue problem , 1951 .

[5]  A. Ostrowski.  On the convergence of the Rayleigh quotient iteration for the computation of the characteristic roots and vectors. I , 1957 .

[6]  A. Ostrowski.  On the convergence of the Rayleigh Quotient Iteration for the computation of characteristic roots and vectors. VI , 1959 .

[7]  A. Ostrowski.  On the convergence of the Rayleigh quotient iteration for the computation of the characteristic roots and vectors. V , 1959 .

[8]  B. Parlett.  The Rayleigh Quotient Iteration and Some Generalizations for Nonnormal Matrices , 1974 .

[9]  E. Davidson.  The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices , 1975 .

[10]  B. Parlett.  The Symmetric Eigenvalue Problem , 1981 .

[11]  J. Meijerink,et al.  Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems , 1981 .

[12]  Axel Ruhe.  Numerical aspects of gram-schmidt orthogonalization of vectors , 1983 .

[13]  G. Diercksen,et al.  Methods in Computational Molecular Physics , 1983 .

[14]  R. Morgan,et al.  Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices , 1986 .

[15]  Y. Saad,et al.  GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .

[16]  H. V. D. Vorst,et al.  The convergence behavior of ritz values in the presence of close eigenvalues , 1987 .

[17]  J. Olsen,et al.  Passing the one-billion limit in full configuration-interaction (FCI) calculations , 1990 .

[18]  J. H. van Lenthe,et al.  A space‐saving modification of Davidson's eigenvector algorithm , 1990 .

[19]  A. Van.  SOME OBSERVATIONS ON THE CONVERGENCE BEHAVIOR OF GMRES(II) , 1990 .

[20]  R. Morgan.  Computing Interior Eigenvalues of Large Matrices , 1991 .

[21]  R. Freund.  Quasi-kernel polynomials and their use in non-Hermitian matrix iterations , 1992 .

[22]  R. Morgan.  Generalizations of davidson's method for computing eigenvalues of large nonsymmetric matrices , 1992 .

[23]  Ronald B. Morgan,et al.  Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems , 1993, SIAM J. Sci. Comput..

[24]  William J. Thompson,et al.  Monster Matrices: Their Eigenvalues and Eigenvectors , 1993 .

[25]  P. M. Meijer,et al.  A preconditioned Jacobi-Davidson method for solving large generalized eigenvalue problems , 1994 .

[26]  Axel Ruhe.  Rational Krylov algorithms for nonsymmetric eigenvalue problems. II. matrix pairs , 1994 .

[27]  M. Gijzen.  Iterative solution methods for linear equations in finite element computations , 1994 .

[28]  Bernard Philippe,et al.  The Davidson Method , 1994, SIAM J. Sci. Comput..

[29]  Y. Saad,et al.  Robust preconditioning of large, sparse, symmetric eigenvalue problems , 1995 .

[30]  H. V. D. Vorst,et al.  Jacobi-davidson type methods for generalized eigenproblems and polynomial eigenproblems , 1995 .

[31]  H. V. D. Vorst,et al.  The Jacobi-Davidson method for eigenvalue problems and its relation with accelerated inexact Newton scheme , 1995 .

[32]  Henk A. van der Vorst,et al.  Approximate solutions and eigenvalue bounds from Krylov subspaces , 1995, Numer. Linear Algebra Appl..

[33]  H.J.J. Van Dam,et al.  An improvement of Davidson's iteration method: Applications to MRCI and MRCEPA calculations , 1996 .

[34]  Gerard L. G. Sleijpen,et al.  An improvement of Davidson's iteration method: Applications to MRCI and MRCEPA calculations , 1996, J. Comput. Chem..

[35]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[36]  H. V. D. Vorst,et al.  Quadratic eigenproblems are no problem , 1996 .

[37]  Gerard L. G. Sleijpen,et al.  Accelerated Inexact Newton Schemes for Large Systems of Nonlinear Equations , 1998, SIAM J. Sci. Comput..

[38]  R. S. Heeg.  Stability and transition of attachment-line flow , 1998 .

[39]  H. V. D. Vorst,et al.  EFFICIENT EXPANSION OF SUBSPACES IN THE JACOBI-DAVIDSON METHOD FOR STANDARD AND GENERALIZED EIGENPROBLEMS , 1998 .

[40]  Gerard L. G. Sleijpen,et al.  Jacobi-Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils , 1998, SIAM J. Sci. Comput..

[41]  Chao Yang,et al.  ARPACK users' guide - solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods , 1998, Software, environments, tools.

[42]  Jack Dongarra,et al.  Templates for the Solution of Algebraic Eigenvalue Problems , 2000, Software, environments, tools.

[43]  D. Sorensen.  Numerical methods for large eigenvalue problems , 2002, Acta Numerica.

[44]  C. Jacobi.  Über ein leichtes Verfahren die in der Theorie der Säcularstörungen vorkommenden Gleichungen numerisch aufzulösen*). , 2022 .