A Contraction Property of an Adaptive Divergence-Conforming Discontinuous Galerkin Method for the Stokes Problem

Abstract

We prove the contraction property for two successive loops of the adaptive algorithm for the Stokes problem reducing the error of the velocity. The problem is discretized by a divergence-conforming discontinuous Galerkin method which separates pressure and velocity approximation due to its cochain property. This allows us to establish the quasi-orthogonality property which is crucial for the proof of the contraction. We also establish the quasi-optimal complexity of the adaptive algorithm in terms of the degrees of freedom.

Cited by in corpus (2)

• A C1-mapping based on finite elements on quadrilateral and hexahedral meshes
• H1-conforming finite element cochain complexes and commuting quasi-interpolation operators on cartesian meshes