Parallel block tridiagonalization of real symmetric matrices

Journal of Parallel and Distributed Computing

Volumn 68, Issue 5, 2008, Pages 703-715

  Bai, Yihua ^a   Ward, Robert C ^b  

^a INDIANA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF TENNESSEE   (United States)

Author keywords

Approximate eigenvalues; Block divide and conquer; Block tridiagonal matrix; Orthogonal block reduction

Indexed keywords

APPROXIMATION ALGORITHMS; BLOCK CODES; COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; HEURISTIC ALGORITHMS;

APPROXIMATE EIGENVALUES; BLOCK DIVIDE AND CONQUER; BLOCK-TRIDIAGONAL MATRIX; ORTHOGONAL BLOCK REDUCTION;

PARALLEL ALGORITHMS;

EID: 41449117629     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2007.10.001     Document Type: Article

References (30)

1. Y. Bai, High performance parallel approximate eigensolver for real symmetric matrices, Ph.D. Dissertation, University of Tennessee, Knoxville, 2005.
2. Bai Y., Gansterer W.N., and Ward R.C. Block-tridiagonalization of "effectively" sparse symmetric matrices. ACM Trans. Math. Software 30 (2004) 326-352
3. Bai Y., and Ward R.C. A parallel symmetric block-tridiagonal divide-and-conquer algorithm. ACM Trans. Math. Software 33 (2007) A25
4. Bischof C., Lang B., and Sun X. Parallel tridiagonalization through two-step band reduction. Proceedings of Scalable High Performance Computing Conference '94 (1984), Knoxville, Tennessee 23-27
5. Bischof C., Lang B., and Sun X. A framework for symmetric band reduction. ACM Trans. Math. Software 26 (2000) 581-601
6. Bischof C., Marques M., and Sun X. Parallel bandreduction and tridiagonalization. Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing (1993), SIAM Press, Philadelphia, PA 383-390
7. Bischof C., and van Loan C.F. The WY representation for products of householder matrices. SIAM J. Sci. Comput. 8 (1987) 2-13
8. Blackford L.S., Choi J., Cleary A., D'Azevedo E., Demmel J., Dhillon I., Dongorra J., Hammarling S., Henry G., Petitet A., Stanley K., Walker D., and Whaley R.C. ScaLAPACK User's Guide (1997), SIAM, Philadelphia, PA
9. Cuppen J.J.M. A divide and conquer method for the symmetric tridiagonal eigenproblem. Numer. Math. 36 (1981) 177-195
10. Demmel J. Applied Numerical Linear Algebra (1997), SIAM, Philadelphia, PA
11. Dhillon I.S., and Parlett B.N. Multiple representation to compute orthogonal eigenvectors of symmetric tridiagonal matrices. Linear Algebra Appl. 387 (2004) 1-28
12. I.S. Dhillon, B.N. Parlett, C. Vömel, LAPACK working note: the design and implementation of the MRRR algorithm, Technical Report UCB/CSD-04-1346, Computer Science Division, University of California at Berkeley, Berkeley, CA, 2004.
13. Dongarra J., Hammarling S., and Sorensen D. Block reduction of matrices to condensed forms for eigenvalue computation. J. Comput. Appl. Math. 27 (1989) 215-227
14. Dongarra J., and Sorensen D. A fully parallel algorithm for the symmetric eigenvalue problem. SIAM J. Sci. Statist. Comput. 8 (1987) 139-154
15. G.J.F. Francis, The QR transformation: a unitary analogue to the LR transformation, parts I and II, Comput. J. 4 (1961) 265-271, 332-345.
16. Gansterer W.N., Kvasnicka D.F., and Ueberhuber C.W. Multi-sweep algorithms for the symmetric eigenproblem, Lecture Notes in Computer Science vol. 1573 (1998), Springer, Berlin 20-28
17. Gansterer W.N., Ward R.C., Muller R.P., and Goddard III W.A. Computing approximate eigenpairs of symmetric block tridiagonal matrices. SIAM J. Sci. Comput. 25 (2003) 65-85
18. Gibbs N.E., Poole W.G.J., and Stockmeyer P.K. An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM J. Numer. Anal. 13 (1976) 236-250
19. Golub G.H., and van Loan C.F. Matrix Computations (1996), John Hopkins University Press, Baltimore/London
20. Gu M., and Eisenstat S.C. A stable and efficient algorithm for the rank-one modification of the symmetric eigenproblem. SIAM J. Matrix Anal. Appl. 15 4 (1994) 1266-1276
21. Gu M., and Eisenstat S.C. A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem. SIAM J. Matrix Anal. Appl. 16 (1995) 172-191
22. Lewis J.G. The Gibbs-Poole-Stockmeyer and Gibbs-King algorithms for reordering sparse matrices. ACM Trans. Math. Software 8 (1982) 190-194
23. J. New, J. Huang, E. Chesler, Personal communication, 2007.
24. Pople J.A., and Beveridge D.L. Approximate Molecular Orbital Theory. first ed. (1970), McGraw-Hill, New York
25. Su W.P., Schrieffer J.R., and Heeger A.J. Soliton excitations in polyacetylene. Phys. Rev. B 22 (1980) 2099-2111
26. Szabo A., and Ostlund N.S. Modern Quantum Chemistry (1996), Dover Publications, Mineola, NY
27. R.C. Ward, Y. Bai, Performance of parallel eigensolvers on electronic structure calculations II, Technical Report, UT-CS-06-572, University of Tennessee, Knoxville, TN, 2006.
28. Wilkinson J.H. The Algebraic Eigenvalue Problem (1965), Oxford University Press, Oxford
29. Wilkinson J.H. Global convergence of the tridiagonal QR algorithm with origin shifts. Linear Algebra Appl. 1 (1968) 409-420
30. Wu Y.J., Alpatov P.A., Bischof C.H., and van de Geijn R.A. A parallel implementation of symmetric band reduction using PLAPACK. Proceedings of Scalable Parallel Library Conference (1996), Starkville, Mississippi