betaFeedback

WorksMathematics

Preconditioning for the time-dependent Stokes equations: stage-weighted Radau IIA and weighted discontinuous Galerkin time-stepping

Abstract

We determine field-of-values equivalent preconditioners for the time-dependent Stokes equations discretized in time by stage-weighted Radau IIA Runge–Kutta time-stepping and discontinuous Galerkin time-stepping methods. By weighing each stage of the Radau IIA Runge–Kutta method differently we obtain preconditioners that are field-of-values equivalent, with constants independent of viscosity, timestep, and mesh size, to the system matrix. Similarly, by using weighted inner products in time to define the discontinuous Galerkin time-stepping method, we again obtain field-of-values equivalent preconditioners for the resulting system matrix. Numerical experiments are performed in two and three-dimensions which demonstrate robustness of the proposed preconditioners.

Introduction

We consider Field-Of-Values (FOV) equivalent preconditioners for the time-dependent Stokes equations that have been discretized in time by stage-weighted Radau IIA Runge–Kutta (RK) and weighted discontinuous Galerkin (DG) methods. The time-dependent Stokes problem for velocity u:Ω×I→Rdu : \Omega\times I \to\mathbb{R}^{d} and pressure p:Ω×I→Rp : \Omega\times I \to\mathbb{R}, in which Ω⊂Rd\Omega\subset\mathbb{R}^{d}, d∈{2,3}d \in\{2, 3\} is a bounded polygonal domain and I=[0,T]I = [0,T] the time-interval of interest, is given by

∂tu−∇⋅(ν∇u)+∇p=ffor (x,t)∈Ω×I,u=0for (x,t)∈∂Ω×I,∇⋅u=0for (x,t)∈Ω×I,u(x,0)=u0(0)for x∈Ω.(1)\begin{aligned} \partial_t u - \nabla\cdot(\nu\nabla u) + \nabla p &= f && \text{for } (x,t) \in\Omega\times I,\qquad u = 0 && \text{for } (x,t) \in\partial\Omega\times I,\\ \nabla\cdot u &= 0 && \text{for } (x,t) \in\Omega\times I,\qquad u(x,0) = u_0(0) && \text{for } x \in\Omega. \tag*{(1)} \end{aligned}

in which ν>0\nu> 0 is a given constant (kinematic) viscosity, f:Ω×I→Rdf : \Omega\times I \to\mathbb{R}^{d} a body force, and u0:Ω→Rdu_0 : \Omega\to\mathbb{R}^{d} a given divergence-free initial velocity field.

Preconditioners for the time-dependent Stokes equations discretized by backward Euler have been studied in various works [13, 28, 31, 40]. Of particular interest is the work of Cahouet and Chabard [6] who introduce a simple approximation to the pressure Schur complement of the block system resulting from discretizing eq. (1). This approximation is a sum of a mass matrix scaled by ν−1\nu^{-1} and a Laplacian scaled by the discrete time step. When backward Euler time stepping is used, the discrete form of eq. (1) is symmetric. This symmetry is used, for example, in [26, 27] to prove that the preconditioner of Cahouet and Chabard [6] is parameter-robust, i.e., robust with respect to mesh size, time step, and viscosity. They do this by finding a uniform bound for the condition number of the preconditioned system. See also [5, 29].

When discretizing a time-dependent partial differential equation (PDE) by a higher order time stepping method, the resulting discretization is in general not symmetric. This complicates constructing parameter-robust preconditioners for these methods because a uniform condition number no longer guarantees robust. convergence of Krylov subspace methods. Instead, FOV analysis is often used to describe the asymptotic convergence of GMRES. A functional analytic approach to preconditioning for nonsymmetric problems is briefly discussed in [19]. For nonsymmetric saddle point problems we mention the work of Loghin and Wathen [24] in which they develop robust nonsymmetric FOV equivalent preconditioners. We will use a slight modification of this framework to determine robust FOV equivalent preconditioners for system matrices resulting from Radau IIA RK [10, 14] and higher-order DG [18, 38] time stepping methods applied to eq. (1). Our preconditioners are higher-order variations of the Cahouet and Chabard [6] preconditioner. Let us also mention [8, 23, 25, 30, 35, 36] for alternative strategies that have been proposed to precondition implicit RK methods applied to time-dependent PDEs.

In this paper we first consider preconditioners for Radau IIA RK time stepping methods. By weighing each stage of the RK scheme by a suitably chosen parameter we are able to show that the discrete weak form of ∂tu−∇⋅(ν∇u)\partial_t u - \nabla\cdot(\nu\nabla u) in eq. (1) when using an ss-stage Radau IIA RK discretization is coercive. This allows us to design a simple and robust block preconditioner (one block per stage) for the system matrix.

We next consider preconditioners for higher-order weighted DG time stepping methods. The idea of using DG time stepping with weighted inner products in time to discretize time-dependent PDEs has previously been used, for example, in [11, 34]. Weighted inner products in time have also been used to analyze higher-order DG time stepping methods [7, 20, 41]. We use weighted inner products in time to discretize eq. (1) in time and show that the discrete weak form of ∂tu−∇⋅(ν∇u)\partial_t u - \nabla\cdot(\nu\nabla u) in eq. (1) is coercive. This result is in contrast to using traditional DG time-stepping methods in which the discrete weak form of ∂tu−∇⋅(ν∇u)\partial_t u - \nabla\cdot(\nu\nabla u) is inf-sup stable but not necessarily coercive. We will use the coercivity of this weak form to design a robust preconditioner for the weighted DG time stepping method.

Traditional (non-weighted) DG time stepping methods are equivalent to Radau IIA RK time stepping methods [1, 2]. We show that the weighted DG time stepping method results in a new RK method, one in which the RK time-discretization of ∂tu−∇⋅(ν∇u)\partial_t u - \nabla\cdot(\nu\nabla u) in eq. (1) is coercive. This new RK method provides hints as to how to choose the weights in the weighted Radau IIA RK time stepping method.

We organize this paper as follows. In § 2 we summarize, and slightly modify, the framework presented in [24] for FOV-equivalent preconditioners for nonsymmetric saddle-point problems. In § 3 we present and analyze the stage-weighted Radau IIA RK, weighted DG, and new RK time-discretizations of eq. (1). Parameter-robust FOV equivalent preconditioners are presented in § 4. Numerical examples in two and three dimensions in § 5 verify the robustness of the proposed preconditioners.

Preconditioning nonsymmetric saddle-point problems

Before determining a preconditioner for discretizations of eq. (1), we analyze FOV-equivalent preconditioners for a general nonsymmetric saddle-point problem. Let {Vh}\{V_h\} and {Qh}\{Q_h\} be families of finite element spaces corresponding to shape regular meshes of size hh. Let VhV_h be endowed with an inner product (⋅,⋅)Vh(\cdot,\cdot)_{V_h} and denote by ∥⋅∥Vh\lVert\cdot\rVert_{V_h} the norm induced by this inner product. Similarly, let QhQ_h be endowed with an inner product (⋅,⋅)Qh(\cdot,\cdot)_{Q_h} and denote its induced norm by ∥⋅∥Qh\lVert\cdot\rVert_{Q_h}. We consider the problem: Find (uh,ph)∈Vh×Qh(u_h,p_h) \in V_h \times Q_h, such that

a(uh,vh)+b(vh,ph)=F(vh)∀vh∈Vh,−b(uh,qh)=G(qh)∀qh∈Qh.(2)\begin{aligned} a(u_h,v_h) + b(v_h,p_h) &= \mathcal{F}(v_h) && \forall v_h \in V_h,\\ -b(u_h,q_h) &= \mathcal{G}(q_h) && \forall q_h \in Q_h. \tag*{(2)} \end{aligned}

where F:Vh→R\mathcal{F}: V_h \to\mathbb{R} and G:Qh→R\mathcal{G}: Q_h \to\mathbb{R} are bounded linear functionals. We assume there exist positive constants cac_a and α\alpha such that the bilinear form a:Vh×Vh→Ra : V_h \times V_h \to\mathbb{R}, which need not be symmetric, satisfies

a(uh,vh)≤ca∥uh∥Vh∥vh∥Vh∀uh,vh∈Vh,(3)a(u_h,v_h) \le c_a \lVert u_h\rVert_{V_h}\lVert v_h\rVert_{V_h} \qquad\forall u_h,v_h \in V_h, \tag*{(3)}
a(vh,vh)≥α∥vh∥Vh2∀vh∈Vh.(4)a(v_h,v_h) \ge\alpha\lVert v_h\rVert_{V_h}^{2} \qquad\forall v_h \in V_h. \tag*{(4)}

and that there exist positive constants cbc_b and β\beta such that the bilinear form b:Vh×Qh→Rb : V_h \times Q_h \to\mathbb{R} satisfies

b(vh,qh)≤cb∥vh∥Vh∥qh∥Qh∀vh∈Vh, qh∈Qh,(5)b(v_h,q_h) \le c_b \lVert v_h\rVert_{V_h}\lVert q_h\rVert_{Q_h} \qquad\forall v_h \in V_h,\ q_h \in Q_h, \tag*{(5)}
inf⁡qh∈Qhsup⁡vh∈Vhb(vh,qh)∥vh∥Vh∥qh∥Qh≥β.(6)\inf_{q_h\in Q_h}\sup_{v_h\in V_h}\frac{b(v_h,q_h)}{\lVert v_h\rVert_{V_h}\lVert q_h\rVert_{Q_h}} \ge\beta. \tag*{(6)}

The assumptions in eqs. (3) and (4) are sufficient for the saddle-point problem eq. (2) to have a unique solution [4, Theorem 4.2.1.

Let ⟨x,y⟩=xTy\langle x,y\rangle= x^{T}y ∀x,y∈Rn\forall x,y \in\mathbb{R}^{n} be the Euclidean inner product on Rn\mathbb{R}^{n}. Let M∈Rn×nM \in\mathbb{R}^{n\times n} be any symmetric and positive definite matrix. We will write ⟨x,y⟩M:=⟨Mx,y⟩\langle x,y\rangle_M := \langle Mx,y\rangle ∀x,y∈Rn\forall x,y \in\mathbb{R}^{n}. This inner product induces the norm ∥x∥M=⟨x,x⟩M1/2\lVert x\rVert_M = \langle x,x\rangle_M^{1/2}. Furthermore, we say that the matrices A,B∈Rn×nA,B \in\mathbb{R}^{n\times n} are (M(M-FOV equivalent if there exist positive constants c⋆c_{\star} and cˉ⋆\bar{c}_{\star} such that

c⋆≤inf⁡0≠x∈Rn⟨AB−1x,x⟩M⟨x,x⟩M,cˉ⋆≤inf⁡0≠x∈Rn⟨BA−1x,x⟩M⟨x,x⟩M.c_{\star} \le\inf_{0\ne x\in\mathbb{R}^{n}}\frac{\langle AB^{-1}x,x\rangle_M}{\langle x,x\rangle_M}, \qquad\bar{c}_{\star} \le\inf_{0\ne x\in\mathbb{R}^{n}}\frac{\langle BA^{-1}x,x\rangle_M}{\langle x,x\rangle_M}.

References

  1. [1]G. Akrivis and C. Makridakis. On maximal regularity estimates for discontinuous galerkin time-discrete methods. SIAM J. Numer. Anal., 60(1):180–194, 2022.DOI
  2. [2]G. Akrivis, C. Makridakis, and R. H. Nochetto. Galerkin and runge–kutta methods: unified formulation, a posteriori error estimates and nodal superconvergence. Numerische Mathematik, 118:429–456, 2011.DOI
  3. [3]Trygve Bærland, Miroslav Kuchta, Kent-Andre Mardal, and Travis Thompson. An observation on the uniform preconditioners for the mixed Darcy problem. Numerical Methods for Partial Differential Equations, 36(6):1718–1734, 2020.

Paper details

vlnc:W_6dsgqmq2
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 8

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

ChatGPT 6.1 Sol, Microsoft Copilot Chat (Basic), Gemini 1.5 Pro

View statement
Looking for related papers…
Contents