A Priori Error Estimates for Finite Element Approximations to Eigenvalues and Eigenfunctions of the Laplace-Beltrami Operator

@article{Bonito2018APE,
  title={A Priori Error Estimates for Finite Element Approximations to Eigenvalues and Eigenfunctions of the Laplace-Beltrami Operator},
  author={Andrea Bonito and Alan Demlow and Justin Owen},
  journal={SIAM J. Numer. Anal.},
  year={2018},
  volume={56},
  pages={2963-2988}
}
Elliptic partial differential equations on surfaces play an essential role in geometry, relativity theory, phase transitions, materials science, image processing, and other applications. They are typically governed by the Laplace-Beltrami operator. We present and analyze approximations by Surface Finite Element Methods (SFEM) of the Laplace-Beltrami eigenvalue problem. As for SFEM for source problems, spectral approximation is challenged by two sources of errors: the geometric consistency error… 
Analysis of finite element methods for surface vector-Laplace eigenproblems
TLDR
A general abstract framework applicable to such nonconforming discretizations of eigenproblems is presented and error bounds both for eigenvalue and eigenvector approximations are derived that depend on certain consistency and approximability parameters.
On the numerical solution of the Laplace-Beltrami problem on piecewise-smooth surfaces
TLDR
This work presents an overview of the L2-invertibility of the Laplace-Beltrami operator on piecewise smooth surfaces, extending earlier weak formulations and integral equation approaches on smooth surfaces.
Discontinuous Galerkin methods for the Laplace-Beltrami operator on point cloud
TLDR
A generic geometric error analysis framework for numerical solution of PDEs on submanifolds is established and is applied to analyzing discontinuous Galerkin (DG) methods for the Laplace-Beltrami operator on point clouds.
Galerkin-Chebyshev approximation of Gaussian random fields on compact Riemannian manifolds
TLDR
A new numerical approximation method for a class of Gaussian random fields on compact Riemannian manifolds characterized by the Laplace–Beltrami operator on the manifold using a Galerkin approximation combined with a polynomial approximation using Chebyshev series.
NEWEST VERTEX BISECTION OVER GENERAL TRIANGULAR MESHES
We give an accessible exposition and analysis to algorithmic mesh refinement via newest vertex bisection for triangular meshes. We prove a purely combinatorial amortized complexity estimate whose
NEWEST VERTEX BISECTION OVER GENERAL TRIANGULATIONS
We give an accessible exposition and analysis to algorithmic mesh refinement via newest vertex bisection for triangular meshes. We prove a purely combinatorial amortized complexity estimate whose
A divergence-conforming finite element method for the surface Stokes equation
TLDR
This work first approximate the Killing fields via a Stokes eigenvalue problem and then gives a method which is asymptotically guaranteed to correctly exclude them from the solution, which exactly satisfies the incompressibility constraint in the surface Stokes problem.

References

SHOWING 1-10 OF 44 REFERENCES
L2 and pointwise a posteriori error estimates for FEM for elliptic PDEs on surfaces
Surface Finite Element Methods (SFEM) are widely used to solve surface partial differential equations arising in applications including crystal growth, fluid mechanics and computer graphics. A
Higher-Order Finite Element Methods and Pointwise Error Estimates for Elliptic Problems on Surfaces
  • A. Demlow
  • Mathematics, Computer Science
    SIAM J. Numer. Anal.
  • 2009
TLDR
Higher-order analogues to the piecewise linear surface finite element method studied in Dziuk's paper are defined and error estimates are proved in both pointwise and $L_2$-based norms.
New A Priori FEM Error Estimates for Eigenvalues
TLDR
The Ritz--Galerkin method for symmetric eigenvalue problems is analyzed and what is apparently the first truly a priori error estimates that show the levels of the eigen value errors depending on approximability of eigenfunctions in the corresponding eigenspace are proved.
Convergence and Optimality of Higher-Order Adaptive Finite Element Methods for Eigenvalue Clusters
TLDR
This note shows that standard adaptive FEM for clustered eigenvalues employing elements of arbitrary polynomial degree converge with optimal rate, and establishes that a key user-defined input parameter in the AFEM, the bulk marking parameter, may be chosen entirely independently of the properties of the target eigenvalue cluster.
Higher order convergence results for the Rayleigh-Ritz method applied to eigenvalue problems: 2. Improved error bounds for eigenfunctions
The application of the Rayleigh-Ritz method for approximating the eigenvalues and eigenfunctions of linear eigenvalue problems in several dimensions is investigated. The object is to improve upon
A Convergent Adaptive Method for Elliptic Eigenvalue Problems
TLDR
The error analysis extends the theory of convergence of adaptive methods for linear elliptic source problems to elliptic eigenvalue problems, and in particular deals with various complications which arise essentially from the nonlinearity of the eigen value problem.
Geometric Variational Crimes: Hilbert Complexes, Finite Element Exterior Calculus, and Problems on Hypersurfaces
TLDR
This framework extends the work of Arnold, Falk, and Winther to problems that violate their subcomplex assumption, allowing for the extension of finite element exterior calculus to approximate domains, most notably the Hodge–de Rham complex on approximate manifolds.
A note on the effect of numerical quadrature in finite element eigenvalue approximation
SummaryIn a recent work by the author and J.E. Osborn, it was shown that the finite element approximation of the eigenpairs of differential operators, when the elements of the underlying matrices are
Estimates for the errors in Eigenvalue and Eigenvector approximation by Galerkinmethods, with particular attention to the case of multiple Eigenvalues
Refined estimates for the errors in eigenvalue and eigenvector approximation by finite element, or, more generally, Galerkin methods, as they apply to selfadjoint. problems, are presented. Particular
An oscillation-free adaptive FEM for symmetric eigenvalue problems
TLDR
The proposed AFEM monitors the edge-contributions in a bulk criterion and so enables a contraction property up to higher-order terms and global convergence and shows a high accuracy and the AFEM leads to optimal empirical convergence rates.
...
1
2
3
4
5
...