TY - JOUR
T1 - Verified eigenvalue evaluation for the laplacian over polygonal domains of arbitrary shape
AU - Liu, Xuefeng
AU - Oishi, Shin'ichi
PY - 2013
Y1 - 2013
N2 - The finite element method (FEM) is applied to bound leading eigenvalues of the Laplace operator over polygonal domains. Compared with classical numerical methods, most of which can only give concrete eigenvalue bounds over special domains of symmetry, our proposed algorithm can provide concrete eigenvalue bounds for domains of arbitrary shape, even when the eigenfunction has a singularity. The problem of eigenvalue estimation is solved in two steps. First, we construct a computable a priori error estimation for the FEM solution of Poisson's problem, which holds even for nonconvex domains with reentrant corners. Second, new computable lower bounds are developed for the eigenvalues. Because the interval arithmetic is implemented throughout the computation, the desired eigenvalue bounds are expected to be mathematically correct. We illustrate several computation examples, such as the cases of an L-shaped domain and a crack domain, to demonstrate the efficiency and flexibility of the proposed method.
AB - The finite element method (FEM) is applied to bound leading eigenvalues of the Laplace operator over polygonal domains. Compared with classical numerical methods, most of which can only give concrete eigenvalue bounds over special domains of symmetry, our proposed algorithm can provide concrete eigenvalue bounds for domains of arbitrary shape, even when the eigenfunction has a singularity. The problem of eigenvalue estimation is solved in two steps. First, we construct a computable a priori error estimation for the FEM solution of Poisson's problem, which holds even for nonconvex domains with reentrant corners. Second, new computable lower bounds are developed for the eigenvalues. Because the interval arithmetic is implemented throughout the computation, the desired eigenvalue bounds are expected to be mathematically correct. We illustrate several computation examples, such as the cases of an L-shaped domain and a crack domain, to demonstrate the efficiency and flexibility of the proposed method.
KW - Eigenvalue problem
KW - Elliptic operator
KW - Finite element method
KW - Min-max principle
KW - Prager-Synge's theorem
KW - Verified computation
UR - http://www.scopus.com/inward/record.url?scp=84884998230&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84884998230&partnerID=8YFLogxK
U2 - 10.1137/120878446
DO - 10.1137/120878446
M3 - Article
AN - SCOPUS:84884998230
SN - 0036-1429
VL - 51
SP - 1634
EP - 1654
JO - SIAM Journal on Numerical Analysis
JF - SIAM Journal on Numerical Analysis
IS - 3
ER -