From the introduction: Domain decomposition (DD) methods are important techniques for designing parallel algorithms for solving partial differential equations. Since the decomposition is often performed using automatic mesh partitioning tools, one can in general not make any assumptions on the shape or physical size of the subdomains, especially if local mesh refinement is used. In many of the popular domain decomposition methods, neighboring subdomains are not using the same type of boundary conditions, e.g. the Dirichlet-Neumann methods invented by P. E. Bjørstad and O. B. Widlund [SIAM J. Numer. Anal. 23, 1097–1120 (1986; Zbl 0615.65113)], or the two-sided optimized Schwarz methods proposed in [the first author, SIAM J. Numer. Anal. 44, No. 2, 699–731 (2006; Zbl 1117.65165)], and one has to decide which subdomain uses which boundary condition. A similar question also arises in mortar methods, see [C. Bernardi et al., NATO ASI Ser., Ser. C, Math. Phys. Sci. 384, 269–586 (1993; Zbl 0799.65124)], where one has to decide on the master and slave side at the interfaces. In [M. J. Gander, S\(\vec{\text{e}}\)MA J. 53, 71–78 (2011; Zbl 1328.65261)], it was found that for optimized Schwarz methods, the subdomain geometry and problem boundary conditions influence the optimized Robin parameters for symmetrical finite domain decompositions, and in [the authors, SIAM J. Numer. Anal. 52, No. 4, 1981–2004 (2014; Zbl 1304.65261)], it was observed numerically that swapping the optimized two-sided Robin parameters can accelerate the convergence for a circular domain decomposition.
We study in this paper two-sided optimized Schwarz methods for a model decomposition into a larger and a smaller subdomain, to investigate which Robin parameter should be used on which subdomain in order to get fast convergence.
For the entire collection see [Zbl 1344.65005].