Journal
LINEAR ALGEBRA AND ITS APPLICATIONS
Volume 387, Issue -, Pages 1-28Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.laa.2003.12.028
Keywords
symmetric tridiagonal; eigenvectors; orthogonality; high relative accuracy; relatively robust representations (RRR)
Categories
Ask authors/readers for more resources
In this paper we present an O(nk) procedure, Algorithm MR3, for computing k eigenvectors of an n x n symmetric tridiagonal matrix T. A salient feature of the algorithm is that a number of different LDLt products (L unit lower triangular, D diagonal) are computed. In exact arithmetic each LDLt is a factorization of a translate of T. We call the various LDLt products representations (of T) and, roughly speaking, there is a representation for each cluster of close eigenvalues. The unfolding of the algorithm, for each matrix, is well described by a representation tree. We present the tree and use it to show that if each representation satisfies three prescribed conditions then the computed eigenvectors are orthogonal to working accuracy and have small residual norms with respect to the original matrix T. (C) 2004 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available