Skip to main content
Article thumbnail
Location of Repository

Orthogonal Eigenvectors and Relative Gaps

By Inderjit S. Dhillon and Beresford N. Parlett

Abstract

Let LDLt be the triangular factorization of a real symmetric n\Theta n tridiagonal matrix so that L is a unit lower bidiagonal matrix, D is diagonal. Let (*; v) be an eigenpair, * 6 = 0, with the property that both * and v are determined to high relative accuracy by the parameters in L and D. Suppose also that the relative gap between * and its nearest neighbor _ in the spectrum exceeds 1=n; nj * \Gamma _j? j*j. This paper presents a new O(n) algorithm and a proof that, in the presence of round-off error, the algorithm computes an approximate eigenvector ^v that is accurate to working precision: j sin "(v; ^v)j = O(n"), where " is the round-off unit. It follows that ^v is numerically orthogonal to all the other eigenvectors. This result forms part of a program to compute numerically orthogonal eigenvectors without resorting to the Gram-Schmidt process. The contents of this paper provide a high-level description and theoretical justification for LAPACK (version 3.0) subroutine DLAR1V

Year: 2002
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.4885
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.utk.edu/~library... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.