Polynomial-degree-robust a posteriori estimates in a unified setting for conforming, nonconforming, discontinuous Galerkin, and mixed discretizations
A Ern, M Vohralík - SIAM Journal on Numerical Analysis, 2015 - SIAM
We present equilibrated flux a posteriori error estimates in a unified setting for conforming,
nonconforming, discontinuous Galerkin, and mixed finite element discretizations of the two …
nonconforming, discontinuous Galerkin, and mixed finite element discretizations of the two …
Goal-oriented a posteriori error estimation for conforming and nonconforming approximations with inexact solvers
We derive a unified framework for goal-oriented a posteriori estimation covering in particular
higher-order conforming, nonconforming, and discontinuous Galerkin finite element …
higher-order conforming, nonconforming, and discontinuous Galerkin finite element …
On the inf-sup stability of Crouzeix-Raviart Stokes elements in 3D
S Sauter, C Torres - Mathematics of Computation, 2023 - ams.org
We consider discretizations of the stationary Stokes equation in three spatial dimensions by
non-conforming Crouzeix-Raviart elements. The original definition in the seminal paper by …
non-conforming Crouzeix-Raviart elements. The original definition in the seminal paper by …
Quasi-optimal nonconforming methods for symmetric elliptic problems. II---Overconsistency and classical nonconforming elements
We devise variants of classical nonconforming methods for symmetric elliptic problems.
These variants differ from the original ones only by transforming discrete test functions into …
These variants differ from the original ones only by transforming discrete test functions into …
Critical functions and inf-sup stability of Crouzeix-Raviart elements
C Carstensen, S Sauter - Computers & Mathematics with Applications, 2022 - Elsevier
In this paper, we prove that Crouzeix-Raviart finite elements of polynomial order p≥ 5, p
odd, are inf-sup stable for the Stokes problem on triangulations. For p≥ 4, p even, the …
odd, are inf-sup stable for the Stokes problem on triangulations. For p≥ 4, p even, the …
[HTML][HTML] A framework for obtaining guaranteed error bounds for finite element approximations
M Ainsworth - Journal of computational and applied mathematics, 2010 - Elsevier
We give an overview of our recent progress in developing a framework for the derivation of
fully computable guaranteed posteriori error bounds for finite element approximation …
fully computable guaranteed posteriori error bounds for finite element approximation …
Fully computable a posteriori error bounds for hybridizable discontinuous Galerkin finite element approximations
M Ainsworth, G Fu - Journal of Scientific Computing, 2018 - Springer
We derive a posteriori error estimates for the hybridizable discontinuous Galerkin (HDG)
methods, including both the primal and mixed formulations, for the approximation of a linear …
methods, including both the primal and mixed formulations, for the approximation of a linear …
The inf-sup constant for hp-Crouzeix-Raviart triangular elements
S Sauter - Computers & Mathematics with Applications, 2023 - Elsevier
In this paper, we consider the discretization of the two-dimensional stationary Stokes
equation by Crouzeix-Raviart elements for the velocity of polynomial order k≥ 1 on …
equation by Crouzeix-Raviart elements for the velocity of polynomial order k≥ 1 on …
Residual-based a posteriori error estimation for immersed finite element methods
In this paper we introduce and analyze the residual-based a posteriori error estimation of the
partially penalized immersed finite element method for solving elliptic interface problems …
partially penalized immersed finite element method for solving elliptic interface problems …
A posteriori error estimator for obstacle problems
A Weiss, BI Wohlmuth - SIAM Journal on Scientific Computing, 2010 - SIAM
In this paper, we consider a posteriori error estimators for obstacle problems. The variational
inequality is reformulated as a mixed problem in terms of a discrete nodewise defined but …
inequality is reformulated as a mixed problem in terms of a discrete nodewise defined but …