Skip to Main content Skip to Navigation
Journal articles

Adaptive inexact iterative algorithms based on polynomial-degree-robust a posteriori estimates for the Stokes problem

Abstract : In this paper, we develop adaptive inexact versions of iterative algorithms applied to finite element discretizations of the linear Stokes problem. We base our developments on an equilibrated stress a posteriori error estimate distinguishing the different error components, namely the discretization error component, the (inner) algebraic solver error component, and possibly the outer algebraic solver error component for algorithms of the Uzawa type. We prove that our estimate gives a guaranteed upper bound on the total error, as well as a polynomial-degree-robust local efficiency, and this on each step of the employed iterative algorithm. Our adaptive algorithms stop the iterations when the corresponding error components do not have a significant influence on the total error. The developed framework covers all standard conforming and conforming stabilized finite element methods on simplicial and rectangular parallelepipeds meshes in two or three space dimensions and an arbitrary algebraic solver. Implementation into the FreeFem++ programming language is invoked and numerical examples showcase the performance of our a posteriori estimates and of the proposed adaptive strategies. As example, we choose here the unpreconditioned and preconditioned Uzawa algorithm and the preconditioned minimum residual (MinRes) algorithm, in combination with the Taylor–Hood discretization.
Document type :
Journal articles
Complete list of metadata

Cited literature [57 references]  Display  Hide  Download
Contributor : Martin Vohralik Connect in order to contact the contributor
Submitted on : Friday, April 20, 2018 - 10:15:42 AM
Last modification on : Friday, January 21, 2022 - 3:16:34 AM
Long-term archiving on: : Tuesday, September 18, 2018 - 4:31:08 PM


Files produced by the author(s)



Martin Čermák, Frédéric Hecht, Zuqi Tang, Martin Vohralík. Adaptive inexact iterative algorithms based on polynomial-degree-robust a posteriori estimates for the Stokes problem. Numerische Mathematik, Springer Verlag, 2018, 138 (4), pp.1027-1065. ⟨10.1007/s00211-017-0925-3⟩. ⟨hal-01097662v4⟩



Les métriques sont temporairement indisponibles