Block tridiagonalization of "effectively" sparse symmetric matrices

ACM Transactions on Mathematical Software

Volumn 30, Issue 3, 2004, Pages 326-352

  Bai, Yihua ^a,c   Gansterer, Wilfried N ^b   Ward, Robert C ^a,c  

^a UNIVERSITY OF TENNESSEE   (United States)

^b UNIVERSITY OF VIENNA   (Austria)

^c University of Tennessee   (United States)

Author keywords

Approximations; Block divide and conquer; Block tridiagonal matrix

Indexed keywords

BLOCK DIVIDE-AND-CONQUER; BLOCK-TRIDIAGONAL MATRIX; SPARSE SYMMETRIC MATRICES; TRIDIAGONALIZATION;

ABSTRACTING; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; HEURISTIC METHODS; MATRIX ALGEBRA;

PHASE TRANSITIONS;

EID: 8344266771     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/1024074.1024078     Document Type: Article

References (22)

1. CRANE, H.L., JR., GIBBS, N. E., POOLE, W. G., JR., AND STOCKMEYER, P. K. 1976. Matrix bandwidth and profile reduction. ACM Trans. Math. Softw. 2, 375-377.
2. CUPPEN, J. J. M. 1981. A divide and conquer method for the symmetric tridiagonal eigenproblem. Numer. Math. 36, 177-195.
3. DEMMEL, J. W. 1997. Applied Numerical Linear Algebra. SIAM Press, Philadelphia, PA.
4. GANSTERER, W. N., KVASNICKA, D. F., AND UEBERHUBER, C. W. 1998. Multi-sweep algorithms for the symmetric eigenproblem. In VECPAR'98-Third International Conference for Vector and Parallel Processing, J. M. L. M. Palma, J. J. Dongarra, and V. Hernandez, Eds., Lecture Notes in Computer Science, vol. 1573, Springer-Verlag, New York, 20-28.
5. GANSTERER, W. N., WARD, R. C., AND MULLER, R. P. 2002. An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems. ACM Trans. Math. Softw. 28, 45-58.
6. GANSTERER, W. N., WARD, E. C., MULLER. R. P., AND GODDARD, W. A., III 2003. Computing approximate eigenpairs of symmetric block tridiagonal matrices. SIAM J. Sci. Camput. 25, 65-85.
7. GEORGE, A. AND LIU, J. W. 1981. Computer Solution of Large Sparse Positive Definite System. Prentice-Hall. Inc., Englewood Cliffs, NJ.
8. GIBBS, N. E. 1986. A hybrid profile reduction algorithm. ACM Trans. Math. Softw. 2, 378-387.
9. GIBBS, N. E., POOLE, W. G., JR., AND STOCKMEYER, P. K 1976a. An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM J. Numer. Anal 13, 236-250.
10. GIBBS, N. E., POOLE, W. G., JR., AND STOCKMEYER, P. K. 1976b. A comparison of several bandwidth and profile reduction algorithms, ACM Trans. Math. Softw. 2, 322-330.
11. 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.
12. LEWIS. J. G. 1982. The Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms for reordering sparse matrices. ACM Trans. Math. Softw., 8, 190-194.
13. PARLETT, B. N. 1998. The Symmetric Eigenvalue Problem, SIAM Press, Philadelphia, PA.
14. POPLE, J. A. AND BEVERIDGE, D. L. 1970. Approximate Molecular Orbital Theory, 1st ed., McGraw-Hill, New York.
15. 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.
16. 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.
17. 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.
18. 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, 3829.
19. SLOAN, S. W. 1986. An algorithm for profile and wavefront reduction of sparse matrices Int. J. Numer. Meth. Eng. 23, 239-251.
20. SLOAN, S. W. 1989. A FORTRAN program for profile and wavefront reduction. Int. J. Numer. Meth. Eng. 28, 2651-2679.
21. SZABO, A. AND OSTLUND, N. S. 1996. Modern Quantum Chemistry. Dover Publications, Mineola, NY.
22. WILKISON, J. H. 1965. The algebraic eigenvalue problem. Oxford University Press, London, U.K.