FEAST for differential eigenvalue problems
Numerical Analysis
2024-11-15 v3 Numerical Analysis
Abstract
An operator analogue of the FEAST matrix eigensolver is developed to compute the discrete part of the spectrum of a differential operator in a region of interest in the complex plane. Unbounded search regions are handled with a novel rational filter for the right half-plane. If the differential operator is normal or self-adjoint, then the operator analogue preserves that structure and robustly computes eigenvalues to near machine precision accuracy. The algorithm is particularly adept at computing high-frequency modes of differential operators that possess self-adjoint structure with respect to weighted Hilbert spaces.
Cite
@article{arxiv.1901.04533,
title = {FEAST for differential eigenvalue problems},
author = {Andrew Horning and Alex Townsend},
journal= {arXiv preprint arXiv:1901.04533},
year = {2024}
}
Comments
Expanded discussion for clarity in several places, revised statement of theorem 5.2 for clarity