Skip to main content
Springer logoLink to Springer
. 2022 Nov 8;92(1):301–334. doi: 10.1007/s11075-022-01445-1

Cross-points in the Dirichlet-Neumann method I: well-posedness and convergence issues

Bastien Chaudet-Dumas 1,, Martin J Gander 1
PMCID: PMC9829650  PMID: 36643714

Abstract

Cross-points in domain decomposition, i.e., points where more than two subdomains meet, have received substantial attention over the past years, since domain decomposition methods often need special attention in their definition at cross-points, in particular if the transmission conditions of the domain decomposition method contain derivatives, like in the Dirichlet-Neumann method. We study here for the first time the convergence of the Dirichlet-Neumann method at the continuous level in the presence of cross-points. We show that its iterates can be uniquely decomposed into two parts, an even symmetric part that converges geometrically, like when there are no cross-points present, and an odd symmetric part, which generates a singularity at the cross-point and is not convergent. We illustrate our analysis with numerical experiments.

Keywords: Domain decomposition methods, Dirichlet-Neumann methods, Cross-points, Elliptic problem

Introduction

Domain decomposition methods for partial differential equations are naturally defined and analyzed at the continuous level, like the original overlapping Schwarz method from 1869 [1], and also the original Dirichlet-Neumann [2] and the Neumann-Neumann [3] method. Even FETI (Finite Element Tearing and Interconnect) was first presented at the continuous level in the original publication [4], as a minimization problem, before the authors proceeded to the finite element discretization that led to its name. For symmetric and positive definite problems, early domain decomposition research focused then however on condition number estimates for such methods used as preconditioners at the discrete level, leading to groundbreaking results (see, e.g., [5] and references therein). The methods were thus intimately linked with the conjugate gradient method and not considered as standalone solvers, in contrast to multigrid methods, for example [6, 7]. For more general problems which are non-symmetric and/or indefinite, condition numbers are not the key quantities anymore for understanding their convergence when used as preconditioners, and directly studying preconditioning properties for more general Krylov methods becomes difficult. There has therefore been an effort to also investigate the underlying iterative versions of these methods, and the study of their convergence properties at the continuous level (see, for example, [8] and references therein). This reveals many interesting properties of domain decomposition methods which are masked by the Krylov method that can correct convergence problems when the domain decomposition method is used as preconditioner. An interesting example is the Additive Schwarz method, which needs Krylov acceleration to be used, while Restricted Additive Schwarz does not, since it corresponds directly to the discretization of the parallel Schwarz method of Lions [9], and thus converges as a standalone iterative method [10, 11].

We are interested here in understanding the convergence properties of the Dirichlet-Neumann method in the presence of cross-points. Cross-points in domain decomposition methods have become a focus of attention over the past years because of an increasing interest in the domain decomposition research community to better understand the discretization of domain decomposition methods at cross-points, and the influence on the convergence of the iterative solution. For the Helmholtz equation and Després’ seminal non-overlapping Schwarz method with Robin transmission conditions, cross-points do not hamper convergence [12], and the same holds more generally for non-overlapping optimized Schwarz methods when studied at the continuous level (see [13]). Care needs to be taken however when discretizing such methods (see, for example, [1418]), and this is even more important when higher order transmission conditions like Ventcell conditions are used [1923]. For the Neumann-Neumann method, a well-posedness issue has been identified in the presence of cross-points (see [24]), and the authors present a modification of the method to get around this difficulty. Also multitrace formulations pose problems at cross-points, and a solution involving specific non-local operators has been proposed in [25] (see also [26] for a purely algebraic formulation). There was even a dedicated mini-symposium on cross-points in domain decomposition methods at the last international conference on domain decomposition methods, DD27, in Hong Kong [27].

For the Dirichlet-Neumann method, the well-posedness issue in the presence of cross points was already mentioned in early work [28], but has so far not been fully analyzed for the iterative version of the algorithm. Most research works using this method or variants of this method do not encounter this problem. Indeed, many authors consider the case of domain decompositions with two subdomains [2, 29, 30] or many subdomains in stripes [31, 32], which excludes the presence of cross-points. Others use the Dirichlet-Neumann method as a preconditioner for a Krylov method (see, for example, [8, 33, 34]), which hides the problematic behavior of the Dirichlet-Neumann method. We focus here on a simple but instructive Laplace problem on a square divided into four squared subdomains of equal area. This allows us to develop a complete analytical understanding of the convergence of the Dirichlet-Neumann method in the presence of cross-points at the continuous level. We will show that the even symmetric part of the iteration converges like when no cross-points are present, but the odd symmetric part of the iteration generates singularities at cross-points and is thus not convergent. Even though our analysis is limited to the case of four subdomains, it reveals the behavior of the iterates locally at the cross-point. Therefore, it is representative of the behavior of the iterates near cross-points for more general domain decompositions of grid-shape. The study on how to correct the convergence problem of the odd symmetric part will be addressed in a further research paper.

Geometry and model problem

As shown in Fig. 1, we use as domain Ω2 for our Laplace model problem the square (− 1,1) × (− 1,1), divided into four non-overlapping square subdomains Ωi, iI:={1,2,3,4}, of equal area. With such a partition, there is one interior cross-point (red dot), and there are also four boundary cross-points (black dots). The presence of boundary cross-points has been identified as an obstacle for multitrace formulations, which requires some additional specific treatment (see, for example, [35, Section 2.4]). Conversely, these points are not an issue here for the Dirichlet-Neumann method. We denote the interfaces between adjacent subdomains by Γij := int(ΩiΩj), and the skeleton of the partition by Γ:=i,jΓ¯ij, and we have Γij = Γji for all i, j. We further denote the interior of the intersection between Ωi and the boundary Ω by Ωi0:=int(ΩiΩ), and the interior of the left, right, bottom, and top sides of Ω by Ωl, Ωr, Ωb, and Ωt. Thus, an arbitrary side of Ω is denoted by Ωσ, where σ is in the set of indices S:={l,r,b,t}. We use the same notation also for an arbitrary side of a subdomain Ωi, namely Ωi,σ with σS.

Fig. 1.

Fig. 1

Domain Ω divided into four square subdomains colored in gray and white

Even and odd symmetric functions

We recall now the definition of an even/odd symmetric function in multivariate calculus, and a useful decomposition result, which we express here in terms of functions in Lp, for p[1,+].

Definition 1 (Symmetric set)

Let n ≥ 1 be an integer. A subset U of n is said to be symmetric if, for any (x1,,xn)n,

(x1,,xn)U(x1,,xn)U.

Definition 2 (Even/odd symmetric functions)

Let Un be open and symmetric, and p[1,+]. A function hLp(U) is called even symmetric if for almost all (x1,⋯ ,xn) ∈ U,

h(x1,,xn)=h(x1,,xn).

Similarly, the function h is called odd symmetric if for almost all (x1,⋯ ,xn) ∈ U,

h(x1,,xn)=h(x1,,xn).

Theorem 1 (Even/odd decomposition)

Let Un be open and symmetric, and p[1,+]. Every function hLp(U) can be uniquely decomposed as the sum of an even and an odd symmetric function, both in Lp(U), which are called the even symmetric part and the odd symmetric part of the function. These functions, denoted by he and ho, are for almost all (x1,⋯ ,xn) ∈ U given by

he(x1,,xn):=12h(x1,,xn)+h(x1,,xn),ho(x1,,xn):=12h(x1,,xn)h(x1,,xn).

Proof 1

Taking the sum, we see that he + ho = h almost everywhere (a.e.) in U. Then, regarding uniqueness, let us assume that there exists another couple of even/odd symmetric functions (h~e,h~o)(he,ho) such that h~e+h~o=h a.e. in U. It follows that

(he+ho)(x1,,xn)=(h~e+h~o)(x1,,xn),for almost all(x1,,xn)U.

This implies that heh~e=h~oho a.e. in U. Since the left hand-side is even symmetric and the right hand-side is odd symmetric, we must have heh~e=h~oho=0 a.e. in U, which contradicts the initial assumption. □

Definition 3 (Symmetry preservation of operators)

Let X and Y be two Banach spaces such that XLp(U) and YLq(V ) for some open symmetric sets U, V and some p, q[1,+]. An operator T : XY is said to preserve symmetry if it satisfies the following properties:

  • for all hX such that h is even symmetric, Th is even symmetric,

  • for all hX such that h is odd symmetric, Th is odd symmetric.

The Laplace operator Δ : H2(Ω) → L2(Ω) preserves symmetry, which can be proved using the standard chain rule for C2 functions together with the density of C(Ω¯) in H2(Ω). In the same way, if p denotes an even symmetric function in W12,(Ω), one can prove that the operator (n+p):H32(Ω)H12(Ω) also preserves symmetry because for each x ∈Γ, n(−x) = −n(x).

Laplace model problem

We consider the Laplace problem with Dirichlet boundary condition on Ω, that is: find u solution to

Δu=finΩ,u=gonΩ, 1

where fH− 1(Ω) and gH12(Ω). Of course, since Ω is Lipschitz, it is known that (1) admits a unique solution uH1(Ω). We also consider the Laplace problem with Robin boundary condition: find u solution to

Δu=finΩ,(n+p)u=gonΩ, 2

where pL(Ω) (p ≥ 0 a.e. on Ω) is even symmetric, fH− 1(Ω) and gH12(Ω). To ensure that the problem is well-posed in H1(Ω), we assume that p is strictly positive on a subset of Ω of non-zero measure.

Regularity results

In this section, we briefly recall some important results about the theory of elliptic boundary value problems in nonsmooth two-dimensional domains, adapted to our specific context of a square. The general results in arbitrary polygons, together with their proofs, can be found in [36, Chapter 4], [37], and [38]. For a brief review on the subject, the reader is also referred to the lecture notes [39, Chapter 2].

H1(Ω) regularity

As it has just been mentioned, the standard variational approach to study problems (1) and (2) leads to existence and uniqueness of solutions in H1(Ω). However, for this result to hold, the regularity required on the boundary data is gH12(Ω) for the Dirichlet case and gH12(Ω) for the Neumann (Robin) case. This means that g can be identified as the trace on Ω of a function in H1(Ω) in the Dirichlet case. Similarly, in the Neumann (Robin) case, it can be identified as the normal derivative on Ω of a function in H1(Ω). When Ω is a polygon, the regularity on Ω can be expressed by means of the regularity on each side of the polygon associated with so-called compatibility relations at the corners (see [37, Chapter 1]). Let us introduce the set of corners C which consists in four pairs of indices in S:

C:=(l,b),(r,b),(r,t),(l,t).

For the reader’s convenience, the restriction of g to a part of the boundary Ωσ will be denoted by gσ:=gΩσ, for each σS. With these notations, we have the following useful characterization for the Dirichlet case: gH12(Ω) iff

gσH12(Ωσ),σS,and0εgσ(s)gσ(s)2dss<+,(σ,σ)C, 3

for some small ε > 0. There exists a similar (and simpler) characterization for the Robin case: gH12(Ω) iff

gσH12(Ωσ),σS. 4

Therefore, replacing the regularity conditions on the boundary data g in problems (1) and (2) by conditions (3) and (4) leads to well-posed formulations in H1(Ω).

H2(Ω) regularity

The existence and uniqueness results mentioned above only give us H1(Ω) regularity for the solution, which means u might not even be continuous since Ω2. Since we are interested in pointwise properties, especially what happens at the cross-point, we need more regular functions.

Theorem 2

(Dirichlet case) If in addition to the previous assumptions, we have fL2(Ω), gσH32(Ωσ) for all σS, and gσ(0)=gσ(0) for all (σ,σ)C, then the solution u to (1) is in H2(Ω).

Theorem 3

(Robin case) If in addition to the previous assumptions, we have fL2(Ω), pΩσC(Ω¯σ), and gσH12(Ωσ) for all σS, then the solution u to (2) is in H2(Ω).

We will also need regularity results for the mixed (Dirichlet/Neumann) problem for subproblems generated by the Dirichlet-Neumann method: let D and N be two subsets of S corresponding to the indices for Dirichlet and Neumann boundary conditions. In order to avoid well-posedness issues, we assume that D. The mixed problem reads: find u solution to

Δu=finΩ,u=gσDonΩσ,forσD,nu=gσNonΩσ,forσN. 5

The set of corners C can be split into three subsets C=CDCNCM corresponding to Dirichlet corners, Neumann corners, or mixed corners, such that for each (σ,σ)C,

(σ,σ)CDifσ,σD,CNifσ,σN,CMifσD,σN.

Theorem 4

(Dirichlet/Neumann case) If in addition to the previous assumptions, we have fL2(Ω), gσDH32(Ωσ) for σD, gσNH12(Ωσ) for σN, and

gσD(0)=gσD(0),(σ,σ)CD,0εgσD(s)gσN(s)2dss<+,(σ,σ)CM,

then the solution u to (5) is in H2(Ω).

Finally, let us state one last useful result about the regularity of such functions, which is a direct consequence of the Sobolev embedding theorem (see, for example, [40]).

Proposition 5

Let U be a bounded Lipschitz open subset of 2. Then, any function in H2(U) is also in C0(U¯).

Proof 2

From the Sobolev embedding theorem, since 2>32 and U2, we know that H2(U) is (continuously) embedded in the Hölder space Cb0,μ(U) for some μ ∈ (0,1). In addition, any function in Cb0,μ(U) is uniformly continuous on U; therefore, it can be extended to a continuous function on U¯. □

From now on, we will assume that the data satisfy the regularity required by the assumptions in Theorems 2 and 3. This ensures that the regularity of the solutions we deal with is at least H2(Ω).

Even/odd symmetric decomposition

We now decompose the problems (1) and (2) into two subproblems, in order to analyze the subproblems separately. With Theorem 1, we can uniquely decompose the data, and thus the associated problem, into the even symmetric part and the odd symmetric part. For problem (1), this leads to: find ue and uo solutions to

Δue=feinΩ,ue=geonΩ, 6
Δuo=foinΩ,uo=goonΩ. 7

These subproblems are still well-posed and the solutions still have H2(Ω) regularity. Using the symmetry preserving property of the operator Δ : H2(Ω) → L2(Ω), we see that ue is even symmetric and uo is odd symmetric. Moreover, since (−Δ) is linear and the boundary conditions are linear as well, ue + uo solves (1). Therefore, ue + uo = u, and since the decomposition is unique, the solution to (6) ue coincides with ue, the even symmetric part of u, and similarly uo = uo. As we will see, the convergence analysis of the Dirichlet-Neumann method reveals different behaviors for the even and odd symmetric subproblems. Note that the geometric domain decomposition itself is also symmetric with respect to the origin (0,0).

As for the Dirichlet problem, we define the even and odd symmetric parts of (2), and still denote by ue and uo their solutions. When p is even symmetric, in addition to the operator Δ, we have seen that the operator (n+p):H32(Ω)H12(Ω) also preserves symmetry. Hence, the even and odd symmetry properties of the solutions ue and uo. Thus, the linearity of (2) yields ue + uo = u, and the uniqueness of the decomposition finally leads to ue = ue and uo = uo like in the Dirichlet case.

Analysis of the Dirichlet-Neumann method

We use as in [8, Section 1.4] a gray and white coloring (see Fig. 1) and define the sets of indices IG:={1i4:Ωiis gray}={2,4} and IW:=IIG={1,3}. The transmission conditions are indicated in Fig. 1, where “D” stands for Dirichlet and “N” for Neumann. Given an initial guess u0 and a relaxation parameter 𝜃, each iteration k ≥ 1 of the method can be split into two steps:

  • (Dirichlet step) Solve for all iIW
    Δuik=finΩi,uik=gonΩi0,uik=𝜃ujk1+(1𝜃)uik1onΓij,jIGs.t.Γij.
  • (Neumann step) Solve for all iIG
    Δuik=finΩi,uik=gonΩi0,niuik=njujkonΓij,jIWs.t.Γij.

To start the Dirichlet-Neumann method, we need an initial guess u0, or equivalently λ0 := u0Γ, since only the traces of u0 on the interfaces Γij are used in the initialization step k = 1. This initial guess needs to satisfy the following compatibility condition.

Definition 4 (Compatible initial guess)

An initial guess u0 (or equivalently λ0) is said to be compatible with the Dirichlet boundary condition if it satisfies u0Ω∩Γ = gΓ (or equivalently λ0 = g a.e. on Ω ∩Γ representing the set of boundary cross-points).

In what follows, we fix an initial guess λ0 such that λ0C0(Γ)H32(Γij) for all (i,j) such that Γij, and λ0 is compatible with the boundary condition.

Case of the even symmetric part

We begin with applying the Dirichlet-Neumann method to the even symmetric part of problem (1).

Theorem 6

Taking λe0 as the initial guess for the Dirichlet-Neumann method applied to the even symmetric part of problem (1) produces a sequence {uek}k that converges geometrically to the solution ue in the L2-norm and the broken H1-norm, for any 𝜃 ∈ (0,1). Moreover, the convergence factor is given by ∣1 − 2𝜃∣, which also proves that this method becomes a direct solver for the specific choice 𝜃=12.1

Proof 3

We perform the first two iterations of the Dirichlet-Neumann method in terms of the local errors eik:=uiuik where ui:=uΩi is the restriction of the original solution to the i–th subdomain (see Section 4 (Example 1) for a numerical illustration).

Iteration k = 1, Dirichlet step: In Ω1, we solve

Δee,11=0inΩ1,ee,11=0onΩ10,ee,11=ueλe0onΓ12Γ41.

Since λe0 is compatible with the even part of the Dirichlet boundary condition and ueΩ1,σH32(Ω1,σ) for all σS, by Theorem 2, ee,11H2(Ω1) exists and is unique. Moreover, we know that it is also continuous in Ω¯1 due to Proposition 5.

In the same way, we solve in Ω3

Δee,31=0inΩ3,ee,31=0onΩ30,ee,31=ueλe0onΓ23Γ34.

Since ueλe0 is even symmetric, it follows that the only solution ee,31H2(Ω3) to this problem verifies ee,31(x,y)=ee,11(x,y), for all (x,y)Ω¯3.

Iteration k = 1, Neumann step: Now, in Ω2, we solve

Δee,21=0inΩ2,ee,21=0onΩ20,xee,21=xee,11=x(ee,11(x,y))x=0onΓ12,yee,21=yee,31=y(ee,11(x,y))y=0=y(ee,11(x,y))y=0onΓ23.

This problem is well-posed in H1(Ω2). In addition, it is clear that the function defined in Ω2 by (x,y)ee,11(x,y) solves the problem. By uniqueness, one deduces that the solution ee,21 is given by ee,21(x,y)=ee,11(x,y), for all (x,y) ∈Ω2. Note that this equality extends to the whole Ω¯2. Again, in the exact same way, we get that the solution ee,41 in Ω4 is given by ee,41(x,y)=ee,11(x,y), for all (x,y)Ω¯4.

We are left with a recombined error ee1 (defined in Ω ∖Γ) that is discontinuous across all parts of the skeleton Γ where ee,110 (see Fig. 3c). This may lead to discontinuities for the recombined solution ue1=ue+ee1. Also note that ee1 is even symmetric in Ω ∖Γ.

Fig. 3.

Fig. 3

Results for the DN method applied to (6) (Example 1)

Iteration k = 2, Dirichlet step: In Ω1, we solve

Δee,12=0inΩ1,ee,12=0onΩ10,ee,12=𝜃ee,21+(1𝜃)ee,11=(12𝜃)ee,11onΓ12,ee,12=(12𝜃)ee,11onΓ41.

The unique solution to this problem is ee,12=(12𝜃)ee,11. In the exact same way, we get in Ω3, ee,32=(12𝜃)ee,31.

Iteration k = 2, Neumann step: Now, in Ω2, we solve

Δee,22=0inΩ2,ee,22=0onΩ20,xee,22=xee,12=(12𝜃)xee,11onΓ12,yee,22=yee,32=(12𝜃)yee,31onΓ23.

The unique solution to this problem is ee,22=(12𝜃)ee,21. Again, in the exact same way, we get in Ω4, ee,42=(12𝜃)ee,41. For all 𝜃 ∈ (0,1), the recombined solution ee2 is exactly (12𝜃)ee1.

Iterations k ≥ 3: From the analysis of the first two iterations, it follows by induction that, at iteration k, one has

eek=(12𝜃)k1ee1inΩΓ,

(see Fig. 3d). Therefore, the proposed domain decomposition method converges geometrically to the solution ue both in the L2-norm and the broken H1-norm for all 𝜃 ∈ (0,1),

ueuekL2(Ω)C12𝜃k1andiIue,iue,ikH1(Ωi)C12𝜃k1.

Note that the recombined solution uek is in general not continuous across the skeleton Γ. □

Remark 1

It is actually not difficult to find an initial guess λ0 satisfying the assumptions of Theorem 6: the simplest way is to build a piecewise linear function on Γ. If we denote Pk, k ∈{1,⋯ ,4}, the four boundary cross points, and set λ0(Pk) := g(Pk) for each k, then λ0 is compatible with the Dirichlet boundary condition. Next, we set λ0(0,0):=14kλ0(Pk) and perform a linear reconstruction on each interface Γij, which ensures that λ0C0(Γ).

Of course, any other choice for λ0(0,0) would work as well, but this specific choice leads to a function λ0 with minimal slopes as it satisfies

14kλ0(Pk)=argminαkλ0(Pk)α2.

Case of the odd symmetric part

Let us now turn to the odd symmetric part of problem (1). Given our initial guess, we obtain the following result.

Theorem 7

The Dirichlet-Neumann method applied to the odd symmetric part of problem (1) is not well-posed. More specifically, taking λo0 as the initial guess, there exists an integer k0 > 0 such that the solution to the problem obtained at the k0-th iteration is not unique. In addition, all possible solutions uok0 are singular at the cross-point, with a leading singularity of type (lnr)2.

The previous result shows that in this case, at some point, the Dirichlet-Neumann method is not applicable anymore. In practice, since we are able to find a solution to this ill-posed problem, one may wonder if it is possible to recover a nice behavior of the method if we go past this iteration k0. The next theorem provides a negative answer.

Theorem 8

If we let the Dirichlet-Neumann method go beyond the ill-posed iteration k0 from Theorem 7, we end up with a sequence {uok}kk0 of non-unique iterates. Moreover, for each kk0, all possible uok are singular at the cross-point, with a leading singularity of type (lnr)2(kk0)+2.

Before giving the proofs of these theorems, we need four technical lemmas which provide solutions to the Laplace problem on the two-dimensional cone C:=+×(π4,π4) with different types of Dirichlet and Neumann boundary conditions on C:=+×{π4} and C+:=+×{π4} (see Fig. 2).

Fig. 2.

Fig. 2

Cone C and its boundaries

Lemma 9

For any integer q ≥ 0, there exist coefficients (αD,j,mq)j,m such that the function vDq defined in polar coordinates for all (r,ϕ) ∈ C by

vDq(r,ϕ):=(lnr)q+j,m=1q2αD,j,mqϕ2j(lnr)q2m

is in L2(C)CC¯{(0,0)} and solves

Δv=0inC,v=(lnr)qonCC+. 8

Proof 4

Let us proceed by induction.

Base case. The cases q = 0 and q = 1 are easily verified. Indeed, vD0:=1 and vD1:=lnr clearly solve (8) for q = 0 and q = 1, respectively.

Induction step. Let q ≥ 1 be fixed. We assume that the result of the lemma holds for all q. In order to find a solution to (8) for q + 1, we begin with the initial guess (lnr)q+1, which obviously satisfies the boundary condition. First, we compute a correction rDq+1 such that (lnr)q+1+rDq+1 is harmonic in C. Then, since the boundary conditions are no longer satisfied due to this first correction, we compute a second correction r~Dq+1 such that (lnr)q+1+rDq+1+r~Dq+1 solves (8).

For the first step, we start by computing the Laplacian in polar coordinates. Let us recall its expression for some smooth function f depending on (r,ϕ)

Δf=2fr2+1rfr+1r22fϕ2.

For our intial guess (lnr)q+1, this leads to

Δ(lnr)q+1=(q+1)q(lnr)q1r2.

We can now cancel the term remaining on the right by adding on the left

Δ(lnr)q+112ϕ2(q+1)q(lnr)q1=12ϕ2(q+1)(q2)(lnr)q3r2.

Again, to remove the new term on the right, we add on the left

Δ(lnr)q+112ϕ2(q+1)q(lnr)q1+14!ϕ4(q+1)(q2)(lnr)q3=14!ϕ4(q+1)(q4)(lnr)q5r2,

and continuing until the exponent on the (lnr) term in the right hand side reaches 0 or 1 gives

Δ(lnr)q+1+j=1q+12(1)j1(2j)!ϕ2j(q+1)(q+22j)(lnr)q+12j=0.

Therefore, introducing βjq+1:=(1)jq+12j for all j, and defining the correction

rDq+1:=j=1q+12βjq+1ϕ2j(lnr)q+12j,

we get a function (lnr)q+1+rDq+1 that is harmonic and is in L2(C)CC¯{(0,0)}.

For the second step, let us note that this function verifies

(lnr)q+1+rDq+1=(lnr)q+1+j=1q+12βjq+1π42j(lnr)q+12j

on CC+. From the induction hypothesis, we know that for each j, there exists a function vDq+12j that solves (8) for q + 1 − 2j. Therefore, if we define

r~Dq+1:=j=1q+12βjq+1π42jvDq+12j,

we obtain a function vDq+1:=(lnr)q+1+rDq+1+r~Dq+1 that solves (8) for q + 1 and is in L2(C)CC¯{(0,0)}. In addition, given the expressions of the corrections rDq+1 and r~Dq+1, it follows that vDq+1 can be written as

vDq+1(r,ϕ)=(lnr)q+1+j,m=1q+12αD,j,mq+1ϕ2j(lnr)q+12m,

where the coefficients αD,j,mq+1 depend on the βjq+1 and the αD,j,m, for q − 1. □

Lemma 10

For any integer q ≥ 0, there exist coefficients (αD,j,mq)j,m such that the function vDq defined in polar coordinates for all (r,ϕ) ∈ C by

vDq(r,ϕ):=4πϕ(lnr)q+j,m=1q2αD,j,mqϕ2j+1(lnr)q2m

is in L2(C)CC¯{(0,0)} and solves

Δv=0inC,v=(lnr)qonC,v=(lnr)qonC+. 9

Proof 5

Let us proceed by induction, in the same way as in the proof of Lemma 9.

Base case. It is not difficult to check that vD0:=4πϕ and vD1:=4πϕlnr solve (9) for q = 0 and q = 1, respectively.

Induction step. Let q ≥ 1 be fixed. We assume that the result of the lemma holds for all q. As for Lemma 9, in order to find a solution to (9) for q + 1, we proceed in two steps, this time starting from 4πϕ(lnr)q+1 as initial guess.

For the first step, following a similar iterative approach, we obtain a correction

rDq+1:=4πϕrDq+1=j=1q+12βjq+1ϕ2j+1(lnr)q+12j,

where βjq+1:=4π(1)jq+12j for all j. This enables us to get a function 4πϕ(lnr)q+1+rDq+1 that is harmonic and is in L2(C)CC¯{(0,0)}. However, we have

4πϕ(lnr)q+1+rDq+1=±(lnr)q+1+j=1q+12βjq+1π42j+1(lnr)q+12j

on C±. This notation means that the sign depends on which part of the boundary is considered: + on C+ and − on C. Therefore, using the induction hypothesis, we introduce a second correction

r~Dq+1:=j=1q+12βjq+1π42j+1vDq+12j,

such that vDq+1:=4πϕ(lnr)q+1+rDq+1+r~Dq+1 solves (9) for q + 1 and is in L2(C)CC¯{(0,0)}. In addition, this function can be written as

vDq+1(r,ϕ)=4πϕ(lnr)q+1+j,m=1q+12αD,j,mq+1ϕ2j+1(lnr)q+12m,

where the coefficients αD,j,mq+1 depend on the βjq+1 and the αD,j,m, for q − 1. □

Lemma 11

For any integer q ≥ 0, there exist coefficients (αN,j,mq)j,m such that the function vNq defined in polar coordinates for all (r,ϕ) ∈ C by

vNq(r,ϕ):=ϕ(lnr)q+j,m=1q2αN,j,mqϕ2j+1(lnr)q2m

is in L2(C)CC¯{(0,0)} and solves

Δv=0inC,ϕv=(lnr)qonCC+. 10

Proof 6

Again, we proceed by induction, in the same spirit as in the proofs of the previous lemmas.

Base case Obviously, vN0:=ϕ and vN1:=ϕlnr solve (10) for q = 0 and q = 1, respectively.

Induction step Let q ≥ 1 be fixed. The result of the lemma is assumed to hold for all q. As before, we aim at finding a solution to (10) for q + 1 by proceeding in two steps, this time starting from ϕ(lnr)q+1 as initial guess.

This initial guess is the same as in the proof of Lemma 10 (up to a factor 4π); therefore, we have for the first correction

rNq+1:=ϕrDq+1=j=1q+12βjq+1ϕ2j+1(lnr)q+12j,

where βjq+1:=(1)jq+12j for all j. This choice ensures that ϕ(lnr)q+1+rNq+1 is harmonic and is in L2(C)CC¯{(0,0)}. However, the boundary condition satisfied by this new function is

ϕϕ(lnr)q+1+rNq+1=(lnr)q+1+j=1q+12(2j+1)βjq+1π42j(lnr)q+12j

on CC+. This time, the induction hypothesis leads to a second correction

r~Nq+1:=j=1q+12(2j+1)βjq+1π42jvNq+12j.

Finally, we define vNq+1:=ϕ(lnr)q+1+rNq+1+r~Nq+1, which is solution to (10) for q + 1 and is in L2(C)CC¯{(0,0)}. Moreover, we have for this function the expression

vNq+1(r,ϕ)=ϕ(lnr)q+1+j,m=1q+12αN,j,mq+1ϕ2j+1(lnr)q+12m,

where the coefficients αN,j,mq+1 depend on the βjq+1 and the αN,j,m, for q − 1. □

Lemma 12

For any integer q ≥ 0, there exist coefficients (αN,j,mq)j,m such that the function vNq defined in polar coordinates for all (r,ϕ) ∈ C by

vNq(r,ϕ):=4π12ϕ2(lnr)q1(q+1)(q+2)(lnr)q+2+j,m=2q2+1αN,j,mqϕ2j(lnr)q+22m

is in L2(C)CC¯{(0,0)} and solves

Δv=0inC,ϕv=(lnr)qonC,ϕv=(lnr)qonC+. 11

Proof 7

We keep proceeding by induction.

Base case Take q = 0. Then we have vN0:=2πϕ2(lnr)2, which is indeed solution to (11) for q = 0.

Induction step Let q ≥ 1 be fixed. The result of the lemma is assumed to hold for all q. In order to find a solution to (11) for q + 1, we follow the usual two steps starting from the initial guess 2πϕ2(lnr)q+1, which satisfies the boundary conditions.

For the first step, we reuse the computations performed in the proof of Lemma 9, replacing q + 1 by q + 3. Rewriting the function (lnr)q+3+rDq+3, we get that

(lnr)q+312ϕ2(q+3)(q+2)(lnr)q+1+j=2q+32(1)jq+32jϕ2j(lnr)q+32j

is a harmonic function. We can easily deduce from this a first correction for our initial guess,

rNq+1:=4π1(q+3)(q+2)(lnr)q+3+j=2q+32βjq+1ϕ2j(lnr)q+32j,

where βjq+1:=4π(1)j+1(q+3)(q+2)q+32j for all j. As desired, the new function 2πϕ2(lnr)q+1+rNq+1 is harmonic and belongs to L2(C)CC¯{(0,0)}. In addition, it satisfies

ϕ2πϕ2(lnr)q+1+rNq+1=±(lnr)q+1+j=2q+32(2j)βjq+1π42j1(lnr)q+32j

on C±. Again, using the induction hypothesis for all q − 1, we obtain a second correction

r~Nq+1:=j=2q+32(2j)βjq+1π42j1vNq+32j.

Therefore, we are able to build a function vNq+1:=2πϕ2(lnr)q+1+rNq+1+r~Nq+1 that solves (11) for q + 1 and is in L2(C)CC¯{(0,0)}, namely

vNq+1(r,ϕ)=4π12ϕ2(lnr)q+11(q+2)(q+3)(lnr)q+3+j,m=2q+12+1αN,j,mq+1ϕ2j(lnr)q+32m,

where the coefficients αN,j,mq+1 depend on the βjq+1 and the αN,j,m, for q − 1. □

We can now prove Theorem 7 and Theorem 8.

Proof 8 (Proof of Theorem 7)

We want to prove that the algorithm has a nice behavior up to some iteration k0, where the iterate becomes non-unique and singular near the cross-point, with a leading singularity of type (lnr)2. The idea is to show that, in general, after two iterations only, the approximate solution given by the method is singular near the cross-point. In order to do so, let us apply the Dirichlet-Neumann method step by step to (7), and write the local subproblems in terms of the local errors eo,ik.

Iteration k = 1, Dirichlet step: In Ω1, we solve

Δeo,11=0inΩ1,eo,11=0onΩ10,eo,11=uoλo0onΓ12Γ41.

As for the even symmetric case, by Theorem 2, eo,11H2(Ω1)C0(Ω¯1) exists and is unique. In the same way, we solve in Ω3

Δeo,31=0inΩ3,eo,31=0onΩ30,eo,31=uoλo0onΓ23Γ34.

Since uoλo0 is odd symmetric, it follows that the unique solution eo,31 to this problem verifies, for all (x,y)Ω¯3, eo,31(x,y)=eo,11(x,y). Note that the recombined solution is continuous across the cross-point from Ω1 to Ω3 because eo,11(0,0)=(uoλo0)(0,0)=0, since (uoλo0) is odd symmetric (see Fig. 5b).

Fig. 5.

Fig. 5

Results for the DN method applied to (7) (Example 3)

Iteration k = 1, Neumann step: Now, in Ω2, we solve

Δeo,21=0inΩ2,eo,21=0onΩ20,xeo,21=xeo,11=x(eo,11(x,y))x=0onΓ12,yeo,21=yeo,31=y(eo,11(x,y))y=0=y(eo,11(x,y))y=0onΓ23.

Here again, we know the problem is well-posed in H1(Ω2). However, in contrast to the even symmetric case, we cannot argue that ±eo,11(x,y) solves this problem. There is a sign incompatibility in the boundary condition: minus sign on Γ12 and plus sign on Γ23. The solution eo,21 cannot be expressed explicitly. Nevertheless, since eo,11H2(Ω1), we know that the trace eo,11(,1) on the bottom side of Ω1 and the normal derivative xeo,11(0,) on the right side of Ω1 satisfy the compatibility relation in Theorem 4 at the mixed corner (0,− 1). Therefore, as eo,11(,1)=0, this compatibility relation is also satisfied by the boundary conditions enforced in the previous problem at this same corner (0,− 1) in Ω2. The same argument can be used for the other mixed corner (1,0). Moreover, the H2 regularity of eo,11 also implies that xeo,11H12(Γ12) and yeo,31H12(Γ23), which finally yields eo,21H2(Ω2)C0(Ω¯2) by Theorem 4 and Proposition 5. Despite this additional regularity property, we are still not able to express the solution. Especially, we do not know the value of eo,21 at (0,0). For the reader’s convenience, let us denote it by δ1:=eo,21(0,0). Then, in Ω4, we get that the solution eo,41 is given by eo,41(x,y)=eo,21(x,y), for all (x,y)Ω¯4. Therefore, the recombined solution jumps across the cross-point from δ1 in Ω2 to − δ1 in Ω4. This time, we are left with a recombined error eo1 that is odd symmetric in Ω ∖Γ, and discontinuous across the cross point (see Fig. 5b).

Iteration k = 2, Dirichlet step: In Ω1, we solve

Δeo,12=0inΩ1,eo,12=0onΩ10,eo,12=𝜃eo,21+(1𝜃)eo,11onΓ12,eo,12=𝜃eo,41+(1𝜃)eo,11onΓ41. 12

Since the boundary conditions are continuous on Γ¯12 and Γ¯41, we are able to compute their limits at the cross-point, which yields

lim(x,y)(0,0)(x,y)Γ12𝜃eo,21+(1𝜃)eo,11(x,y)=𝜃δ1,lim(x,y)(0,0)(x,y)Γ41𝜃eo,41+(1𝜃)eo,11(x,y)=𝜃δ1.

In other words, whenever δ1≠ 0, the method enforces a discontinuous Dirichlet boundary condition at this step, which may lead to a singular solution since the compatibility relation (3) is no longer satisfied. Especially, the problem is not necessarily well-posed so the Dirichlet-Neumann method might not even be valid in this case. Note that there is no other discontinuity enforced since the boundary conditions on Γ12 and Γ41 extend to 0 at Γ¯12Γ¯1 and Γ¯41Γ¯1.

Case δ1≠ 0 In what follows, we prove existence and uniqueness of eo,12, exhibiting the type of singularity induced by this nonsmooth boundary condition. In order to do so, we try to decompose eo,12 as the sum of a regular part v12 and a singular part w12, in the same spirit as in [37] for more regular problems. First, for each iI, let us introduce the angle ϕi ∈ (0,2π) such that the rotation Ri of angle − ϕi, given in polar coordinates by

Ri:(r,ϕ)r,ϕϕi,

maps the quadrant containing Ωi onto the cone C. More specifically, we have

ϕ1:=5π4,ϕ2:=7π4,ϕ3:=π4,ϕ4:=3π4.

Using these notations, we define w12:=(𝜃δ1)vD0R1, whose expression in polar coordinates (r,ϕ) reads

w12(r,ϕ)=𝜃δ14πϕϕ1. 13

We know from Lemma 10 that w12 is of class C in (+)2{(0,0)}, and that it satisfies

Δw12=0in×,w12=𝜃δ1on{0}×,w12=𝜃δ1on×{0}.

Then, since we would like v12+w12 to solve (12), we must define v12 such that

Δv12=0inΩ1,v12=w12onΩ10,v12=𝜃eo,21+(1𝜃)eo,11w12onΓ12,v12=𝜃eo,41+(1𝜃)eo,11w12onΓ41.

Note that the Dirichlet boundary condition enforced here is in C0(Ω1)H12(Ω1,σ) for all σS. Therefore, v12H1(Ω1) exists and is unique. Therefore, we have built (in a unique way) a solution v12+w12 to (12) which is in L2(Ω1)H1(Ω1). Indeed, it is easy to show that w12 is in L2(Ω1), but not in H1(Ω1) since

w122=𝜃δ14π21r2.

Now, in order to conclude that eo,12=v12+w12, we must have uniqueness of the solution to (12) in L2(Ω1). This uniqueness property is indeed guaranteed since we know from [37, Theorem 4.4.3.3] that the subspace of all solutions zL2(Ω1) to

Δz=0inΩ1,z=0onΩ1,

is of dimension 0. Hence, eo,12:=v12+w12 exists and is unique.

In the same way, one can conclude that, in Ω3, eo,32:=v32+w32 exists and is unique, with v32H1(Ω3) and w32L2(Ω3)H1(Ω3). Of course, v32 and w32 can be obtained immediately from v12 and w12 using symmetry arguments, which gives for w32

w32(r,ϕ)=𝜃δ14πϕϕ3. 14

It is now clear that the algorithm generates a singular solution at this step. In order to estimate how the singularity propagates in the Neumann step, let us keep going and see what happens.

Iteration k = 2, Neumann step: In Ω2, we solve

Δeo,22=0inΩ2,eo,22=0onΩ20,xeo,22=xeo,12onΓ12,yeo,22=yeo,32onΓ23. 15

Due to the lack of regularity of eo,12 and eo,32, standard results fail to apply, so that existence and uniqueness of eo,22 are not guaranteed. As in subdomains Ω1 and Ω3, we decompose eo,22 as the sum of a regular part v22 and a singular part w22, exhibiting the singularity of w22. Using the previous decompositions for eo,12 and eo,32, we rewrite the boundary conditions on Γ12 and Γ23,

xeo,22=xv12+xw12onΓ12,yeo,22=yv32+yw32onΓ23.

Then, let us introduce the function w22:=(𝜃δ14π)vN0R2, given in polar coordinates by

w22(r,ϕ)=𝜃δ18π2ϕϕ22(lnr)2. 16

From Lemma 12, we know that w22C(+×{(0,0)}), and that it satisfies

Δw22=0in+×,xw22=xw12=𝜃δ14π1yon{0}×,yw22=yw32=𝜃δ14π1xon+×{0}.

This time, in order for v22+w22 to solve the problem for eo,22, we define v22 such that

Δv22=0inΩ2,v22=w22onΩ20,xv22=xv12onΓ12,yv22=yv32onΓ23.

Given the regularities of w22, v12, and v32, we deduce that v22 exists and is unique in H1(Ω2). Again, we have built (in a unique way) a solution v22+w22 to (15), where v22H1(Ω2) and w22L2(Ω2)H1(Ω2). But this is not enough to conclude that eo,22=v22+w22. As for Ω1, we know that this last equality holds provided that the subspace of all solutions zL2(Ω2) to

Δz=0inΩ2,z=0onΩ20,nz=0onΓ12Γ23,

is of dimension 0. Unfortunately, it follows from [37, Theorem 4.4.3.3] that its dimension is 1, and that it is spanned by a function in L2(Ω2), say z2, that admits a singularity of type lnr at the cross-point. Therefore, one has that eo,22 is not unique, and it can be written as eo,22=v22+w22+C22z2, for some constant C22. However, no matter the value of C22, one may always deduce that, in a neighborhood V0 of (0,0),

eo,22𝜃δ18π2(lnr)2inΩ2V0. 17

Note that there are actually three singular terms in eo,22: (ϕϕ2)2, (lnr)2 and lnr. So the leading singularity is indeed (lnr)2.

Besides, one gets a similar result for eo,42. That is eo,42 is not unique and can be written as eo,42=v42+w42+C42z4 for some C42, where v42H1(Ω4), w42L2(Ω4)H1(Ω4) is given by

w42(r,ϕ)=𝜃δ18π2ϕϕ42(lnr)2, 18

and z4L2(Ω4) admits a singularity of type lnr near the cross-point, Of course, one obtains a similar asymptotic result in the neighborhood V0 of (0,0), i.e.,

eo,42𝜃δ18π2(lnr)2inΩ4V0.

Note that in this case, the integer k0 in the statement of the theorem equals 2.

Case δ1= 0 In this case, well-posedness is guaranteed and no singularity is generated by the method at the current iteration k = 2. Indeed, the method behaves exactly as in the first iteration and all eo,i2 are well defined. Thus, we can introduce δ2 such that eo,22(0,0)=eo,42(0,0)=:δ2. Then we are again facing two possible situations: δ2≠ 0, in which case well-posedness is lost and a (lnr)2 singularity is generated at the next iteration k = 3 (i.e., k0 = 3), or δ2 = 0, in which case we still have the same behavior as in the first iteration. If we keep going with the same reasoning, we end up with two possible cases: either there exists some integer k0 > 1 such that all iterates are uniquely defined and regular up to k0 and both regularity and well-posedness are lost at k = k0, or δk = 0 for all k ≥ 1, in which case all iterates are well defined and regular. This last case, which has never been encountered in practice, is not treated here as it seems difficult to study convergence properties in this specific situation. □

Proof 9 (Proof of Theorem 8)

Here, we study how the singularity exhibited in Theorem 7 propagates through the next iterations kk0. To begin, we assume that the algorithm is capable of finding one of the solutions to a problem for which uniqueness is not guaranteed (typically problem (15)). To simplify notations, we introduce the integer p ≥ 0 such that k = k0 + p. Then, we claim that at iteration k, for each iI, there exists a regular function vikH1(Ωi) and real coefficients γi,j,mkj,m such that the local error eo,ik is given by

eo,ik=vik+m=02p+1j=02pγi,j,mk(ϕϕi)m(lnr)j,ifiIW, 19
eo,ik=vik+m=02p+2j=02p+2γi,j,mk(ϕϕi)m(lnr)j,ifiIG. 20

In addition, for iIW, we have γi,2p,mk=0 if m > 1, which means that the leading singularity in Ωi is of type (ϕϕi)(lnr)2p. And for iIG, we have γi,2p+2,mk=0 if m≠ 0; thus, the leading singularity in Ωi is of type (lnr)2p+2.

To prove this, we proceed by induction and use the results of the four lemmas stated earlier.

Base case The case k = k0, or equivalently p = 0, has already been seen in the proof of Theorem 7. Indeed, we have shown that the Dirichlet step in Ωi (iIW) led to a local error with a singular part wik0 that matches the one in (19) for k = k0 (see expression (13) or (14)). In addition, the Neumann step in Ωi (iIG) led to a local error with a singular part wik0+Cik0zi, which can be replaced by wik0+Cik0(lnr) up to some changes in the regular part vik0. It follows from expressions (16) and (18) that this matches the singular part in (20) for k = k0.

Induction step Let k > k0, or equivalently p > 0, be fixed. Assuming our statement holds for any integer k, let us prove that it still holds for k + 1. Given eo,ik for each iI, the only way to get information about eo,ik+1 is to perform the Dirichlet and Neumann steps of the algorithm.

Dirichlet step: In Ω1 we solve

Δeo,1k+1=0inΩ1,eo,1k+1=0onΩ10,eo,1k+1=𝜃eo,2k+(1𝜃)eo,1konΓ12,eo,1k+1=𝜃eo,4k+(1𝜃)eo,1konΓ41. 21

As previously, we know from [37, Theorem 4.4.3.3] that if there exists a solution to (21) that is in L2(Ω1), then it is unique. In order to prove existence, we use the induction hypothesis for eo,2k and eo,4k, then we decompose eo,1k+1=𝜃w~1k+1+(1𝜃)eo,1k, where w~1k+1 is for 1 ≤ j ≤ 2p + 2 the sum of the solutions to the boundary value problems

Δv=0inΩ1,v=0onΩ10,and(a)v=v2konΓ12,v=v4konΓ41.(b)jv=μ2,jk(lnr)jonΓ12,v=μ2,jk(lnr)jonΓ41.(c)jv=ν2,jk(lnr)jonΓ12,v=ν2,jk(lnr)jonΓ41, 22

where we have introduced for each j

μ2,jk:=n=0p+1γ2,j,2nkπ42nandν2,jk:=n=0pγ2,j,2n+1kπ42n+1.

Note that we have performed some simplifications using the equality γ2,j,mk=γ4,j,mk which holds for all k, j, m, due to the odd symmetry of the problem. Now, we consider each part of (22), and express the general form of its solution. First, since v2k and v4k are smooth and verify v2k(x,y)=v4k(x,y) for almost all (x,y) ∈Ω2, we have already seen (in problem (12)) that there exists a solution

w~ak+1span{(ϕϕ1)}+H1(Ω1)

to part (a), where the coefficient in the linear combination depends on the jump v2k(0,0) at the cross-point. Then, for each j, we get from Lemma 10 that there exists a solution

w~bjk+1μ2,jk4π(ϕϕ1)(lnr)j+span(ϕϕ1)m(lnr)q3mj+1,0qj2+H1(Ω1)

to part (b)j. In addition, we also get from Lemma 9 that there exists a solution

w~cjk+1ν2,jk(lnr)j+span(ϕϕ1)m(lnr)q2mj,0qj2+H1(Ω1)

to part (c)j. Summing up all these contributions over the values of j, we deduce that there exists a function v~1k+1H1(Ω1) and coefficients γ~1,j,mk+1j,m such that

w~1k+1=v~1k+1+m=02p+3j=02p+2γ~1,j,mk+1(ϕϕi)m(lnr)j

solves (22) in L2(Ω1), with γ~1,2p+2,mk+1=0 for m > 1. Finally, defining eo,1k+1:=𝜃w~1k+1+(1𝜃)eo,1k, we obtain a solution to (21) that is in L2(Ω1), which also proves that it is unique in L2(Ω1). Moreover, using the previous decomposition for w~1k+1 and the induction hypothesis for eo,1k, we get that there exists a function v1k+1:=𝜃v~1k+1+(1𝜃)v1kH1(Ω1) and coefficients γ1,j,mk+1j,m such that

eo,1k+1=v1k+1+m=02p+3j=02p+2γ1,j,mk+1(ϕϕ1)m(lnr)j,

with γ1,2p+2,mk+1=𝜃γ~1,2p+2,mk+1=0 for m > 1. Obviously, the same result (existence, uniqueness, and decomposition) holds for eo,3k+1 in Ω3 due to the odd symmetry property of the problem.

Neumann step: In Ω2 we solve

Δeo,2k+1=0inΩ2,eo,2k+1=0onΩ20,xeo,2k+1=xeo,1k+1onΓ12,yeo,2k+1=yeo,3k+1onΓ23. 23

We have already seen (again from [37, Theorem 4.4.3.3]) that, if there exists a solution to (23) that is in L2(Ω2), then the set of all solutions is an affine subspace of dimension 1. As in the Dirichlet step, in order to prove existence, we decompose eo,2k+1 using the decompositions obtained for eo,1k+1 and eo,3k+1. More specifically, we consider for 1 ≤ j ≤ 2p + 2 the sum of the solutions to the boundary value problems

Δv=0inΩ2,v=0onΩ20,and(a)ϕv=ϕv1k+1onΓ12,ϕv=ϕv3k+1onΓ23.(b)jϕv=μ1,jk+1(lnr)jonΓ12,ϕv=μ1,jk+1(lnr)jonΓ23.(c)jϕv=ν1,jk+1(lnr)jonΓ12,ϕv=ν1,jk+1(lnr)jonΓ23, 24

where we have introduced for each j

μ1,jk+1:=n=0p+1γ1,j,2n+1k+1(2n+1)π42nandν1,jk+1:=n=0pγ1,j,2n+2k+1(2n+2)π42n+1.

This time we have used the equality γ1,j,mk+1=γ3,j,mk+1 to simplify the formulations. Let us now study separately each part of (24), and express the general form of its solution. To begin with, due to the regularities of v1k+1 and v3k+1, we know from standard results that there exists a (unique) solution

w¯ak+1H1(Ω2)

to part (a). Then, for each j, we get from Lemma 12 that there exists a solution

w¯bjk+1μ1,jk+14π12(ϕϕ2)2(lnr)j1(j+1)(j+2)(lnr)j+2+span(ϕϕ2)m(lnr)q4mj+2,0qj2+H1(Ω2)

to part (b)j. Finally, we get from Lemma 10 that there exists a solution

w¯cjk+1ν1,jk+1(ϕϕ2)(lnr)j+span(ϕϕ2)m(lnr)q3mj+1,0qj2+H1(Ω2)

to part (c)j. Combining these results, we end up with a function

v2k+1+m=02p+4j=02p+4γ2,j,mk+1(ϕϕ2)m(lnr)j

that solves (24) in L2(Ω2), where v2k+1H1(Ω2) and the coefficients γ2,j,mk+1j,m satisfy γ2,2p+4,mk+1=0 if m≠ 0. This means that every solution eo,2k+1 to (24) is given by the general expression

eo,2k+1=v2k+1+m=02p+4j=02p+4γ2,j,mk+1(ϕϕ2)m(lnr)j+C2k+1z2,

with C2k+1. Since the singularity in z2 is of type lnr, it follows that every solution can be written as

eo,2k+1=v2k+1+m=02p+4j=02p+4γ2,j,mk+1(ϕϕ2)m(lnr)j,

up to some modification of the regular part v2k+1 and the coefficient γ2,1,0k+1. Again, the same result can be deduced for eo,4k+1 in Ω4.

This ends the proof of our claim about the expression of the local errors eo,ik (see (19) and (20)). The type of singularity generated by the domain decomposition method at iteration k is directly given by those expressions, so the proof of the result is complete. □

Remark 2

Following the same computations as in the previous proof while taking care of the coefficient in front of the leading singularity at each step enables us to end up with the following approximations of the errors in subdomains Ω1,,Ω4 at iteration k = k0 + p

eo,ik±𝜃δ14π(ϕϕ1)1(2p)!𝜃4πlnr2p,foriIW,eo,ik±δ11(2p+2)!𝜃4πlnr2p+1,foriIG, 25

where the correct sign is + for i ∈{1,2} and − for i ∈{3,4}.

The results given by Theorem 6, Theorem 7, and Theorem 8 can be easily extended to the Laplace problem with Robin boundary conditions. In this case, no compatibility condition is required, we only impose that the initial guess λ0 satisfies the regularity assumption that λ0C0(Γ)H32(Γij) for all (i,j) such that Γij.

Theorem 13

Taking λe0 as the initial guess for the Dirichlet-Neumann method applied to the even symmetric part of problem (2) produces a sequence {uek}k that converges geometrically to the solution ue with respect to the L2-norm and the broken H1-norm. Moreover, the convergence factor is given by ∣1 − 2𝜃∣, which also proves that this method becomes a direct solver for the specific choice 𝜃=12.

Theorem 14

The Dirichlet-Neumann method applied to the odd symmetric part of problem (2) is not well-posed. More specifically, taking λo0 as the initial guess, there exists an integer k0 > 0 such that the solution to the problem obtained at the k0-th iteration is not unique. In addition, all possible solutions uok0 are singular at the cross-point, with a leading singularity of type (lnr)2.

Theorem 15

If we let the Dirichlet-Neumann method go beyond the ill-posed iteration k0 from Theorem 14, we end up with a sequence {uok}kk0 of non-unique iterates. Moreover, for each kk0, all possible uok are singular at the cross-point, with a leading singularity of type (lnr)2(kk0)+2.

Proof 10

The proofs can be obtained by following the same steps as in the proofs of Theorem 6, Theorem 7 and Theorem 8. □

Remark 3

Note that the formulas given by the asymptotic analysis near the origin remain valid in the Robin case. Indeed, as this study has been conducted in the neighborhood of (0,0), what happens “far away” from this point (e.g., on the boundary Ω) has no influence on the results.

Numerical experiments

We now illustrate the theoretical results obtained in the previous section. The square domain Ω is discretized using a regular grid of size h, and our numerical method is based on a standard five-point finite difference scheme. In problems with mixed boundary conditions (Dirichlet and Robin), the Dirichlet boundary condition is enforced weakly using a penalty parameter ε of order 10− 10. Unless otherwise stated, the mesh size will be set to h = 2 ⋅ 10− 2 in all experiments. In addition, each convergence analysis is performed taking uex (exact solution) as the discrete solution obtained when solving on the whole domain Ω with a direct solver.

Example 1

In order to illustrate the result of Theorem 6, i.e., convergence for the even symmetric part, we take the source term f = fe = 1 in Ω, and set the Dirichlet boundary condition to g = ge = 0 on Ω. A simple initial guess compatible with the Dirichlet boundary condition is in this case λ0=λe0=0 on Γ. The results are displayed in Fig. 3.

As expected, when 𝜃=12, the DN method becomes a direct solver; thus, the error at iteration 2 is “zero” (here it cannot be smaller than the order of magnitude of ε) (see Fig. 3b). For 𝜃12, we see from Fig. 3c and d that the error on Ω is multiplied by a constant from one iteration to the next. Moreover, the plot of the L2 and broken H1 norms of the error in Fig. 3e confirms that the DN method converges geometrically in this case. We also see that, as predicted by the proof of Theorem 6, at each iteration, the error remains continuous at the cross-point from Ω1 to Ω3, and from Ω2 to Ω4, and it has the expected symmetry property.

Example 2

We illustrate now the result of Theorem 13 for the even symmetric part with Robin conditions: the source term is f = fe = 1 in Ω, and the Robin boundary condition is defined by p = pe = 1 and g = ge on Ω, where ge is such that ge = 1 on ΩbΩt (bottom and top sides) and ge = y2 on ΩlΩr (left and right sides). The same initial guess λ0=λe0=0 on Γ is considered. As shown in Fig. 4, we observe the same convergence properties as for the Dirichlet problem (Example 1). Especially, the DN method becomes a direct solver when 𝜃 is set to 12 (see Fig. 4b), and for other choices of 𝜃, it converges geometrically (see Fig. 4e), with the expected common ratio (1 − 2𝜃).

Fig. 4.

Fig. 4

Results for the DN method applied to the even symmetric part of (2) (Example 2)

Example 3

Finally, we give an illustration of the problematic case described in Theorem 7 and Theorem 8. We consider a Dirichlet problem with the odd symmetric data: f=fo=5π24sin(πx)cos(π2y) in Ω and g = go = 0 on Ω. As in the previous examples, the initial guess is set to λ0=λo0=0. The results displayed in Fig. 5 show that, as expected, the DN method applied to this odd symmetric problem does not converge. More specifically, we see that after the first iteration (see Fig. 5b), continuity across the cross-point from Ω2 to Ω4 is already lost. This jump (referred to as δ1≠ 0 in the proof of Theorem 7) generates a “singularity” at the next iteration (see Fig. 5c). This “singularity” keeps propagating in the following iterations so that the method diverges, as predicted by Theorem 8. Moreover, the graph in Fig. 5d reveals a geometric (divergent) behavior of the errors in L2 and broken H1 norms.

Remark 4

Since we use a standard finite difference scheme, it is not possible to enforce a discontinuous Dirichlet boundary condition. In practice, when two Dirichlet boundary values do not match at a corner, the average is computed and imposed at this corner. Thus, every numerical solution in Ωi necessarily belongs to a finite dimensional subspace of C0(Ωi¯), which explains the quotation marks for singularity in the previous paragraph. More generally, solving this problem using standard discretization methods (such as the finite difference method or the finite element method) involves a regularization step, namely the projection of the discontinuous boundary condition onto some finite dimensional subspace of C0(Ωi¯).

Given our choice of projection (computing the average), the boundary data are regularized in the disk Dh of radius h centered at the origin. Outside this disk, they are not modified. Consequently, one may argue that, in each subdomain Ωi, the local numerical solution should be “not too far” from the local real solution in ΩiDh. In order to verify this in the numerical results, we have plotted (red marks) the value of the error at the cross-point in subdomain Ω2 with respect to the mesh size h (see Fig. 6). We see that these points follow a curve of (lnh)2 type. An interpretation of that result is that the discretization process (which acts as a regularization here) turns the singularity of type (lnr)2 from Theorem 7 (see formula (17)) into a pseudo “singularity” of type (lnh)2.

Fig. 6.

Fig. 6

Error at the cross-point at iteration 2 with respect to h, for the DN method applied to the odd symmetric problem described in Example 3, with 𝜃 = 0.45

Now, we would like to analyze how the “singularity” propagates through the numerical iterates. In other words, given the “singularity” of type (lnh)2 obtained at iteration k = k0, do we observe a “singularity” of type (lnh)2p+2 at the following iterations k = k0 + p with p > 0, as predicted by Theorem 8 ? To answer this, let us first note that the error at the cross-point eo,2k(0,0) seems to grow geometrically with respect to k (see Fig. 5d). Thus, for each h, we are able to compute constants α2, β2 such that, for k ≥ 2,

lneo,2k(0,0)α2k+β2.

In addition, computing the logarithm of formula (25) (with i = 2), we get in the neighborhood of the cross-point

lneo,2kln𝜃4πlnr2k+β~2,

where β~2 depends on 𝜃 and k (only logarithmically). In Fig. 7, we have plotted the value computed for the coefficient α2 as a function of the mesh size h, and tried to make it fit with a curve of type ln(c1(lnh)2) (drawn in orange). As shown in the figure, this fitting was not successful and it appears that the appropriate fitting is a curve of type c2ln(c3(lnh)2) (drawn in blue), with a constant c20.87. This suggests that, in the numerical experiments, the “singularity” at iteration k = k0 + p is of type (lnh)1.74(p+1) rather than (lnh)2(p+1). One possible explanation for this is the regularizing effect of the discretization, which may slow down the propagation of the “singularity.”

Fig. 7.

Fig. 7

Slope of the curve klneo,2k(0,0) with respect to h, for the DN method applied to the odd symmetric problem described in Example 3, with 𝜃 = 0.45

Conclusion

We presented a complete analysis of the Dirichlet-Neumann method at the continuous level in a specific configuration involving one cross-point. Based on an even/odd symmetric decomposition of the data, we proved that the even symmetric part of the iterates converges geometrically to the right solution, while the boundary value problems associated to the odd symmetric part are not well-posed, which generates singular iterates. We also exhibited the type of singularity generated, and showed how this singularity propagates through the iterations. Finally, we studied the impact of our theoretical findings on numerical experiments.

A natural extension of this work would be to conduct a similar analysis for the Neumann-Neumann method, which is also known to pose problems in configurations with cross-points (see [41]). Another direction of future work, which will be the subject of the second part of this paper, is to build a modified (and convergent) Dirichlet-Neumann method taking advantage of this even/odd symmetric decomposition of the data.

Funding

Open access funding provided by University of Geneva

Declarations

Conflict of interest

The authors declare no competing interests.

Footnotes

1

The same result was already proved in [2], in the case of a symmetric decomposition with two subdomains without any restriction on the even/odd symmetric nature of the data.

Data availability

Data sharing not applicable to this article as no datasets were generated or analyzed during the current study.

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Contributor Information

Bastien Chaudet-Dumas, Email: bastien.chaudet@unige.ch.

Martin J. Gander, Email: martin.gander@unige.ch

References

  • 1.Schwarz HA. Über einen Grenzübergang durch alternierendes Verfahren. Vierteljahrsschrift der Naturforschenden Gesellschaft in Zürich. 1870;15:272–286. [Google Scholar]
  • 2.Bjørstad PE, Widlund OB. Iterative methods for the solution of elliptic problems on regions partitioned into substructures. SIAM J. Numer. Anal. 1986;23(6):1093–1120. doi: 10.1137/0723075. [DOI] [Google Scholar]
  • 3.Bourgat, J.-F., Glowinski, R., Le Tallec, P., Vidrascu, M., Glowinski, R., Périaux, J., Widlund, O: Variational formulation and algorithm for trace operator in domain decomposition calculations. In: Chan, T. (ed.) Domain decomposition methods, pp 3–16, SIAM (1989)
  • 4.Farhat C, Roux F-X. A method of Finite Element Tearing and Interconnecting and its parallel solution algorithm. Int. J. Numer. Meth. Engrg. 1991;32:1205–1227. doi: 10.1002/nme.1620320604. [DOI] [Google Scholar]
  • 5.Toselli, A., Widlund, O.: Domain Decomposition Methods - Algorithms and Theory. Springer Series in Computational Mathematics, vol. 34. Springer (2004)
  • 6.Hackbusch W. Ein iteratives Verfahren zur schnellen Auflösung elliptischer randwertprobleme, rep. 76-12 Technical Report 76–12. West Germany, Cologne: Institute for Applied Mathematics, University of Cologne; 1976. [Google Scholar]
  • 7.Brandt A. Multi-level adaptive solutions to boundary value problems. Math. Comp. 1977;31:333–390. doi: 10.1090/S0025-5718-1977-0431719-X. [DOI] [Google Scholar]
  • 8.Quarteroni, A., Valli, A.: Domain Decomposition Methods for Partial Differential Equations. Oxford University Press (1999)
  • 9.Lions, P.-L.: On the Schwarz alternating method. I. In: Glowinski, R., Golub, G.H., Meurant, G.A. , Périaux, J. (eds.) First International Symposium on Domain Decomposition Methods for Partial Differential Equations, pp. 1–42. SIAM (1988)
  • 10.Efstathiou E, Gander MJ. Why Restricted Additive Schwarz converges faster than Additive Schwarz. BIT Numer. Math. 2003;43(5):945–959. doi: 10.1023/B:BITN.0000014563.33622.1d. [DOI] [Google Scholar]
  • 11.Gander MJ. Schwarz methods over the course of time. Electron. Trans. Numer. Anal. 2008;31(5):228–255. [Google Scholar]
  • 12.Després B. Méthodes de décomposition de domaine pour les problèmes de propagation d’ondes en régimes harmoniques. Paris IX: PhD thesis; 1991. [Google Scholar]
  • 13.Lions, P.-L.: On the Schwarz alternating method. III:, a variant for nonoverlapping subdomains. In: Chan, T.F., Glowinski, R., Périaux, J., Widlund, O. (eds.) Third International Symposium on Domain Decomposition Methods for Partial Differential Equations, Held in Houston, Texas, March 20-22, 1989. SIAM (1990)
  • 14.Boubendir, Y., Bendali, A.: Dealing with cross-points in a non-overlapping domain decomposition solution of the Helmholtz equation. In: Mathematical and Numerical Aspects of Wave Propagation WAVES 2003, pp 319–324. Springer, Skylä (2003)
  • 15.Gander MJ, Kwok F. Best Robin parameters for optimized Schwarz methods at cross points. SIAM J. Sci. Comput. 2012;34(4):1849–1879. doi: 10.1137/110837218. [DOI] [Google Scholar]
  • 16.Loisel S. Condition number estimates for the nonoverlapping optimized Schwarz method and the 2-Lagrange multiplier method for general domains and cross points. SIAM J. Numer. Anal. 2013;51(6):3062–3083. doi: 10.1137/100803316. [DOI] [Google Scholar]
  • 17.Gander, M.J., Kwok, F.: On the applicability of Lions’ energy estimates in the analysis of discrete optimized Schwarz methods with cross points. In: Domain Decomposition Methods in Science and Engineering XX, pp. 475–483. Springer (2013)
  • 18.Gander MJ, Santugini-Repiquet K. Cross-points in domain decomposition methods with a finite element discretization. ETNA. 2016;45:219–240. [Google Scholar]
  • 19.Bamberger A, Joly P, Roberts JE. Second-order absorbing boundary conditions for the wave equation: a solution for the corner problem. SIAM J. Num. Anal. 1990;27(2):323–352. doi: 10.1137/0727021. [DOI] [Google Scholar]
  • 20.Nataf F. A Schwarz additive method with high order interface conditions and nonoverlapping subdomains. ESAIM: Mathematical Modelling and Numerical Analysis-Modélisation Mathématique et Analyse Numérique. 1998;32(1):107–116. doi: 10.1051/m2an/1998320101071. [DOI] [Google Scholar]
  • 21.Modave A, Royer A, Antoine X, Geuzaine C. A non-overlapping domain decomposition method with high-order transmission conditions and cross-point treatment for Helmholtz problems. Comput. Methods Appl. Mech. Eng. 2020;368:113162. doi: 10.1016/j.cma.2020.113162. [DOI] [Google Scholar]
  • 22.Després, B., Nicolopoulos, A., Thierry, B.: Corners and stable optimized domain decomposition methods for the Helmholtz problem hal-02612368 (2020)
  • 23.Gander, M.J., Halpern, L.: A simple finite difference discretization for Ventcell transmission conditions at cross points. In: Domain Decomposition Methods in Science and Engineering XXVI. Springer (2021)
  • 24.Chaouqui, F., Gander, M.J., Santugini-Repiquet, K.: A local coarse space correction leading to a well-posed continuous neumann-neumann method in the presence of cross points. In: International Conference on Domain Decomposition Methods, pp. 83–91. Springer (2018)
  • 25.Claeys, X., Parolin, E.: Robust treatment of cross points in optimized S,chwarz methods. arXiv:2003.06657 (2020)
  • 26.Gander, M.J., Kwok, F.: Optimal interface conditions for an arbitrary decomposition into subdomains. In: Domain Decomposition Methods in Science and Engineering XIX, pp. 101–108. Springer (2011)
  • 27.Domain Decomposition Methods in Science and Engineering XXVI. Springer, Hong-Kong (2021)
  • 28.De Roeck, Y. -H., Le Tallec, P.: Analysis and test of a local domain-decomposition preconditioner. In: Domain Decomposition Methods in Science and Engineering IV. Springer (1990)
  • 29.Maier I, Haasdonk B. A dirichlet–neumann reduced basis method for homogeneous domain decomposition problems. Appl. Numer. Math. 2014;78:31–48. doi: 10.1016/j.apnum.2013.12.001. [DOI] [Google Scholar]
  • 30.Song B, Jiang Y-L, Wang X. Analysis of two new parareal algorithms based on the dirichlet-neumann/neumann-neumann waveform relaxation method for the heat equation. Numer. Algor. 2021;86(4):1685–1703. doi: 10.1007/s11075-020-00949-y. [DOI] [Google Scholar]
  • 31.Chaouqui F, Ciaramella G, Gander MJ, Vanzan T. On the scalability of classical one-level domain-decomposition methods. Vietnam J. Math. 2018;46(4):1053–1088. doi: 10.1007/s10013-018-0316-9. [DOI] [Google Scholar]
  • 32.Gander MJ, Kwok F, Mandal BC. Dirichlet–neumann waveform relaxation methods for parabolic and hyperbolic problems in multiple subdomains. BIT Numer. Math. 2021;61(1):173–207. doi: 10.1007/s10543-020-00823-2. [DOI] [Google Scholar]
  • 33.Widlund, O., Dryja, M., Proskurowski, W.: A method of domain decomposition with crosspoints for elliptic finite element problems. In: Proceedings of the International Symposium on Optimal Algorithms. Blagovegrad, Bulgaria, April 21-25, 1986, pp. 97–111. Bulgarian Academy of Sciences, Sofia (1986)
  • 34.Dryja, M.: A method of domain decomposition for three-dimensional finite element elliptic problems. In: First International Symposium on Domain Decomposition Methods for Partial Differential Equations, pp 43–61. SIAM, Philadelphia (1988)
  • 35.Parolin É. Non-overlapping Domain Decomposition Methods with Non-local Transmissionoperators for Harmonic Wave Propagation Problems. Institut Polytechnique de Paris: PhD thesis; 2020. [Google Scholar]
  • 36.Dauge, M.: Elliptic Boundary Value Problems on Corner Domains: Smoothness and Asymptotics of Solutions vol. 1341. Springer (2006)
  • 37.Grisvard, P.: Elliptic Problems in Nonsmooth Domains. SIAM (2011)
  • 38.Dauge, M.: Regularity and singularities in polyhedral domains. Available on: https://perso.univ-rennes1.fr/monique.dauge/publis/Talk_Karlsruhe08.pdf (2008). Accessed 16 Sept 2021
  • 39.Demlow, A.: Lecutre notes: Singular solutions to pde and their finite element approximations. Available on: https://www.math.tamu.edu/~demlow/Courses/16_sp/663_sp16/index.html (2016). Accessed 1 Aug 2021
  • 40.Brézis, H.: Functional Analysis, Sobolev Spaces and Partial Differential Equations vol. 2. Springer (2011)
  • 41.Chaouqui, F., Gander, M.J., Santugini-Repiquet, K.: A coarse space to remove the logarithmic dependency in neumann-neumann methods. In: International Conference on Domain Decomposition Methods, pp 159–167. Springer (2017)

Articles from Numerical Algorithms are provided here courtesy of Springer

RESOURCES