Analysis of a Schwarz–Fourier Domain Decomposition Method

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 [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.

Authors

Institutions

Publication Details

Journal
SIAM Journal on Numerical Analysis
Published
2026-09-11
DOI
https://doi.org/10.1137/25m1818369
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Analysis of a Schwarz–Fourier Domain Decomposition Method

Arnold Reusken
SIAM Journal on Numerical Analysis
Advanced Numerical Methods in Computational Mathematics
article

Analysis of a Schwarz–Fourier Domain Decomposition Method

Arnold Reusken
article en

Abstract

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 [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.

SIAM Journal on Numerical AnalysisVol. 64(5)
RWTH Aachen University (DE)
Deutsche Forschungsgemeinschaft
Openalex Percentile: Top 98%
Advanced Numerical Methods in Computational Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.