Mathematical analysis demonstrates contraction bounds for an inexact Schwarz–Fourier method, indicating guaranteed convergence for computational chemistry solvers.
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 [Formula: see text] 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.
No takes yet. Share an insight, caveat, or question.
Arnold Reusken (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: