Analysis of a Schwarz-Fourier domain decomposition method
Arnold Reusken
TL;DR
The paper analyzes Schwarz domain decomposition for the Laplace problem on a domain formed by two overlapping discs, focusing on an inexact Schwarz method where subproblems on each disc are solved using low-dimensional Fourier subspaces. By leveraging a variant of the maximum principle, it derives convergence results and contraction bounds for the Schwarz-Fourier iterations, including explicit positivity and boundary-layer considerations for the projected Poisson kernel. It introduces two algorithmic variants—Fourier-projection Schwarz-Fourier and Fourier-interpolation Schwarz-Fourier—establishing contraction bounds, computational efficiency via FFT, and robustness to small numbers of Fourier modes; numerical experiments illustrate the bounds and the influence of geometry and discretization on convergence. An appendix furnishes a rigorous endpoint analysis for Laplace solutions with boundary discontinuities, clarifying the limiting behavior at jump points and underpinning the maximum-principle arguments used in the main text.
Abstract
The Schwarz domain decomposition method can be used for approximately solving a Laplace equation on a domain formed by the union of two overlapping discs. We consider an inexact variant of this method in which the subproblems on the discs are solved approximately using the projection on a Fourier subspace of the $L^2$ space on the boundary. This model problem is relevant for better understanding of the ddCOSMO solver that is used in computational chemistry. We analyze convergence properties of this Schwarz-Fourier domain decomposition method. The analysis is based on maximum principle arguments. We derive a new variant of the maximum principle and contraction number bounds in the maximum norm.
