Achieving h‐ and p‐Robust Monolithic Multigrid Solvers for the Stokes Equations

ABSTRACT The numerical analysis of higher order mixed finite‐element discretizations for saddle‐point problems, such as the Stokes equations, has been well‐studied in recent years. While the theory and practice of such discretizations is now well‐understood, the same cannot be said for efficient preconditioners for solving the resulting linear (or linearized) systems of equations. In this work, we propose and study variants of the well‐known Vanka relaxation scheme that lead to effective geometric multigrid preconditioners for both the conforming Taylor‐Hood discretizations and nonconforming ‐ discretizations of the Stokes equations. Numerical results demonstrate robust performance with respect to FGMRES iteration counts for increasing polynomial order for some of the considered discretizations and expose open questions about stopping tolerances for effectively preconditioned iterations at high polynomial order.