An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems

ACM Transactions on Mathematical Software

Volumn 28, Issue 1, 2002, Pages 45-58

  Gansterer, Wilfried N ^a   Ward, Robert C ^a   Muller, Richard P ^b  

^a University of Tennessee   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

G.1.3 Numerical Analysis : Numerical Linear Algebra Eigenvalues and eigenvectors (direct and iterative methods); G.4 Mathematical Software : Algorithm design and analysis

Indexed keywords

EID: 0040668385     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/513001.513004     Document Type: Article

References (27)

1. ANDERSON, E., BAI, Z., BISCHOF, C. H., BLACKFORD, S., DEMMEL, J. W., DONGARRA, J. J., DU CROZ, J., GREENBAUM, A., HAMMARLING, S., MCKENNEY, A., AND SORENSEN, D. C. 1999. LAPACK Users' Guide, 3rd ed. SIAM Press, Philadelphia, PA.
2. ARBENZ, P. 1992. Divide and conquer algorithms for the bandsymmetric eigenvalue problem. Parallel Comput. 18, 1105-1128.
3. ARBENZ, P., GANDER, W., AND GOLUB, G. H. 1988. Restricted rank modification of the symmetric eigenvalue problem: Theoretical considerations. Linear Algebra Appl. 104, 75-95.
4. ARBENZ, P. AND GOLUB, G. H. 1988. On the spectral decomposition of Hermitian matrices modified by low rank perturbations with applications. SIAM J. Matrix Anal. Appl. 9, 40-58.
5. BARLOW, J. L. 1993. Error analysis of update methods for the symmetric eigenvalue problem. SIAM J. Matrix Anal. Appl. 14, 598-618.
6. BUNCH, J. R., NIELSEN, C. P., AND SORENSEN, D. C. 1978. Rank-one modification of the symmetric eigenproblem. Numer. Math. 31, 31-48.
7. CUPPEN, J. J. M. 1981. A divide and conquer method for the symmetric tridiagonal eigenproblem. Numer. Math. 36, 177-195.
8. DEMMEL, J. W. 1997. Applied Numerical Linear Algebra. SIAM Press, Philadelphia, PA.
9. DONGARRA, J. J. AND SORENSEN, D. C. 1987. A fully parallel algorithm for the symmetric eigenproblem. SIAM J. Sci. Comput. 8, s139-s154.
10. GANSTERER, W. N., SCHNEID, J., AND UEBERHUBER, C. W. 1999. A divide-and-conquer method for symmetric banded eigenproblems. Part II: Complexity analysis. Tech. Rep. AURORA TR1999-14, Vienna University of Technology.
11. GANSTERER, W. N., SCHNEID, J., AND UEBERHUBER, C. W. 2001. A low-complexity divide-and-conquer method for computing eigenvalues and eigenvectors of symmetric band matrices. BIT 41, 967-976.
12. GANSTERER, W. N., WARD, R. C., AND MULLER, R. P. 2000. An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems. Tech. Rep. UT-CS-00-447, Department of Computer Science, University of Tennessee, Knoxville, TN.
13. GATES, K. AND ARBENZ, P. 1994. Parallel divide and conquer algorithms for the symmetric tridiagonal eigenproblem. Tech. Rep. 222, Institut für Wissenschaftliches Rechnen, ETH Zürich.
14. GOLUB, G. H. 1973. Some modified matrix eigenvalue problems. SIAM Rev. 15, 318-334.
15. GOLUB, G. H. AND VAN LOAN, C. F. 1996. Matrix Computations, 3rd ed. Johns Hopkins University Press, Baltimore, MD.
16. GU, M. AND EISENSTAT, S. C. 1994. A stable and efficient algorithm for the rank-one modification of the symmetric eigenproblem. SIAM J. Matrix Anal. Appl. 15, 1266-1276.
17. GU, M. AND EISENSTAT, S. C. 1995. A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem. SIAM J. Matrix Anal. Appl. 16, 172-191.
18. LI, R.-C. 1994. Solving the secular equations stably and efficiently. LAPACK Working Note 89, University of California at Berkeley, Berkeley, CA. Nov.
19. POPLE, J. A. AND BEVERIDGE, D. L. 1970. Approximate Molecular Orbital Theory, 1st ed. McGraw-Hill Book Company, New York.
20. POPLE, J. A., BEVERIDGE, D. L., AND DOBOSH, P. A. 1967. Approximate self-consistent molecular orbital theory. V. Intermediate neglect of differential overlap. J. Chem. Physics 47, 2026.
21. POPLE, J. A., SANTRY, D. P., AND SEGAL, G. A. 1965. Approximate self-consistent molecular orbital theory. I. Invariant procedures. J. Chem. Physics 43, S129.
22. POPLE, J. A. AND SEGAL, G. A. 1965. Approximate self-consistent molecular orbital theory. II. Calculations with complete neglect of differential overlap. J. Chem. Physics 43, S136.
23. POPLE, J. A. AND SEGAL, G. A. 1966. Approximate self-consistent molecular orbital theory. III. CNDO results for ab2 and ab3 systems. J. Chem. Physics 44, 3289.
24. RUTTER, J. 1994. A serial implementation of Cuppen's divide and conquer algorithm for the symmetric eigenvalue problem. LAPACK Working Note 69, Computer Science Division (EECS), University of California at Berkeley, Berkeley, CA.
25. SORENSEN, D. C. AND TANG, P. T. P. 1991. On the orthogonality of eigenvectors computed by divide-and-conquer techniques. SIAM J. Numer. Anal. 28, 1752-1775.
26. SZABO, A. AND OSTLUND, N. S. 1996. Modern Quantum Chemistry. Dover Publications, Mineola, NY.
27. TISSEUR, F. AND DONGARRA, J. J. 1999. A parallel divide and conquer algorithm for the symmetric eigenvalue problem on distributed memory architectures. SIAM J. Sci. Comput. 20, 2223-2236.