A Parallel Davidson-Type Algorithm for Several Eigenvalues

Journal of Computational Physics

Volumn 144, Issue 2, 1998, Pages 727-748

  Borges, Leonardo ^a   Oliveira, Suely ^a  

^a Texas AandM University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS;

ARNOLDI; DAVIDSON; DAVIDSON ALGORITHM; EIGEN-VALUE; MATRIX; MULTIPLE EIGENVALUE; NUMERICAL RESULTS; PARALLELIZATIONS; PARPACK;

PARALLEL ALGORITHMS;

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

References (41)

1. Anderson E., Bai Z., Bischof C., Demmel J., Dongarra J., Croz J., Greenbaum A., Hammarling S., McKenney A., Ostrouchov S., Sorensen D. LAPACK User's Guide. 1992.
2. Bateman H. On a set of kernels whose determinants form a sturmian sequence. Bull. Amer. Math. Soc. 18:1912;179.
3. Becker N. Note on the parallel efficiency of the Frederickson-McBryan multigrid algorithm. SIAM J. Sci. Stat. Comput. 12:1991;208.
4. Borges L. New Parallel Algorithms for Eigenvalue Problems. 1998.
5. Brent R. P. Algorithms for Minimization without Derivatives. 1973.
6. Briggs W. L. A Multigrid Tutorial. 1987.
7. Calvetti D., Reichel L., Sorenson D. An implicitly restarted Lanczos method for large symmetric eigenvalue problems. Electronic Trans. Numer. Anal. 2:1994;1.
8. Cisneros G., Berrondo M., Brunge C. F. DVDSON: A subroutine to evaluate selected sets of eigenvalues and eigenvectors of large symmetric matrices. Comput. Chem. 10:1986;281.
9. Cisneros G., Brunge C. F. An improved computer program for eigenvector and eigenvalues of large configuration iteraction matrices using the algorithm of Davidson. Comput. Chem. 8:1984;157.
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;87.
11. Davidson E. R. Super matrix methods. J. Comput. Phys. Comm. 53:1989;49.
12. Demmel J. W. Applied Numerical Linear Algebra. 1997.
13. der Wijngaart R. V. Efficient implementation of a 3-dimensional ADI method on the iPSC/860. Supercomputing'93. 1993;102.
14. Dongarra J. J., Croz J. D., Hammarling S., Duff I. A set of level 3 basic linear algebra subprograms. ACM Trans. Math. Soft. 16:1990;1.
15. Dongarra J. J., Otto S. W., Snir D. W. M. A message passing standard for MPP and workstations. Comm. ACM. 39:1996;84.
16. Frederickson P., McBryan O. Normalized convergence rates for the PSMG method. SIAM J. Sci. Stat. Comput. 12:1991;221.
17. Golub G., Van Loan C. Matrix Computations. 1989.
18. Gropp W., Lusk E., Skjellum A. Using MPI: Portable Parallel Programming with the Message-Passing Interface. 1994.
19. Hwang K. Advanced Computer Architecture: Parallelism, Scalability, Programmability. 1993.
20. Paragon System User's Guide. 1995.
21. Jiang H., Wong Y. A parallel alternating direction implicit preconditioning method. J. Comput. Appl. Math. 36:1991;209.
22. Kincaid D., Cheney W. Numerical Analysis. 1990.
23. Kumar V., Grama A., Gupta A., Karypis G. Introduction to Parallel Computing. 1994.
24. Leca P., Mane L. A 3-D ADI algorithm on distributed memory multiprocessors implementations and results. Parallel Computational Fluid Dynamics. 1992;149.
25. Manteuffel T., McCormick S., Morel J., Oliveira S., Yang G. A parallel version of a multigrid algorithm for isotropic transport equations. SIAM J. Sci. Comput. 15:1994;474.
26. K. Maschhoff, D. Sorensen, A portable implementation of ARPACK for distributed memory parallel architectures, Proceedings of Copper Mountain Conference on Iterative Methods, April 9-13, 1996.
27. Murray C. W., Racine S. C., Davidson E. R. Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices. J. Comput. Phys. 103:1991;382.
28. O'Leary D. P., Stewart G. W. Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices. J. Comput. Phys. 90:1990;497.
29. O'Leary D. P., Whitman P. Parallel QR factorization by Householder and modified Gram-Schmidt algorithms. Parallel Computing. 16:1990;99.
30. S. Oliveira, A convergence proof of an iterative subspace method for eigenvalues problem, Foundations of Computational Mathematics Selected Papers, F. CuckerM. Shub, Springer-Verlag, New York/Berlin, 1997, 316.
31. Oliveira S. A new parallel chasing algorithm for transforming arrowhead matrices to tridiagonal form. Math. Comput. 67:1998;221.
32. Parlett B. N. The Symmetric Eigenvalue Problem. 1980.
33. Saad Y. Numerical Methods for Large Eigenvalue Problems. 1992.
34. Smith B. T., Boyle J. M., Dongarra J. J., Garbow B. S., Ikebe Y., Klema V. C., Moler C. B. Matrix Eigensystem Routines: EISPACK Guide. 1976.
35. A. Stathopoulos, C. F. Fischer, Reducing synchronization on the parallel davidson method for the large, sparse, eigenvalue problem, Proceedings of Supercomputing Conference, 1993, 172.
36. Stathopoulos A., Fischer C. F. A Davidson program for finding a few selected extreme eigeinpairs of a large, sparse, real, symmetric matrix. Comput. Phys. Comm. 79:1994;268.
37. Umar V. M., Fischer C. F. Multitasking the Davidson algorithm for the large, sparse eigenvalue problem. Int. J. Supercomput. Appl. 3:1989;28.
38. Varga R. S. Matrix Iterative Analysis. 1963.
39. Weber J., Lacroix R., Wanner G. The eigenvalue problem in configuration iteration calculations: A computer program based on a new derivation of the algorithm of Davidson. Comput. Chem. 4:1980;55.
40. Westlake J. R. A Handbook of Numerical Matrix Inversion and Solution of Linear Equations. 1968.
41. Young D. M. Iterative Solution of Large Linear Systems. 1971.