New Methods for Calculations of the Lowest Eigenvalues of the Real Symmetric Generalized Eigenvalue Problem

Journal of Computational Physics

Volumn 161, Issue 2, 2000, Pages 653-667

  Mitin, Alexander V ^a,b,c  

^a UNIVERSITY OF WUPPERTAL   (Germany)

^b KANSAS STATE UNIVERSITY   (United States)

^c JOINT INSTITUTE FOR HIGH TEMPERATURES   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS;

EIGEN-VALUE; GENERALIZED DAVIDSON METHOD; GENERALIZED EIGENVALUE PROBLEMS; JACOBI- DAVIDSON; JACOBI-DAVIDSON METHODS; KRYLOV SUBSPACE; SYMMETRIC EIGENVALUE PROBLEMS; SYMMETRICS;

ITERATIVE METHODS;

EID: 0347938219     PISSN: 00219991     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcph.2000.6520     Document Type: Article

References (72)

1. R. McWeeny and B. T. Sutcliffe, Methods of Molecular Quantum Mechanics (Academic Press, London/New York, 1969).
2. I. Shavitt, The method of configuration interaction, in Mehtods of Electronic Structure Theory, edited by H. F. Shaefer III (Plenum, New York, 1977), p. 189.
3. C. F. Fischer, The Hartee-Fock Method for Atoms: A Numerical Approach (Wiley, New York, 1977).
4. E. B. Wilson, J. C. Decius, and P. C. Cross, Molecular Vibrations (McGraw-Hill, New York, 1955).
5. C. Lanczos, An iterative method for the solution of the eigenvalue problem of linear differential and integral operators, J. Res. Natl. Bur. Stand. 45, 255 (1950).
6. 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, 87 (1975).
7. W. Karush, An iterative method for finding characteristic vectors of a symmetric matrix, Pacific J. Math. 1, 233 (1951).
8. C. C. Page, Computational variants of the Lanczos method for the eigenproblem, J. Inst. Math. Appl. 10, 373 (1972).
9. W. Butscher and W. E. Kammer, Modification of Davidson's method for the calculation of eigenvalues and eigenvectors of large real-symmetric matrices: "Root homing procedure," J. Comput. Phys. 20, 313 (1976).
10. B. Liu, The simultaneous expansion method, in Numerical Algorithms in Chemistry: Algebraic Methods, edited by C. Moler and I. Shavitt (Lawrence Berkley Lab., Univ. of California, 1978), p. 49.
11. B. N. Parlett, The Lanczos algorithm with selective orthogonalization, Math. Comput. 33, 217 (1979).
12. B. N. Parlett, The Symmetirc Eigenvalue Problem (Prentice Hall, Englewood Cliffs, NJ, 1980).
13. T. Ericsson and A. Ruhe, The spectral transformation Lanczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems, Math. Comput. 35, 1251 (1980).
14. T. Z. Kalamboukis, Davidson's algorithm with and without perturbation correction, J. Phy. A: Math. Gen. 13, 57 (1980).
15. E. R. Davidson, Comments on the Kalamboukis tests of the Davidson agorithm, J. Phys. A: Math. Gen. 13, L179 (1980).
16. J. Cullum and R. A. Wiloughby, Computing eigenvalues of very large symmetric matrices - An implementation of a Lanczos algorithm with no reorthogonalization, J. Comput. Phys. 43, 329 (1981).
17. H. D. Simon, Analysis of the symmetric Lanczos algorithm with reorthogonalization methods, Linear Algebra Appl. 61, 103 (1984).
18. H. D. Simon, The Lanczos algorithm with partial reorthogonalization, Math. Comput. 42, 115 (1984).
19. N. Kosugi, Modification of the Liu-Davidson method for obtaining one or simultaneously several eigensolutions of large real-symmetric matrix, J. Comput. Phys. 55, 426 (1984).
20. J. K. Cullum and R. A. Wiloughby, Lanczos Algorithms for Large Symmetric Eigenvalue Computations (Birkhäuser, Boston, 1985), Vol. 1.
21. D. M. Wood and A. Zunger, A new method for diagonalising large matrices, J. Phys. A: Math. Gen. 18, 1343 (1985).
22. R. B. Morgan and D. S. Scott, Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices, SIAM J. Sci. Stat. Comput. 7, 817 (1986).
23. V. M. Umar and C. F. Fischer, Multitasking the Davidson algorithm for the large, sparse eigenvalue problem, Int. J. Supercomput. Appl. 3, 28 (1989).
24. J. D. Kress, S. W. Woodruff, G. A. Parker, and R. T. Pack, Some strategies for enhancing the performance of the block Lanczos method, Comput. Phys. Comm. 53, 109 (1989).
25. B. Noud-Omid, Applications of the Lanczos method, Comput. Phys. Comm. 53, 157 (1989).
26. B. N. Parlett and B. Nour-Omid, Towards a block Lanczos program, Comput. Phys. Comm. 53, 169 (1989).
27. J. H. van Lenthe and P. Pulay, A space-saving modification of Davidson's eigenvector algorithm, J. Comput. Chem. 11, 1164 (1990).
28. J. Olsen, P. Jørgensen, and J. Simons, Passing the one-billion limit in full configuration-interaction (FCI) calculations, Chem. Phys. Lett. 169, 463 (1990).
29. C. W Murray, S. C. Racine, and E. R. Davidson, Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices, J. Comput. Phys. 103, 382 (1992).
30. R. B. Morgan and D. S. Scott, Preconditioning the Lanczos algorithm for sparse symmetric eigenvalue problems, SIAM J. Sci. Comput. 14, 585 (1993).
31. T. Koslowski and W. von Nissen, Linear combination of Lanczos vectors: A storage-efficient algorithm for sparse matrix eigenvector computations, J. Comput. Chem. 14, 769 (1993).
32. R. G. Grimes, J. G. Levis, and M. D. Simon, A shifted block Lanczos algorithm for solving sparse symmetric generalized eigenproblems, SIAM J. Matrix Anal. Appl. 15, 228 (1994).
33. D. Calvetti, L. Reichel, and D. Sorensen, An implicitly restarted Lanczos method for large symmetric eigenvalue problems, Electron. Trans. Numer. Anal. 2, 1 (1994).
34. J. M. Bofill and J. M. Anglada, Some remarks on the use of the three-term recurrence method in the configuration interaction eigenvalue problem, Chem. Phy. 183, 19 (1994).
35. M. Crouzeix, B. Philippe, and M. Sadkane, The Davidson method, SIAM J. Sci. Comput. 15, 62 (1994).
36. F. X. Gadea, Large matrix diagonalization, comparison of various algorithms and a new proposal, Chem. Phys. Lett. 227, 201 (1994).
37. A. Stathopoulos, Y. Saad, and C. F. Fischer, Robust preconditioning of large, sparse, symmetric eigenvalue problems, SIAM J. Comput. Appl. Math. 64, 197 (1995).
38. H. Dachsel and H. Lischka, An efficient data compression method for the Davidson subspace diagonalization scheme, Theor. Chim. Acta 92, 339 (1995).
39. G. L. G. Sleijpen, J. G. L. Booten, D. R. Fokkema, and H. A. Van der Vorst, A Jakobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems, BIT 36, 595 (1996).
40. F. Webster and G.-C. Lo, Projective block Lanczos algorithm for dense, hermitian eigensystems, J. Comput. Phys. 124, 146 (1996).
41. 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, 267 (1996).
42. G. L. G. Sleijpen and H. A. van Der Vorst, A Jakobi-Davidson iteration method for linear eigenvalue problems, SIAM J. Matrix Anal. Appl. 17, 401 (1996).
43. A Strathopoulos, Y. Saad, and K. Wu, Dynamic thick restarting of the Davidson and the implicitly restarted Arnoldi method, SIAM J. Sci. Comput. 19, 227 (1998).
44. L. Borges and S. Oliveira, A parallel Davidson-type algorithm for several eigenvalues, J. Comput. Phys. 144, 727 (1998).
45. M. Genseberger and G. L. G. Sleijpen, Alternative correction equation in the Jakobi-Davidson method, Numer. Linear Algebra Appl. 6, 235 (1999).
46. J. K. Cullum and R. A. Wiloughby, Lanczos Algorithms for Large Symmetric Eigenvalue Computations (Birkhäuser, Boston, 1985), Vol. 2.
47. J. Weber, R. Lacroix, and G. Wanner, The eigenvalue problem in configuration interaction calculations: S computer program based on a new derivation of the algorithm of Davidson, Comput. Chem. 4, 55 (1980).
48. G. Cisneros and C. F. Bunge, An improved computer program for eigenvector and eigenvalues of large configuration interaction matrices using the algorithm of Davidson, Comput. Chem. 8, 157 (1984).
49. G. Cisneros, M. Berrondo, and C. F. Bunge, DVDSON: A subroutine to evaluate selected sets of eigenvalues and eigenvectors of large symmetric matrices, Comput. Chem. 10, 281 (1986).
50. A Stathopoulos and C. F. Fischer, A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix, Comput. Phys. Comm. 79, 268 (1994).
51. D. S. Scott, Solving sparse symmetric generalized eigenvalue problems without factorization, SIAM J. Numer. Anal. 18, 102 (1981).
52. H. A. van der Vorst, A generalized Lanczos scheme, Math. Comput. 39, 559 (1982).
53. G. A. Gallup, Iterative calculation of eigenvalues and eigenvectors of large, real matrix system with overlap, J. Comput. Chem. 3, 127 (1982).
54. R. B. Morgan, Davidson's method and preconditioning for generalized eigenvalue problems, J. Comput. Phys. 89, 241 (1990).
55. A. V. Mitin, Iterative methods for the calculation of a few of the lowest eigenvalues and corresponding eigenvectors of the AX = λBX equation with real symmetric matrices of large dimension, J. Comput. Chem. 15, 747 (1994).
56. S. F. Boys, Electronic wave functions. II. A calculation for the ground state of the beryllium atom, Proc. R. Soc. London A 201, 125 (1950).
57. R. K. Nesbet, Algorithm for diagonalization of large matrices, J. Chem. Phys. 43, 311 (1965).
58. E. R. Davidson, Monster matrices: Their eigenvalues and eigenvectors, Comput. Phys. 7, 519 (1993).
59. D. K. Faddeev and V. N. Faddeeva, Computational Methods of Linear Algebra (Freeman, San Francisco, 1963). [English translation]
60. R. Fletcher, Practical Methods of Optimization (Wiley, Chichester/New York, 1987).
61. C. C. J. Roothaan and P. S. Bagus, Atomic self-consistent field calculations by the expansion method, in Methods in Computational Physics, edited by B. Alder, S. Fernbach, and M. Rotenberg (Academic Press, New York/London, 1963), Vol. 2, p. 47.
62. O. Axelsson, Iterative Solution Methods (Cambridge Univ. Press, Cambridge, UK, 1994).
63. B. G. Galerkin, Sterzni I plastinki. Rjadi v nekotorih voprosah yprygogo ravnovesija sterznei i plastinok, Vestn. Ingenerov 1, 897 (1915).
64. T. F. Chan and H. A. Van der Vorst, Approximate and incomplete factorization, in Parallel Numerical Algorithms, edited by D. E. Keyes, A. Sameh, and V Venkatakrishnan (Kluwer Academic, Dordrecht, 1997), p. 167.
65. J. H. Wilkinson, The Algebraic Eigenvalue Problem (Clarendon, Oxford, 1965).
66. G. E. Forsythe, M. A. Malcolm, and C. B. Mouler, Computer Methods for Mathematical Calculations (Prentice Hall, Englewood Cliffs, NJ, 1977).
67. R. J. Buenker and S. D. Peyerimhoff, Energy extrapolation in CI calculations, Theor. Chim. Acta 39, 217 (1975).
68. R. J. Buenker and S. D. Peyerimhoff, Ab initio calculations close to the full CI level of accuracy and their use for the interpretation of molecular spectra, in New Horizons of Quantum Chemistry, edited by R-O. Löwdin and B. Pullman (Reidel, Dordrecht, 1976), p. 183.
69. R. J. Buenker, S. D. Peyerimhoff, and W. Butcher, Applicability of the multi-reference double-exitation CI (MRD-CI) method to the calculation electronic wavefunctions and comparison and related techniques, Mol. Phys. 35, 771 (1978).
70. R. J. Buenker, Combining perturbation theory techniques with variational CI calculations to study molecular exited states, Int. J. Quantum Chem. 29, 435 (1986).
71. D. B. Knowles, J. R. Alvarez-Collado, G. Hirsch, and R. J. Buenker, Comparison of perturbatively corrected energy results from multiple reference double-excitation configuration-interaction method calculations with exact full configuration-interaction benchmark values, J. Chem. Phys. 92, 585 (1990).
72. A. V Mitin, to be published.