Projection error-based guaranteed L2 error bounds for finite element approximations of Laplace eigenfunctions
Xuefeng Liu, Tom\'a\v{s} Vejchodsk\'y

TL;DR
This paper introduces a fully computable, guaranteed L2 error bound for finite element approximations of Laplace eigenfunctions, ensuring robustness even with multiple or clustered eigenvalues.
Contribution
It presents a novel, guaranteed error bound based on a priori estimates that is optimal for eigenfunctions with varying regularity, improving reliability of finite element methods.
Findings
The error bound is fully computable and guaranteed.
The bound is robust for multiple and clustered eigenvalues.
Numerical examples confirm the accuracy of the error estimate.
Abstract
For conforming finite element approximations of the Laplacian eigenfunctions, a fully computable guaranteed error bound in the norm sense is proposed. The bound is based on the a priori error estimate for the Galerkin projection of the conforming finite element method, and has an optimal speed of convergence for the eigenfunctions with the worst regularity. The resulting error estimate bounds the distance of spaces of exact and approximate eigenfunctions and, hence, is robust even in the case of multiple and tightly clustered eigenvalues. The accuracy of the proposed bound is illustrated by numerical examples. The demonstration code is available at https://ganjin.online/xfliu/EigenfunctionEstimation4FEM .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Methods in Computational Mathematics · Numerical methods in engineering · Model Reduction and Neural Networks
