Cross-points in the Neumann-Neumann method
Bastien Chaudet-Dumas, Martin J. Gander

TL;DR
This paper analyzes the Neumann-Neumann method at the continuous level for problems with cross-points, revealing singularities and proposing new transmission conditions to ensure convergence.
Contribution
It provides the first continuous-level analysis of NNM at cross-points, identifies singularities, and introduces improved transmission conditions for convergence.
Findings
Solutions are singular near cross-points.
The type of singularity propagates through iterations.
New transmission conditions achieve geometric convergence.
Abstract
In this work, we focus on the Neumann-Neumann method (NNM), which is one of the most popular non-overlapping domain decomposition methods. Even though the NNM is widely used and proves itself very efficient when applied to discrete problems in practical applications, it is in general not well defined at the continuous level when the geometric decomposition involves cross-points. Our goals are to investigate this well-posedness issue and to provide a complete analysis of the method at the continuous level, when applied to a simple elliptic problem on a configuration involving one cross-point. More specifically, we prove that the algorithm generates solutions that are singular near the cross-points. We also exhibit the type of singularity introduced by the method, and show how it propagates through the iterations. Then, based on this analysis, we design a new set of transmission…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Methods in Computational Mathematics · Numerical methods in engineering · Electromagnetic Simulation and Numerical Methods
11institutetext: Bastien Chaudet-Dumas 22institutetext: University of Geneva, Switzerland 22email: [email protected] 33institutetext: Martin J. Gander 44institutetext: University of Geneva, Switzerland 44email: [email protected]
Cross-points in the Neumann-Neumann method
Bastien Chaudet-Dumas and Martin J. Gander
1 Introduction
The Neumann-Neumann method (NNM), first introduced in Bourgat:1989:VFA in the case of two subdomains, is among the most popular non-overlapping domain decomposition methods. However, when used as a stationary solver at the continuous level, it has been observed that the method faced well-posedness issues in the presence of cross-points, see chaouqui2018local . Here, our goal is to analyze in detail the behaviour of the NNM near cross-points on a simple, but rather instructive, bidimensional configuration.
Let be the square , divided into four non-overlapping square subdomains , , see Figure 1. This leads to one interior cross-point (red dot), and four boundary cross-points (black dots). We denote the interfaces between adjacent subdomains by , the skeleton of the partition by , and . We consider the Laplace problem with Dirichlet boundary conditions on , that is: find solution to
[TABLE]
where and , ensuring that .
Given an initial couple , and a relaxation parameter , each iteration of the NNM applied to (1) can be split into two steps:
- •
(Dirichlet step) Solve for all ,
[TABLE]
- •
(Neumann step) Compute the correction , that is, solve for all ,
[TABLE]
For the method to be well defined, it is assumed in the rest of this paper that the initial couple is compatible with the Dirichlet boundary condition, i.e. it satisfies: , and .
2 Convergence analysis of the Neumann-Neumann method
Definition 1
A measurable function is said to be even symmetric (resp. odd symmetric) if for a.e. , (resp. ). Moreover, any measurable function can be uniquely decomposed into where is even symmetric and is odd symmetric.
Following this notion, as in chaudet2022cross1 , we introduce the so-called even symmetric and odd symmetric parts of problem (1): find and solutions to
[TABLE]
If denotes the solution to (1), it is known (see chaudet2022cross1 ) that the unique solutions and to these subproblems are precisely the even symmetric part and the odd symmetric part of . In what follows, we will perform the convergence analysis of the NNM separately for the errors associated with the even and odd symmetric subproblems, as they lead to completely different behaviours of the method.
Case of the even symmetric part. The next Theorem states that the NNM is convergent when applied to the even symmetric part of (1).
Theorem 2.1
Taking as initial couple for the NNM applied to (2a) produces a sequence that converges geometrically to the solution with respect to the -norm and the broken -norm for any . Moreover, the convergence factor is given by , which also proves that the method becomes a direct solver for the specific choice .
Proof
As in chaudet2022cross1 for the Dirichlet-Neumann method, let us study the first iterations of the NNM in terms of the local errors .
Iteration , Dirichlet step: In each , , the errors satisfy
[TABLE]
Since is compatible with the even symmetric part of the Dirichlet boundary condition, exists and is unique in . Using the even symmetry properties of and , one can deduce that the , for , can be expressed in terms of as follows:
[TABLE]
Iteration , Neumann step: We compute the correction in each subdomain . For instance, taking , we get in
[TABLE]
Thus, uniqueness of in yields in . A similar reasoning applies to each , , therefore the recombined correction simply reads: in .
Iteration : At iteration , the transmission condition for the Dirichlet step in on each is given by, Uniqueness of in enables us to conclude that in . Since this holds in each subdomain, the exact same reasoning as for iteration applies, and we get after the Neumann step and in . By induction, we obtain for any , in . This leads to the following estimates for the error on the whole domain in the -norm and the broken -norm:
[TABLE]
[TABLE]
where , are strictly positive constants depending on the data and the geometry of the domain decomposition.
Case of the odd symmetric part. As for the Dirichlet-Neumann method, the NNM does not converge in general when applied to the odd symmetric part of (1).
Theorem 2.2
The NNM applied to (2b) is not well-posed. More specifically, taking as initial couple, there exists an integer such that the solution to the problem obtained at the -th iteration is not unique. In addition, all possible solutions are singular at the cross-point, with a leading singularity of type .
Theorem 2.3
If we let the NNM go beyond the ill-posed iteration from Theorem 2.2, we end up with a sequence of non-unique iterates. Moreover, for each , all possible are singular at the cross-point, with a leading singularity of type .
Proof
The proofs of these results rely on the exact same arguments as those in the proofs of (chaudet2022cross1, , Theorem 7 and 8).
The previous results show that, at some point in the iterative process, the NNM method will lead to solving an ill-posed problem. This will generate a singular solution, and the generated singularity will then propagate through the following iterations.
3 Toward a modified Neumann-Neumann method
The conclusions from the previous section suggest that the transmission conditions of the standard NNM are naturally well adapted to the even symmetric part of the problem. Indeed, in this context, one may express at each iteration all local errors in terms of only one, say , by symmetry. This motivates the search for different transmission conditions such that a similar symmetry property holds for the odd symmetric part of the problem.
Fixing the odd symmetric case. In order to fix the well-posedness issue in the odd symmetric case, and obtain the symmetry property mentioned above, we propose a new distribution of Dirichlet and Neumann transmission conditions, as shown in Figure 2.
Let us introduce , , , the sets containing all parts of the interface where transmission conditions of Dirichlet or Neumann type are imposed for (superscript 1) and for (superscript 2), that is :
[TABLE]
Given an initial couple and relaxation parameter , each iteration of the proposed mixed Neumann-Neumann method can be split into two steps:
- •
(First step) Solve for all
[TABLE]
- •
(Second step) Compute the correction , that is, solve for all
[TABLE]
With this choice of transmission conditions, we are able to prove that the proposed mixed NNM is convergent when applied to the odd symmetric part of (1).
Theorem 3.1
Taking as initial couple for the mixed NNM applied to (2b) produces a sequence that converges geometrically to the solution with respect to the -norm and the broken -norm for any . Moreover, the convergence factor is given by , which also proves that the method becomes a direct solver for the specific choice .
Proof
We follow the same steps as in the proof of Theorem 2.1.
Iteration , Dirichlet step: In each , , the odd errors satisfy
[TABLE]
These problems are well-posed since is compatible with the odd symmetric part of the boundary condition. This time, using the mixed conditions enforced along together with the odd symmetry properties of and , we can deduce that
[TABLE]
Indeed, for the first equality, taking , we have on and
[TABLE]
Then uniqueness of the solution to the subproblem in yields a.e. in . The two other equalities are obtained using similar arguments, see Figure 3 for an illustration of this symmetry property.
Iteration , Neumann step: For , we get in
[TABLE]
Therefore in . Extending these arguments to the other subdomains yields a recombined correction in .
Iteration : At iteration , the transmission conditions for the first step in are given by
[TABLE]
This implies that in . Using the same arguments in the other subdomains and performing the second step leads to and in . As in the proof of Theorem 2.1, we obtain by induction that, for any , in . The desired error estimates are then deduced from the last relation.
The new NNM. Here are the different steps of our new NNM to solve (1) starting from an initial couple compatible with the Dirichlet boundary condition, and a relaxation parameter .
Decompose the data into their even/odd symmetric parts to get (2a) and (2b). 2. 2.
Solve in parallel:
- •
(2a) using the standard NNM starting from ,
- •
(2b) using the mixed NNM starting from . 3. 3.
Recompose the solution .
Remark 1
It is actually enough to solve for and in , and then extend them to the whole domain by symmetry. One iteration of the new NNM thus costs the same as one iteration of the original NNM.
4 Numerical experiments
In order to test our new NNM, we apply it to two simple benchmarks: one with even symmetric data (Example 1: and ) and one with odd symmetric data (Example 2: and where in , in and in , with being the angle in polar coordinates, see Figure 3). The discretization of (1) is performed using a standard five point finite difference scheme on a cartesian grid of meshsize . When two Dirichlet conditions meet at a corner, the value of at this node is set to the average of the two values. In addition, when Dirichlet and Neumann conditions meet at a corner, we choose the Dirichlet one to be enforced at this node. The results obtained show that the method behaves as predicted by Theorem 2.1 and Theorem 3.1. Indeed, for , the method converges after two iterations, see the left column in Figure 4. And for , , the method converges geometrically to the solution, see the right column in Figure 4.
In this short paper, we gave a complete analysis of the standard NNM in a simple configuration involving one cross-point. The even/odd decomposition showed that the NNM was able to treat very efficiently the even symmetric part of the solution, while it faced well-posedness and convergence issues when applied to the odd symmetric part of the solution. Based on this observation, we proposed new mixed transmission conditions of Dirichlet/Neumann type to treat efficiently the odd symmetric part. We proved that the newly proposed NNM built upon a combination between the standard NNM and the new mixed method is convergent, and we validated this property by some numerical experiments. A natural extension of this work would be the 3D case of a cube divided into eight subcubes. It would also be interesting to generalize the notion of even/odd symmetry to the case of more general cross-points (not necessarily rectilinear, or involving a number of subdomains ).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J.-F. Bourgat, R. Glowinski, P. Le Tallec, and M. Vidrascu. Variational formulation and algorithm for trace operator in domain decomposition calculations. In T. Chan, R. Glowinski, J. Périaux, and O. Widlund, editors, Domain Decomposition Methods , Philadelphia, PA, 1989. SIAM.
- 2[2] F. Chaouqui, M. J. Gander, and K. Santugini-Repiquet. 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 , pages 83–91. Springer, 2018.
- 3[3] B. Chaudet-Dumas and M. J. Gander. Cross-points in the Dirichlet-Neumann method I: well-posedness and convergence issues. Numerical Algorithms , 92(1):301–334, 2023.
