The trace minimization method for the symmetric generalized eigenvalue problem

Journal of Computational and Applied Mathematics

Volumn 123, Issue 1-2, 2000, Pages 155-175

  Sameh, Ahmed ^a   Tong, Zhanye ^a  

^a Purdue University   (United States)

Author keywords

65F15; Eigenvalue; Eigenvector; Jacobi Davidson scheme; Trace minimization

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING; VECTORS;

JACOBI-DAVIDSON SCHEME; SYMMETRIC GENERALIZED EIGENVALUE PROBLEM; TRACE MINIMIZATION METHOD;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 0034319898     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(00)00391-5     Document Type: Article

References (44)

1. Bathe K.J., Wilson E.L. Large eigenvalue problems in dynamic analysis, ASCE. J. Eng. Mech. Div. 98:1972;1471-1485.
2. Bathe K.J., Wilson E.L. Solution methods for eigenvalue problems in structural mechanics. Internat. J. Numer. Methods Engrg. 6:1973;213-226.
3. Bauer F.L. Das Verfahren der Treppeniteration und Verwandte Verfahren zur Lösung Algebraischer Eigenwertprobleme. Z. Angew. Math. Phys. 8:1957;214-235.
4. Beckenbach E.F., Bellman R. Inequalities. 1965;Springer, New York.
5. Clint M., Jennings A. The evaluation of eigenvalues and eigenvectors of real symmetric matrices by simultaneous iteration. Comput. J. 13:1970;76-80.
6. Crouzeix M., Philippe B., Sadkane M. The Davidson method. SIAM J. Sci. Comput. 15:1994;62-76.
7. Cullum J., Willoughby R.A. Lanczos and the computation in specified intervals of the spectrum of large, sparse real symmetric matrices. Duff I.S., Stewart G.W. Sparse Matrix Proceedings 1978. 1979;SIAM Publications, Philadelphia, PA.
8. Cullum J., Willoughby R.A. Computing eigenvalues of very large symmetric matrices - an implementation of a Lanczos algorithm with no reorthogonalization. J. Comput. Phys. 44:1984;329-358.
9. Daniel J., Gragg W.B., Kaufman L., Stewart G.W. Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization. Math. Comp. 33:1976;772-795.
10. Davidson E.R. The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices. J. Comput. Phys. 17:1975;817-825.
11. Ericsson T., Ruhe A. The spectral transformation Lanczos method for the solution of large sparse generalized symmetric eigenvalue problems. Math. Comp. 35:1980;1251-1268.
12. Fokkema D.R., Sleijpen G.L.G., van der Vorst H.A. Jacobi-Davidson style QR and QZ algorithms for the reduction of matrix pencils. SIAM J. Sci. Comput. 20:1999;94-125.
13. Gerschgorin A. Über die Abgrenzung der Eigenwerte einer Matrix. Izv. Akad. Nauk SSSR Ser. Fiz.-Mat. 6:1931;749-754.
14. Golub G.H., Underwood R. The block Lanczos method for computing eigenvalues. Rice J.R. Mathematical Software III. 1977;361-377 Academic Press, New York.
15. Golub G.H., van Loan C.F. Matrix Computation. 3rd Edition:1993;Johns Hopkins University Press, Baltimore, MD.
16. Grimes R.G., Lewis J.G., Simon H.D. A shifted block Lanczos algorithm for solving sparse symmetric generalized eigenproblems. SIAM J. Matrix Anal. Appl. 15:1994;228-272.
17. R.C. Grimm, J.M. Greene, J.L. Johnson, Computation of the magnetohydrodynamic spectrum in axisymmetric toroidal confinement systems, in: Methods of Computational Physics 16, Academic Press, New York, 1976.
18. Gropp W.D., Lusk E., Skjellum A. Using MPI: Portable Parallel Programming with the Message Passing Interface. 1994;MIT Press, Boston, MA.
19. Gruber R. Finite hybrid elements to compute the ideal magnetohydrodynamic spectrum of an axisymmetric plasma. J. Comput. Phys. 26:1978;379-389.
20. Jacobi C.G.J. Über ein leichtes Verfahren die in der Theorie der Säculärstörungen vorkommenden Gleichungen numerisch aufzulösen. J. Reine Angew. Math. 30:1846;51-94.
21. Kalamboukis T.Z. A Lanczos-type algorithm for the generalized eigenvalue problem. Ax=λ Bx J. Comput. Phys. 53:1984;82-89.
22. Kantorovic L.V. Funkcional'nyi analiz i prikladnaja mathematika. Uspekhi Mat. Nauk. 3:1948;9-185.
23. Lanczos C. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Nat. Bur. Stand. Sect. B. 45:1950;225-280.
24. Levin A.A. On a method for the solution of a partial eigenvalue problem. USSR J. Comput. Math. Math. Phys. 5:1965;206-212.
25. Liu B. The simultaneous expansion for the solution of several of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices. Moler C., Shavitt I. Numerical Algorithms in Chemistry: Algebraic Method, Lawrence Berkeley Laboratory. 1978;49-53 University of California, California.
26. Morgan R.B., Scott D.S. Generalizations of Davidson's method for computing eigenvalues of sparse symmetric matrices. SIAM J. Sci. Statist. Comput. 7:1986;817-825.
27. C.C. Paige, The computation of eigenvalues of very large sparse matrices, Ph. D. Thesis, University of London, 1971.
28. Parlett B.N. The Symmetric Eigenvalue Problem. 1980;Prentice-Hall, Englewood Cliffs, NJ.
29. Parlett B.N. The Symmetric Eigenvalue Problem. 1998;SIAM, Philadelphia.
30. Parlett B.N., Scott D.S. The Lanczos algorithm with selective orthogonalization. Math. Comp. 33:1979;217-238.
31. Rutishauser H. Computational aspects of F.L. Bauer's simultaneous iteration method. Numer. Math. 13:1969;4-13.
32. Rutishauser H. Simultaneous iteration method for symmetric matrices. Numer. Math. 13:1970;205-223.
33. Saad Y. Numerical Methods for Large Eigenvalue Problems. 1992;Halsted Press, New York.
34. Sameh A., Tong Z. Trace minimization and Jacobi-Davidson-type algorithms for large symmetric eigenvalue problems, Tech. Rep. CS-98, Purdue University. 1998;West Lafayette, Indiana.
35. Sameh A., Wisniewski J.A. A trace minimization algorithm for the generalized eigenvalue problem. SIAM J. Numer. Anal. 19:1982;1243-1259.
36. Simon H.D. The Lanczos algorithm with partial reorthogonalization. Math. Comp. 42:1984;115-142.
37. Sleijpen G.L.G., Booten A.G.L., Fokkema D.R., van der Vorst H.A. Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems. BIT. 36:1996;595-633.
38. Sleijpen G.L.G., van der Vorst H.A. A Jacobi-Davidson iteration method for linear eigenvalue problems. SIAM J. Matrix Anal. Appl. 17:1996;401-425.
39. B.F. Smith, W.D. Gropp, L.C. McInnes, S. Balay, Petsc 2.0 users manual, Tech. Rep. ANL-95 / 11, Argonne National Laboratory, Chicago, IL, 1995.
40. Stathopoulos A., Saad Y., Fischer C.F. Robust preconditioning of large, sparse, symmetric eigenvalue problems. J. Comput. Appl. Math. 1995;197-215.
41. Stewart G.W. Accelerating the orthogonal iteration for the eigenvalues of a hermitian matrix. Numer. Math. 13:1969;362-376.
42. Stewart G.W. A bibliographical tour of the large, sparse generalized eigenvalue problems. Banch J.R., Rose D.J. Sparse Matrix Computations. 1976;113-130 Academic Press, New York.
43. van der Vorst H.A., Golub G.H. 150 years old and still alive: Eigenproblems. Duff I.S., Watson G.A. The State of the Art in Numerical Analysis. 1997;93-119 Clarendon Press, Oxford.
44. K. Wu, Preconditioning techniques for large eigenvalue problems, Ph. D. Thesis, University of Minnesota, Minneapolis, MN, 1997.