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.
References in corpus (7)
- A Hybrid High-Order method for the incompressible Navier--Stokes equations based on Temam's device
- Computing the lower and upper bounds of Laplace eigenvalue problem: by combining conforming and nonconforming finite element methods
- On the inequalities of Babuška-Aziz, Friedrichs and Horgan-Payne
- Stabilization-free HHO a posteriori error control
- Mixed methods and lower eigenvalue bounds
- Locking-free hybrid high-order method for linear elasticity
- Adaptive hybrid high-order method for guaranteed lower eigenvalue bounds