Skip to main content
Article
Filtered Subspace Iteration for Selfadjoint Operators
Portland Institute for Computational Science Publications
  • Jay Gopalakrishnan, Portland State University
  • Luka Grubišić, University of Zagreb
  • Jeffrey S. Ovall, Portland State University
Document Type
Pre-Print
Publication Date
9-18-2017
Subjects
  • Numerical analysis,
  • Galerkin methods,
  • Discontinuous functions
Abstract

We consider the problem of computing a cluster of eigenvalues (and its associated eigenspace) of a (possibly unbounded) selfadjoint operator in a Hilbert space. A rational function of the operator is constructed such that the eigenspace of interest is its dominant eigenspace, and a subspace iteration procedure is used to approximate this eigenspace. The computed space is then used to obtain approximations of the eigenvalues of interest. An eigenvalue and eigenspace convergence analysis that considers both iteration error and dis- cretization error is provided. A realization of the proposed approach for a model second-order elliptic operator is based on a discontinuous Petrov-Galerkin discretization of the resolvent, and a variety of numerical experiments illustrate its performance.

Persistent Identifier
http://archives.pdx.edu/ds/psu/22313
Citation Information
Jay Gopalakrishnan, Luka Grubišić and Jeffrey S. Ovall. "Filtered Subspace Iteration for Selfadjoint Operators" (2017)
Available at: http://works.bepress.com/jay-gopalakrishnan/106/