TY - JOUR
T1 - Quasi-optimal adaptive pseudostress approximation of the Stokes equations
AU - Carstensen, C.
AU - Gallistl, D.
AU - Schedensack, M.
PY - 2013
Y1 - 2013
N2 - The pseudostress-velocity formulation of the stationary Stokes problem allows some quasi-optimal Raviart--Thomas mixed finite element formulation for any polynomial degree. The adaptive algorithm employs standard residual-based explicit a posteriori error estimation from Carstensen, Kim, and Park [SIAM J. Numer. Anal., 49 (2011), pp. 2501--2523] for the lowest-order Raviart--Thomas finite element functions in a simply connected Lipschitz domain. This paper proves optimal convergence rates in terms of the number of unknowns of the adaptive mesh-refining algorithm based on the concept of approximation classes. The proofs use some novel equivalence to first-order nonconforming Crouzeix--Raviart discretization plus a particular Helmholtz decomposition of deviatoric tensors.
AB - The pseudostress-velocity formulation of the stationary Stokes problem allows some quasi-optimal Raviart--Thomas mixed finite element formulation for any polynomial degree. The adaptive algorithm employs standard residual-based explicit a posteriori error estimation from Carstensen, Kim, and Park [SIAM J. Numer. Anal., 49 (2011), pp. 2501--2523] for the lowest-order Raviart--Thomas finite element functions in a simply connected Lipschitz domain. This paper proves optimal convergence rates in terms of the number of unknowns of the adaptive mesh-refining algorithm based on the concept of approximation classes. The proofs use some novel equivalence to first-order nonconforming Crouzeix--Raviart discretization plus a particular Helmholtz decomposition of deviatoric tensors.
UR - https://www.jstor.org/stable/42004031
U2 - 10.1137/110852346
DO - 10.1137/110852346
M3 - Article
SN - 0036-1429
VL - 51
SP - 1715
EP - 1734
JO - SIAM journal on numerical analysis
JF - SIAM journal on numerical analysis
IS - 3
ER -