Lower eigenvalue bounds with hybrid high-order methods
arXiv:2406.06244 · doi:10.1093/imanum/draf148
Abstract
This paper proposes hybrid high-order eigensolvers for the computation of guaranteed lower eigenvalue bounds. These bounds display higher order convergence rates and are accessible to adaptive mesh-refining algorithms. The involved constants arise from local embeddings and are available for all polynomial degrees. Applications include the linear elasticity and Steklov eigenvalue problem.