Quasi-laguerre iteration in solving symmetric tridiagonal eigenvalue problems

SIAM Journal on Scientific Computing

Volumn 17, Issue 6, 1996, Pages 1347-1368

  Du, Qiang ^a   Jin, Ming ^b   Li, T Y ^a   Zeng, Z ^c  

^a MICHIGAN STATE UNIVERSITY   (United States)

^b Lambuth University   (United States)

^c NORTHEASTERN ILLINOIS UNIVERSITY   (United States)

Author keywords

Eigenvalue; Quasi Laguerre iteration; Symmetric tridiagonal matrix

Indexed keywords

EID: 0343050486     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827594273225     Document Type: Article

References (16)

1. E. ANDERSON, Z. BAI, C. BISCHOF, J. DEMMEL, J. DONGARRA, J. DU CROZ, A. GREENBAUM, S. HAMMARLING, A. MCKENNEY, S. OSTROUCHOV, and D. SORENSON, LAPACK User's Guide, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1992.
2. J. J. M. CUPPEN, A divide and conquer method for the symmetric tridiagonal eigenproblem, Numer. Math., 36 (1981), pp. 177-195.
3. Q. Du, M. JIN, T. Y. LI, AND Z. ZENG, Quasi-Laguerre iteration, Math. Comp., to appear.
4. J. J. DONGARRA AND D. C. SORENSEN, A fully parallel algorithm for the symmetric eigenvalue problem, SIAM J. Sci. Statist. Comput., 8 (1987), pp. 139-154.
5. L. V. FOSTER, Generalizations of Laguerre 's method: Lower order methods, preprint, Mathematics and Computer Science Department, San Jose State University, San Jose, CA, 1982.
6. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd Ed., The Johns Hopkins University Press, Baltimore, MD, 1989.
7. R. T. GREGORY AND D. L. KARNEY, A Collection of Matrices for Testing Computational Algorithms, Robert E. Krieger Publishing Company, Huntington, NY, 1978.
8. M. GU AND S. C. EISENSTAT, A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem SIAM J. Matrix Anal. Appl., 16 (1995), pp. 172-191.
9. W. KAHAN, Notes On Laguerre's Iteration, preprint, University of California, Berkeley, CA, 1992.
10. T. Y. LI AND Z. ZENG, Laguerre's iteration in solving the symmetric tridiagonal eigenproblem - revisited, SIAM J. Sci. Comput., 15 (1994), pp. 1145-1173.
11. J. RUTTER, A serial implementation of Cuppen's divide and conquer algorithm for the symmetric eigenvalue problem, LAPACK Working Note 69, 1994.
12. B. PARLETT, The use of a refined error bound when updating eigenvalues of tridiagonals, Linear Algebra Appl., 68 (1985), pp. 179-219.
13. B. N. PARLETT, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, NJ, 1980.
14. D. C. SORENSEN AND P. T. P. TANG, On the orthogonality of eigenvectors computed by divide-and-conquer techniques, SIAM. J. Numer. Anal., 28 (1991), pp. 1752-1775.
15. C. TREFFTZ, C. C. HUANG, P. MCKINLEY, T. Y. LI, AND Z. ZENG, A scalable eigenvalue solver for symmetric tridiagonal matrices, Parallel Comput., 21 (1995), pp. 1213-1240.
16. J. H. WILKINSON, The Algebraic Eigenvalue Problem, Oxford University Press, Oxford, 1965.