Computing eigenvalue bounds for iterative subspace matrix methods

Abstract

A procedure is presented for the computation of bounds to eigenvalues of the generalized hermitian eigenvalue problem and to the standard hermitian eigenvalue problem. This procedure is applicable to iterative subspace eigenvalue methods and to both outer and inner eigenvalues. The Ritz values and their corresponding residual norms, all of which are computable quantities, are needed by the procedure. Knowledge of the exact eigenvalues is not needed by the procedure, but it must be known that the computed Ritz values are isolated from exact eigenvalues outside of the Ritz spectrum and that there are no skipped eigenvalues within the Ritz spectrum range. A multipass refinement procedure is described to compute the bounds for each Ritz value. This procedure requires O(m) effort where m is the subspace dimension for each pass. Published by Elsevier B.V. PACS: 02.10; 02.60; 02.70; 89.80

DOI: 10.1016/j.cpc.2004.12.013

6 Figures and Tables

Cite this paper

@article{Zhou2005ComputingEB, title={Computing eigenvalue bounds for iterative subspace matrix methods}, author={Yunkai Zhou and Ron L. Shepard and Michael Minkoff}, journal={Computer Physics Communications}, year={2005}, volume={167}, pages={90-102} }