Guaranteed computational methods for self-adjoint differential eigenvalue problems

DOI10.1007/978-981-97-3577-8MaRDI QIDQ6574013zbMATH OpenFDO

Authors Xuefeng Liu

Publication date 17 July 2024

Published in SpringerBriefs in Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-981-97-3577-8

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical linear algebra (65Fxx)

Recommendations

• Guaranteed lower eigenvalue bounds for Steklov operators using conforming finite element methods
• Guaranteed eigenvalue bounds for the Steklov eigenvalue problem
• A framework of verified eigenvalue bounds for self-adjoint differential operators
• Fully computable a posteriori error bounds for eigenfunctions
• Fully computable error bounds for eigenvalue problem

Cited in

(6)

• Comparison of guaranteed lower eigenvalue bounds with three skeletal schemes
• Stable computation of Laplacian eigenfunctions corresponding to clustered eigenvalues.
• Guaranteed lower and upper bounds for eigenvalues of second order elliptic operators in any dimension
• Bounding escape rates and approximating quasi-stationary distributions of Brownian dynamics
• The second Dirichlet eigenvalue is simple on every non-equilateral triangle. I: Nearly degenerate triangles
• The second Dirichlet eigenvalue is simple on every non-equilateral triangle. II: Nearly equilateral triangles

This page was built for publication: Guaranteed computational methods for self-adjoint differential eigenvalue problems

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