PreprintCC BY 4.0arXiv
Analysis of an inexact Schwarz domain decomposition method in 3D
Abstract
We consider an inexact version of the Schwarz domain decomposition method in $3$D to solve a Laplace problem in a domain that is the union of two overlapping spheres. We solve each subproblem approximately by projecting its boundary data L2-orthogonally onto the space of spherical harmonics of degree at most N. The model problem arises from the ddCOSMO solver used for implicit solvation in computational chemistry. We analyze the Schwarz-spherical domain decomposition method by establishing a new variant of the maximum principle.
Related
- The geometric convergence of a parallel domain decomposition method on manifolds
- A pure source transfer domain decomposition method for Helmholtz equations in 3D unbounded domain
- Two-level domain-decomposition AdaGrad method for scalable training of graph neural networks
- Combined High-Dimensional and Reduced-Order Modeling Based on an Iterative Domain Decomposition Method
- A Fully Dual Domain Decomposition Method for Extreme Learning Machines Using GenEO Spectral Coarse Spaces
BibTeX
@misc{ghosh2026analysis,
title = {{Analysis of an inexact Schwarz domain decomposition method in 3D}},
author = {Nibedita Ghosh},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.13793},
eprint = {2610.13793},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.13793},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Analysis of an inexact Schwarz domain decomposition method in 3D
AU - Nibedita Ghosh
PY - 2026
DA - 2026/10/09
PB - arXiv
DO - 10.48550/arxiv.2610.13793
UR - https://arxiv.org/abs/2610.13793
AB - We consider an inexact version of the Schwarz domain decomposition method in $3$D to solve a Laplace problem in a domain that is the union of two overlapping spheres. We solve each subproblem approximately by projecting its boundary data L^2-orthogonally onto the space of spherical harmonics of degree at most N. The model problem arises from the ddCOSMO solver used for implicit solvation in computational chemistry. We analyze the Schwarz-spherical domain decomposition method by establishing a new variant of the maximum principle.
ER -