Verified eigenvalue evaluation for the Laplacian over polygonal domains of arbitrary shape
From MaRDI portal
Publication:2845606
DOI10.1137/120878446zbMATH Open1273.65179arXiv1204.4119OpenAlexW2095139809MaRDI QIDQ2845606FDOQ2845606
Authors: Xuefeng Liu, Shin'ichi Oishi 
Publication date: 2 September 2013
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Abstract: The finite element method(FEM) is applied to bound leading eigenvalues of Laplace operator over polygonal domain. Compared with classical numerical methods, most of which can only give concrete eigenvalue bounds over special domain of symmetry, our proposed algorithm can provide concrete eigenvalue bounds for domain of arbitrary shape, even in the case that eigenfunction has singularity. The problem of eigenvalue estimation is solved in two steps. First, we construct computable a priori error estimation for FEM solution of Poisson's problem even for non-convex domain with re-entrant corner. Second, a new computable lower and upper bounds is developed for eigenvalues. As the interval arithmetic is implemented in the FEM computation, the desired eigenvalue bounds can be expected to be mathematically correct. The Lehmann's theorem is also adopted to sharpen the eigenvalue bounds with high precision. At the end of this paper, we illustrate several computation examples, such as the case of L-shaped domain and crack domain, to demonstrate the efficiency and flexibility of proposed method.
Full work available at URL: https://arxiv.org/abs/1204.4119
Recommendations
eigenvalue problemelliptic operatorfinite element methodmin-max principleverified computationPrager-Synge's theorem
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)
Cited In (49)
- The Prager-Synge theorem in reconstruction based a posteriori error estimation
- Solving eigenvalue problems in a discontinuous approximation space by patch reconstruction
- Any three eigenvalues do not determine a triangle
- Numerical verification of positiveness for solutions to semilinear elliptic problems
- An optimal adaptive FEM for eigenvalue clusters
- An alternative approach to norm bound computation for inverses of linear operators in Hilbert spaces
- Explicit a posteriori and a priori error estimation for the finite element solution of Stokes equations
- Guaranteed local error estimation for finite element solutions of boundary value problems
- Solving Poisson problems in polygonal domains with singularity enriched physics informed neural networks
- The weak Galerkin method for elliptic eigenvalue problems
- Guaranteed and robust a posteriori bounds for Laplace eigenvalues and eigenvectors: conforming approximations
- Computational Lower Bounds of the Maxwell Eigenvalues
- Projection-based guaranteed \(L^2\) error bounds for finite element approximations of Laplace eigenfunctions
- A Method of Verified Computations for Solutions to Semilinear Parabolic Equations Using Semigroup Theory
- Flux reconstructions in the Lehmann-Goerisch method for lower bounds on eigenvalues
- Guaranteed eigenvalue bounds for the Steklov eigenvalue problem
- Lower and upper bounds of Laplacian eigenvalue problem by weak Galerkin method on triangular meshes
- Sharp numerical inclusion of the best constant for embedding \(H_0^1(\Omega) \hookrightarrow L^p(\Omega)\) on bounded convex domain
- Title not available (Why is that?)
- Mixed methods and lower eigenvalue bounds
- Computing fractional Laplacians on complex-geometry domains: algorithms and simulations
- Finite element eigenvalues for the Laplacian over an L-shaped domain
- A boundary integral algorithm for the Laplace Dirichlet-Neumann mixed eigenvalue problem
- Computing eigenvalues of the Laplacian on rough domains
- Guaranteed a posteriori bounds for eigenvalues and eigenvectors: multiplicities and clusters
- Explicit eigenvalue bounds of differential operators defined by symmetric positive semi-definite bilinear forms
- Computing ultra-precise eigenvalues of the Laplacian within polygons
- High-precision eigenvalue bound for the Laplacian with singularities
- Fully computable a posteriori error bounds for eigenfunctions
- Guaranteed lower bounds on eigenvalues of elliptic operators with a hybrid high-order method
- Guaranteed high-precision estimation for \(P_0\) interpolation constants on triangular finite elements
- Adaptive-stabilized finite element methods for eigenvalue problems based on residual minimization onto a dual discontinuous Galerkin norm
- Computable error estimates for ground state solution of Bose-Einstein condensates
- A counterexample to Payne's nodal line conjecture with few holes
- Computation of tight enclosures for Laplacian eigenvalues
- Verified norm estimation for the inverse of linear elliptic operators using eigenvalue evaluation
- Guaranteed lower eigenvalue bounds for two spectral problems arising in fluid mechanics
- Inverse norm estimation of perturbed Laplace operators and corresponding eigenvalue problems
- Computer-assisted proof for the stationary solution existence of the Navier-Stokes equation over 3D domains
- Some improvements of invertibility verifications for second-order linear elliptic operators
- A-priori and a-posteriori error estimates for discontinuous Galerkin method of the Maxwell eigenvalue problem
- A posteriori verification of the positivity of solutions to elliptic boundary value problems
- Error constants for the semi-discrete Galerkin approximation of the linear heat equation
- A posteriori verification for the sign-change structure of solutions of elliptic partial differential equations
- Numerical verification method for positive solutions of elliptic problems
- A framework of verified eigenvalue bounds for self-adjoint differential operators
- On the polygonal Faber-Krahn inequality
- Guaranteed lower eigenvalue bounds for Steklov operators using conforming finite element methods
- A deep learning method for computing eigenvalues of the fractional Schrödinger operator
Uses Software
This page was built for publication: Verified eigenvalue evaluation for the Laplacian over polygonal domains of arbitrary shape
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845606)
