Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices

Linear Algebra and Its Applications

Volumn 387, Issue 1-3 SUPPL., 2004, Pages 1-28

  Dhillon, Inderjit S ^a   Parlett, Beresford N ^b  

^a University of Texas at Austin   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Eigenvectors; High relative accuracy; Orthogonality; Relatively robust representations (RRR); Symmetric tridiagonal

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; MATRIX ALGEBRA; TREES (MATHEMATICS); VECTORS;

HIGH RELATIVE ACCURACY; ORTHOGONALITY; RELATIVELY ROBUST REPRESENTATIONS (RRR); SYMMETRIC TRIDIAGONAL;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 2942522546     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2003.12.028     Document Type: Article

References (16)

1. Anderson E., Bai Z., Bischof C., Demmel J., Dongarra J., Du Croz J., Greenbaum A., Hammarling S., McKenney A., Ostrouchov S., Sorensen D. LAPACK Users' Guide. second ed. 1995;SIAM, Philadelphia. 324 p.
2. Cormen Thomas H., Leiserson Charles E., Rivest Ronald L. Introduction to Algorithms. MIT Electrical and Computer Science Series. 1992;MIT Press. ISBN 0-262-03141-8.
3. Cuppen J.J.M. A divide and conquer method for the symmetric tridiagonal eigenproblem. Numer. Math. 36:1981;177-195.
4. Demmel J., Kahan W. Accurate singular values of bidiagonal matrices. SIAM J. Sci. Stat. Comput. 11(5):1990;873-912.
5. 2) algorithm for the symmetric tridiagonal eigenvalue/eigenvector problem, Ph.D. Thesis, Computer Science Division, University of California, Berkeley, California, May 1997. Available as UC Berkeley Technical Report No. UCB//CSD-97-971.
6. Dhillon I.S., Parlett B.N. Orthogonal eigenvectors and relative gaps. SIAM J. Matrix Anal. Appl. 25(4):2004;. Also LAPACK Working Note 154 (ut-cs-02-474).
7. Eisenstat S., Ipsen I. Relative perturbation techniques for singular value problems. SIAM J. Numer. Anal. 32(6):1995.
8. Fernando K., Parlett B. Accurate singular values and differential qd algorithms. Numer. Math. 67(2):1994;191-229.
9. Golub Gene H., Van Loan Charles F. Matrix Computations. third ed. 1996;Johns Hopkins University Press.
10. Gu M., Eisenstat S.C. A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem. SIAM J. Matrix Anal. Appl. 16(1):1995;172-191.
11. Parlett B.N. The spectral diameter as a function of the diagonal entries. Numer. Linear Algebra Appl. 1:2003;1-7.
12. Parlett B.N., Dhillon I.S. Fernando's solution to Wilkinson's problem: an application of double factorization. Linear Algebra Appl. 267:1997;247-279.
13. Parlett B.N., Dhillon I.S. Relatively robust representations of symmetric tridiagonals. Linear Algebra Appl. 309:2000;121-151.
14. Rutishauser H. Der quotienten-differenzen-algorithmus. Z. Angew. Math. Phys. 5:1954;223-251.
15. J. Rutter, A serial implementation of Cuppen's divide and conquer algorithm for the symmetric eigenvalue problem, Mathematics Dept. Master's Thesis, University of California, 1994.
16. Wilkinson J.H. The Algebraic Eigenvalue Problem. 1965;Oxford University Press, Oxford.