Skip to main content
Wiley Open Access Collection logoLink to Wiley Open Access Collection
. 2023 May 7;30(5):e2503. doi: 10.1002/nla.2503

A conforming auxiliary space preconditioner for the mass conserving stress‐yielding method

Lukas Kogler 1, Philip L Lederer 1,, Joachim Schöberl 1
PMCID: PMC10909495  PMID: 38439917

Summary

We are studying the efficient solution of the system of linear equations stemming from the mass conserving stress‐yielding (MCS) discretization of the Stokes equations. We perform static condensation to arrive at a system for the pressure and velocity unknowns. An auxiliary space preconditioner for the positive definite velocity block makes use of efficient and scalable solvers for conforming Finite Element spaces of low order and is analyzed with emphasis placed on robustness in the polynomial degree of the discretization. Numerical experiments demonstrate the potential of this approach and the efficiency of the implementation.

Keywords: auxiliary space preconditioner, exact divergence‐free velocity, high order robustness, iterative solver, Stokes equations

1. INTRODUCTION

Let Ωd be a bounded domain with d=2 or 3 with Lipschitz boundary Γ:=Ω. Let u and p be the velocity and the pressure, respectively. Given an external body force f:Ωd and the double of kinematic viscosity denoted by ν, the velocity‐pressure formulation of the Stokes system is given by

div(νε(u))+p=finΩ, (1a)
div(u)=0inΩ, (1b)

where ε(u)=12(u+(u)T). By introducing additional matrix valued variables σ:=νε(u) for the stress and ω:=12(u(u)T), these equations can be restated as

ν1dev(σ)u+ω=0inΩ, (2a)
div(σ)+p=finΩ, (2b)
σσT=0inΩ, (2c)
div(u)=0inΩ, (2d)

where dev(σ) denotes the deviatoric part (see Section 2), and (2a) is motivated by the fact that for the solution of (1) we have σ=νε(u)=νdev(ε(u))=dev(σ). The introduction of ω as a Lagrange multiplier enables the derivation of discrete methods that enforce the symmetry constraint (2c) weakly, see also References 1, 2, 3. As boundary conditions, we consider Dirichlet ones for the velocity u, homogenous purely for clarity of the presentation, and two kinds of outlet conditions,

u=0onΓD, (2e)
(σ+pI)n=0onΓN, (2f)
((σ+pI)n)·n=ut=0onΓÑ, (2g)

where I is the d×d identity matrix and ut is the tangential part of u. We assume that both ΓD and at least one of ΓN or ΓÑ have positive measure. As usual, when ΓN=ΓÑ=, an additional condition must be imposed on the pressure to make it unique.

In recent years, divergence‐free and pressure‐robust Finite Element discretizations, that is those whose solutions fulfill (2d) strongly, and allow for pressure‐independent a‐priori error estimates respectively, have been of great interest. 4

For the velocity‐pressure formulation (1), one class of such methods are certain Hybrid Discontinuous Galerkin (HDG) methods that take the velocity in H(div,Ω) and the pressure in L2(Ω), that is, they only build normal continuity into the Finite Element space while the tangential continuity of the solution is enforced via Lagrange parameters. To make the resulting system for the velocity positive definite, a consistent stabilization term has to be added, often involving either a parameter that has to be sufficiently large or a lifting of the jump, see References 5, 6.

In References 7, 8, the authors presented a novel variational formulation for the Stokes equations that still takes the velocity in H(div,Ω) and pressure in L2(Ω), retaining the property of yielding exactly divergence‐free and pressure‐robust solutions, but is based on (2) instead of (1). This mass conserving stress‐yielding (MCS) method features a normal‐tangential continuous stress space and requires no stabilizing term. It was already remarked in the original work 7 that static condensation can be performed to eliminate certain σ degrees of freedom (dofs). Later, in Reference 9, the normal‐tangential continuity of σ was broken and instead an additional Lagrange parameter û was introduced. This technique makes it possible to eliminate σ altogether and to reduce the problem to one for the velocity in H(div,Ω), the pressure in L2(Ω), and the newly introduced û which approximates the tangential velocity trace on the mesh facets. The velocity unknowns u,û take the place of σ as primal variables in the condensed saddle point system, with the pressure remaining the Lagrange parameter enforcing (2d). The condensed system involves the same variables, and has the same structure as the above HDG methods, but does not require a stabilization term. The first contribution of this work is a characterization of the velocity block of the condensed system based on its relation to the velocity block resulting from an HDG method with optimal stabilization. In particular, we prove that the velocity block, as previously claimed in Reference 9 for that of a related low order MCS method, is indeed positive definite.

We then move on to the question of how to efficiently solve the condensed system and consider preconditioned Krylov space methods. Preconditioning techniques for saddle point systems based on separate preconditioners for the primal (velocity) and Lagrange (pressure) unknowns are a well studied subject, see Reference 10, and the pressure Schur complement is easily preconditioned, see Reference 11. Therefore, our focus is on identifying and analyzing suitable preconditioners for the condensed velocity block.

The literature on preconditioners for conforming methods is vast and includes, among others, domain decomposition, see Reference 12, as well as Geometric, see Reference 13, and Algebraic, see Reference 14, Multigrid methods and an even somewhat comprehensive review would be beyond the scope of this work. We will take as given that efficient and scalable solvers for conforming methods exist and are available.

Preconditioners for HDG methods are not quite as well studied in the literature, one recurring theme is the attempt to reuse conforming preconditioners for these non‐conforming spaces. For example, a non‐nested Multigrid method with conforming coarse grid spaces was studied in Reference 15, and auxiliary space preconditioners (ASP, see Reference 16) that also feature a conforming sub‐space were considered in Reference 17.

The idea at the heart of both approaches is to decompose functions in the non‐conforming space into a conforming component plus a (small) remainder and to address them separately with some pre‐existing conforming preconditioner and a simple, computationally inexpensive method such as (Block‐)Jacobi, respectively.

The principal focus in this work is on the introduction and analysis of ASPs for the MCS method. The main improvement over the theory in Reference 17 is that the analysis of the velocity preconditioners extends techniques from Reference 18 and is explicit in the polynomial degree of the discretization. In particular, the main result, Theorem 3, states that the condition number of a particular ASP is bounded by γ·(log(k))3, where k is the polynomial degree of the discretization and γ is a constant stemming from the relation between condensed MCS and HDG norms.

We close out the discussion with numerical experiments that demonstrate the robustness and scalability of the proposed preconditioners. It is a testament to the elegance and simplicity of the ASP method that we were able to scale the computations to a relatively large scale by leveraging existing, scalable and highly Performant software.

Outline

We gather notation used throughout this work in Section 2 and introduce various Finite Element spaces and norms in Section 3 which also contains some useful technical results. Section 4 reviews the MCS method itself and contains a thorough discussion of static condensation as well as results on the obtained condensed systems. Approaches for preconditioning saddle point matrices with separate preconditioners for the primal unknowns and Lagrange multipliers as well as the method of auxiliary space preconditioning are recalled in Section 5. The main results can be found in Section 6, where different variations of ASPs for the velocity block of the Stokes system are discussed. In Section 7, we sketch the treatment of the lowest order case which is not covered by the theory developed in previous sections. Finally, numerical experiments are performed in Section 8.

2. NOTATION

With 𝕄 denoting the vector space of real d×d matrices, we define the subsets of skew‐symmetric and skew‐symmetric trace‐free matrices by

𝕂={τ𝕄:τ+τT=0}and𝔻={τ𝕄:τ:I=0},

where (·)T denotes the transpose and I𝕄 the identity matrix. To differentiate between scalar‐, vector‐ and matrix‐valued functions on some subset DΩ we include the range in the notation for the latter two while we omit it for the former one, i.e. where L2(D,)=L2(D) denotes the space of square integrable ‐valued scalar functions, the spaces L2(D,d) and L2(D,𝕄) denote the analogous vector‐ and matrix‐valued spaces. Similarly, k(D,)=k(D), and so forth, denote the set of scalar‐, vector‐ or matrix‐valued polynomials up to degree k on D. We use the notation (·,·)D for the L2‐inner product on D and set ·D2=(·,·)D. The L2‐orthogonal projection onto k(D,·) (the range should be clear from context) is denoted by ΠDk and we will occasionally omit the subscript. Similarly, the L2‐orthogonal projector onto the (restrictions to D of) the rigid body modes RD:={u(x)=a+b×x:a,bd} is written as ΠDR.

In the following, let ϕ, Φ, and Ψ be smooth scalar‐, vector‐, and matrix‐valued functions, respectively. The operator is to be understood from context as resulting in either in a vector whose components are iϕ:=ϕ/xi or a matrix with components (iΦj). For vector‐valued functions in three dimensions the operator curl is defined as curlΦ:=×Φ and in two we understand it to refer to the scalar‐valued curlϕ:=2ϕ1+1ϕ2. The divergence operator div is understood as divΦ:=j=1djΦj for vectors and is applied row‐wise to matrices, that is, (divΨ)i:=j=1djΨij. Besides the well known trace operator tr(Ψ):=j=1dΨii and the deviatoric part dev(Ψ):=Ψ1dtr(Ψ)I we further introduce the operator κ:d(d1)/2𝕂 by

κ(ϕ):=120ϕϕ0ifd=2,κ(Φ):=120Φ3Φ2Φ30Φ1Φ2Φ10ifd=3.

Based on these differential operators, we use standard notation for the Sobolev spaces Hm(Ω,)=Hm(Ω),H(div,Ω) and H(curl,Ω) with m0. Further, for some ΓΩ, a subscript “0,Γ” indicates that the corresponding natural traces vanish on Γ, and we use only the zero subscript if Γ=Ω.

We denote by 𝒯h a quasi‐uniform and shape regular triangulation of the domain Ω into simplices. Let h denote the maximum of the diameters of all elements in 𝒯h. The set of element interfaces and boundaries, or facets, is denoted by h and the set of facets of a particular element T𝒯h is T:={Fh:FT}. By an abuse of notation, we shall also use h to denote the domain formed by union of all Fh. We assume that the mesh resolves the domain boundary parts in the sense that Fh with FΩ!Γ{ΓD,ΓN,ΓÑ} such that FΓ. This splits h into boundary facets hD:={Fh:FΓD}, hN:={Fh:FΓN}, and hÑ:={Fh:FΓÑ}, and interior facets h0:=h(hDhNhÑ). According to this mesh we also introduce the “broken” spaces

Hm(𝒯h,·):=T𝒯hHm(T,·),k(𝒯h,·):=T𝒯hk(T,·),k(h,·):=Fhk(F,·),

where, as before, we include the range explicitly, for example, as in k(𝒯h,d). On each Fh we denote by · and {{·}} the standard jump and mean value operators and take them to be the identity on boundary facets. On each element boundary and each facet Fh we denote by n the outward unit normal vector. The scalar normal and vector‐valued tangential traces of a sufficiently smooth function v are given by vn:=v·n and vt:=vvnn. Similarly, the normal‐normal and normal‐tangential traces of a smooth matrix‐valued function Ψ are Ψnn:=Ψ:(nn)=nTΨn and Ψnt=ΨnΨnnn.

We write functions in general Sobolev spaces as u,û,ω, and so forth, discrete functions with a subscript h as uh,ûh,ωh, and so forth, and their via Galerkin isomorphism identified coefficient vectors w.r.t to some given Finite Element basis as u,u^,ω, and so forth. For readability of the presentation we make no difference between row and column vectors and, for example, write (u,û) for the coefficient vector of (uh,ûh) which should strictly speaking be the column vector (uT,ûT)T. Similarly, operators are capital letters A,B, and so forth, their discrete counterparts Ah,Bh, and so forth, and the corresponding Finite Element matrices A,B, etc. Occasionally, when it is useful to emphasize the Galerkin isomorphism we use G, for example, uhGu or AhGA.

Finally, throughout this work we write AB when there exists a constant c>0 independent of the mesh size h and the viscosity ν such that cAB and ABABBA. For example, due to quasi‐uniformity we have hdiam(T)T𝒯h. For two elliptic operators A,B (or symmetric and positive definite matrices A,B) we take AB to mean that the maximum eigenvalue of the generalized eigenvalue problem Ax=λBx is bounded by a constant C similarly independent of h and ν. Note that in inequalities related to discrete functions or operators, unless explicitly stated otherwise, these constants can depend on the polynomial degree. Henceforth we assume that ν is a constant.

3. FINITE ELEMENTS AND NORM EQUIVALENCES

Reminding our self that the lowest order case is addressed separately in Section 7, we define the following approximation spaces for k2:

Vh:={uhBDMk(𝒯h):(uh)n=0onΓD}, (3)
V^h:={ûhk1(h,d):(ûh)n=0Fhandûh=0FΓDΓÑ}, (4)
Wh:=k1(𝒯h,𝕂), (5)
h:={τhk(𝒯h,𝔻):(τh)ntk1(F,d)Fh}, (6)
Qh:=k1(𝒯h,), (7)
Vh:={uh1(𝒯h,d)H1(Ω,d):uh=0onΓD}. (8)

See Reference 19 for a detailed discussion of the H(div)‐conforming Brezzi‐Douglas‐Marini (BDM) space appearing in the definition of Vh. Note that, restricted to a single element T, in addition to k1(T,𝔻), the stress space h also includes functions in k(T,𝔻) with vanishing normal tangential trace (“nt‐bubbles”). We further define the space of divergence free velocities Vh0:={vhVh:div(vh)=0} and the product spaces 𝒱h:=Vh×V^h, Uh:=Vh×V^h×Wh and Uh0:=Vh0×V^h×Wh. Following Reference 20, for T𝒯h, FT and uk(F,d) we write

uj,F,T2:=supσk(T,d)(u,σ)F2σT2h1j=0kk(kj+1)(ΠFjΠFj1)uF2, (9)

where ΠF1:=0 and the equivalence was shown in [Theorem 2]. 20 Where it is clear from the context which volume element T is meant, we omit it from the subscript and simply write ·j,F. We define Hybrid Discontinuous Galerkin (HDG) norms on 𝒱h and Uh by

(uh,ûh)ε,h2:=T𝒯h(ε(uh)T2+FTΠk1(uhûh)tj,F2), (10)
(uh,ûh,ωh)Uh2:=T𝒯hε(uh)T2+κ(curl(uh))ωhT2+h1Πk1(uhûh)tT2, (11)
|(uh,ûh,ωh)|Uh,2:=T𝒯hdev(uωh)T2+h1Πk1(uhûh)tT2. (12)

In (10), the terms for FΓÑ, where ûh=0, weakly enforce ut=0 from (2g). There holds the equivalence (see Reference 9)

(uh,ûh,ωh)Uh2|(uh,ûh,ωh)|Uh,2+d1div(uh)02(uh,ûh,ωh)Uh. (13)

3.1. Technical results

For readability, the technical details of this Section are moved to the Appendix.

3.1.1. Interpolation operators

A well known interpolation operator f:H2(𝒯h,d)Vhf:=1(𝒯h,d)H1(Ω,d) is defined by

(f(u))(p)=1|χp|Tχpu|T(p)p𝒱, (14)

where χp is the set of all elements that share the vertex p, and |χp| is the number of such elements. Bounds for the approximation error of f in H1‐like norms are very standard and well known, and with a Korn inequality for broken H1 spaces like

T𝒯huT2CKT𝒯hε(u)T2+Fh0hDΠFRuF2uH1(𝒯h,d), (15)

derived in Reference 21, it can easily be bounded by an ·ε,h like one. However, as the kernel of ε is controlled only by the hD terms, Ck can degenerate depending on the shape of Ω and ΓD. As it would otherwise later on enter into condition number estimates, the following Lemma 1 bounds the approximation error of f independent of CK.

Lemma 1

There holds

T𝒯hh2ufuT2+(ufu)T2T𝒯hε(u)T2+Fh0h1ΠFRuF2uH2(𝒯h,d). (16)

See Appendix A.

A minor technical detail is our need for an interpolation operator not into Vhf but into Vh. It can be obtained by simply interpolating into Vhf and then zeroing out degrees of freedom on ΓD via

π0:VhfVhdefined byπ0ūh(p)=0pΓDūh(p)elseforp𝒱.
Lemma 2

For :H2(𝒯h)Vh:uπ0fu there holds

T𝒯hh2uuT2+(uu)T2T𝒯hε(u)T2+Fh0h1ΠFRuF2uH2(𝒯h,d). (17)

See Appendix A.

3.1.2. Trace norms

For Fh and an arbitrary element T𝒯h with FT we define for all ûk(F,) discrete versions of the H1/2(F,) and the H001/2(F,)‐norm for (scalar) HDG spaces as

û1,F2:=infwk(T){wT2+wûj,F2},andû1,F,02:=infwk(T)wT2+wûj,F2+F˜T{F}wj,F2.

In Reference 20 the authors proved the inverse estimate

û1,F,02(logk)3û1,F2ûk(F,)such thatΠF0v^=0. (18)

A similar estimate can be derived for the hybrid, vector‐valued velocity space 𝒱h and norms involving the symmetric gradient,

(u,û)ε,F2:=infwk(T)wn=unonF{ε(w)T2+Πk1(wû)tj,F2} (19)
(u,û)ε,F,02:=infwk(T)wn=unonF,wn=0onTFε(w)T2+Πk1(wû)tj,F2+F˜T{F}Πk1wtj,F˜2. (20)

The difference lies not only in the appearance of ε instead of but also, and more importantly, in the fact that, as VhH(div), the normal trace is enforced strongly, and one has to slightly modify the strategy from Reference 20.

Corollary 1

For (u,û)𝒱h with ΠFR(unn+ût)=0 there holds

(u,û)ε,F,02(logk)3(u,û)ε,F2. (21)

See Appendix B.

4. THE MCS METHOD

The method considered in this work is based on formulation (2), where ω is used as a Lagrange multiplier to weakly enforce the symmetry constraint (2c), see also References 1, 2, 3. In Reference 7, a novel variational formulation of (2) without the symmetry constraint was presented where the velocity and pressure spaces were H(div,Ω) and L2(Ω) and the stress space for the variable σ was defined as H(curldiv):={σL2(Ω,𝔻):div(σ)H(div,Ω)}, where the superscript denotes the classical dual space. The variational version of (2b) then became

div(σ),vdiv+(div(v),p)=(f,v)vH(div,Ω), (22)

where ·,·div denotes the duality pairing on H(div,Ω). The authors showed that Finite Element approximation of σ in H(curldiv) demands normal‐tangential continuity. The method described in the following is based on this variational formulation and in many ways is a variation of previous MCS methods from Reference 7, 8, 9, 22. Like in the method from Reference 9, we incorporate the normal‐tangential continuity of σh via a Lagrange multiplier in V^h, similar to approaches taken in hybridized mixed methods for the Poisson problem, see Reference 23, 24, 25. For a detailed discussion on this hybridization technique see also section 7.2.2 in Reference 19. The main motivation for breaking the normal‐tangential continuity by hybridization is that it enables local, element‐wise elimination, or static condensation, of all h and Wh dofs. The resulting, condensed, system is the one we actually have to solve and are interested in preconditioning. It will therefore be discussed in great detail in Section 4.2.

The hybridized mass conserving stress‐yielding method with weakly imposed symmetry finds (σh,(uh,ûh,ωh),ph)h×Uh×Qh such that

ν1(σh,τh)+b(τh,(uh,ûh,ωh))=0τhh, (23a)
b(σh,(vh,v^h,ηh))+νd1(div(uh),div(vh))(div(vh),ph)=(f,vh)(vh,v^h,ηh)Uh, (23b)
(div(uh),qh)=0qhQh, (23c)

with the bilinear form

b(τh,(uh,ûh,ωh)):=T𝒯hTdiv(τh)·uhT(τh)nn(uh)n+Tτh:ωhT(τh)ntûh.

The first two integrals in b can be interpreted as a discrete version of the duality pair given in (22) and the third weakly enforces the symmetry constraint. The last terms incorporate the normal‐tangential continuity of σh and the tangential part of (2f). Since

T𝒯hT(τh)ntûh=FhF(τh)ntûh,

and (τh)ntV^h, testing (23b) with (0,v^h,0), and all v^hV^h results in (σh)nt=0 on all Fh0. On ΓD and ΓÑ the integrals vanish together with (v^h)t=0 and on ΓN the remaining integrals weakly incorporate the tangential part of (2f), ((νσh+phI)n)t=(νσh)nt=0. For more details on boundary conditions see Remark 2.

We also define the sub problem where we leave out the divergence constraint and solve only for the velocity and stress: Find (σh,(uh,ûh,ωh))h×Uh such that

𝒦((σh,(uh,ûh,ωh)),(τh,(vh,v^h,ηh)))=(f,vh)(τh,(vh,v^h,ηh))h×Uh, (24)

with

𝒦((σh,(uh,ûh,ωh)),(τh,(vh,v^h,ηh)))=ν1(σh,τh)+b(τh,(uh,ûh,ωh))+b(σh,(vh,v^h,ηh))+νd1(div(uh),div(vh)).

Note the addition of the term νd1(div(uh),div(vh)) in (23b) which is not present in any of the previous MCS methods. It is consistent since the solution is exactly divergence‐free (by (23c) and div(Vh)=Qh) and guarantees the inf‐sup stability of 𝒦 by compensating for the missing trace of σh which can only approximate the deviatoric part of ε(u). The choice of the constant νd1 is motivated by the identity ε(u)=dev(ε(u))+d1div(u)I. It makes (24) a discretization of div(νε(u))=f and the velocity Schur complement introduced in Section 4.2 equivalent to a linear elasticity problem, see (31) in the proof of Lemma 5. We want to stress again that preconditioners for such problems (although only for conforming methods) are standard in the literature and widely available. A different choice of constant would be possible, but changes the norm represented by the velocity Schur complement. For example, a large (penalty) parameter ε1ν (i.e., with a small ε>0) instead of νd1 would be a valid choice but would make the resulting velocity Schur complement extremely difficult to precondition as it then has the divergence constraint essentially built in.

Remark 1

The MCS method here, like the one from Reference 8 to which it is most closely related to, features insufficient inter‐element coupling for the lowest order case k=1 and is only stable for k2. This is discussed in detail in Reference 9, where a stable minimal order MCS method for k=1 was introduced. We treat the lowest order case separately in Section 7.

Remark 2

Reference 7 contains an exhaustive discussion of possible boundary conditions for the standard MCS method. One type of boundary condition for which it is particularly suitable are non‐homogenous viscous stress ones, where (σh)nt=gt can be demanded strongly for a given tangential traction gt, and is incorporated as an essential boundary condition in h. In the hybridized MCS method, where the normal‐tangential continuity in h is no longer given, this boundary condition is instead realized by an additional right‐hand side term ΓNgtv^h in (23). Since (σh)ntV^h, this still strongly yields (σh)nt=gt, as testing (23b) with (0,v^h,0) shows.

4.1. Stability analysis

In the following we summarize the stability results for the discrete method defined above. We only prove solvability of (24), all other results follow with the same techniques and steps as in References 7, 8, 9, 22. Lemma 4, which can, just as Lemma 3, be found in the stated literature, is an inf‐sup stability result for the constraint given by the bilinear form b. It is posed in the semi‐norm |·|Uh, as, since all elements in h are trace‐free, the divergence of functions in Uh can not be controlled. Theorem 1 states that with the addition of the term νd1(div(uh),div(vh)) in (23b) we can switch to the proper norm ·Uh and (24) is solvable independently of the divergence constraint. Finally, Corollary 2, which is again already proven in the literature, provides solvability of (23) including the divergence constraint. Note that the stability analysis in this section is only robust in terms of the mesh size h. Particularly the inf‐sup constant in Corollary 2 and Theorem 1 is not known to be independent of the polynomial order k.

Lemma 3

There hold the continuity estimates

ν1(σh,τh)ν1σh0τh0τh,σhh,b(τh,(uh,ûh,ωh))τh0(uh,ûh,ωh)Uh(τh,(uh,ûh,ωh))h×Uh,(div(uh),qh)(uh,ûh,ωh)Uhqh0(qh,(uh,ûh,ωh))Qh×Uh,νd1(div(uh),div(vh))νd1div(uh)0div(vh)0uh,vhVh.

Lemma 4

Let (vh,v^h,ηh)Uh be arbitrary. There exists a σhh such that

b(σh,(vh,v^h,ηh))|(vh,v^h,ηh)|Uh,2,andσh0|(vh,v^h,ηh)|Uh,.

Theorem 1

Let (τh,(vh,v^h,ηh))h×Uh be arbitrary, there holds the inf‐sup stability

supσhh(uh,ûh,ηh)Uh𝒦((σh,(uh,ûh,ωh)),(τh,(vh,v^h,ηh)))ν1/2σh0+ν1/2(uh,ûh,ωh)Uhν1/2τh0+ν1/2(vh,v^h,ηh)Uh.

This follows with standard techniques, that is, using Lemma 4, Young's and Cauchy Schwarz's inequality and the norm equivalence (13).

Corollary 2

Let (τh,(vh,v^h,ηh),qh)h×UhQh be arbitrary, there holds the inf‐sup stability

supσhh(uh,ûh,ηh)UhphQh𝒦((σh,(uh,ûh,ωh)),(τh,(vh,v^h,ηh)))+(div(uh),qh)+(div(vh),ph)ν1/2(σh0+ph0)+ν1/2(uh,ûh,ωh)Uh(ν1/2τh0+qh0)+ν1/2(vh,v^h,ηh)Uh.

For a smooth exact solution we can further derive the following optimal error estimate.

Corollary 3

Let uHm(𝒯h,d)H1(Ω,d), σHm1(𝒯h,𝔻)H1(Ω,𝔻), ωHm1(𝒯h,𝕂)L2(Ω,𝕂), and pHm1(𝒯h,)L2(Ω,) be the exact solution of the Stokes problem (2) and set û=u|F for all Fh. Let (σh,(uh,ûh,ωh))h×Uh be the solution of (23) and let s=min(m1,k), then there holds the error estimate

ν1(σσh0+pph0)+(uuh,ûûh,ωωh)Uhhs(ν1(σHs(𝒯h,𝔻)+pHs(𝒯h,))+uHs+1(𝒯h,d)+ωHs(𝒯h,𝕂)).

4.2. Static condensation of local variables

We now discuss the structure of the Finite Element matrix directly obtained from the MCS method (23) and that of various Schur complements thereof. Writing ϕσ,ϕu,ϕû,ϕω and ϕp for the basis functions of h,Vh,V^h,Wh and Qh respectively and, complying with the notation for the Galerkin isomorphism introduced in Section 2, u for the coefficients of uh with respect to the basis given by ϕu, and so forth, (23) in matrix form is

MσσBωσTBωσ0BuσTBûσT0000Buσ0Bûσ0Auudiv000BpuT000Bpu00σωuûp=00F00. (25)

The right hand side vector F is given by Fi=(f,ϕiu). The system matrix with its entries

(Mσσ)ij=ν1(ϕiσ,ϕjσ),(Bûσ)ij=TT(ϕjσ)nt(ϕiû)t,(Bωσ)ij=TTϕjσ:ϕiω,(Auudiv)ij=νd1(div(ϕiu),div(ϕju)),(Bpu)ij=(div(ϕju),ϕip),(Buσ)ij=TTdiv(ϕjσ)ϕiuT(ϕjσ)nn(ϕiu)n.

is a saddle point matrix with Lagrange multipliers ω,u,û and p enforcing (2c), (2a), the nt‐continuity of σ, and (2d) respectively.

Static condensation of

σ,ω

The diagonal block for σ,ω does not couple with the pressure via the incompressibility constraint and, thanks to the introduction of ûh as additional multiplier, is block diagonal. It is also invertible since every block represents the simple projection problem of finding (σhT,ωhT)h(T)×Wh(T) for some T𝒯h such that

1ν(σhT,τh)T+(τh,ωhT)T=gT(τh)τhh(T), (26a)
(σhT,ηh)T=0ηhWh(T), (26b)

where h(T),Wh(T) are the restrictions of the corresponding (discontinuous) global spaces to T and gT is some right hand side. Standard arguments and the Brezzi theorem prove that (26) is inf‐sup stable, that is, writing

M:=MσσBωσTBωσ0,Bσ:=Buσ0Bûσ0,Adiv:=Auudiv000,

M is invertible and the Schur complement A:=AdivBσM1BσT is well defined and, as M is block diagonal, can be computed element‐wise. Eliminating σ,ω from (25) in this way leaves us with the system

Kuûp:=ABTB0uûp=F00. (27)

The symmetry of K is obvious and in the next Lemma 5 we show that the upper left block A is also positive definite and we are now in the very standard setting of a saddle point problem with symmetric and positive definite (SPD) “A‐block”. The velocity unknowns uh,ûh move to the position of primal variables, while the pressure ph remains the Lagrange parameter for the divergence constraint. After solving (27) to get uh,ûh,ph, we can recover σh and ωh by solving the local problems (26).

Lemma 5

The Schur complement A is symmetric positive definite and with

𝒱hc:={(vh,v^h)𝒱h:vhH1(Ω,d),ΠFk1(uhûh)t=0Fh}

there holds

ν(uh,ûh)ε,h2(uh,ûh)A2ν(uh,ûh)ε,h2(uh,ûh)𝒱h, (28)
(uh,ûh)A2=νε(uh)02(uh,ûh)𝒱hc. (29)

Let (uh,ûh)𝒱h be arbitrary and set (σ,ω):=M1BσT(u,û), that is, the local functions (σh|T,ωh|T):=(σhT,ωhT) are the solution of (26) with right hand side

gT(τh):=b(τh,(uh,ûh,0))=Tτh:uhT(τh)nt(uhûh)t, (30)

where we used an element‐wise integration by parts for b. From (26b) we see (Bωσσ,ω)=Ωσh:ωh=0 and there holds

(uh,ûh)A2=(σ,ω,u,û)MBσTBσAdiv(σ,ω,u,û)T=(Mσσσ,σ)+(Adiv(u,û),(u,û)).

With (Adiv(u,û),(u,û))=νd1div(uh)02 this gives

(uh,ûh)A2=ν1σh02+νd1div(uh)02. (31)

We now insert (30) into (26a) and test with τh=σhT. The term (τh,ωhT)T=0 drops out due to (26b) and we see that T𝒯h

ν1σhT2=gT(σh).

We can use (26b) again to see (σh,uh)T=(σh,dev(ε(uh)))T, as tr(σh)=0 is built into h(T) and get

ν1σhT|(uh,σh)T|+|((σh)nt,(uhûh)t)T|σhT=|(dev(ε(uh)),σh)T|+FT|((σh)nt,(uhûh)t)F|σhTdev(ε(uh))T+FTsupτhh(T)((τh)nt,(uhûh)t)FτhTdev(ε(uh))T+FTΠk1(uhûh)tj,F.

Thus, with (31)

(uh,ûh)A2νT𝒯h(dev(ε(uh))T2+d1div(uh)T2+FTΠk1(uhûh)tj,F2)=νT𝒯h(ε(uh)T2+FTΠk1(uhûh)tj,F2)=ν(uh,ûh)ε,h2.

It remains to prove the other direction. By Lemma 4 there exists a τhh with τ0|uh,ûh,ωh|Uh, such that, once again inserting (30) into (26a), we see that

|(uh,ûh,ωh)|Uh,b(τh,(uh,ûh,ωh))τh0=T𝒯hν1(σh,τh)Tτh0ν1σh0

and therefore there holds

ν(uh,ûh)ε,h2ν|(uh,ûh,ωh)|Uh,2+νd1div(uh)02ν1σh02+νd1div(uh)02=(uh,ûh)A2.

Finally, for (uh,ûh)𝒱hc we have ΠFk1(uhûh)t=0Fh and the distributional terms in (30) vanish. The solutions of (26) are then simply given by σh=νdev(ε(uh)) and ωh=κ(curl(uh)) and (31) states

(uh,ûh)A2=νdev(ε(uh))02+νd1div(uh)02=νε(uh)02.

Remark 3

In A, we have a discretization of div(νε(u)) with degrees of freedom uh and ûh only. This is less reminiscent of a mixed method like MCS than of a HDG method and it is interesting to further elaborate on the relationship between the MCS method and DG and HDG methods. In general, DG and HDG methods require a stabilizing term to assure solvability. An example is the well known interior penalty method where the L2‐norm of jumps, αk2huhûhF2 for Fh with some sufficiently large α is used. Any dependence on such a parameter is avoided here, however this is not an unique feature of the MCS method. Other DG and HDG methods that also avoid this parameter feature a lifting σh of the jump similar to (9) instead of its L2 norm, see Reference 5. That lifting has to be explicitly computed and is then condense out. A final class of DG methods, for example the one in Reference 26, see also References 5, 27, features a simultaneous lifting of the jump and the fluxes. This is similar to what happens here, where σh both approximates the flux νε(u) and automatically and canonically stabilizes the condensed system through its interaction with the tangential jumps.

Static condensation of high order velocity functions

The basis functions of Vh can be split into two different types, see Reference 28. We write ϕu, for the high order “element bubble” basis functions whose support is entirely within some element T𝒯h and whose normal trace on T vanishes. The span of these basis functions is denoted by Vh and we write 𝒱h:=Vh×{0}𝒱h. The remaining basis functions ϕu, of Vh have support entirely within the patch of some facet F and their normal trace on all other facets in the patch vanishes. As the supports of ϕu, belonging to different elements do not overlap, in

A=AAAûAAAûAûAûAûû,

the upper left block A is block diagonal and invertible. This lets us form a second, “double” Schur complement

A:=AAûAûAûûAAûA1AAû.

In the bigger system (27), all Vh degrees of freedom couple with the divergence constraint and we cannot perform this static condensation independently of the pressure variables. However, for higher order problems, implementing multiplication with A via the exact factorization

A=IAA10IA00AI0A1AI, (32)

is still advantageous. Both the left and right factors as well as A are block diagonal and only A instead of the larger A needs to be assembled as a proper sparse matrix. We will revisit the idea of also preconditioning A via this factorization in Section 6.1.

Splitting the coordinate vector u of the Vh component of (uh,ûh)𝒱h into u and u, the norm induced by A on (u,û) is

(u,û)A=infv(u+v,u,û)A=inf(vh,v^h)𝒱h(uh+vh,ûh+v^h)A. (33)

That is, the norm induced by A is just the one induced by A on the energy minimal extension to 𝒱h dofs. The lifting operator, or (discrete) harmonic extension, :𝒱h𝒱h maps (uh,ûh), to the minimizer in (33):

(uh,ûh)=arg min(vh,v^h)𝒱h(uh+vh,ûh+v^h)A.

Equivalently, writing (w,ŵ)G(wh,ŵh):=(uh,ûh), the operator is defined by

w=u,ŵ=ûandw=A1(Au+Aûû). (34)

The range of is

𝒱hharm:=(𝒱h)={(uh,ûh)𝒱h:Au+Au+Aûû=0}, (35)

and for such “discrete harmonic” or “lifted” functions (uh,ûh)𝒱hharm there holds

(uh,ûh)A=(u,u,û)A=(u,û)A. (36)

Here we encounter a slight complication of notation: Per default, (uh,ûh)𝒱hharm is associated with its coordinate vector (u,u,û), but A only takes the (u,û) coordinates (which determine u according to (35)). The space 𝒱hharm is spanned by lifted, discrete harmonic, basis functions,

𝒱hharm=span{(ϕu,,0):ϕu,Φu,}+span{(0,ϕû):ϕûΦû},

where Φu, is the set of all ϕu, and Φû the one of all ϕû basis functions. The induced Galerkin Isomorphism G defines the natural operator A associated with A and identifies (uh,ûh)𝒱hharm with (u,û). Where there is potential for confusion we explicitly write (uh,ûh)G(u,û) in contrast to (uh,ûh)G(u,u,û).

Analogously, we define the Schur complement like norm

(uh,ûh)ε,h,:=inf(vh,v^h)𝒱h(uh+vh,ûh+v^h)ε,h (37)

and the associated lifting operator ε:𝒱h𝒱h such that

(uh,ûh)ε,h,=ε(uh,ûh)ε,h,(uh,ûh)𝒱h.

Note that both ·A and ·ε,h, can be defined on the entirety of 𝒱h but are only semi‐norms as they vanish on ker=kerε=𝒱h. Restricted to 𝒱hharm they are proper norms and equivalent.

Corollary 4

There holds

γ1ν(uh,ûh)ε,h,2(uh,ûh)A2ν(uh,ûh)ε,h,2(uh,ûh)𝒱hharm, (38)

for some γ(k)>0 discussed in more detail shortly in Remark 4.

Follows immediately from Lemma 5.

Remark 4

An interesting question is whether, and if so, how strongly, both the constant in the lower bound in (28) and γ depend on k. Note that only the latter constant enters into condition number estimates in Section 6. Numerical experiments on the unit tetrahedron suggest that the former depends linearly on k while there holds γ=𝒪(1) or possibly γ=𝒪(log(k)l) with some moderate l>0. We have not further pursued a rigorous proof for this latter, admittedly crucial, fact. Such a proof would essentially require a k‐explicit version of Lemma 4 for functions in 𝒱hharm.

5. PRECONDITIONING FRAMEWORK

A final Schur complement can be formed with respect to the pressure unknowns, however this involves the inverse A1. With the resulting (negative) pressure Schur complement Sp:=BA1BT, we have the exact factorization

K=I0BA1IA00SpIA1BT0I (39)

for the saddle point matrix K. Solving (27) could in principle be reduced to solving separate problems for the pressure and velocity. While this is not feasible due to the appearance of A1 in the pressure Schur complement, this line of thought still takes a prominent role in common preconditioning techniques for K based on separate preconditioners A^ for A and S^p for Sp. See Reference 10 and the references therein for an overview of such methods. Motivated by (39), here we use

K^1:=IA^1BT0IA^100S^p1I0BA^1I. (40)

Note that unlike suggested by (40), the operation xK^1x can be implemented such that it requires only two applications of A^1 instead of three. A rigorous analysis of K^ for the generic saddle point case as well as a number of other, similar, preconditioners built from A^ and S^p can be found in Reference 29.

5.1. Pressure Schur preconditioner

From the standard Stokes‐LBB condition on 𝒱h using the norm ·ε,h, see for example in Reference 9, and the equivalence result Lemma 5, we can conclude the MCS Stokes‐LBB condition

sup(vh,v^h)𝒱h(div(vh),qh)(vh,v^h)AγLqh0qhQh.

with γL>0 independent of h. It is generally well known that given this LBB condition, Sp is equivalent to the scaled mass matrix (Mpp,q):=ν1(ph,qh)0 for ph,qhQh. The bounds in that equivalence depend on a continuity constant (Lemma 3) and, more importantly, γL, see References 11, 30. As Qh is completely discontinuous across elements in the MCS discretization, inverting the block‐diagonal matrix Mp is feasible and we use S^p:=Mp. Since therefore γL is the primary constant determining the quality of the pressure preconditioner, it is very relevant what else it might depend on. For norms similar to the ones used here, γL was proven to be independent of k in two dimensions in Reference 31 and numerical experiments carried out in the same work strongly suggest that the independence also holds in three dimensions. The k‐robustness is further supported by numerical experiments carried out in this work, see Section 8. There remains, however, a dependence of the domain Ω itself, and in fact γL even tends to zero for certain domain shapes, for example, channels with increasingly higher aspect ratios, see Reference 32. This imposes a fundamental limitation on all methods that, like the one here, precondition the velocity problem independently of the divergence constraint.

5.2. Auxiliary space preconditioning

We give the fictitious space Lemma 6 below in the compact form it takes, for example, in Reference 14 [Theorem 6.3].

Lemma 6

Let H,H˜ be two real Hilbert spaces equipped with norms induced by A:HH and A˜:H˜H˜ and let there exist a linear operator Π:H˜H such that the continuity condition

Πv˜A2c0v˜A˜2v˜H˜, (41)

and the stability condition,

vHv˜H˜such thatv=Πv˜andv˜A˜2c1vA2, (42)

hold. Then, for the preconditioner Âa defined by Âa1:=ΠA˜1Π, there holds the spectral estimate

c01(v,v)A(Âa1Av,v)Ac1(v,v)AvH. (43)

The term auxiliary space method, as coined in Reference 16, refers to the case where the titular fictitious space H˜ is a product space that contains H itself as a component, H˜=H×V1××Vn, so Π takes the form Π=(I|Π1||Πn), and Ã:=diag(M,Ā1,,Ān) is a diagonal operator with M:HH and Āj:VjVj and induced norm (v,v1,,vn)Ã2=vM2+j=1nvjĀj2. The stability condition (42) then demands the existence of a stable decomposition v=v0+j=1nvj with v0H and vj in the range of Πj. The underlying idea is that the remainder v0H in this composition is small and somehow localized and M can be a computationally cheap method (or “smoother”). Often, M is given by some form of additive or multiplicative Schwarz method such as (Block‐)Jacobi or (Block‐)Gauss‐Seidel. In the only relevant case here, where all involved spaces are finite dimensional and n=1, the ASP Âa is just

Âa1=ΠA˜1Π=ΠM100Ā11Π=M1+Π1Ã11Π1.

As alluded to by the subscript, Âa is an additive preconditioner in that, given some right hand side vector b and intermediate approximation x0 with residual r0:=bAx0, one Richardson iteration with preconditioner Âa is to perform

x0x0+M1r0+Π1Ã11Π1r0,

that is, to perform two updates additively. The multiplicative ASP Âm is implicitly defined by performing these updates successively instead,

x1:=x0+M1r0,r1:=bAx1,x2:=x1+Π1Ã11Π1r1,r2:=bAx2,

and then, performing another smoothing step with the adjoint smoother M

x3:=x2+(M)1r2

yielding x3:=x0+Âm1r0. Multiplication with Âm1 is just performing this procedure once starting with x0=0. With symmetry ensured by the additional smoothing step, positive definiteness of Âm follows from AM and Π1Ã11Π1A1 which can always be achieved by scaling the component preconditioners. If M is a (Block‐)Jacobi preconditioner, scaling of M can be avoided by replacing it with the corresponding (Block‐)Gauss‐Seidel iteration which never over‐corrects, see Reference 33.

Lemma 7

Let an ASP Âa with n=1 fulfill the conditions of Lemma 6, and M be either self‐adjoint and positive definite with MA or given by (Block‐)Gauss‐Seidel iterations. Let Ã1 self‐adjoint and positive definite with

Π1AΠ1Ã1. (44)

Then Âm is self‐adjoint and positive definite and there holds

c11ÂmAÂm. (45)

This is proven within the framework of space decomposition and subspace correction, see Reference 33. The analysis there rests on a strengthened Cauchy‐Schwarz type inequality and a stable decomposition. The former is implied by limited overlap of subspaces and the additional requirements posed on M and Ã1 and the latter is directly related to (42). See also the discussion in Reference 14 [section 6], where convergence bounds for multiplicative two‐grid Algebraic Multigrid methods are derived from the fictitious space lemma.

6. PRECONDITIONERS FOR A

From the point of view of Section 5.2, a straightforward approach to preconditioning A is to use the conforming low order space Vh, where preconditioning is well understood and efficient and scalable software is widely available, as basis for an ASP. A slight complication in the analysis arises due to the non‐conformity in boundary conditions between 𝒱h=Vh×V^h, where tangential Dirichlet conditions on ΓÑ are imposed in V^h, and Vh, where ΓÑ does not feature any Dirichlet conditions. While imposing strong tangential Dirichlet conditions in Vh would sidestep the issue and be convenient for theory, in practice this is only a simple matter when the outflow lies in an axis‐aligned plane and we can impose Dirichlet conditions in the x,y or z component. Therefore, we for now assume that ΓÑ= and address the case ΓÑ separately in Lemma 9 at the end of this Section.

On Vh, we define the bilinear form ā(·,·) (as usual, with associated operator Ā and Finite Element matrix A) by

ā(ūh,vh):=ν1Ωε(ūh):ε(vh)ūh,vhVh. (46)

To define the operator Π in (41) we need the embedding operator

E:Vh𝒱h:ūh(ūh,(ūh)t) (47)

with associated Finite Element matrix E.

Corollary 5

For ūhVh there holds

EūhA=ūhĀ. (48)

For ūhVh and ΓÑ= there holds Eūh𝒱hc from Lemma 5 and (48) follows from (29).

To establish the stable decomposition (42) we use from Lemma 2 and define

Vh:𝒱hVh:(uh,ûh)uh. (49)

Corollary 6

For (uh,ûh)𝒱h and (wh,ŵh):=(IEVh)(uh,ûh) there holds

T𝒯h(ε(wh)T2+h2whT2+FTΠk1(whŵh)tj,F2)(uh,ûh)ε,h2, (50)

Per definition of E there holds Πk1(whŵh)t=Πk1(uhûh)t and the facet terms are bounded trivially. The volume terms are bounded with Lemma 2 and the identity for the jump terms in (9).

With Vh being of low order, robustness in the polynomial degree k has to be achieved by the smoother.

Theorem 2

Let M be the overlapping Block‐Jacobi preconditioner for A that has one block per facet Fh that contains all 𝒱h degrees of freedom associated to either F or any T𝒯h such that FT. Let C be an SPD preconditioner for A such that CA. Then, conditions (41) and (42) of Lemma 6 are fulfilled for H=𝒱h, H˜=𝒱h×Vh,

Π:H˜H:((uh,ûh),ūh)(uh,ûh)+Eūh,

and Ã:=diag(M,C) with c01 and c1γ·(logk)3. That is, for A^a1:=M1+EC1ET there holds

A^aAγ·(logk)3A^a.

We postpone the proof of Theorem 2 to Section 6.1, where we discuss preconditioning of A, as obtaining the logarithmic bound in k is more natural in that context.

Remark 5

If one is satisfied with a polynomial bound in k, Theorem 2 can be shown only using standard Finite Element inverse estimates and Corollaries 5 and 6.

6.1. Preconditioning via the condensed system

Using the factorization in (32) to implement multiplication with A also opens up a way to precondition it. Replacing A by some preconditioner A^ yields

A^ext:=IAA10IA^00AI0A1AI

as a preconditioner for A. From the factorization (32) it clearly follows that

c1A^extAc2A^extc1A^Ac2A^

and we are left with the task to precondition the “double” Schur complement A. Analogues for A of the preconditioners A^a and A^m can be constructed straightforwardly with the modified embedding operator

E:Vh𝒱hharm:ūhEūh. (51)

Note that the matrix EGE is just a sub‐matrix of E as does not change (u,û) coefficients, see (34), with

E=EEEûwe haveE=EEû.

We could modify the bilinear form in Vh and use A:=E,TAE, which would be computable element‐wise. In that case, the exact analogue of Corollary 5 would hold. However, as we now show, this is not strictly necessary and for ease of implementation we opt to keep A defined by (46).

Lemma 8

For (uh,ûh)𝒱h there holds

uh=0, (52)
Vh(uh,ûh)=Vh(uh,ûh)=Vhε(uh,ûh). (53)

Any uhVh restricted to T𝒯h is a normal bubble. At any vertex p of T, d linearly independent components of (uh)|T(p) vanish, and therefore (uh)|T(p) and uh also vanish as a whole. This concludes the proof as ,ε only add some vhVh to the Vh component of (uh,ûh)𝒱h.

Corollary 7

For ūhVh there holds

γ1ūhĀγ1νεEūhε,h,EūhAūhĀ. (54)

The sharp upper bound is a consequence of the energy minimization (33) and Corollary 5,

EūhA2=EūhA2EūhA2=ūhĀ2.

With (uh,ûh):=εEūh and (52) we conclude the identity uh=εEūh=Eūh=ūh. Now, (17) and (9) show

ūhĀ2=νε(uh)02νε(uh)02+νε(uhuh)02ν(uh,ûh)ε,h2=νεEūhε,h2

and the rest follows form the lower bound in (38).

Corollary 8

For (uh,ûh)𝒱h and either (wh,ŵh):=ε(IEVh)(uh,ûh) or (wh,ŵh):=(IEVh)(uh,ûh) there holds

T𝒯h(whT2+h2whT2+FTΠk1(whŵh)tj,F2)(uh,ûh)ε,h,2. (55)

With the readily apparent VhEVh=Vh and (53) we see

EVhε(IEVh)=0andε(IEVh)(uh,ûh)=ε(IEVh)ε(uh,ûh).

This lets us insert a zero into (wh,ŵh) to obtain an expression without ε in front,

(wh,ŵh)=ε(IEVh)(uh,ûh)=(IEVh)ε(IEVh)ε(uh,ûh).

Corollary 6 applied to ε(IEVh)ε(uh,ûh) shows

T𝒯h(h2wh02+wh02+FTh1Πk1(whŵh)tj,F2)ε(IEVh)ε(uh,ûh)ε,h2.

The proof is concluded by the energy minimization of ε,

ε(IEVh)ε(uh,ûh)ε,h2(IEVh)ε(uh,ûh)ε,h2ε(uh,ûh)ε,h2=(uh,ûh)ε,h,2,

where the continuity of EVh in the ·ε,h norm follows from Lemma 2. The other case (wh,ŵh):=(IEVh)(uh,ûh) works analogously.

An operator that, like EVh, extracts a low order component out of (uh,ûh)𝒱h is

Πlo:=𝒱h(Vh1(𝒯h,d))×(V^h1(h,d))(uh,ûh)(BDM1uh,ΠF1ûh), (56)

where BDM1 is the standard BDM1 interpolator, see Reference 19, that is, Fh there holds (BDM1uh)n=(ΠF1(uh))n.

Corollary 9

For (uh,ûh)𝒱hharm and (wh,ŵh):=ε(IΠlo)(uh,ûh) there holds

T𝒯h(whT2+h2whT2+FTΠk1(whŵh)tj,F2)(uh,ûh)ε,h,2. (57)

Follows from the Bramble‐Hilbert Lemma, an element‐level Korn inequality and Lemma 8 with similar arguments as the previous Corollary 8.

Theorem 3

Let M be the block Jacobi preconditioner for A, consisting of one block per facet Fh that contains all 𝒱hharm degrees of freedom associated to F. Let C be an SPD preconditioner for A such that CA. Then, conditions (41) and (42) of Lemma 6 are fulfilled for H=𝒱hharm, H˜=𝒱hharm×Vh,

Π:H˜H:((uh,ûh),ūh)(uh,ûh)+Eūh,

and Ã:=diag(M,C) with c01 and c1γ·(logk)3. That is, for (A^a)1:=(M)1+EC1E,T there holds

A^aAγ·(logk)3A^a.

The continuity condition (41) holds as EūhAūhĀ is shown in Corollary 7 and (uh,ûh)A2(uh,ûh)M2 follows from limited overlap of basis functions. For some (uh,ûh)H=𝒱h, the choice

v˜:=((IEVh)(uh,ûh),Vh(uh,ûh))H˜,

fulfills (uh,ûh)=Πv˜. The stability condition (42) is verified by showing

(IEVh)(uh,ûh)M2+Vh(uh,ûh)C2γ·(logk)3(uh,ûh)A2. (58)

For the second term, CĀ and Corollary 7 bound it by EVh(uh,ûh)ε,h,2 which is then further bounded by the ·A norm with the continuity of EVh in ·ε,h,, as implied by Corollary 8, and (38) where we incur the factor γ. The other bound requires a more careful approach. For general (vh,v^h)𝒱hharm, and therefore also for (IEVh)(uh,ûh)𝒱hharm, the lower bound in (38) shows

νFh(vh,v^h)ε,F2ν(vh,v^h)ε,h,2γ(vh,v^h)A2. (59)

In the first step we bounded the facet terms in the sum, where an infimum is taken over functions with arbitrary traces on neighboring faces, by (vh,v^h)ε,h,, where these traces are fixed. On the other hand, the upper inequality in (38) shows

(vh,v^h)M2=Fh(vh,v^h)(F)A2νFh(vh,v^h)ε,F,02, (60)

where (vh,v^h)(F) denotes the element of 𝒱hharm that has the same coordinates as (vh,v^h) for degrees of freedom associated to F and whose degrees of freedom are zero otherwise (Galerkin isomorphism G). Given the continuity of EVh in ·ε,h, (see Corollary 8), the crucial step is therefore to bound ·ε,F,0 by ·ε,F, as in Corollary 1. However, Corollary 1 is only applicable if ΠFR((vh)nn+v^h)=0Fh, which is not usually true for (IEVh)(uh,ûh).

This does not pose a problem for low‐order functions or, crucially, their harmonic extensions, where an alternative path via an inverse inequality bypasses the trace estimate. For a low order (vh,v^h)𝒱h(1(𝒯h)×1(h)), a standard, and necessarily k‐independent, inverse estimate is

Fh(vh,v^h)(F)ε,h2T𝒯hh2vhT2+FhΠk1(vhv^h)tj,F2. (61)

Because of the energy minimization in ·ε,h,, the estimate holds with the same constant also for discrete harmonic extensions (vh,v^h)ε(𝒱h(1(𝒯h)×1(h))) of these low order functions where (vh,v^h)(F)ε,h=(vh,v^h)(F)ε,h,. The right hand side can then further be bounded using Corollary 8 or Corollary 9 if (vh,v^h) takes the form of an approximation error, as required there.

Therefore, the strategy is to use the operator Πlo as defined in (56) to split the ·M term in (58) into low and high order components. The former can then be bounded via the inverse estimate and the latter via the trace inequality, we have

(IEVh)(uh,ûh)M2Πlo(IEVh)(uh,ûh)M2+(IΠlo)(IEVh)(uh,ûh)M2.

For (vh,v^h)𝒱h, the (low order) normal trace of the Vh component of EVh(vh,v^h) and the entire V^h component are not changed by and there holds

ΠloEVh(vh,v^h)=ΠloEVh(vh,v^h)=ΠloEVh(vh,v^h)=EVh(vh,v^h),

that is ΠloEVh=EVh. Therefore ΠloEVh=EVh=EVh and the high order term can be simplified,

(IΠlo)(IEVh)(uh,ûh)M2=(IΠlo)(uh,ûh)M2.

Note that we can apply Corollary 1 not only to (IΠlo)(uh,ûh), which is apparent from the definition of Πlo, but also to (IΠlo)(uh,ûh) because again, as argued above, does not change the relevant traces. Therefore, (60), (21) and then (59) shows

(IΠlo)(uh,ûh)M2ν(logk)3(IΠlo)(uh,ûh)ε,h,2ν(logk)3(uh,ûh)ε,h,2,

where the continuity of Πlo used in the last estimate follows from the Bramble Hilbert Lemma as in the proof of Corollary 9. Finally, the bound

(IΠlo)(IEVh)(uh,ûh)M2γ·(logk)3(uh,ûh)A2,

follows with (38). As for the low order term, with ΠloEVh=EVh we see

Πlo(IEVh)(uh,ûh)M2=(ΠloEVh)(uh,ûh)M2,

and applying (61) to the (harmonic extension of) the low order function (ΠloEVh)(uh,ûh) gives

Πlo(IEVh)(uh,ûh)M2νFh((ΠloEVh)(uh,ûh))(F)ε,h,2=νFh(ε(ΠloEVh)(uh,ûh))(F)ε,h2ν(T𝒯hh2whT2+FTΠk1(whŵh)tj,F2),

where we write (wh,ŵh):=ε(ΠloEVh)(uh,ûh). We further split (wh,ŵh) into (αh,α^h):=ε(IEVh)(uh,ûh) and (βh,β^h):=ε(IΠlo)(uh,ûh) and get

Πlo(IEVh)(uh,ûh)M2ν(T𝒯hh2αhT2+FTΠk1(αhα^h)tj,F2)+ν(T𝒯hh2βhT2+FTΠk1(βhβ^h)tj,F2).

Corollary 8 and (38) bound the former two terms,

ν(T𝒯hh2αhT2+FTΠk1(αhα^h)tj,F2)ν(uh,ûh)ε,h,γ(uh,ûh)A,

and Corollary 9 and (38) the latter two,

ν(h2βhT2+FTΠk1(βhβ^h)tj,F2)ν(uh,ûh)ε,h,γ(uh,ûh)A.

Proof of Theorem 2

Similarly to the proof of Theorem 3, the continuity condition follows from Corollary 5, limited overlap of basis functions and this time also limited overlap of the Jacobi blocks themselves. Also similarly, the stability condition is proven by setting v˜:=((IEVh)(uh,ûh),Vh(uh,ûh))H˜ and using Corollary 6. The bound (IEVh)(uh,ûh)M2(uh,ûh)A2 via the triangle inequality follows from

(IEVh)(uh,ûh)M2γ·(logk)3(uh,ûh)A2,

which was already shown in the proof of Theorem 3, and the estimate

(EE)Vh(uh,ûh)M2=(I)EVh(uh,ûh)M2(uh,ûh)A2.

The latter holds because (I)EVh(uh,ûh) is a normal bubble, that is all its coupling degrees of freedom are zero, and A restricted to such functions is block diagonal.

Corollary 10

Let A^m and A^m be the multiplicative versions of A^ and A^, respectively, with the Block‐Jacobi smoothers M, M replaced by Block‐Gauss‐Seidel sweeps and let AC. Then there holds

γ1·(logk)3A^mAA^m, (62)
γ1·(logk)3A^mAA^m. (63)

The former result (62) follows from Theorem 2 and Lemma 7, where condition (44) is fulfilled due to AC and Corollary 5. The latter one (63) follows along the same lines with Theorem 3 and the strict upper bound in (54) for Lemma 7.

Remark 6

Although we have only experimental evidence that the constant γ in Theorems 2 and 3 is benign, the proofs of these theorems show that in the ·ε,h and ·ε,h, norm they hold independently of γ. That is, we have results for ASPs for HDG methods with optimal stabilization that are explicit and robust in k.

6.2. Non‐conformity in boundary conditions

We now return to the case of ΓÑ. Instead of enforcing zero tangential Dirichlet conditions on ΓÑ in Vh, it suffices to add a tangential penalty to Ā and for E to zero out V^h degrees of freedom on ΓÑ.

Lemma 9

For some C>0, let Ā be defined by the modified bilinear form

ā(ūh,vh):=Ωνε(ūh):ε(vh)+FΓÑFνCk2h(ūh)t(vh)t.

and π0:𝒱h𝒱h be the operator that zeros out V^h degrees of freedom on ΓÑ. Then, for C large enough there holds

ūhĀ2π0EūhA2ūhĀ2,andūhĀ2π0EūhA2ūhĀ2.

These estimates are robust in k.

With the upper bound in (28) and (9) there holds

π0EūhA2ν(ε(ūh)02+FhÑΠk1(ūh)tj,F2)ν(ε(ūh)02+FhÑk2hΠk1(ūh)tF2),

that is for large enough C we have π0EūhA2ūhĀ2. The lower bound ūhĀ2π0EūhA2 similarly follows from the lower bound in (28) and the fact that, as ūh1(𝒯h) is of low order, the high order terms in (9) vanish and there holds

k2hΠk1(ūh)tF2Πk1(ūh)tj,F2,

with a k‐robust constant. The estimates for the ·A‐norm follow from the ones for the ·A‐norm with energy minimization as in the proof of Corollary 7.

Modifying Ā and the embedding operators like this, one shows the proofs of Section 6 also for the case ΓÑ.

7. THE LOWEST ORDER CASE

The MCS method of Section 4 is, as already mentioned there, not stable in the lowest order case k=1. Stability of the method is recovered when a simplified stress tensor σ=ν(u) is used in (1a), but we are interested in treating the full symmetric stress tensor σ=νε(u). The five coupling degrees of freedom per facet we have for k=1, that is three in VhBDM1 and two enforced by V^h, are too few to capture the six rigid body modes.

In Reference 9, this was remedied by using a vector‐valued Wh instead of the 𝕂‐valued one here, which just means that all occurrences of ωh have to be replaced by κ(ωh) everywhere, and taking it as a subset of H(div),

Wh:={ωhH0,D(div,Ω):(ωh)|T0(T,3)+x0(T,)T𝒯h},

providing the missing coupling degree of freedom per facet. Motivated by the fact that the divergence of ωh=curl(u)H(div,Ω) vanishes for the true solution uH1(Ω,d), a consistent stabilizing term (div(ωh),div(ηh))0 was added to the bilinear form. We only briefly sketch how to adapt the preconditioners and their analysis developed here. Since WhH(div,Ω) has a coupling degree of freedom per facet, ωh remains after static condensation and A is a system for (uh,ûh,ωh)𝒱hlo:=Vh×V^h×Wh. The norm in 𝒱hlo is

(uh,ûh,ωh)ε,h,lo2:=T𝒯h(ε(uh)T2+FTh1ΠF0(uhû)hF2+h(curl(uh)ωh)nF2),

this is justified by the discrete Korn inequality

T𝒯huhT2T𝒯hε(uh)T2+Fhh1ΠF0uhtF2+hn·curl(uh)F2,

introduced in Reference 9 [lemma 3.1]. We only need to change the "embedding" operator E which now has a Wh component and projects into the V^h component as for uhVh the piecewise 1 tangential trace (ūh)tV^h,

E:Vh𝒱hlo:ūh(ūh,ΠF0(ūh)t,curl(ūh)).

The analysis also needs to be only slightly modified using the equivalence

T𝒯hε(uh)T2+Fhh1ΠFRuhtF2T𝒯hε(uh)T2+Fhh1ΠF0uhtF2+hΠF0n·curl(uh)F2,

introduced together with the Korn inequality in Reference 9 [lemma 3.1].

8. NUMERICAL RESULTS

We now present numerical results that were achieved using the Netgen/NGSolve meshing and Finite Element software, 34 , 35 and the Algebraic Multigrid extension library NgsAMG, 36 available from References 37, 38. The computations were performed on the Vienna Scientific Cluster (VSC4).

We considered two problems, the first of which is a standard benchmark problem from the literature (see Reference 39) where we investigate the relative performance of different ASP variations and demonstrate robustness in the polynomial degree. The second problem is a flow around an airplane model and is meant to demonstrate the effectiveness of the method even in less academic situations. For both cases, the viscosity is fixed to ν=103, the preconditioner in the conforming auxiliary space V^h was given by a single Algebraic Multigrid V‐cycle. Instead of the difficult to parallelize Block‐Gauss‐Seidel smoothers in A^m and A^m, we use block versions of the scalable semi‐multiplicative 1‐smoothers from Reference 40.

Although K^1 is symmetric (see Equation 40) and would be suitable for MINRES, we use GMRES as the Krylov space method since in our experience it performs better, perhaps due to the explicit orthogonalization in every iteration. We chose to solve with a relative tolerance of 106 as is used commonly in the AMG literature (e.g., References 41, 42); Figure 1 demonstrates that we generally do not suffer notable loss of convergence until the error has been reduced by more than a factor of 1012.

FIGURE 1.

NLA-2503-FIG-0001-c

Relative errors (left) and error reduction (right) on the y‐axis versus iteration number on the x‐axis for the setup from Section 8.1.1 on the condensed system, as in Table 1 on the right. Only every other computation is shown.

We show weak scaling results and therefore aim to keep the number of elements per core constant, however are only able to ensure this approximately because of the unstructured simplicial meshes we use.

The obtained results, listed in Tables 1, 2, 3 will be discussed in detail below. For every computation we list the number of elements in the mesh |𝒯h| and the number of cores #P. With the h dofs condensed out of the system, the relevant number of dofs is that of 𝒱h×Qh which we list as #D. We give the number of iterations of GMRES needed as #IT and the total time to solve the problem (excluding loading of the mesh) as ttot. The latter is further subdivided into the setup time tsup, which includes the assembly of all finite element matrices and the setup of the preconditioner, and the time tsol taken for GMRES iterations.

TABLE 1.

Comparison of multiplicative ASPs for the full system A and the condensed system A for the channel problem with k=2.

Full system Condensed system
|𝒯h|
#D #P #IT
ttot
tsup
tsol
#IT
ttot
tsup
tsol
5.5·104 1.9·106 7 166 67.2 9.0 58.2 76 29.3 9.5 19.8
1.8·105 6.3·106 19 119 58.2 10.2 48.0 63 32.4 11.3 21.1
3.1·105 1.1·107 36 235 163.1 9.1 154.0 92 59.1 10.2 48.9
7.9·105 2.7·107 81 128 110.6 11.8 98.8 65 53.0 12.3 40.7
1.5·106 5.0·107 166 159 134.9 10.6 124.3 73 54.5 10.8 43.7
3.5·106 1.2·108 408 172 171.1 11.3 159.8 78 65.3 11.8 53.5
6.3·106 2.2·108 720 164 141.7 11.1 130.6 74 55.2 11.9 43.3
1.2·107 4.0·108 1333 164 169.2 12.0 157.2 75 68.0 12.9 55.1
2.3·107 7.9·108 2667 193 430.2 24.0 406.2 81 78.6 14.8 63.8

TABLE 2.

Comparison of additive and multiplicative ASPs for A for the channel problem with k=2.

Additive Multiplicative
|𝒯h|
#D #P #IT
ttot
tsup
tsol
#IT
ttot
tsup
tsol
5.5·104 1.9·106 5 191 60.9 13.9 47.0 75 46.0 14.2 31.8
2.1·105 7.3·106 17 191 75.8 12.8 63.0 73 45.6 14.3 31.3
4.4·105 1.5·107 35 206 154.4 13.4 141.0 77 65.7 14.6 51.1
1.5·106 5.0·107 111 169 132.8 14.0 118.7 73 73.1 15.2 57.9
6.3·106 2.2·108 480 179 176.0 15.7 160.3 74 90.9 17.0 73.9
1.4·107 4.6·108 1040 209 261.5 16.7 244.8 78 120.0 18.0 101.9
3.5·107 1.2·109 2698 230 400.2 18.0 382.3 88 159.4 20.3 139.13
5.1·107 1.7·109 3876 202 301.4 18.1 283.3 84 151.9 19.4 132.5

TABLE 3.

Multiplicative ASP for A with two smoothing steps for the channel problem and varying polynomial order k.

k=1
k=2
|𝒯h|
#P #D #IT
ttot
tsup
tsol
#D #IT
ttot
tsup
tsol
8.6·103 1 1.2·105 86 11.6 4.2 7.4 3.1·105 49 23.9 7.9 16.0
3.2·105 36 4.2·106 82 21.6 5.8 15.8 1.1·107 53 42.8 10.2 32.6
7.6·105 85 1.0·107 79 23.7 6.6 17.2 2.6·107 52 54.2 12.0 42.2
2.0·106 225 2.7·107 81 27.4 6.9 20.5 6.9·107 57 61.2 12.1 49.1
6.4·106 712 8.4·107 82 30.4 7.3 23.2 2.2·108 58 67.9 12.8 55.2
2.1·107 2347 2.8·108 85 32.6 8.2 24.3 7.2·108 62 74.8 14.7 60.1
4.6·107 5165 6.1·108 97 44.8 12.0 32.8 1.6·109 75 92.1 15.0 77.1
6.5·107 7168 8.4·108 98 43.1 10.2 32.9 2.2·109 75 94.6 16.1 78.5
9.7·107 10775 1.3·109 106 66.0 30.1 35.9
k=4
8.6·103 11 1.2·106 63 40.8 19.4 21.4
4.5·104 57 6.3·106 65 48.8 22.9 25.9
1.8·105 227 2.5·107 65 63.7 28.2 35.5
3.2·105 397 4.3·107 67 61.4 27.0 34.4
7.6·105 953 1.0·108 65 65.7 27.4 38.3
1.7·106 2064 2.2·108 66 61.7 24.8 36.9
6.4·106 8008 8.7·108 64 68.7 27.7 41.0

8.1. Flow around a cylinder

This first series of computations concerns the flow around a cylinder as in Reference 39. The cuboid‐shaped channel Ω with cylindrical obstacle Ωc, Ω:=(0,2.5)×(0,0.41)×(0,0.41)Ωc is depicted on the left in Figure 2. The boundary parts are ΓN=, ΓÑ={(2.5,y,z)Ω} with ΓD=ΓinΓwall split into inflow boundary Γin:={(0,y,z)Ω}, where we impose a parabolic velocity inflow and wall boundary Γwall with homogenous Dirichlet conditions.

FIGURE 2.

NLA-2503-FIG-0002-b

Channel with cylindrical obstacle (left) and airplane model (right).

8.1.1. Full versus condensed system

We first discuss whether preconditioning A via A as described in Section 6.1 is purely convenient for theory or also advantageous in practice. For that, we compare the multiplicative ASPs over a range of problem sizes and fixed polynomial degree k=2. As can be clearly seen in Table 1, preconditioning via the condensed system leads to considerably better performance and is the approach we take from here on out.

8.1.2. Additive versus multiplicative ASP

The second choice is between additive and multiplicative ASPs, we again fix the polynomial degree to k=2 for the comparison in Table 2. From the results it is once again clear that the multiplicative preconditioner is superior and our method of choice going forward.

8.1.3. High order robustness

Finally, we demonstrate robustness in the polynomial degree k with results for k{1,2,4}.

For the lowest order case k=1, we cannot use the MCS method (23) from Section 4 since it is simply not stable, see also Remark 1. Instead, we employ the minimal order MCS method from Reference 9, see Section 7, where, analogous to (23), we added the consistent term νd1(div(uh),div(vh)).

Our choice of preconditioner, informed by previous results, is the multiplicative ASP for the condensed system, this time with two smoothing steps. Due to considerably increased memory requirements, different meshes were used for k=4 than for k=1,2.

8.2. Flow around an airplane model

The computational domain Ω here is the “air” in a cuboid‐shaped box surrounding an airplane model Ωp depicted in Figure 2, we have Ω=(8,10)×(7,7)×(3,4)Ωp. The airplane itself is contained in the bounding box [5.2,5.3]×[4.9,4,9]×[0.5,1.6]. Boundary conditions, similar to the last case, are imposed velocity inflow conditions on the side of the box in front of the plane Γin, and homogenous Dirichlet conditions on Ωp. The rest of the boundary is considered as outflow, that is, ΓÑ=Ω(ΓinΩp). The results can be found in Table 4.

TABLE 4.

Results for the model airplane problem, k=2, multiplicative ASP for A, two smoothing steps.

|𝒯h|
#D #P #IT
ttot
tsup
tsol
9.2·105 3.2·107 63 61 68.4 24.2 44.3
1.4·106 5.0·107 99 41 55.8 25.1 30.7
1.9·106 6.7·107 132 44 67.4 26.5 40.8
3.7·106 1.3·108 253 41 65.7 27.4 38.3
1.2·107 4.0·108 876 50 72.3 25.1 47.2
1.6·107 5.3·108 1176 52 79.1 25.6 53.5
3.0·107 1.0·109 2261 53 82.6 26.6 56.0

9. CONCLUSIONS

In this work, we introduced and analyzed a series of auxiliary space preconditioners for certain mass conserving stress‐yielding discretizations of the Stokes equations. In the norm induced by these MCS methods, the analysis is mostly explicit in the polynomial degree and even yields completely explicit results in the norm induced by certain hybrid discontinuous Galerkin methods that feature optimal stabilization. Numerical experiments demonstrate the robustness of the preconditioners in the polynomial degree.

CONFLICT OF INTEREST STATEMENT

The authors declare that they have no conflicts of interest.

ACKNOWLEDGMENTS

The authors have been partially funded by the Austrian Science Fund (FWF) through the research program “Taming complexity in partial differential systems” (F65)–project “Automated discretization in multiphysics” (P10) and the standalone project P35931‐N.

APPENDIX A. INTERPOLATION

A.1.

A standard result for f, which, for example, follows from the Bramble Hilbert Lemma, the bounds for jump terms arising from nodal averaging for 1(𝒯h,d) functions in Reference 21 [section 3], and a trace inequality is

T𝒯hh2ufuT2+(ufu)T2T𝒯huT2+Fh0h1Π0uF2uH2(𝒯h,d). (A1)

Following Reference 21 [section 3], for T𝒯h we define ET:H1(T,d)RM(T) by

T(uETu)·q=0q0(T,d)andT(curlucurl(ETu))·q=0q0(T,d(d1)/2),

that is curl(ETu)=ΠT0curlu and ΠT0ETu=ΠT0u, such that (also Reference 21 [section 3])

h2uETuT2+(uETu)T2ε(u)T2. (A2)

With the element center of mass xT:=ΠT0x, elementary calculations show

ETu(x)=ΠT0u+κ(ΠT0curlu)·(xxT).

Proof of Lemma 1

For any T𝒯h, define the set of element patch elements 𝒯h,T:={S𝒯h:TS} and the element patch ωT:=(S𝒯h,TS). We write ω for the local interpolation operator defined only on 𝒯h,T as f is on 𝒯h, that is, by averaging only over values from elements in 𝒯h,T. There holds (fu)|T=(ωu)|T and

((If)u)|T=((Iω)(uR))|TR1(ωT,d)RM(ωT).

In combination with estimate (A1) applied to ω on 𝒯h,T this shows

h2(If)uT2+((If)u)T2infRRM(ωT)h2(Iω)(uR)ωT2+((Iω)(uR))ωT2infRRM(ωT)T˜𝒯h,T(uR)T˜2+Fωh1Π0uRF2=infRRM(ωT)T˜𝒯h,T(uR)T˜2+Fωh1Π0uF2,

where ω denotes the set of interior facets of 𝒯h,T. We can further bound the volume terms by inserting ±ET˜u and using (A2),

T˜𝒯h,T(uR)T˜2T˜𝒯h,T(uET˜u)T˜2+(ET˜uR)T˜2T˜𝒯h,Tε(u)T˜2+(ET˜uR)T˜2.

We see that it remains to find RRM(ωT) such that

T˜𝒯h,T(ET˜uR)T˜2T˜𝒯h,Tε(u)T˜2+Fωh1ΠRuF2. (A3)

Similar to the definition of ET, with xω:=ΠωT0x a suitable R is

R:=ΠωT0u+κ(ΠωT0curlu)·(xxω).

Calculations show ΠωT0curlu=T˜𝒯h,TαT˜ΠT˜0curlu with αT˜:=|T˜||ωT|, and therefore

R=ΠωT0u+T˜𝒯h,TαT˜κ(curl(ET˜u))·(xxω).

As ε(ET˜uR)=0, there holds (ET˜uR)=κ(curl(ET˜uR))0(𝒯h,T,d), i.e.

(ET˜uR)T˜2hd|(ET˜uR)|T˜|2=hd|S𝒯h,TαS(curl(ET˜u)curl(ESu))|,

where we used S𝒯h,TαS=1 and therefore, with αS1,

T˜𝒯h,T(ET˜uR)T˜2T˜𝒯h,TS𝒯h,Thd|(curl(ET˜u)curl(ESu))|.

Any two elements in 𝒯h,T are connected via a path over a bounded number of other elements in 𝒯h,T, and we can bound this last sum by one over facet terms (see Figure A1):

T˜𝒯h,TS𝒯h,Thd|(curl(ET˜u)curl(ESu))|Fωhd|curl(ETF,Lu)curl(ETF,Ru)|2, (A4)

where TF,L and TF,R denote the two elements that share the facet F. Any facet is only summed up over a bounded number of times after reordering of the sum and due to the shape regularity of 𝒯h, (A4) holds with a single constant for all patches in 𝒯h. These jump terms can be bounded by an expansion of ET˜u at xF:=ΠF0(x),

ET˜u(x)=ΠF0(ET˜u)+κ(curl(ET˜u))·(xxF)forxF,

and the elementary estimate xxFF2h2|F|hd+1. Writing 𝒯F:={TF,L,TF,R} we see

hd|curl(ETF,Lu)curl(ETF,Ru)|2h1κ(curl(ETF,Lu)curl(ETF,Ru))·(xxF)F2=h1(ΠFRΠF0)(ETF,LuETF,Ru)F2h1ΠFRuF2+T˜𝒯Fh1ΠFR(uET˜u)F2.

Finally, an H1 trace inequality and (A2) let us bound

h1ΠFR(uET˜u)F2(uET˜u)H1(T˜)2ε(u)T˜2,

in summary,

T˜𝒯h,T(ET˜uR)T˜2Fωhd|curl(ETF,Lu)curl(ETF,Ru)|2T˜𝒯h,Tε(u)T˜2+Fωh1ΠFRuF2,

that is, (A3) holds for our specific choice of R which finishes the proof.

FIGURE A1.

NLA-2503-FIG-0003-c

Example path in two dimensions for the last estimate in (A4).

Proof of Lemma 2

An inverse estimate for the piecewise linear fuVhf shows

T𝒯hh2uuT2T𝒯hh2ufuT2+h2(Iπ0)fuT2T𝒯h(h2ufuT2+FThDh1(Iπ0)fuF2).

As (Iπ0)fu=fu on FhD, and fu1(𝒯h,d)

(Iπ0)fuF2=ΠF1fuF2ΠFRfuF2+(ΠF1ΠFR)fuF2ΠFRuF2+ΠFR(ufu)F2+(ΠF1ΠFR)fuF2

We bound the second one with an H1 trace inequality and a scaling argument,

h1ΠFR(ufu)F2h2ufuT2+(ufu)T2,

where T is the unique element such that FT. An explicit expansion of the piecewise linear fu at the facet center of mass xF:=ΠF0x shows

h1(ΠF1ΠFR)fuF2=h1ε((fu)|T)·(xxF)F2ε(fu)T2ε(u)T2+(ufu)T2

Finally, with ΠFRu=ΠFRu on FhD, by Lemma 1 there holds

T𝒯hh2uuT2T𝒯h(h2ufuT2+(ufu)T2+ε(u)T2+FThDh1ΠFRuF2)T𝒯h(ε(u)T2+FTh1ΠFRuF2).

The other volume terms (uu)T in (17) are bounded analogously.

APPENDIX B. TRACE ESTIMATES

B.1.

The crucial step in the proof of (18) in Reference 20 was to construct for a given wk(T,) a w˜k(T,) that approximates it in ·j,F and is bounded in the H1 semi‐norm and yet w˜|F=0. That is, implicitly, for Fh and T𝒯h with FT, an operator

0s,F:k(T,)k(T,)with(0s,Fu)|F=0and0s,FuT2+0s,Fuuj,F2logkuH1(T)2 (B1)

was constructed. As no boundary conditions are enforced strongly in ·1,F,0, the trace of 0s,Fw could be extended to a function admissible for the infimum in ·1,F,0. In addition to 0s,F, of the commuting H1,H(curl) and H(div) extensions introduced in References 43, 44, 45, we need the first,

s:k(T,)k(T,)with(su)T=uT,andsuH1(T)2uH1/2(T)2,

see Reference 43 [theorem 6.1], and last,

div:{uH1/2(T):u|Fk(F,d)FT}k(T,d)with((divu)n)|F=(un)|FFT,anddivuH1(T)2uH1/2(F)2.

Note although that div was constructed from H1/2(T)Hdiv(T) in Reference 44 [theorem 7.1], the authors actually proved continuity in the H1(T) norm.

Lemma 10

For Fh and uk(T,d) there exists ũk(T,d) with ũn=un on F and ũn=0 on F˜T{F} such that

ũT2+(ũu)tj,F2+F˜T{F}h1utj,F˜2(logk)3uH1(T)2. (B2)

To simplify the notation we only show a proof in three dimensions, the two‐dimensional case works analogously. It also suffices to show the estimate on a reference tetrahedron, for general tetrahedra it follows from scaling arguments.

First, we use div to get a ũ1 which fulfills (ũ1)n=un on F and (ũ1)n=0 on F˜T{F} with a bounded H1 norm,

ũ1H1(T)2uH1/2(F)2uH(div,T)2uH1(T)2.

We have no control over the tangential traces of ũ1 and have to add correction terms. For all F^T we pick two arbitrary normalized, orthogonal tangent vectors tF^ and t˜F^ and write the “errors” we need to compensate for on F and F˜T{F} as

λFtF:=((uũ1)·tF)tF,λ˜Ft˜F:=((uũ1)·t˜F)t˜F,λF˜tF˜:=(ũ1·tF˜)tF˜,λ˜F˜t˜F˜:=(ũ1·t˜F˜)t˜F˜.

We write s,F^ for s applied to the extension by zero to T of functions that vanish on F^. This defines an H001/2 stable extension

s,F^:k(F,)H001/2(F)k(T,)withs,F^uH1(T)uH001/2(F),

and construct a corrected ũ as

ũ:=ũ1+F^Ts,F^0s,F^(λF)tF^+s,F^0s,F^(λ˜F)t˜F^,

where we understand s,F^ to be applied to the respective trace on F^. The added corrections are normal bubbles because on their associated facet they are a scalar times a tangential and their trace vanishes on all others, that is, ũn=(ũ1)nFT and ũ is admissible and we need to show that if fulfills (B2).

As s,F˜ restricted to F˜ is just the identity, for F˜T{F} there holds

ũ·tF˜j,F˜2=(ũ1·tF˜)s,F˜0s,F˜(ũ1·tF˜)j,F˜2=(I0s,F˜)(ũ1·tF˜)j,F˜2,

and (B1) implies

ũ·tF˜j,F˜2logkũ1·tF˜H1(T)2logkũ1H1(T)2logkuH1(T)2.

The volume terms arising from the correction of λF˜ for F˜T{F} can be bounded with the inverse estimate vH001/2(F˜)(logk)2vH1/2(F˜) for polynomials that vanish on F˜, see Reference 45 [lemma 4.7],

s,F˜0s,F˜(λF˜)tF˜T20s,F˜λF˜H001/2(F˜)2(logk)20s,F˜λF˜H1/2(F˜)2,

and we can continue with (B1) to see

s,F˜0s,F˜(λF˜)tF˜T2(logk)3ũ1·tF˜H1(T)2(logk)3uH1(T)2.

Analogously, we show these bounds for volume and trace terms for F˜=F as well as t˜(·),λ˜(·) instead of t(·),λ(·). In summary, we have

ũT2+(uũ)t||j,F2+F˜T{F}ũtj,F˜2ũ1F2+F^Ts,F^0s,F^(λF^)tF^T2+s,F^0s,F^(λ˜F^)t˜F^T2+(uũ)t||j,F2+F˜T{F}ũtj,F˜2(logk)3uH1(T)2.

Proof of Lemma 1

For the minimizer w in (19), a Korn inequality on T shows

wH1(T)2ε(w)T2+ΠFRwj,F2=ε(w)T2+ΠFR(wû)tj,F2(u,û)ε,F.

Choosing w˜k(T,d) as in Lemma 10, finishes the proof as it is admissible for the infimum in (20) and bounds it by wH1(T)2(u,û)ε,F.

Kogler L, Lederer PL, Schöberl J. A conforming auxiliary space preconditioner for the mass conserving stress‐yielding method. Numer Linear Algebra Appl. 2023;30(5):e2503. 10.1002/nla.2503

DATA AVAILABILITY STATEMENT

The data that support the findings of this study are available from the corresponding author upon reasonable request.

REFERENCES

  • 1. Stenberg R. A family of mixed finite elements for the elasticity problem. Numer Math. 1988;53(5):513–38. 10.1007/BF01397550 [DOI] [Google Scholar]
  • 2. Cockburn B, Gopalakrishnan J, Guzmán J. A new elasticity element made for enforcing weak stress symmetry. Math Comp. 2010;79(271):1331–49. 10.1090/S0025-5718-10-02343-4 [DOI] [Google Scholar]
  • 3. Arnold DN, Falk RS, Winther R. Mixed finite element methods for linear elasticity with weakly imposed symmetry. Math Comp. 2007;76(260):1699–723. 10.1090/S0025-5718-07-01998-9 [DOI] [Google Scholar]
  • 4. John V, Linke A, Merdon C, Neilan M, Rebholz L. On the divergence constraint in mixed finite element methods for incompressible flows. SIAM Rev. 2017;59:492–544. [Google Scholar]
  • 5. Stamm B, Wihler TP. hp‐optimal discontinuous Galerkin methods for linear elliptic problems. Math Comp. 2010;79(272):2117–33. 10.1090/S0025-5718-10-02335-5 [DOI] [Google Scholar]
  • 6. Arnold DN, Brezzi F, Cockburn B, Marini LD. Unified analysis of discontinuous Galerkin methods for elliptic problems. SIAM J Numer Anal. 2002;39(5):1749–79. [Google Scholar]
  • 7. Lederer PL. A Mass Conserving Mixed Stress Formulation for Incompressible Flows (PHD Thesis). Technical University of Vienna. Wiedner Hauptstrasse 8‐10, 1040 Vienna, Austria. 2019.
  • 8. Gopalakrishnan J, Lederer PL, Schöberl J. A mass conserving mixed stress formulation for Stokes flow with weakly imposed stress symmetry. SIAM J Numer Anal. 2020;58(1):706–32. [Google Scholar]
  • 9. Gopalakrishnan J, Kogler L, Lederer PL, Schöberl J. Divergence‐conforming velocity and vorticity approximations for incompressible fluids obtained with minimal inter‐element coupling. 2021. [DOI] [PMC free article] [PubMed]
  • 10. Benzi M, Golub GH, Liesen J. Numerical solution of saddle point problems. Acta Numer. 2005;14:1–137. [Google Scholar]
  • 11. Wathen AJ, Silvester DJ. Fast iterative solution of stabilised Stokes systems, part I: using simple diagonal preconditioners. SIAM J Numer Anal. 1993;30:630–49. [Google Scholar]
  • 12. Toselli A, Widlund OB. Domain decomposition methods. 2005th ed. Springer series in computational mathematics. Berlin, Germany: Springer; 2005. [Google Scholar]
  • 13. Braess D. Finite elemente–Theorie, Schnelle Löser und Anwendungen in der Elastizitätstheorie. Berlin, Heidelberg: Springer; 2013. [Google Scholar]
  • 14. Xu J, Zikatanov L. Algebraic multigrid methods. Acta Numer. 2017;26:591–721. [Google Scholar]
  • 15. Cockburn B, Dubois O, Gopalakrishnan J, Tan S. Multigrid for an HDG method†. IMA J Numer Anal. 2013;34(4):1386–425. 10.1093/imanum/drt024 [DOI] [Google Scholar]
  • 16. Xu J. The auxiliary space method and optimal multigrid preconditioning techniques for unstructured grids. Comput. 1996;56(3):215–35. 10.1007/bf02238513 [DOI] [Google Scholar]
  • 17. Fu G. Uniform auxiliary space preconditioning for HDG methods for elliptic operators with a parameter dependent low order term. SIAM J Sci Comput. 2021;43(6):A3912–37. 10.1137/20m1382325 [DOI] [Google Scholar]
  • 18. Schöberl J, Lehrenfeld C. In: Apel T, Steinbach O, editors. Domain decomposition preconditioning for high order hybrid discontinuous Galerkin methods on tetrahedral meshes. Berlin, Heidelberg: Springer; 2013. p. 27–56. 10.1007/978-3-642-30316-6_2 [DOI] [Google Scholar]
  • 19. Boffi D, Brezzi F, Fortin M. Mixed finite element methods and applications. Berlin, Heidelberg: Springer Science & Business Media; 2013. [Google Scholar]
  • 20. Schöberl J, Lehrenfeld C. Domain decomposition preconditioning for high order hybrid discontinuous Galerkin methods on tetrahedral meshes. Advanced finite element methods and applications. Berlin Heidelberg: Springer; 2013. p. 27–56. 10.1007/978-3-642-30316-6_2 [DOI] [Google Scholar]
  • 21. Brenner SC. Korn's inequalities for piecewise H1 vector fields. Math Comp. 2004;73(247):1067–87. 10.1090/S0025-5718-03-01579-5 [DOI] [Google Scholar]
  • 22. Gopalakrishnan J, Lederer PL, Schöberl J. A mass conserving mixed stress formulation for the Stokes equations. IMA J Numer Anal. 2019;40(3):1838–74. [Google Scholar]
  • 23. Arnold DN, Brezzi F. Mixed and nonconforming finite element methods: implementation, postprocessing and error estimates. RAIRO Modél Math Anal Numér. 1985;19(1):7–32. [Google Scholar]
  • 24. Brezzi F, Douglas J Jr, Durán R, Fortin M. Mixed finite elements for second order elliptic problems in three variables. Numer Math. 1987;51(2):237–50. 10.1007/BF01396752 [DOI] [Google Scholar]
  • 25. Fraeijs de Veubeke B. Displacement and equilibrium models in the finite element method by B. Fraeijs de Veubeke, Chapter 9, pages 145–197 of Stress Analysis, Edited by O. C. Zienkiewicz and G. S. Holister, Published by John Wiley & Sons, 1965. Internat J Numer Methods Engrg. 2001;52(3):287–342. Edited by O. C. Zienkiewicz and G. S. Holister and with introductory remarks by Zienkiewicz. 10.1002/nme.339 [DOI]
  • 26. Bassi F, Rebay S. A high‐order accurate discontinuous finite element method for the numerical solution of the compressible Navier–Stokes equations. J Comput Phys. 1997;131(2):267–79. 10.1006/jcph.1996.5572 [DOI] [Google Scholar]
  • 27. Cockburn B, Gopalakrishnan J, Lazarov R. Unified hybridization of discontinuous Galerkin, mixed, and continuous Galerkin methods for second order elliptic problems. SIAM J Numer Anal. 2009;47(2):1319–65. [Google Scholar]
  • 28. Beuchler S, Pillwein V, Zaglmayr S. Sparsity optimized high order finite element functions for H(div) on simplices. Numer Math. 2012;122(2):197–225. 10.1007/s00211-012-0461-0 [DOI] [Google Scholar]
  • 29. Zulehner W. Analysis of iterative methods for saddle point problems: a unified approach. Math Comput. 2002;71:479–505. [Google Scholar]
  • 30. Verfürth R. A combined conjugate gradient–multi‐grid algorithm for the numerical solution of the Stokes problem. IMA J Numer Anal. 1984;4:441–55. [Google Scholar]
  • 31. Lederer P, Schöberl J. Polynomial robust stability analysis for H(div)‐conforming finite elements for the Stokes equations. arXiv preprint arXiv:161201482. 2016.
  • 32. Chizhonkov EV, Olshanskii MA. On the domain geometry dependence of the LBB condition. ESAIM: Math Model Numer Anal. 2000;34(5):935–51. 10.1051/m2an:2000110 [DOI] [Google Scholar]
  • 33. Xu J. Iterative methods by space decomposition and subspace correction. SIAM Rev. 1992;34(4):581–613. 10.1137/1034116 [DOI] [Google Scholar]
  • 34. Schöberl J. NETGEN An advancing front 2D/3D‐mesh generator based on abstract rules. Comput Visual Sci. 1997;1(1):41–52. [Google Scholar]
  • 35. Schöberl J. C++11 Implementation of Finite Elements in NGSolve. 2014. https://www.asc.tuwien.ac.at/∼schoeberl/wiki/publications/ngs‐cpp11.pdf
  • 36. Kogler L, Schöberl J. An algebraic multigrid method for elasticity based on an auxiliary topology with edge matrices. Numer Linear Algebra Appl. 2021;29(1):e2408. 10.1002/nla.2408 [DOI] [Google Scholar]
  • 37. Netgen/NGSolve . Software (website). https://ngsolve.org
  • 38. NgsAMG . Software (website). https://github.com/LukasKogler/NgsAMG
  • 39. Schäfer M, Turek S, Durst F, Krause E, Rannacher R. In: Hirschel EH, editor. Benchmark computations of laminar flow around a cylinder. Wiesbaden: Vieweg+Teubner Verlag; 1996. p. 547–66. 10.1007/978-3-322-89849-4_39 [DOI] [Google Scholar]
  • 40. Baker AH, Falgout RD, Kolev TV, Yang UM. Multigrid smoothers for ultraparallel computing. SIAM J Sci Comput. 2011;33:2864–87. [Google Scholar]
  • 41. Baker AH, Kolev TV, Yang UM. Improving algebraic multigrid interpolation operators for linear elasticity problems. Numer Linear Algebra Appl. 2009;17(2‐3):495–517. 10.1002/nla.688 [DOI] [Google Scholar]
  • 42. Napov A, Notay Y. An algebraic multigrid method with guaranteed convergence rate. SIAM J Sci Comput. 2012;34(2):A1079–109. 10.1137/100818509 [DOI] [Google Scholar]
  • 43. Demkowicz LF, Gopalakrishnan J, Schöberl J. Polynomial extension operators. Part I. SIAM J Numer Anal. 2008;46:3006–31. [Google Scholar]
  • 44. Demkowicz LF, Gopalakrishnan J, Schöberl J. Polynomial extension operators. Part II. SIAM J Numer Anal. 2009;47:3293–324. [Google Scholar]
  • 45. Demkowicz LF, Gopalakrishnan J, Schöberl J. Polynomial extension operators. Part III. Math Comput. 2012;81:1289–326. [Google Scholar]
  • 46. Bica I. Iterative substructuring algorithms for the P‐version finite element method for elliptic problems (PHD Thesis). USA: Courant Institute of Mathematical Sciences of New York University; 1997. AAI9808273. [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

The data that support the findings of this study are available from the corresponding author upon reasonable request.


Articles from Numerical Linear Algebra with Applications are provided here courtesy of Wiley

RESOURCES