Fast accurate eigenvalue methods for graded positive definite matrices

Numerische Mathematik

Volumn 74, Issue 1, 1996, Pages 85-103

  Mathias, Roy ^a  

^a The College of William and Mary   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030518594     PISSN: 0029599X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002110050209     Document Type: Article

References (10)

1. Barlow, J., Demmel, J. (1990): Computing accurate eigensystems of scaled diagonally dominant matrices. SIAM J. Num. Anal. 27(3), 762-791
2. Demmel, J. (1992): On the inherent inaccuracy of implicit tridiagonal QR. Technical Report 983, Institute for Mathemetics and its Applications, Univeristy of Minnesota, April
3. Demmel, J., Veselić, K. (1992): Jacobi's method is more accurate than QR. SIAM J. Matrix Anal. Appl. 13(4), 1204-1245
4. Fernando, K.V., Parlett, B. (1993): Implicit cholesky algorithms for singular values and vectors. Technical Report PAM-587, Center for Pure and Applied Mathematics, University of Calfornia, Berkeley
5. Fernando, K.V., Parlett, B. (1994): Accurate singular values and differential qd algorithms. Numer. Math. 67, 191-229
6. Mathias, R.: Accurate eigensystem computations by Jacobi methods SIAM J. Matrix Anal. Appl. (to appear)
7. Mathias, R. (1993): Spectral perturbation bounds for graded positive definite matrices. (Manuscript submitted for publication)
8. Mathias, R., Stewart, G.W. (1993): A block QR algorithm and the singular value decomposition. Linear Algebra Appl. 182, 91-100
9. Parlett, B.N. (1980): The Symmetric Eigenvalue Problem. Prentice-Hall, Englewood Cliffs, NJ
10. Stewart G.W., Zhang, G. (1991): Eigenvalues of graded matrices and the condition numbers of a multiple eigenvalue. Numer. Math. 58, 703-712