Guaranteed eigenvalue bounds for the Steklov eigenvalue problem
Lists
Only you see this
Abstract
To provide mathematically rigorous eigenvalue bounds for the Steklov eigenvalue problem, an enhanced version of the eigenvalue estimation algorithm developed by the third author is proposed, which removes the requirements of the positive definiteness of bilinear forms in the formulation of eigenvalue problems. In practical eigenvalue estimation, the Crouzeix--Raviart finite element method (FEM) along with quantitative error estimation is adopted. Numerical experiments for eigenvalue problems defined on a square domain and an L-shaped domain are provided to validate the precision of computed eigenvalue bounds.
BibTeX
@misc{you2018guaranteed,
author = {Chun'guang You and Hehu Xie and Xuefeng Liu},
title = {{Guaranteed eigenvalue bounds for the Steklov eigenvalue problem}},
year = {2018},
eprint = {1808.08148},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/1808.08148},
}| Optimal quadratic element on rectangular grids for $H^1$ problems | arXiv · 2019 |
| On Computing Coercivity Constants in Linear Variational Problems Through Eigenvalue Analysis | arXiv · 2022 |
| Uniform estimation of the eigenvalues of Sturm–Liouville problems | The Journal of the Australian Mathematical Society Series B Applied Mathematics · 1980 |
| Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues | arXiv · 2018 |
| On rigorous estimates of eigenspaces and eigenvalues of a matrix | arXiv · 2015 |
| A posteriori local error estimation for finite element solutions of boundary value problems | arXiv · 2021 |