Skip to main content
Springer logoLink to Springer
. 2015 Apr 1;132(2):347–367. doi: 10.1007/s00211-015-0718-5

A massively parallel nonoverlapping additive Schwarz method for discontinuous Galerkin discretization of elliptic problems

Maksymilian Dryja 1, Piotr Krzyżanowski 1,
PMCID: PMC5445549  PMID: 28615738

Abstract

A second order elliptic problem with discontinuous coefficient in 2-D or 3-D is considered. The problem is discretized by a symmetric weighted interior penalty discontinuous Galerkin finite element method with nonmatching simplicial elements and piecewise linear functions. The resulting discrete problem is solved by a two-level additive Schwarz method with a relatively coarse grid and with local solves restricted to subdomains which can be as small as single element. In this way the method has a potential for a very high level of fine grained parallelism. Condition number estimate depending on the relative sizes of the underlying grids is provided. The rate of convergence of the method is independent of the jumps of the coefficient if its variation is moderate inside coarse grid substructures or on local solvers’ subdomain boundaries. Numerical experiments are reported which confirm theoretical results.

Mathematics Subject Classification: 65N55

Introduction

In this paper we consider a second order elliptic equation

-div(ρu)=f,

with homogeneous Dirichlet boundary condition, where the diffusion coefficient ρ is a discontinuous function. The problem is discretized by a symmetric weighted interior penalty discontinuous Galerkin (DG) finite element method with simplicial nonmatching elements and piecewise linear functions. Our goal is to design and analyze a two-level nonoverlapping additive Schwarz method (ASM), see e.g. [16], for solving the resulting discrete problem with rate of convergence independent of the jumps of the coefficient and with a potential for a very high level of fine grained parallelism.

Usually, two level ASMs for discretizations on fine mesh of size h are defined by introducing a partitioning of the domain into subdomains of size H>h, where local solvers are applied in parallel. A global coarse problem is then based on the same partitioning. This method has recently been generalized for nonoverlapping domain decomposition methods for DG discretizations, allowing the coarse grid with mesh size HH to be a refinement of the original partitioning into subdomains where local solvers are applied—see e.g. [1, 14].

In the present paper, we take a different approach and consider local solvers’ subdomains of size H and a coarse grid of size H such that HH. Therefore, in an extreme case our local solver subdomain can be as small as a single element of the fine mesh (so then H=h); on the other extreme, it can be set equal to the coarse grid cell, H=H, the usual approach. By allowing small subdomains we substantially increase the level of parallelism of the method. Very small and cheap to solve local systems come in huge quantities, which can be an advantage on new multi-threaded processors. Moreover, small subdomains give more flexibility in assigning them to processors for load balancing in coarse grain parallel processing. In this way, an additional level of domain partitioning gives the user more parameters to fine tune the actual parallel performance, and thus overall efficiency, of the preconditioner for a given hardware architecture. The increased level of parallelism affects the condition number of the preconditioned system in a controlled way which we prove is, roughly speaking, of order OH2/hH. Numerical experiments reported in this paper confirm the bound is sharp in terms of mesh sizes.

In particular, if H=h we get the condition number of order O(H2/h2) which then gradually improves, as H increases, to well-known O(H/h) when H=H, see [14]. It is also not surprising that if all partitionings scale in the same way so that H/H and H/h are kept constant, then the condition number remains bounded independently of the actual values of H,H,h.

The method discussed in the paper makes the preconditioned system condition number independent of the jumps of diffusion coefficient ρ, under the assumption that the distribution of the coefficient satisfies certain assumptions. We identify two such cases: when the variation of the coefficient is mild inside cells of the coarse grid, or when the coefficient is close to a constant on the skeleton of the partitioning into local solvers’ subdomains.

The ASM discussed here is a generalization of [11] and, for continuous coefficient, of [1, 14]. See also [3] for a similar concept for continuous FE discretization where functions of the coarse space were constant inside substructures on which the original region was partitioned. The authors are unaware of other results concerning the influence of the sizes of local solver subdomains and the coarse grid on the condition number when the former grid is a refinement of the latter, in the context of DG methods for the discretization of elliptic problems with discontinuous coefficient. Other recent works towards domain decomposition preconditioning of DG discretizations of problems with strongly varying coefficients include [2, 5, 6].

The paper is organized as follows. In Sect. 2, differential and discrete DG problems are formulated. In Sect. 3, ASM for solving the discrete problem is designed and analyzed. Numerical experiments are presented in Sect. 4.

For nonnegative scalars x,y, we shall write xy if there exists a positive constant C, independent of x, y and mesh parameters h,H,H, and of jumps of the diffusion coefficient ρ as well, such that xCy. If both xy and yx, we shall write xy.

Differential and discrete DG problems

Let Ω be a bounded open polyhedral domain in Rd, d{2,3}, with Lipschitz boundary Ω. We consider the following variational problem for given fL2(Ω) and ρL(Ω):

Find uH01(Ω) such that

a(u,v)=(f,v)Ω,vH01(Ω), 1

where

a(u,v)=Ωρu·vdx,(f,v)Ω=Ωfvdx.

We assume that there exist constants α0 and α1 such that 0<α0ρα1 a.e. in Ω so that (1) is well-posed. Without loss of generality we shall additionally suppose that α01, which can always be guaranteed by simple scaling. This assumption will simplify the proof in Sect. 3.

In what follows we will analyze a preconditioner for a system of algebraic equations arising from a discretization of (1) with DG finite element method. The corresponding finite element spaces and the discrete problem are introduced below in the following subsection.

Finite element spaces and DG discretization

Let Th denote an affine, shape-regular but not necessarily conforming partition of Ω by triangles in 2-D or tetrahedrons in 3-D, Th={K1,,KNh}. We shall refer to Th as the “fine mesh”. The diameter of element KTh will be denoted by hK (assumed uniformly bounded from above by an absolute constant) and we collect all elements’ diameters in a multi-parameter h=(hK1,,hKNh).

By Eh0 we denote the set of all common (internal) faces (edges in 2-D) of elements in Th, so that eEh0 iff e=KiKj is of positive measure. We will use symbol Eh to denote the set of all faces (edges in 2-D) of fine mesh Th, that is those either in Eh0 or on the boundary Ω. For eEh we set he=diam(e).

We assume that Th is shape- and contact-regular in the sense of [9, Definition 1.38], that is, it admits a matching submesh Th~ which is shape-regular and such that for any KTh the ratios of hK to diameters of simplices in Th~ covering K are uniformly bounded by an absolute constant. In consequence, if e=KiKjEh0, then

hehKihKj. 2

Moreover, the number of neighboring elements in Th is bounded by an absolute constant.

For p{0,1}, we denote by Pp the set of polynomials of degree not greater than p. Then we define the finite element space Vh in which we will approximate (1),

Vh={vL2(Ω):v|KP1for allKTh}. 3

Note that traces of functions from Vh are multi-valued on the skeleton Eh.

We discretize (1) by the symmetric weighted interior penalty DG method, see for example [10, 13]:

Find uhVh such that

Ah(uh,vh)=(f,vh)Ω,vhVh, 4

where

Ah(u,v)KThρu,vK+eEhγ[u],[v]e-eEh([u],ρvωe+ρuω,[v]e).

Here for KTh and eEh we use standard notation

u,vK=Kuvdxandu,ve=euvdσ.

In what follows we shall assume that ρ is piecewise constant on Th (equal to its average value on each element), thus ρi:=ρ|Ki is constant for i=1,,Nh. On e=KiKj we set

γ=δheρiρjρi+ρj,ρuω=ωjρiui+ωiρjuj,[u]=uini+ujnj,

with ωj=ρj/(ρi+ρj). The unit normal vector pointing outward Ki is denoted by ni. On e which lies on the boundary of Ω and belongs to a face of Ki, we set ρuω=ρiui, [u]=uini and γ=δρi/he.

For sufficiently large δ the discrete problem (4) is well-defined, according to the following lemma:

Lemma 1

([10, 13]) There exists positive δ0 such that if δδ0 the bilinear form Ah(·,·) is symmetric, positive definite, and spectrally equivalent to a simplified form

Ah(u,v)=KThρu,vK+eEhγ[u],[v]e,

that is, there holds

Ah(u,u)Ah(u,u)uVh. 5

In what follows we shall take as granted that δ is a fixed parameter such that δδ0. The seminorm of a function f from the Sobolev space Hs(U) will be denoted by |f|Hs(U). For short, the L2-norm of f will then be denoted by |f|0,U or simply |f|U. We also define the broken norm ||u||1,h by the identity ||u||1,h2=Ah(u,u). Then there holds the following approximation result:

Lemma 2

([10, 13]) Let uH01(Ω) be the solution of (1), and let uhVh satisfy the discrete problem (4). If u|KH2(K) for all KTh, then

||u-uh||1,h2KThhK2ρ|K|u|H2(K)2.

Additive Schwarz method with small subdomains

The condition number of the discrete problem (4) can be prohibitively large, affected by both the fine mesh size and by the magnitude of jumps in ρ. Thus, for an iterative solution of (4), some preconditioning is necessary. In this section we consider an ASM whose ingredients are: a large number of local solvers on relatively small nonoverlapping subdomains, and a coarse grid solver defined on a possibly much coarser grid.

Let us therefore introduce TH as a partition of Ω into NH disjoint open polyhedral subdomains Ωi, i=1,,NH, such that Ω¯=i=1,,NHΩ¯i and that each Ωi is a union of certain elements from the fine mesh Th, which we will denote Th(Ωi)={KTh:KΩi}. We set Hi=diam(Ωi) and H=(H1,,HNH). We shall refer to this partition as the “local solvers’ grid”, because our ASM is going to solve (in parallel) local problems defined on the fine grid restricted to each of these subdomains.

Next, let TH be a division of Ω into NH disjoint open polyhedral regions Dn, n=1,,NH, such that Ω¯=n=1,,NHD¯n and that each Dn is a union of certain elements from the local solvers’ grid TH. We set Hn=diam(Dn) and then H=(H1,,HNH). We shall call this partition the “coarse grid”.

We clearly have NHNHNh and

THTHTh

(inclusions understood in the sense of subsequent refinements of the coarsest partitioning), and maxhmaxHmaxH. Note that in [1, 14] the inclusions come in a different order: THTHTh, making the use of very small subdomains infeasible due to excessive increase of the coarse space dimension.

An example partitioning of Ω into fine, coarse and local solvers’ grids is shown in Fig. 1.

Fig. 1.

Fig. 1

Relationship between Th, TH, TH. Thin lines correspond to the fine grid Th. Local solvers’ grid TH is marked with lines of medium width; an example local solvers’ subdomain Ωi is grayed. Coarse partition TH—here consisting of three local solvers’ subdomains per its element—is marked with thickest lines

For S belonging either to TH or to TH let us introduce the notation referring to the skeleton of the fine mesh restricted only to S:

Eh(S)={eEh:eS¯}

and its boundary and interior parts as well:

Eh(S)={eEh(S):eS},Eh0(S)=Eh(S)\Eh(S).

Finally, let us collect all fine grid faces belonging to the boundaries of elements of TH and TH, respectively, to denote the skeletons of TH and TH:

EH=i=1NHEh(Ωi)andEH=n=1NHEh(Dn).

We start the definition of the ASM by introducing a decomposition of Vh:

Vh=V0+i=1NHVi 6

where the coarse space is

V0={vVh:v|DnP0for alln=1,,NH}

and for i=1,,NH the local spaces are

Vi={vVh:v|Ωj=0for allji}. 7

Note that Vh is a direct sum of the local spaces. By choosing the lowest order coarse space, we reduce its dimension and, in consequence, the cost of solving the coarse problem.

Since now on, for φ defined on Ω, if necessary we shall write φi to denote the restriction of φ to Ωi:

φi:=φ|Ωi.

Observe that this brings a change from the notation of Sect. 2.1.

Using decomposition (6) we define local operators Ti:VhVi, i=1,,NH, by “inexact” solvers

Ah(Tiu,v)=Ah(u,v)vVi,

so that on each subdomain one has to solve only a relatively small system of linear equations for ui=Tiu|Ωi such that for all viVi

KTh(Ωi)ρui,viK+eEh0(Ωi)γ[ui],[vi]e+eEh(Ωi)eγuivi=Ah(u,vi).

(For ji we set (Tiu)|Ωj=0.) The coarse solve operator is T0:VhV0 defined analogously as

Ah(T0u,v0)=Ah(u,v0)v0V0.

Note that on V0, the approximate form Ah(·,·) coincides with Ah(·,·) and simplifies to

Ah(u0,v0)=eEHγ[u0],[v0]eu0,v0V0.

Finally, the preconditioned operator is

T=T0+i=1NHTi. 8

In order to formulate the condition number estimate result for T, we make two additional assumptions, that the elements of partition TH do not differ too much in shape, as well as those in TH:

  1. There exists a reference simply-connected polyhedron D^Rd to which all coarse grid partition elements DnTH are affinely homeomorphic and the aspect ratios of Dn, n=1,,NH, are uniformly bounded with constant independent of H, H and h. (An example of TH which satisfies this condition is a partition which forms a simplicial, shape-regular, not necessarily matching, partition of Ω.)

  2. There exists a reference simply-connected, polyhedral structure Ω^Rd to which all local solvers’ grid subdomains ΩiTH are affinely homeomorphic and the aspect ratios of Ωi, i=1,,NH, are uniformly bounded with constant independent of H, H and h. Moreover, the number of neighboring regions in TH is uniformly bounded by an absolute constant N. (An example of TH which satisfies this condition is a partition which forms a simplicial, shape-regular, not necessarily matching, locally uniform partition of Ω.)

Assumptions (A1) and (A2) are required for Poincaré’s and trace inequalities in the proof of Theorem 1.

Theorem 1

In addition to our general assumptions of Sect. 2, suppose that both (A1) and (A2) hold. Then T defined in (8) is symmetric with respect to Ah(·,·) and

β-1Ah(u,u)Ah(Tu,u)Ah(u,u)uVh,

where

β=maxn=1,,NHHn2hH_nRnR_n+maxi=1,,NHHih_irir_i

with mesh-dependent parameters defined as

h_i=min{hK:KTh(Ωi)},hH_n=min{h_iHi:ΩiDn,i=1,NH},

and coefficient-dependent parameters defined as

r_i=minρ|Ωi,ri=max{ρ|e:eEh(Ωi)},R_n=minρ|Dn,Rn=max{ri:ΩiDn,i=1,NH}.

Therefore, the condition number of the preconditioned operator T is O(β).

Before proceeding with the proof of Theorem 1, we state a useful trace inequality result for functions in Vh (see also [14], where the estimate of Lemma 3 is proved for a star-like region Ωi; here we do not need this assumption):

Lemma 3

Under the assumptions of Sect. 2 together with (A2), for any i=1,NH there holds

|v|0,Ωi21Hi|v|0,Ωi2+HiKTh(Ωi)|v|0,K2+eEh0(Ωi)1he|[v]|0,e2vVh.

Proof

Let us fix i=1,NH and let us denote by Th^ the fine mesh Th(Ωi) affinely mapped onto Ω^. It suffices to prove that for vVh~,

|v|0,Ω^2|v|0,Ω^2+||v||1,h^,Ω^2 9

on the reference domain Ω^, where for short we denote

||v||1,h^,Ω^2=KTh^|v|0,K2+eEh^0(Ω^)1h^e|[v]|0,e2,

and then apply the standard scaling argument. By (A2) and the assumptions on Th of Sect. 2.1, Th^ is also shape- and contact-regular, with relevant constants independent of h,H,H. Thus, Th^ admits a shape-regular matching submesh Th~, so it is sufficient to prove (9) on Th~.

Our proof will use technical tools and results from [4]. Let us consider two subspaces of Vh~: the space Vh~1 of nonconforming P1 finite elements [7] on Th~, and W~h~—the continuous Lagrange finite element space consisting of piecewise polynomials from P2 (in 2-D) or P3 (in 3-D).

Let I:Vh~Vh~1 and E:Vh~1W~h~ be operators defined in [4, Eq. (2.1) and (3.1)]. Let us recall that Iv is defined by its values at the centers of the faces

(Iv)(c)=1|e|evds

where c denotes the center of face e. The enriching operator E is defined by the nodal values of v, so that in node p,

(Ev)(p)=1npKV(p)v|K(p),

where V(p) is the set of elements in Th~ sharing node p, and np is the number of these elements.

We will use the following estimates from [4, Eq. (2.8), (2.9), (3.10)–(3.11) and estimates from Example 4.2]:

KTh~|Iv|0,K2||v||1,h~,Ω^2,KTh~h~K-1|v-Iv|0,K2||v||1,h~,Ω^2 10

for all vVh~1, and

|Ev|Ω^2|v|Ω^2,|Ev|Ω^2KTh~|v|0,K2,|Ev-v|Ω^2KTh~h~K|v|0,K2 11

for all vW~h~.

For vVh~ we have

|v|0,Ω^2|v-Iv|0,Ω^2+|Iv-E(Iv)|0,Ω^2+|E(Iv)|0,Ω^2. 12

By trace inequality and the last inequality of (10),

|v-Iv|0,Ω^2KTh~h~K-1|v-Iv|0,K2||v||1,h~,Ω^2.

Using the last estimate of (11) and then the first from (10) we get

|Iv-E(Iv)|0,Ω^2KTh~|Iv|0,K2||v||1,h~,Ω^2.

Finally, as E(Iv)H1(Ω^), we can apply standard trace inequality and use (11) and (10), to conclude that

|E(Iv)|0,Ω^2|E(Iv)|0,Ω^2+|E(Iv)|0,Ω^2|v|0,Ω^2+||v||1,h~,Ω^2.

Substituting the above inequalities into (12) we arrive at (9).

Proof (of Theorem 1)

We follow the abstract theory of additive Schwarz methods, cf. [16, Theorem 2.7], and prove three key properties for T0,T1,,TNH:

Strengthened Cauchy–Schwarz inequality It is straightforward to verify that if uVi and vVj with i,j{1,,NH} then Ah(u,v)=0, if only Ωi and Ωj are not neighbors, i.e. they do not share a face in EH0. Thus, we conclude that then

Ah(u,v)ϵijAh(u,u)1/2Ah(v,v)1/2

and the spectral radius of ϵ=(ϵij)i,j=1NH is bounded by N—the maximum number of neighbors of any element in TH. According to assumption (A2) N is bounded independently of the mesh parameters h and H (and, clearly, independently of other parameters of the problem).

Local stability For all i=0,1,,NH

Ah(u,u)ωAh(u,u)uVi,

with absolute constant ω independent of ρ, h, H and H. This is an obvious consequence of (5); in addition, ω1, because on V0 both forms coincide.

Stable decomposition We have to prove that there exist C0 independent of h,H,H,ρ, and a decomposition of uVh,

u=i=0NHu(i)withu(i)Vi, 13

such that

i=0NHAh(u(i),u(i))C02Ah(u,u)uVh. 14

In order to construct the stable decomposition of uVh, we first define u(0)V0 such that on each DnTH, n=1,,NH,

u|Dn(0)=u¯(n)=1|Dn|Dnudx.

Note that u(0) is constant on the local solvers’ subdomains Ωi, i=1,,NH, as well.

Next, for i=1,,NH, we define u(i)Vi, as a zero-extension of the restriction of u-u(0) to Ωi:

u(i)=u-u(0)onΩi,0elsewhere.

We obviously have, since u(0) is subdomainwise constant and its jumps cannot occur inside any element of TH,

i=1NHAh(u(i),u(i))=i=1NHKTh(Ωi)ρu,uK+i=1NHeEh0(Ωi)γ|[u]|0,e2+i=1NHeEh(Ωi)γ|(u-u(0))i|0,e2Ah(u,u)+i=1NHeEh(Ωi)γ|(u-u(0))i|0,e2.

Let us consider subdomain Ωi. Then, it follows that on eEh(Ωi) such that e=KIKJ and KITh(Ωi), KJTh(Ωj) there holds

γ=δheρ|KIρ|KJρ|KI+ρ|KJδhKIρ|KIrih_i

and analogously, if e lies on the boundary of Ω, then

γ=δρ|KIherih_i,

so that

eEh(Ωi)γ|(u-u(0))i|0,e2rih_ieEh(Ωi)|(u-u(0))i|0,e2=rih_i|(u-u(0))i|0,Ωi2.

From (A2) it follows that we can apply the trace inequality of Lemma 3 to u-ui(0) and obtain

|(u-u(0))i|0,Ωi21Hi|u-u(0)|Ωi2+HiKTh(Ωi)|u|0,K2.+eEh0(Ωi)1he|[u]|0,e2,

because again [ui(0)] vanishes on the inner skeleton Eh0(Ωi). Then,

i=1NHeEh(Ωi)γ|(u-u(0))i|0,e2i=1NHrih_iHi|u-u(0)|Ωi2+maxi=1,,NHrir_iHih_iAh(u,u).

Now,

i=1NHrih_iHi|u-u(0)|Ωi2=n=1NHi:ΩiDnrih_iHi|u-u(0)|Ωi2n=1NHRnhH_n|u-u¯(n)|Dn2.

Applying Poincaré’s inequality for discontinuous finite element functions [4, Theorem 5.1] (see also [8, 14]) on the matching submesh of Dn and then using the shape- and contact-regularity assumption followed by the scaling argument we get

|u-u¯(n)|Dn2Hn2KTh(Dn)|u|0,K2+eEh0(Dn)1he|[u]|0,e2Hn2i:ΩiDnKTh(Ωi)|u|0,K2+eEh0(Dn)1he|[u]|0,e2.

Because on eEh0(Dn) such that e=KIKJ there holds min{ρKI,ρKJ}2ρKIρKJ/(ρKI+ρKJ), we conclude that

R_n2γheδonEh0(Dn),

and therefore

|u-u¯(n)|Dn2Hn2i:ΩiDn1r_iKTh(Ωi)ρ|K|u|0,K2+1R_neEh0(Dn)γ|[u]|0,e2Hn21R_ni:ΩiDnKTh(Ωi)ρ|K|u|0,K2+eEh(Ωi)γ|[u]|0,e2.

From the above we can estimate

i=1NHeEh(Ωi)γ|(u-u(0))i|0,e2maxn=1,,NHHn2hH_nRnR_n+maxi=1,,NHHih_irir_iAh(u,u)

and in consequence

i=1NHAh(u(i),u(i))βAh(u,u)βAh(u,u),

the latter inequality following from Lemma 1.

It remains to bound Ah(u(0),u(0)). We have

Ah(u(0),u(0))=eEHγ|[u(0)]|0,e2eEHγ|[u-u(0)]|0,e2+eEHγ|[u]|0,e2

For any eEH such that e=KIKJ and KITh(Ωi) and KJTh(Ωj) we have

|[u-u(0)]|0,e2|(u-u(0))i|0,e2+|(u-u(0))j|0,e2,

so that

eEHγ|[u(0)]|0,e2i=1NHeEh(Ωi)γ|(u-u(0))i|0,e2+Ah(u,u)

Since the first term has already been estimated by βAh(u,u), we conclude that also

Ah(u(0),u(0))βAh(u,u),

which completes the proof.

Remark 1

In (A1) or (A2) we could have assumed the existence of a finite set of several such reference structures, the number of which is another absolute constant independent of h, H, H and the jumps in ρ.

Below we prove that the convergence speed of the method is independent of the magnitude of jumps of ρ, if the variation of coefficient ρ is assumed moderate:

  • either on the skeleton of the local solvers’ partition EH,

  • or on the coarse partition TH.

Observe that then large jumps of ρ are allowed, respectively, either on islands strictly inside local subdomains or on the boundaries of the coarse partition.

Corollary 1

In addition to the assumptions of Theorem 1 suppose that the variation of the coefficient ρ on the skeleton EH is uniformly bounded by an absolute constant of order 1:

ρ|e1eEH. 15

Then

cond(T)=Omaxn=1,,NHHn2hH_n+maxi=1,,NHHih_i.

Proof

Since ρ is normalized so that ρ1 it follows that 1r_i and 1R_n. Therefore 1/R_n1 and, since Eh(Ωi)EH for i=1,,NH,

rir_iri1,

so in consequence maxnRn1.

Corollary 2

In addition to the assumptions of Theorem 1 suppose that the variation of the coefficient ρ is uniformly bounded by an absolute constant within elements of the coarse partition TH:

ρ|Dnρ¯(n):=1|Dn|Dnρdx,n=1,,NH, 16

(for example, ρ can be piecewise constant on TH with arbitrary jumps across the interface EH). Then

cond(T)=Omaxn=1,,NHHn2hH_n+maxi=1,,NHHih_i.

Proof

By our assumption, for any i=1,,NH and for n such that ΩiDn we have

ri,r_iρ¯(n),

so that ri/r_i1, and for any n=1,,NH there holds

Rn,R_n,ρ¯(n)

as well.

Remark 2

If we suppose that (15) or (16) is satisfied and that all meshes Th, TH and TH are quasi-uniform, then (with a little abuse of notation) the expression for cond(T) simplifies to

cond(T)=OH2hH,

where h, H, H here mean the maximum diameter of elements in Th, TH and TH, respectively.

If each local solvers’ subdomain reduces to a single element of the fine mesh, i.e. TH=Th, one has to solve in parallel Nh=O(hd) local problems, which are just a very simple 3×3 (in 2-D) or 4×4 (in 3-D) system each, while the coarse problem remains fixed with (relatively small) size NH=O(Hd). The price to be paid for this massive parallelism is slower (as compared to the standard approach, cf. Corollary 4 below) convergence of the iteration:

Corollary 3

In addition to our general assumptions of Sect. 2, assume that TH=Th and (A1) holds together with (16). Then

cond(T)=Omaxn=1,,NHHn2minKTh(Dn)hK2.

Proof

Assumption (A2) is automatically satisfied since Ωi reduces to single element in Th, so the estimate follows directly from Corollary 2.

Theorem 1 also recovers previously known bounds, for constant or piecewise constant coefficient, in the “standard” case when TH=TH (see [1, 10, 14]), and extends them to the case of coefficient mildly varying over EH:

Corollary 4

In addition to our general assumptions of Sect. 2, assume that TH=TH and (A2) holds together with either (15) or (16). Then

cond(T)=Omaxi=1,,NHHiminKTh(Ωi)hK.

Proof

The proof follows straightforwardly from Corollaries 1 and 2 and thus is omitted.

For completeness, let us also mention the following:

Corollary 5

In addition to our general assumptions of Sect. 2, assume that Th=TH=TH. Then cond(T)=O(1).

Proof

Assumption (16) is automatically fulfilled on a single element, while (A1) and (A2) are trivially satisfied because of our assumptions on the fine grid in Sect. 2. The estimate then follows again from Corollary 2.

Although the condition number in Corollary 5 is independent both from h and the jumps of ρ, the preconditioned operator T is not robust in this particular case: the number of degrees of freedom in the coarse space operator T0 is unacceptably large, of order Nh, i.e. of the same order as the original size of the discrete problem. On the other hand, T0 is defined only on the space of piecewise constant functions.

Numerical experiments

Let us choose the unit square [0,1]2 as the domain Ω and for some prescribed integer M divide it into NH=2M×2M smaller squares Dn (n=1,,NH) of equal size. This coarse grid TH is then refined into a uniform local solvers’ 2M×2M square grid TH, which in turn is further refined into a uniform fine triangulation Th based on a square 2m×2m grid (mMM) with each square split into two triangles of identical shape. Hence, the grid parameters are h=2-m, H=2-M and H=2-M; obviously, there holds THTHTh. We discretize problem (1) on the fine mesh Th using (4) with δ=7.

In the following tables we report the number of Preconditioned Conjugate Gradient iterations for operator T which are required to reduce the initial Euclidean norm of the residual by a factor of 106 and (in parentheses) the condition number of T approximation computed from the extreme eigenvalues estimate based on the PCG coefficients, see e.g. [15, Sect. 6.7.3]. We always choose a random vector for the right hand side and zero as the initial guess.

Dependence on h, H, H

First, let us consider the convergence of the “massively parallel” method when TH=Th against “standard” approach, when TH=TH. For the diffusion coefficient we take an elementwise P0 approximation of a continuous function ρ(x)=x12+x22+1. As it turns out from Table 1, the condition number of the method considered in Corollary 3 indeed shows an O(H2/h2) behavior, as predicted, while methods which use local solves on subdomains of diameter at least H (e.g. [1, 14]) exhibit O(H/h) dependence, cf. Corollary 4 and Table 2.

Table 1.

Dependence of the number of iterations and the condition number (in parentheses) on H=2-M and h=2-m for the method with TH=Th

Coarse (M) Fine (m)
4 5 6 7
4 29 (22) 39 (40) 59 (1.1×102) 96 (3.8×102)
5 30 (23) 39 (40) 59 (1.1×102)
6 30 (23) 38 (40)
7 30 (23)

Slowly varying coefficient ρ

Table 2.

Dependence of the number of iterations and the condition number (in parentheses) on H=2-M and h=2-m for the method with TH=TH

Coarse (M) Fine (m)
4 5 6 7
4 27 (20) 35 (34) 46 (67) 62 (1.3×102)
5 28 (20) 35 (34) 46 (67)
6 28 (20) 35 (34)
7 28 (20)

Slowly varying coefficient ρ

Strongly discontinuous coefficient piecewise constant on TH

Here we deal with large discontinuities in ρ under restrictions of Corollary 3. The case of discontinuous coefficient when TH=TH (cf. Corollary  4) has already been treated elsewhere [12], so we restrict ourselves only to the case when TH=Th. Let us then consider ρ with discontinuities aligned with an auxiliary partitioning of Ω into 4×4 squares. Precisely, we introduce a red–black checkerboard coloring of this partitioning and set ρ equal to ρR=1 in red regions, and the value of ρB reported in Table 3 in black ones. In this way, our fine and coarse triangulations, with m=7 and M=4, are always aligned with the discontinuities, as required in Corollary 3. Table 3 confirms the condition number is independent from ρB in this case.

Table 3.

Dependence of the number of iterations and the condition number (in parentheses) on the discontinuity when the coefficient is constant inside coarse partition and TH=Th

ρB 100 102 104 106
Iter (cond) 134 (3.8×102) 143 (3.7×102) 160 (3.7×102) 181 (3.7×102)

Red–black 4×4 distribution of ρ, aligned with the coarse grid. Fixed H/h=8

Strongly discontinuous coefficient piecewise constant on Th

Next, we investigate elementwise discontinuous coefficient with m=7 and M=4 as before, but with ρ=1 on odd and ρ=ρB on even-numbered triangles of Th. Table 4 shows that in this case the preconditioner fails (a dash means the method did not converge in 600 iterations) for large jumps in ρ. This confirms the importance of controlled variation of the coefficient inside elements over the partition of the domain.

Table 4.

Dependence of the number of iterations and the condition number (in parentheses) on the discontinuity when the coefficient is elementwise discontinuous

ρB 100 102 104 106
Iter (cond) 134 (3.8×102) 435 (3.8×103) - (3.1×105) - (2.5×107)

Fixed H/h=8 and TH=Th

As stated in Corollary 5, in the unfeasible case when Th=TH=TH, the condition number of the preconditioned system is O(1) regardless of h and the jumps of ρ (parameters H and H do not apply here) and this is confirmed in experiments, as reported in Table 5.

Table 5.

Dependence of the number of iterations and the condition number (in parentheses) on the discontinuity and fine mesh size h=2-m when the coefficient is elementwise discontinuous and Th=TH=TH

ρB Fine (m)
3 4 5 6 7
100 40 (34) 44 (41) 45 (42) 47 (44) 47 (45)
106 38 (22) 41 (24) 42 (25) 66 (50) 64 (50)

Strongly discontinuous coefficient constant on EH

In Corollary 1 we show that in some circumstances one can allow very large variation of ρ even inside local solvers’ subdomains. Let us then choose ρ constant equal to 1, except for square islands, where we set ρ=106. The islands are centrally located in cells of a 25×25 independent division of Ω into squares. The size of every island equals half-length of the cell (see Fig. 2 for an example). In order to make the fine triangulation resolve the discontinuities of ρ well, we restrict ourselves only to m=8.

Fig. 2.

Fig. 2

Example distribution of coefficient ρ, considered in Sect. 4.4, depicted inside a single square interior element of TH (whose edges are marked with thick lines) when M=2. In gray islands ρ=106; elsewhere ρ=1. Local solvers’ grid marked with thinner lines for M=4. Note that in presented example, ρ on EH is constant

As it turns out from Table 6, if local solvers’ subdomains entirely cover the islands—that is, if M5—then ρ turns constant on EH and the performance of the preconditioner is not sensitive to large jumps in the coefficients inside subdomains, which is in agreement with Corollary 1. Moreover, in the case when there are jumps across EH and at the same time the coarse grid does not resolve the discontinuities well enough, i.e. M>5>M, the condition number becomes sensitive to the coefficient jumps.

Table 6.

Dependence of the number of iterations and the condition number (in parentheses) on H=2-M and H=2-M when the coefficient is discontinuous with contrast ratio 106 on small islands centrally placed on a 25×25 grid, cf. Fig. 2

Coarse (M) Local (M)
2 3 4 5 6 7 8
2 132 (4.9·102) 151 (5.8·102) 188 (8.6·102) 253 (1.4·103) – (5.6·108) – (5.1·108) – (1.4·109)
3 120 (3.1·102) 129 (3.5·102) 152 (4.7·102) – (1.6·108) – (1.4·108) – (3.7·108)
4 93 (1.7·102) 98 (1.8·102) 737 (4.7·107) 751 (4.3·107) 883 (1.1·108)
5 69 (9.0·101) 76 (1.1·102) 81 (1.1·102) 88 (1.3·102)
6 77 (1.2·102) 99 (1.3·102) 115 (1.5·102)
7 62 (5.2·101) 59 (4.6·101)
8

Fine grid parameter is h=2-m with m=8

When M5, we are back to the case when the coefficient is constant on TH (i.e. the case of Corollary 2) and results from Table 6 reflect this.

Conclusions

A nonoverlapping ASM preconditioner for symmetric interior penalty DG discretization of second order elliptic PDE with discontinuous coefficient on a nonmatching mesh Th has been presented. A very large number of small local problems defined by subdomains introduced by a domain partition TH is solved in parallel, together with one coarse problem of moderate size on a coarser partition TH such that THTHTh in the sense of subsequent refinements. Two cases of arrangement of the coefficient discontinuity relative to partitionings TH or TH have been identified, for which the condition number of the resulting system is O(H2/hH) independently of the jumps of the coefficient. This property allows one to design a massively parallel method with rate of convergence independent of the jumps of the coefficient. Our result also shows that the decrease of local solvers’ subdomains size H (i.e. the increase of parallelism) affects the condition number only linearly, while it turns out highly important to keep the diameter H of the coarse grid as small as possible, due to its quadratic influence on the condition number.

Acknowledgments

We would like to thank an anonymous referee whose comments and remarks helped to improve the paper. This research has been partially supported by the Polish National Science Centre Grant 2011/01/B/ST1/01179.

Contributor Information

Maksymilian Dryja, Email: m.dryja@mimuw.edu.pl.

Piotr Krzyżanowski, Email: p.krzyzanowski@mimuw.edu.pl.

References

  • 1.Antonietti PF, Ayuso B. Schwarz domain decomposition preconditioners for discontinuous Galerkin approximations of elliptic problems: non-overlapping case. M2AN Math. Model. Numer. Anal. 2007;41(1):21–54. doi: 10.1051/m2an:2007006. [DOI] [Google Scholar]
  • 2.Ayuso de Dios, B., Holst, M., Zhu, Y., Zikatanov, L.: Multilevel preconditioners for discontinuous Galerkin approximations of elliptic problems with jump coefficients. Math. Comp. 83, 1083–1120 (2014)
  • 3.Bjørstad, P.E., Dryja, M., Vainikko, E.: Additive Schwarz methods without subdomain overlap and with new coarse spaces. In: Domain Decomposition Methods in Science and Engineering (Beijing, 1995), pp. 141–157. Wiley, Chichester (1997)
  • 4.Brenner SC. Poincaré-Friedrichs inequalities for piecewise H1 functions. SIAM J. Numer. Anal. 2003;41(1):306–324. doi: 10.1137/S0036142902401311. [DOI] [Google Scholar]
  • 5.Brix, K., Pinto, C., Canuto, C., Dahmen, W.: Multilevel preconditioning of discontinuous-Galerkin spectral element methods part I: Geometrically conforming meshes. IGPM Preprint, RWTH Aachen (2013)
  • 6.Canuto C, Pavarino LF, Pieri AB. BDDC preconditioners for continuous and discontinuous Galerkin methods using spectral/hp elements with variable local polynomial degree. IMA J. Numer. Anal. 2014;34(3):879–903. doi: 10.1093/imanum/drt037. [DOI] [Google Scholar]
  • 7.Crouzeix, M., Raviart, P.-A.: Conforming and nonconforming finite element methods for solving the stationary Stokes equations. I. Rev. Française Automat. Informat. Recherche Opérationnelle Sér. Rouge 7(R-3), 33–75 (1973)
  • 8.Di Pietro DA, Ern A. Discrete functional analysis tools for discontinuous Galerkin methods with application to the incompressible Navier-Stokes equations. Math. Comp. 2010;79(271):1303–1330. doi: 10.1090/S0025-5718-10-02333-1. [DOI] [Google Scholar]
  • 9.Di Pietro, D.A., Ern, A.: Mathematical aspects of discontinuous Galerkin methods. In: Mathématiques & Applications (Berlin) [Mathematics & Applications], vol. 69. Springer, Heidelberg (2012)
  • 10.Dryja, M.: On discontinuous Galerkin methods for elliptic problems with discontinuous coefficients. Comput. Methods Appl. Math. 3(1):76–85 (electronic), (2003)
  • 11.Dryja, M., Krzyżanowski, P.: Additive Schwarz methods for DG discretization of elliptic problems with discontinuous coefficient. In: Domain Decomposition Methods in Science and Engineering XXII. Lecture Notes in Computer Science and Engineering. Springer, Berlin (to appear, 2015)
  • 12.Dryja, M., Krzyżanowski, P., Sarkis, M.: Additive Schwarz method for DG discretization of anisotropic elliptic problems. In: Erhel, J., Gander, M.J., Halpern, L., Pichot, G., Sassi, T., Widlund, O. (eds.) Domain Decomposition Methods in Science and Engineering XXI. Lecture Notes in Computational Science and Engineering, vol. 98, pp. 407–415. Springer, Berlin (2014)
  • 13.Ern A, Stephansen AF, Zunino P. A discontinuous Galerkin method with weighted averages for advection-diffusion equations with locally small and anisotropic diffusivity. IMA J. Numer. Anal. 2009;29(2):235–256. doi: 10.1093/imanum/drm050. [DOI] [Google Scholar]
  • 14.Feng, X., Karakashian, O.A.: Two-level additive Schwarz methods for a discontinuous Galerkin approximation of second order elliptic problems. SIAM J. Numer. Anal., 39(4):1343–1365 (electronic) (2001)
  • 15.Saad, Y.: Iterative methods for sparse linear systems. In: Society for Industrial and Applied Mathematics, 2nd edn., Philadelphia, PA (2003)
  • 16.Toselli, A., Widlund, O.: Domain decomposition methods—algorithms and theory. In: Springer Series in Computational Mathematics, vol. 34. Springer, Berlin (2005)

Articles from Numerische Mathematik are provided here courtesy of Springer

RESOURCES