Justification of the saturation assumption
From MaRDI portal
Publication:304515
DOI10.1007/s00211-015-0769-7zbMath1348.65161OpenAlexW2243835919MaRDI QIDQ304515
Carsten Carstensen, Joscha Gedicke, Dietmar Gallistl
Publication date: 25 August 2016
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-015-0769-7
Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Related Items (6)
Some remarks on interpolation and best approximation ⋮ An a posteriori estimator of eigenvalue/eigenvector error for penalty-type discontinuous Galerkin methods ⋮ On the convergence of adaptive feedback loops ⋮ Dual-weighted residual a posteriori error estimates for a penalized phase-field slit discontinuity problem ⋮ Two-Side a Posteriori Error Estimates for the Dual-Weighted Residual Method ⋮ Reliability and efficiency of DWR-type a posteriori error estimates with smart sensitivity weight recovering
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An adaptive finite element method with asymptotic saturation for eigenvalue problems
- Convergence of simple adaptive Galerkin schemes based on \(h - h/2\) error estimators
- Small data oscillation implies the saturation assumption
- A convergent adaptive finite element method for an optimal design problem
- A Posteriori Error Estimates Based on Hierarchical Bases
- Quasi-Optimal Convergence Rate for an Adaptive Finite Element Method
- Edge Residuals Dominate A Posteriori Error Estimates for Low Order Finite Element Methods
- Each averaging technique yields reliable a posteriori error control in FEM on unstructured grids. Part I: Low order conforming, nonconforming, and mixed FEM
- Some new error estimates for Ritz–Galerkin methods with minimal regularity assumptions
- A Convergent Adaptive Algorithm for Poisson’s Equation
- Quasi-Interpolation and A Posteriori Error Analysis in Finite Element Methods
- The completion of locally refined simplicial partitions created by bisection
This page was built for publication: Justification of the saturation assumption