Fully computable a posteriori error bounds for eigenfunctions

DOI10.1007/S00211-022-01304-0zbMATH Open1496.65204arXiv1904.07903OpenAlexW3023739347MaRDI QIDQ2168065FDOQ2168065

Authors: Yanyan Li 

Publication date: 31 August 2022

Published in: Numerische Mathematik (Search for Journal in Brave)

Abstract: For compact self-adjoint operators in Hilbert spaces, two algorithms are proposed to provide fully computable a posteriori error estimate for eigenfunction approximation. Both algorithms apply well to the case of tight clusters and multiple eigenvalues, under the settings of target eigenvalue problems. Algorithm I is based on the Rayleigh quotient and the min-max principle that characterizes the eigenvalue problems. The formula for the error estimate provided by Algorithm I is easy to compute and applies to problems with limited information of Rayleigh quotients. Algorithm II, as an extension of the Davis--Kahan method, takes advantage of the dual formulation of differential operators along with the Prager--Synge technique and provides greatly improved accuracy of the estimate, especially for the finite element approximations of eigenfunctions. Numerical examples of eigenvalue problems of matrices and the Laplace operators over convex and non-convex domains illustrate the efficiency of the proposed algorithms.

Full work available at URL: https://arxiv.org/abs/1904.07903

Recommendations

• Guaranteed a posteriori bounds for eigenvalues and eigenvectors: multiplicities and clusters
• Fully computable error bounds for eigenvalue problem
• A posteriori error estimates for elliptic eigenvalue problems using auxiliary subspace techniques
• A Posteriori and a Priori Error Analysis for Finite Element Approximations of Self-Adjoint Elliptic Eigenvalue Problems
• Guaranteed and robust a posteriori bounds for Laplace eigenvalues and eigenvectors: conforming approximations

zbMATH Keywords

error estimatefinite elementsapproximations of eigenfunctions

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Error bounds for boundary value problems involving PDEs (65N15) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Cites Work

• Optimal estimation for the Fujino-Morley interpolation error constants
• The Rotation of Eigenvectors by a Perturbation. III
• Title not available (Why is that?)
• Finite element approximation of eigenvalue problems
• Title not available (Why is that?)
• Introduction to Interval Analysis
• A posteriori estimates for partial differential equations
• Title not available (Why is that?)
• Guaranteed lower bounds for eigenvalues
• Adaptive computation of smallest eigenvalues of self-adjoint elliptic partial differential equations.
• Title not available (Why is that?)
• Approximations in elasticity based on the concept of function space
• An a posteriori error estimator for \(hp\)-adaptive discontinuous Galerkin methods for elliptic eigenvalue problems
• A posteriori error estimator for eigenvalue problems by mixed finite element method
• A posteriori error estimates for non-conforming approximation of eigenvalue problems
• Asymptotic lower bounds for eigenvalues by nonconforming finite element methods
• Eigenvalue approximation from below using non-conforming finite elements
• A POSTERIORI ERROR ESTIMATORS FOR MIXED APPROXIMATIONS OF EIGENVALUE PROBLEMS
• Two-sided bounds for eigenvalues of differential operators with applications to Friedrichs, Poincaré, trace, and similar constants
• Explicit lower bounds for Stokes eigenvalue problems by using nonconforming finite elements
• Lower bounds for eigenvalues of elliptic operators: by nonconforming finite element methods
• Guaranteed lower eigenvalue bounds for the biharmonic equation
• Rayleigh-Ritz Approximation by Piecewise Cubic Polynomials
• The calculation of guaranteed bounds for eigenvalues using complementary variational principles
• Verified eigenvalue evaluation for the Laplacian over polygonal domains of arbitrary shape
• A framework of verified eigenvalue bounds for self-adjoint differential operators
• Eigenwertschranken für Eigenwertaufgaben mit partiellen Differentialgleichungen
• High-precision eigenvalue bound for the Laplacian with singularities
• Title not available (Why is that?)
• Fully Computable Error Bounds for Eigenvalue Problem
• Verified numerical computations for multiple and nearly multiple eigenvalues of elliptic operators
• Guaranteed and robust a posteriori bounds for Laplace eigenvalues and eigenvectors: a unified framework
• Guaranteed and Robust a Posteriori Bounds for Laplace Eigenvalues and Eigenvectors: Conforming Approximations
• Guaranteed Eigenvalue Bounds for the Steklov Eigenvalue Problem
• Flux reconstructions in the Lehmann-Goerisch method for lower bounds on eigenvalues
• Explicit bound for quadratic Lagrange interpolation constant on triangular finite elements
• Explicit eigenvalue bounds of differential operators defined by symmetric positive semi-definite bilinear forms
• Three methods for two‐sided bounds of eigenvalues—A comparison
• Guaranteed a posteriori bounds for eigenvalues and eigenvectors: Multiplicities and clusters
• Computer-assisted proof for the stationary solution existence of the Navier-Stokes equation over 3D domains
• Sharp error bounds for Ritz vectors and approximate singular vectors
• An a posteriori estimator of eigenvalue/eigenvector error for penalty-type discontinuous Galerkin methods

Cited In (2)

• Projection-based guaranteed \(L^2\) error bounds for finite element approximations of Laplace eigenfunctions
• An overview of \textit{a posteriori} error estimation and post-processing methods for nonlinear eigenvalue problems

Uses Software

• constant_estimation

This page was built for publication: Fully computable a posteriori error bounds for eigenfunctions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168065)