Detecting Localization in an Invariant Subspace
METADATA ONLY
Loading...
Author / Producer
Date
2009-11
Publication Type
Report
ETH Bibliography
yes
Citations
Altmetric
METADATA ONLY
Data
Rights / License
Abstract
A normalized eigenvector, or, more interestingly, an invariant subspace, is localized if its significant entries are defined by just part(s) of the matrix and negligible elsewhere. This paper presents two new procedures to detect such localization in eigenvectors of a symmetric tridiagonal matrix. The procedures are intended for use before the actual eigenvector computation. If localization is found, one may reduce costs by computing the vectors just from the relevant matrix regions. Practical eigensolvers from numerical libraries such as LAPACK and ScaLAPACK already inspect a given tridiagonal $T$ for off-diagonal entries that are of small magnitude relative to the matrix norm. These so-called splitting points indicate that $T$ breaks into smaller blocks, each one defining a subset of eigenvalues and localized eigenvectors. However, localization can occur even when none of the off-diagonals is particularly small. Our study investigates this more complicated phenomenon in the context of invariant subspaces belonging to isolated eigenvalue clusters.
Permanent link
Publication status
published
External links
Editor
Book title
Journal / series
Volume
33 (6)
Pages / Article No.
3447 - 3467
Publisher
SIAM
Event
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Organisational unit
02150 - Dep. Informatik / Dep. of Computer Science