Fully computable a posteriori error bounds for eigenfunctions
From MaRDI portal
Publication:2168065
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)
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.
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
Cites work
- scientific article; zbMATH DE number 996050 (Why is no real title available?)
- scientific article; zbMATH DE number 3818979 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 1377418 (Why is no real title available?)
- scientific article; zbMATH DE number 3053051 (Why is no real title available?)
- A POSTERIORI ERROR ESTIMATORS FOR MIXED APPROXIMATIONS OF EIGENVALUE PROBLEMS
- A framework of verified eigenvalue bounds for self-adjoint differential operators
- A posteriori error estimates for non-conforming approximation of eigenvalue problems
- A posteriori error estimator for eigenvalue problems by mixed finite element method
- A posteriori estimates for partial differential equations
- Adaptive computation of smallest eigenvalues of self-adjoint elliptic partial differential equations.
- An a posteriori error estimator for \(hp\)-adaptive discontinuous Galerkin methods for elliptic eigenvalue problems
- An a posteriori estimator of eigenvalue/eigenvector error for penalty-type discontinuous Galerkin methods
- Approximations in elasticity based on the concept of function space
- Asymptotic lower bounds for eigenvalues by nonconforming finite element methods
- Computer-assisted proof for the stationary solution existence of the Navier-Stokes equation over 3D domains
- Eigenvalue approximation from below using non-conforming finite elements
- Eigenwertschranken für Eigenwertaufgaben mit partiellen Differentialgleichungen
- 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
- Explicit lower bounds for Stokes eigenvalue problems by using nonconforming finite elements
- Finite element approximation of eigenvalue problems
- Flux reconstructions in the Lehmann-Goerisch method for lower bounds on eigenvalues
- Fully computable error bounds for eigenvalue problem
- Guaranteed a posteriori bounds for eigenvalues and eigenvectors: multiplicities and clusters
- 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
- Guaranteed lower bounds for eigenvalues
- Guaranteed lower eigenvalue bounds for the biharmonic equation
- High-precision eigenvalue bound for the Laplacian with singularities
- Introduction to Interval Analysis
- Lower bounds for eigenvalues of elliptic operators: by nonconforming finite element methods
- Optimal estimation for the Fujino-Morley interpolation error constants
- Rayleigh-Ritz Approximation by Piecewise Cubic Polynomials
- Sharp error bounds for Ritz vectors and approximate singular vectors
- The Rotation of Eigenvectors by a Perturbation. III
- The calculation of guaranteed bounds for eigenvalues using complementary variational principles
- Three methods for two-sided bounds of eigenvalues. A comparison
- Two-sided bounds for eigenvalues of differential operators with applications to Friedrichs, Poincaré, trace, and similar constants
- Verified eigenvalue evaluation for the Laplacian over polygonal domains of arbitrary shape
- Verified numerical computations for multiple and nearly multiple eigenvalues of elliptic operators
Cited in
(5)- Fully computable error bounds for eigenvalue problem
- An overview of \textit{a posteriori} error estimation and post-processing methods for nonlinear eigenvalue problems
- Guaranteed a posteriori bounds for eigenvalues and eigenvectors: multiplicities and clusters
- Guaranteed computational methods for self-adjoint differential eigenvalue problems
- Projection-based guaranteed \(L^2\) error bounds for finite element approximations of Laplace eigenfunctions
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)
