Iterative methods for the computation of a few eigenvalues of a large symmetric matrix

BIT Numerical Mathematics

Volumn 36, Issue 3, 1996, Pages 400-421

  Baglama, J ^a   Calvetti, D ^b   Reichel, L ^a  

^a KENT STATE UNIVERSITY   (United States)

^b Stevens Institute of Technology   (United States)

Author keywords

Leja points; Polynomial acceleration; Restarted Lanczos method

Indexed keywords

EID: 1542498748     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01731924     Document Type: Article

References (40)

1. Å. Björck, Numerics of Gram-Schmidt orthogonalization, Linear Algebra Appl., 197-198 (1994), pp. 297-316.
2. Å. Björck, E. Grimme, and P. Van Dooren, An implicit shift bidiagonalization algorithm for ill-posed problems, BIT, 34 (1994), pp. 510-534.
3. D. Calvetti and L. Reichel, An adaptive Richardson iteration method for indefinite linear systems, Numer. Algorithms, to appear.
4. D. Calvetti, L. Reichel, and D. C. Sorensen, An implicitly restarted Lanczos method for large symmetric eigenvalue problems, Elec. Trans. Numer. Anal., 2 (1994), pp. 1-21.
5. A. K. Cline, G. H. Golub and G. W. Platzman, Calculation of normal modes of oceans using the Lanczos method, in Sparse Matrix Computations, J. R. Bunch and D. J. Rose, eds., Academic Press, New York, 1976, pp. 409-426.
6. J. Cullum and R. A. Willoughby, Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Vol. 1, Birkhäuser, Boston, 1985.
7. A. Edrei, Sur les déterminants récurrents et les singularités d'une fonction donnée par son développement de Taylor, Compositio Math., 7 (1939), pp. 20-88.
8. T. Ericsson and A. Ruhe, The spectral transformation Lanczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems, Math. Comp., 35 (1980), pp. 1251-1268.
9. P. A. Farrell, A. Ruttan, and R. R. Zeller, Finite difference minimization of the Landau-de Gennes free energy for liquid crystals in rectangular regions, Comp. Appl. Math., I, C. Brezinski and U. Kulish, eds., Elsevier, Amsterdam, 1992, pp. 137-146.
10. D. A. Flanders and G. Shortley. Numerical determination of fundamental modes, J. Appl. Phys., 21 (1950), pp. 1326-1332.
11. E. C. Gartland, On some mathematical and numerical aspects of the Landau-de Gennes minimization problem, for liquid crystals, Report, Institute for Computational Mathematics, Kent State University, Kent, OH, 1993.
12. G. H. Golub, Some modified matrix eigenvalue problems, SIAM Review, 15 (1973), pp. 318-334.
13. G. H. Golub, R. Underwood, and J. H. Wilkinson, The Lanczos algorithm, for the symmetric Ax = λBx problem, Report STAN-CS-72-270, Department of Computer Science, Stanford University, Stanford, CA, 1972.
14. R. G. Grimes, J. L. Lewis, and H. D. Simon, A shifted block Lanczos algorithm for solving sparse symmetric generalized eigenproblems, SIAM J. Matrix Anal., 15 (1994), pp. 228-272.
15. W. Hoffmann, Iterative algorithms for Gram-Schmidt orthogonalization, Computing, 41 (1989), pp. 335-348.
16. W. Karush, An iterative method for finding characteristic vectors of a symmetric matrix, Pacific J. Math., 1 (1951), pp. 233-248.
17. N. J. Lehmann, Optimale Eigenwerteinschliessungen, Numer. Math., 5 (1963), pp. 246-272.
18. R. Lehoucq, Analysis and Implementation of an Implicitly Restarted Arnoldi Iteration, Ph.D. Thesis, Rice University, Houston, 1995.
19. R. Lehoucq and D. C. Sorensen, Deflation techniques for an implicitly re-started Arnoldi iteration, Report TR94-13, Department of Computational and Applied Mathematics, Rice University, Houston, 1995.
20. R. Lehoucq, D. C. Sorensen, and P.A. Vu, ARPACK: An implementation of the implicitly restarted Arnoldi and the implicitly restarted Lanczos methods. Code available from Netlib, in directory scalapack.
21. F. Leja, Sur certaines suits liées aux ensemble plan et leur application à la representation conforme, Ann. Polon. Math., 4 (1957), pp. 8-13.
22. R. B. Morgan, Computing interior eigenvalues of large matrices, Linear Algebra Appl., 154-156 (1991), pp. 289-309.
23. 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 (1986), pp. 817-825.
24. R. Natarajan and D. Vanderbilt, A new iterative scheme for obtaining eigenvectors of large, real-symmetric matrices, J. Comp. Phys., 82 (1989), pp. 218-228.
25. C. C. Paige, Computational variants of the Lanczos method for the eigenproblem, J. Inst. Math. Appl., 10 (1972), pp. 373-381.
26. C. C. Paige, B. N. Parlett, and H. A. van der Vorst, Approximate solutions and eigenvalue bounds from Krylov subspaces, Numer. Linear Algebra Appl., to appear.
27. B. N. Parlett, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, 1980.
28. B. N. Parlett and B. Nour-Omid, Towards a black box Lanczos program, Comput. Phys. Comm., 53 (1989), pp. 169-179.
29. B. N. Parlett and D. S. Scott, The Lanczos algorithm with selective orthogonalization, Math. Comp., 33 (1979), pp. 311-328.
30. A. Pothen, H. D. Simon, and K.-P. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 430-452.
31. E. B. Priestly, P. J. Wojyowicz, and P. Sheng, eds., Introduction to Liquid Crystals, Plenum Press, New York, 1975.
32. L. Reichel, The application of Leja points to Richardson iteration and polynomial preconditioning, Linear Algebra Appl., 154-156 (1991), pp. 389-414.
33. A. Ruhe, Rational Krylov sequence methods for eigenvalue computations, Linear Algebra Appl., 58 (1984), pp. 391-405.
34. Y. Saad, Iterative solution of indefinite symmetric linear systems by methods using orthogonal polynomials over two disjoint intervals, SIAM J. Numer. Anal., 20 (1983), pp. 784-811.
35. Y. Saad, Numerical Methods for Large Eigenvalue Problems, Halstead Press, New York, 1992.
36. D. S. Scott, LASO2 - FORTRAN implementation of the Lanczos process with selective orthogonalization. Code and documentation available from Netlib.
37. D. C. Sorensen, Implicit application of polynomial filters in a k-step Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 357-385.
38. D. C. Sorensen, Minimization of a large scale quadratic function subject to an ellipsoidal constraint, Report TR94-27, Department of Computational and Applied Mathematics, Rice University, Houston, 1994.
39. D. B. Szyld, Criteria for combining inverse and Rayleigh quotient iteration, SIAM J. Numer. Anal., 25 (1988), pp. 1369-1375.
40. X. Yang, T. K. Sarkar, and E. Arvas, A survey of conjugate gradient algorithms for solution of extreme eigen-problems of a symmetric matrix, IEEE Trans. Acoust. Speech Signal Proc., 37 (1989), pp. 1550-1555.