For tridiagonals T replace T with LDLt

Journal of Computational and Applied Mathematics

Volumn 123, Issue 1-2, 2000, Pages 117-130

  Parlett, Beresford N ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL ARITHMETIC; EIGENVALUES AND EIGENFUNCTIONS; LINEAR EQUATIONS; PROBLEM SOLVING; VECTORS;

EIGENPROBLEM; FACTORIZATION; GRAM-SCHMIDT PROCEDURE; TRIANGULAR MATRIX; TRIDIAGONALS;

MATRIX ALGEBRA;

EID: 0034321412     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(00)00394-0     Document Type: Article

References (24)

1. E. Anderson, Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, S. Ostrouchov, D. Sorensen, LAPACK Users' Guide, 2nd Edition, SIAM, Philadelphia, 1995, 324pp.
2. Barlow J., Demmel J.W. Computing accurate eigensystems of scaled diagonally dominant matrices. SIAM J. Num. Anal. 27:1990;762-791.
3. A. Bunse-Gerstner, Berechnung der Eigenwerte einer Matrix mit dem HR -Verfahren (German and English summary), Numerische Behandlung von Eigenwertaufgaben, Band 2 (Tagung, Tech. Univ. Clausthal, Clausthal, 1978), pp. 26-39, Internat. Schriftenreihe Numer. Math., 43, Birkhauser, Basel-Boston, MA, 1979.
4. Bunse-Gerstner A. An analysis of the. HR algorithm for computing the eigenvalues of a matrix Linear Algebra Appl. 35:1981;155-173.
5. Demmel J. Applied Numerical Algebra. 1997;SIAM, Philadelphia.
6. Day D. An efficient implementation of the nonsymmetric Lanczos algorithm. SIAM J. Matrix Anal. Appl. 18:1997;566-589.
7. 2) algorithm for the symmetric tridiagonal eigenvalue/eigenvector problem, Ph.D. Thesis, Computer Science Division, Department of Electrical Engineering and Computer Science, University of California, Berkeley, California, May 1997. Also available as Computer Science Division Technical Report No. UCB // CSD-97-971.
8. I.S. Dhillon, G.I. Fann, B.N. Parlett, Application of a new algorithm for the symmetric eigenproblem to computational chemistry, in: Proceedings of the Eigth SIAM Conference on Parallel Processing for Scientific Computing, Minneapolis, MN, SIAM, Philadelphia, March 1997.
9. Eisenstat S., Ipsen I.C.F. Relative perturbation bounds for eigenspaces and singular vector subspaces. Lewis J.G. Proceedings of the Fifth SIAM Conference on Applied Linear Algebra. 1994;62-65 SIAM, Philadelphia.
10. Eisenstat S., Ipsen I.C.F. Relative perturbation techniques for singular value problems. SIAM J. Numer. Anal. 32:1995;1972-1988.
11. G.I. Fann, R.J. Littlefield, Performance of a fully parallel dense real symmetric eigensolver in quantum chemistry applications, Proceedings of High Performance Computing' 95 , Simulation MultiConference, The Society for Computer Simulation, 1995 .
12. Fernando K.V., Parlett B.N. Accurate singular values and differential qd algorithms. Numer. Math. 67:1994;191-229.
13. G.J.F. Francis, The QR Transformation, Parts I and II, Comput. J. 4 (1961-62), 265-271, 332-345.
14. Z.S. Liu, On the extended HR algorithm, Ph. D. Thesis, Technical Report CPAM-564 (August 1992 ), Center for Pure and Applied Math., Univ. of California, Berkeley.
15. 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.
16. I.S. Dhillon, B.N. Parlett, Orthogonal eigenvectors and relative gaps, submitted to SIAM J. Matrix Anal. Appl.
17. Parlett B.N., Dhillon I.S. Relatively robust representations for symmetric tridiagonal matrices. Linear Algebra Appl. 309:2000;121-151.
18. B.N. Parlett, The Symmetric Eigenvalue Problem, 2nd Edition, SIAM, Philadelphia, 1998, 398pp.
19. Parlett B.N., Marques O.A. An implementation of the dqds algorithm (Positive case). Linear Algebra Appl. 309:2000;217-259.
20. Rutishauser H. Der quotienten-differenzen-algorithmus. Z. Angew. Math. Phys. 5:1954;233-251.
21. Rutishauser H. Solution of eigenvalue problems with the LR-transformation. Nat. Bur. Standards Appl. Math. Ser. 49:1958;47-81.
22. Rutishauser H. Lectures on Numerical Mathematics. 1990;Birkhäuser, Boston.
23. F. Uhlig, A fast and simple method to compute the eigenvalues of general complex tridiagonal matrices, preprint, Olga Tausssky-Todd Memorial Meeting, June 1996.
24. Uhlig F. The. DQR algorithm, basic theory, convergence, and conditional stability Numer. Math. 76:1997;515-553.