Lower eigenvalue bounds with hybrid high-order methods

2024/06/10 by Tran, Ngoc Tien · 1 citation
#65N25 #65N30 #FOS: Mathematics #Numerical Analysis (math.NA)

paper · doi:10.48550/arxiv.2406.06244

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.

Cited by

• A Hybrid High-Order Method for the Gross--Pitaevskii Eigenvalue Problem

Related

• Computing Both Upper and Lower Eigenvalue Bounds by HDG Methods
• Greedy algorithms for high-dimensional eigenvalue problems
• Adaptive guaranteed lower eigenvalue bounds with optimal convergence rates
• A Two-Stage Finite Element Approach for High-precision Guaranteed Lower Eigenvalue Bounds
• New guaranteed lower bounds on eigenvalues by conforming finite elements