Spectral discretization errors in filtered subspace iteration
Preprint
Abstract
We consider filtered subspace iteration for approximating a cluster of eigenvalues (and its associated eigenspace) of a (possibly unbounded) selfadjoint operator in a Hilbert space. The algorithm is motivated by a quadrature approximation of an operator-valued contour integral of the resolvent. Resolvents on infinite dimensional spaces are discretized in computable finite-dimensional spaces before the algorithm is applied. This study focuses on how such discretizations result in errors in the eigenspace approximations computed by the algorithm. The computed eigenspace is then used to obtain approximations of the eigenvalue cluster. Bounds for the Hausdorff distance between the computed and exact eigenvalue clusters are obtained in terms of the discretization parameters within an abstract framework. A realization of the proposed approach for a model second-order elliptic operator using a standard finite element discretization of the resolvent is described. Some numerical experiments are conducted to gauge the sharpness of the theoretical estimates.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Recursive integral method for transmission eigenvaluesJournal of Computational Physics, 2016
- Relationships among contour integral-based methods for solving generalized eigenvalue problemsJapan Journal of Industrial and Applied Mathematics, 2016
- FEAST As A Subspace Iteration Eigensolver Accelerated By Approximate Spectral ProjectionSIAM Journal on Matrix Analysis and Applications, 2014
- REPRESENTATION THEOREMS FOR INDEFINITE QUADRATIC FORMS REVISITEDMathematika, 2012
- An integral method for solving nonlinear eigenvalue problemsLinear Algebra and its Applications, 2012
- Elliptic Problems in Nonsmooth Domains2011
- Angles between infinite dimensional subspaces with applications to the Rayleigh–Ritz and alternating projectors methodsJournal of Functional Analysis, 2010
- Rayleigh–Ritz Majorization Error Bounds with Applications to FEMSIAM Journal on Matrix Analysis and Applications, 2010
- Density-matrix-based algorithm for solving eigenvalue problemsPhysical Review B, 2009
- The Neumann problem on Lipschitz domainsBulletin of the American Mathematical Society, 1981