On the effect of boundary conditions on the scalability of Schwarz methods
1 Introduction
This work is concerned with convergence and weak scalability111Here, weak scalability is understood in the sense that the contraction factor does not deteriorate as the number of subdomains increases and, hence, the number of iterations, needed to reach a given tolerance, is uniformly bounded in ; see, e.g., Ciaramella_mini_10_CiaramellaGander4 . analysis of one-level parallel Schwarz method (PSM) and optimized Schwarz method (OSM) for the solution of the problem
(1) |
where is the domain depicted in Fig. 1, and and are either Dirichlet, or Neumann or Robin operators:
Dirichlet: | ||||
Neumann: | ||||
Robin: |
Here, and the subscripts ‘’ and ‘’ stand for ‘bottom’ and ‘top’.
As shown in Fig. 1, the domain is the union of subdomains , , defined as , where , for and for . Hence, the length of each subdomain is and the length of the overlap is with .
It is well known that one-level Schwarz methods are not weakly scalable, if the number of subdomains increases and the whole domain is fixed. However, the recent work Ciaramella_mini_10_Stamm3 , published in the field of molecular dynamics, has drawn attention to the opposite case in which the number of subdomains increases, but their size remains unchanged, and, as a result, the size of the whole domain increases. In this setting, weak scalability of PSM and OSM for (1) with Dirichlet boundary conditions is studied in Ciaramella_mini_10_CiaramellaGander ; Ciaramella_mini_10_CiaramellaGander4 . Scalability results for the PSM in case of more general geometries of the (sub)domains are presented in Ciaramella_mini_10_CiaramellaGander2 ; Ciaramella_mini_10_CiaramellaGander3 ; Ciaramella_mini_10_CHS2 . In these works, only external Dirichlet conditions are discussed and, in such a case, weak scalability is shown. A short remark about the non-scalability in case of external Neumann conditions is given in Ciaramella_mini_10_CiaramellaGander4 . Similar results have been recently presented in Ciaramella_mini_10_bootland2020 for time-harmonic problems. The goal of this work is to study the effect of different (possibly mixed) external boundary conditions on convergence and scalability of PSM and OSM. In particular, we will show that only in the case of (both) external Neumann conditions at the top and the bottom of , PSM and OSM are not scalable. External Dirichlet conditions lead to the fastest convergence, while external Robin conditions lead to a convergence that depends heavily on the parameter .
One-level PSM and OSM for the solution of (1) are
(2) |
for , where and are Dirichlet trace operators,
(3) |
for the PSM, and Robin trace operators,
(4) |
with for the OSM. The subscript ‘’ and ‘’ stand for ‘left’ and ‘right’. For the condition at must be replaced by and for the condition at must be replaced by . In this paper, ‘external conditions’ and ‘transmission conditions’ will always refer to the conditions obtained by the pairs and , respectively. Note that the Robin parameter of the OSM can be chosen independently of the Robin parameter used for the operators and . We analyze convergence of PSM and OSM by a Fourier analysis in Section 3. For this purpose, we use the solutions of eigenproblems of the 1D Laplace operators with mixed boundary conditions. These are studied in Section 2. Finally, results of numerical experiments are presented in Section 4.
2 Laplace eigenpairs for mixed external conditions
Consider the 1D eigenvalue problem
(5) |
and six pairs of boundary operators :
-
(DD)
, ,
-
(DR)
, ,
-
(DN)
, ,
-
(RR)
, ,
-
(NR)
, ,
-
(NN)
, ,
where and ‘D’, ‘R’ and ‘N’ stand for ‘Dirichlet’, ‘Robin’ and ‘Neumann’. For all these six cases the eigenvalue problem (5) is solved by orthonormal (in ) Fourier basis functions.
Theorem 2.1 (Eigenpairs of the Laplace operator)
Let . The eigenproblems (5) with the above external conditions are solved by the non-trivial eigenpairs given by
-
(DD)
, ,
-
(DR)
, , , where , , are roots . Moreover, and .
-
(DN)
, ,
-
(RR)
, , , where , , are roots of . Moreover, and .
-
(NR)
, , , where , , are roots of . Moreover, and .
-
(NN)
, ,
Proof
If we multiply (5) with , integrate over , and integrate by parts, we get . Using any of the above external conditions (and that , for the Robin ones) one gets . We refer to, e.g., (Ciaramella_mini_10_Olver2013, , Section 4.1) for similar discussions. Now, all the cases can be proved by using the ansatz , which clearly satisfies (5), and computing, e.g., and in such a way that satisfies the two external conditions and as a normalization factor.
The coefficients , and as functions of are shown in Fig. 2 (left),


where we can observe that and , and that the maps , and increase monotonically and approach, respectively, and as . Hence, by taking the limit , one can pass from the conditions (DR), (RR) and (NR) to (DN), (NN) and (NN), respectively. Similarly, by taking the limit , the conditions (DR), (RR) and (NR) become (DD), (DD) and (DN), respectively.
3 Convergence and scalability
Consider the Schwarz method (2) and any pair of operators as in Section 2. The Fourier expansions of , , are
(6) |
where the sum is over for (DD), (DR), (RR) and (NR), and over for (DN) and (NN). The functions depend on the external boundary conditions and are the ones obtained in Theorem 2.1. The Fourier coefficients satisfy
(7) |
for . For , the condition at must be replaced by and for the condition at must be replaced by . If the operators and correspond to Dirichlet conditions (see (3)), then (7) is a PSM. If they correspond to Robin conditions (see (4)), then (7) is an OSM. The convergence of the iteration (7) is analyzed in Theorem 3.1.
Theorem 3.1 (Convergence of Schwarz methods in Fourier space)
The contraction factors of the Schwarz methods222The contraction factor for (7) (corresponding to the -th Fourier component) is the spectral radius of the Schwarz iteration matrix; see Ciaramella_mini_10_CiaramellaGander ; Ciaramella_mini_10_CiaramellaGander4 . (7) are bounded by
(8) |
Moreover, it holds that with (independently of ), and that is strictly monotonically decreasing.
Proof
The Dirichlet case follows from (Ciaramella_mini_10_CiaramellaGander, , Lemma 2 and Theorem 3). See also (Ciaramella_mini_10_CiaramellaGander4, , Lemma 2 and Theorem 1). We focus here on the Robin case. From Theorem 3 in Ciaramella_mini_10_CiaramellaGander4 and the corresponding proof we have that the contraction factor of the OSM is bounded by where
with for all and . If we compute the derivative of we get
which is negative for any and . Thus, is strictly monotonically decreasing. Let us now study the function . Direct calculations reveal that , which is negative for any and , and and for any and . These observations imply that is strictly monotonically decreasing and attains its maximum at . Finally, a direct comparison shows that and the result follows, because .
Theorem 3.1 gives the same bound (8) for the convergence factors of PSM and OSM. This fact is not surprising. First, it is well known that OSM converges faster than PSM for . Hence, a convergence bound for the PSM is a valid bound also for the OSM. Second, in the above proof the convergence bound for the OSM is obtained for , which corresponds to passing from Robin transmission conditions to Dirichlet transmission conditions. The bound (8) is based on the ones obtained in Ciaramella_mini_10_CiaramellaGander ; Ciaramella_mini_10_CiaramellaGander4 . These are quite sharp for large values of ; see, e.g., (Ciaramella_mini_10_CiaramellaGander4, , Fig. 4 and Fig. 5).
We can now prove our main convergence result, which allows us to study convergence and scalability of PSM and OSM for all the external conditions considered in Section 2.
Theorem 3.2 (Convergence of PSM and OSM)
The contraction factors (in the norm) of PSM and OSM for the solution to (1) are bounded by
where and is defined in Theorem 3.1. Moreover, for any we have that
(9) |
(10) |
Proof
According to Theorem 3.1, the bounds of the Fourier contraction factor is monotonically decreasing in . Therefore, an upper bound for the convergence factor of PSM and OSM (in the norm) can be obtained by taking the maximum over the admissible Fourier frequencies and invoking Parseval’s identity (see, e.g., Ciaramella_mini_10_CiaramellaGander ). Recalling Theorem 2.1, these maxima are attained at for (DD), for (DR), for (DN), for (RR), for (NR), and for (NN). The inequalities (9) and (10) follow from the monotonicity and the fact that and .
The inequalities (9) and (10) imply that the contraction factor is bounded, independently of , by a constant strictly smaller than for all the cases except (NN). In the case (NN), the first Fourier frequency is . Hence, the coefficients are generated by the 1D Schwarz method
(11) |
which is known to be not scalable; see, e.g., Ciaramella_mini_10_CiaramellaGander4 ; Ciaramella_mini_10_CHS1 . The scalability of PSM and OSM for different external conditions applied at the top and at the bottom of the domain is summarized in Table 1.
Dirichlet | Robin | Neumann | |
Dirichlet | yes | yes | yes |
Robin | yes | yes | yes |
Neumann | yes | yes | no |
Dirichlet | Robin | Neumann | |
Dirichlet | - | yes | - |
Robin | yes | no | no |
Neumann | - | no | - |
Inequalities (9) and (10) lead to another interesting observation. The contraction factors are clearly influenced by the external boundary conditions. Dirichlet conditions lead to faster convergence than Robin conditions, which in turn lead to faster convergence than Neumann conditions. For example, if one external condition is of the Dirichlet type, then PSM and OSM converge faster if the other condition is of the Dirichlet type and slower if this is of Robin and even slower for the Neumann type. The case (RR) is slightly different, because the corresponding convergence of PSM and OSM depends heavily on the Robin parameter . The behavior of the bounds , and with respect to is depicted in Fig. 2 (right), which shows the bounds discussed in Theorem 3.2 as functions of (recall that ). Here, we can observe that the inequalities (9) and (10) are satisfied and that
-
•
As increases the Dirichlet part of the Robin external condition dominates. In addition, the bounds and decrease and approach as . Similarly, decreases and approaches .
-
•
As decreases the Neumann part of the Robin external condition dominates. In addition, the bounds and decrease and approach as . Similarly, increases and approaches .
These observations lead to Tab. 1 (right), where we summarize the robustness of PSM and OSM with respect to the parameter . The methods are robust with respect to only if one of the two external boundary conditions is of Dirichlet type. This is due to the fact that Robin conditions become Neumann conditions for .
4 Numerical experiments
In this section, we test the scalability of PSM and OSM by numerical simulations. For this purpose, we run PSM and OSM for all the external boundary conditions discussed in this paper and measure the number of iterations required to reach a tolerance on the error of . To guarantee that the initial errors contain all frequencies, the methods are initialized with random initial guesses. In all cases, each subdomain is discretized with a uniform grid of size interior points in direction and interior points in direction . The mesh size is , with , and the overlap parameter is . For the OSM the robin parameter is . The Robin parameter of the external Robin conditions is , and the (RR) case is also tested with . The results of our experiments are shown in Tab. 2 and confirm the theoretical results discussed in the previous sections.
DD | DR(10) | DN | RR(10) | NR(10) | NN | RR(0.1) | |
3 | 12 - 9 | 13 - 10 | 27 - 19 | 14 - 10 | 26 - 19 | 77 - 54 | 65 - 45 |
4 | 13 - 9 | 14 - 10 | 29 - 21 | 15 - 11 | 29 - 21 | 130 - 90 | 95 - 66 |
5 | 13 - 9 | 14 - 10 | 31 - 22 | 15 - 11 | 31 - 22 | 194 - 134 | 124 - 86 |
10 | 13 - 10 | 14 - 10 | 33 - 24 | 15 - 11 | 34 - 24 | 401 - 401 | 227 - 155 |
20 | 13 - 10 | 14 - 10 | 34 - 24 | 15 - 11 | 35 - 24 | 401 - 401 | 293 - 199 |
30 | 13 - 10 | 14 - 10 | 34 - 24 | 15 - 11 | 35 - 24 | 401 - 401 | 311 - 210 |
40 | 13 - 10 | 14 - 10 | 34 - 24 | 15 - 11 | 35 - 24 | 401 - 401 | 317 - 214 |
50 | 13 - 10 | 14 - 10 | 34 - 24 | 15 - 11 | 35 - 24 | 401 - 401 | 319 - 216 |
References
- [1] N. Bootland, V. Dolean, A. Kyriakis, and J. Pestana. Analysis of parallel Schwarz algorithms for time-harmonic problems using block Toeplitz matrices. arXiv.2006.08801, 2020.
- [2] E. Cancès, Y. Maday, and B. Stamm. Domain decomposition for implicit solvation models. J. Chem. Phys., 139:054111, 2013.
- [3] F. Chaouqui, G. Ciaramella, M. J. Gander, and T. Vanzan. On the scalability of classical one-level domain-decomposition methods. Vietnam J. Math., 46(4):1053–1088, 2018.
- [4] G. Ciaramella and M. J. Gander. Analysis of the parallel Schwarz method for growing chains of fixed-sized subdomains: Part I. SIAM J. Numer. Anal., 55(3):1330–1356, 2017.
- [5] G. Ciaramella and M. J. Gander. Analysis of the parallel Schwarz method for growing chains of fixed-sized subdomains: Part II. SIAM J. Numer. Anal., 56 (3):1498–1524, 2018.
- [6] G. Ciaramella and M. J. Gander. Analysis of the parallel Schwarz method for growing chains of fixed-sized subdomains: Part III. Electron. Trans. Numer. Anal., 49:210–243, 2018.
- [7] G. Ciaramella, M. Hassan, and B. Stamm. On the scalability of the parallel Schwarz method in one-dimension. In Domain Decomposition Methods in Science and Engineering XXV, pages 151–158. Springer International Publishing, 2020.
- [8] G. Ciaramella, M. Hassan, and B. Stamm. On the scalability of the Schwarz method. SMAI-JCM, 6:33–68, 2020.
- [9] P. J. Olver. Introduction to Partial Differential Equations. Undergraduate Texts in Mathematics. Springer International Publishing, 2013.