A Two-Stage Finite Element Approach for High-precision Guaranteed Lower Eigenvalue Bounds

TL;DR

This paper introduces a two-stage finite element method that achieves high-precision, guaranteed lower eigenvalue bounds matching the sharpness of upper bounds, especially on graded meshes, addressing a longstanding challenge in numerical eigenvalue estimation.

Contribution

The paper presents a novel two-stage algorithm combining high-order FEM and graded meshes to produce sharp, reliable lower eigenvalue bounds, filling a critical gap in eigenvalue computation methods.

Findings

Method provides bounds as sharp as high-order upper bounds.

Effective on graded and nonuniform meshes.

Numerical results confirm accuracy and efficiency.

Abstract

Obtaining high-precision guaranteed lower eigenvalue bounds remains difficult, even though the standard high-order conforming finite element (FEM) easily yields extremely sharp upper bounds. Recently developed rigorous approaches using such as Crouzeix--Raviart or linear conforming elements do not extend well to high-order FEM. Some non-standard FEM approaches can provide sharp eigenvalue bounds but are technically involved. This persistent gap between accurate upper bounds and equally sharp rigorous lower bounds via standard high-order conforming FEMs makes the problem technically demanding and highly competitive. In this paper, we propose a new two-stage rigorous algorithm that closes this gap by employing high-order FEM on graded meshes and producing rigorous lower eigenvalue bounds as sharp as the corresponding high-order upper bounds, as demonstrated in our numerical examples. Numerical experiments for the Laplacian and Steklov eigenvalue problems on square and dumbbell domains show the accuracy and efficiency of the method, particularly on graded or highly nonuniform meshes. These results confirm that the proposed approach provides a practical and competitive solution to the long-standing difficulty of obtaining sharp, reliable lower eigenvalue bounds.