Convergence and Optimality of Higher-Order Adaptive Finite Element Methods for Eigenvalue Clusters
DOI10.1137/15M1036877zbMath1346.65058arXiv1508.06265OpenAlexW2964114492MaRDI QIDQ3188303
Publication date: 18 August 2016
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.06265
convergencefinite element methodoptimalityadaptivitya posteriori error estimateseigenvalue problemseigenfunctionlinear elliptic problemspectral computations
Estimates of eigenvalues in context of PDEs (35P15) Error bounds for boundary value problems involving PDEs (65N15) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25)
Related Items (8)
Uses Software
Cites Work
- Approximating gradients with continuous piecewise polynomial functions
- An oscillation-free adaptive FEM for symmetric eigenvalue problems
- Convergence and optimal complexity of adaptive finite element eigenvalue computations
- Adaptive finite element methods with convergence rates
- An optimal adaptive FEM for eigenvalue clusters
- Optimality of a standard adaptive finite element method
- Primer of Adaptive Finite Element Methods
- Quasi-Optimal Convergence Rate of an Adaptive Discontinuous Galerkin Method
- Convergence and quasi-optimality of adaptive FEM for Steklov eigenvalue problems
- A new error analysis for discontinuous finite element methods for linear elliptic problems
- Convergence and quasi-optimal complexity of adaptive finite element computations for multiple eigenvalues
- deal.II—A general-purpose object-oriented finite element library
- A Convergent Adaptive Method for Elliptic Eigenvalue Problems
- CONVERGENCE OF ADAPTIVE FINITE ELEMENT METHODS FOR EIGENVALUE PROBLEMS
- Quasi-Optimal Convergence Rate for an Adaptive Finite Element Method
- Finite Element-Galerkin Approximation of the Eigenvalues and Eigenvectors of Selfadjoint Problems
- A Convergent Adaptive Algorithm for Poisson’s Equation
- Comparison Results of Finite Element Methods for the Poisson Model Problem
- The completion of locally refined simplicial partitions created by bisection
This page was built for publication: Convergence and Optimality of Higher-Order Adaptive Finite Element Methods for Eigenvalue Clusters