A fast divide-and-conquer algorithm for computing the spectra of real symmetric tridiagonal matrices

Applied and Computational Harmonic Analysis

Volumn 34, Issue 3, 2013, Pages 379-414

  Coakley, Ed S ^a   Rokhlin, Vladimir ^a,b  

^a YALE UNIVERSITY   (United States)

^b Yale University   (United States)

Author keywords

Fast multipole method; Symmetric eigenproblem; Tridiagonal

Indexed keywords

CHARACTERISTIC POLYNOMIALS; DIVIDE-AND-CONQUER ALGORITHM; DIVIDE-AND-CONQUER APPROACH; EIGENPROBLEM; FAST MULTIPOLE METHOD; SYMMETRIC TRIDIAGONAL MATRIX; TRIDIAGONAL; TRIDIAGONAL MATRICES;

ALGORITHMS; MATRIX ALGEBRA; NUMERICAL METHODS;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 84875225222     PISSN: 10635203     EISSN: 1096603X     Source Type: Journal    
DOI: 10.1016/j.acha.2012.06.003     Document Type: Article

References (22)

1. C.F. Borges, and W.B. Gragg A parallel divide and conquer algorithm for the generalized real symmetric definite tridiagonal eigenproblem Num. Lin. Alg. Sci. Comput. 1993 11 29
2. E.S. Coakley, V. Rokhlin, A new class of fast divide-and-conquer algorithms for the real symmetric tridiagonal eigenvalue problem, dissertation, Yale University, New Haven, CT, 2010.
3. J.J.M. Cuppen A divide and conquer method for the symmetric tridiagonal eigenproblem Numer. Math. 36 1981 177 195
4. G. Dahlquist, and Å. Björck Numerical Methods 1974 Dover Publications, Inc. New York
5. n 2) algorithm for the symmetric tridiagonal eigenvalue/eigenvector problem, dissertation, University of California, Berkeley, 1997.
6. J.J. Dongarra, and D.C. Sorensen A fully parallel algorithm for the symmetric eigenproblem SIAM J. Sci. Statist. Comput. 8 1987 139 154
7. Z. Gimbutas, and V. Rokhlin A generalized fast multipole method for nonoscillatory kernels SIAM J. Sci. Comput. 24 3 2002 796 817
8. G. Golub, and C.V. Loan Matrix Computations second edition 1989 Johns Hopkins University Press Baltimore
9. L. Greengard, and V. Rokhlin A fast algorithm for particle simulations J. Comp. Phys. 23 2 1987 325 348
10. M. Gu, and S.C. Eisenstat A stable and efficient algorithm for the rank-one modification of the symmetric eigenproblem SIAM J. Matrix Anal. Appl. 15 4 1994 1266 1276
11. M. Gu, and S.C. Eisenstat A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem SIAM J. Matrix Anal. Appl. 16 1 1995 172 191
12. R.A. Horn, and C.R. Johnson Matrix Analysis 1985 Cambridge University Press Cambridge
13. T. Hrycak, and V. Rokhlin An improved fast multipole algorithm for potential fields J. Sci. Comput. 19 1998 1804 1826
14. A.S. Krishnakumar, and M. Morf Eigenvalues of a symmetric tridiagonal matrix: a divide-and-conquer approach Numer. Math. 48 1986 349 368
15. P.G. Martinsson, and V. Rokhlin An accelerated kernel-independent fast multipole method in one dimension SIAM J. Sci. Comput. 29 3 2007 1160 1178
16. B.N. Parlett The Symmetric Eigenvalue Problem 1980 Prentice Hall, Inc. New York, NY
17. M. Reed, and B. Simon Methods of Modern Mathematical Physics, vol. I 1980 Academic Press New York
18. F. Smithies Integral Equations 1958 Cambridge University Press Cambridge
19. J. Stoer, and R. Bulirsch Introduction to Numerical Analysis second edition 1993 Springer-Verlag New York, NY
20. M. Tygert Recurrence relations and fast algorithms Appl. Comput. Harmon. Anal. 28 2010 121 128
21. J.H. Wilkinson The Algebraic Eigenvalue Problem 1965 Clarendon Press Oxford, UK
22. N. Yarvin, and V. Rokhlin An improved fast multipole algorithm for potential fields on the line SIAM J. Numer. Anal. 36 2 1999 629 666