How many numerical eigenvalues can we trust?

Abstract: When using finite element and finite difference methods to approximate eigenvalues of

2 m^{t h}

-order elliptic problems, the number of reliable numerical eigenvalues can be estimated in terms of the total degrees of freedom

N

in resulting discrete systems. The truth is worse than what we used to believe in that the percentage of reliable eigenvalues decreases with an increased

N

, even though the number of reliable eigenvalues increases with

N

.

Recommendations

Cites work

Cited in

(37)

Spectrally accurate Stokes eigen-modes on isosceles triangles
Tailored finite point methods for solving singularly perturbed eigenvalue problems with higher eigenvalues
A penalized Crouzeix-Raviart element method for second order elliptic eigenvalue problems
Exponentially convergent symbolic algorithm of the functional-discrete method for the fourth order Sturm-Liouville problems with polynomial coefficients
Sparse spectral-Galerkin method on an arbitrary tetrahedron using generalized Koornwinder polynomials
Superconvergence and fast implementation of the barycentric prolate differentiation
Spectral-Galerkin approximation and optimal error estimate for biharmonic eigenvalue problems in circular/spherical/elliptical domains
Spectral approximation for polynomial eigenvalue problems
On the stability of the Rayleigh-Ritz method for eigenvalues
Symbolic algorithm of the functional-discrete method for a Sturm-Liouville problem with a polynomial potential
On hp-convergence of prolate spheroidal wave functions and a new well-conditioned prolate-collocation scheme
On the number of reliable finite‐element eigenmodes
A Multilevel Correction Type of Adaptive Finite Element Method for Eigenvalue Problems
On the degree of ill-posedness of multi-dimensional magnetic particle imaging
Spectral element methods for eigenvalue problems based on domain decomposition
Inversion of trace formulas for a Sturm-Liouville operator
Computing eigenvalues and eigenfunctions of Schrödinger equations using a model reduction approach
Optimal spectral schemes based on generalized prolate spheroidal wave functions of order -1
Solving eigenvalue problems in a discontinuous approximation space by patch reconstruction
The triangular spectral element method for Stokes eigenvalues
Computing fractional Laplacians on complex-geometry domains: algorithms and simulations
Stability and bifurcation of a reaction-diffusion-advection model with nonlinear boundary condition
The foundations of spectral computations via the solvability complexity index hierarchy
Diagonalized Legendre spectral method for second-order eigenvalue problems
Eigenvalue analysis and applications of the Legendre dual-Petrov-Galerkin methods for initial value problems
The tailored finite point scheme based on flux conservation for singularly perturbed eigenvalue problems
A semianalytic diagonalization finite element method for the spectral fractional Laplacian
The spectral Galerkin method for the differential operator eigenvalue problems based on a least-squares form and its Schur complement type implementation methods
Highly efficient Gauss's law-preserving spectral algorithms for Maxwell's double-curl source and eigenvalue problems based on eigen-decomposition
Unfitted spectral element method for interfacial models
A gradient flow model for ground state calculations in Wigner formalism based on density functional theory
Fast Maxwell solvers based on exact discrete eigen-decompositions. I: Two-dimensional case
A spectral element approximation of the modified transmission eigenvalue problem in regular polygonal geometries
Solving singularly perturbed eigenvalue problems via TFPM-inspired neural networks
Spectral/spectral element method for the transmission eigenvalue problem in complex geometric configurations
A hybridizable discontinuous Galerkin method for the indefinite time-harmonic Maxwell equations
A spectral-element method for computing many eigenvalues and their asymptotics of the Schrödinger operator with Robin boundary condition