Schwarz methods by domain truncation
Martin J. Gander, Hui Zhang

TL;DR
This paper reviews optimized Schwarz methods that utilize domain truncation and advanced boundary conditions, analyzing their convergence behaviors through Fourier analysis for various media and decompositions.
Contribution
It provides a comprehensive survey of optimized Schwarz methods with detailed convergence analysis considering different boundary conditions and media.
Findings
Optimized Schwarz methods converge faster with advanced boundary conditions.
Fourier analysis reveals how boundary conditions affect convergence.
Layered media impact the effectiveness of domain truncation techniques.
Abstract
Schwarz methods use a decomposition of the computational domain into subdomains and need to put boundary conditions on the subdomain boundaries. In domain truncation one restricts the unbounded domain to a bounded computational domain and also needs to put boundary conditions on the computational domain boundaries. It turns out to be fruitful to think of the domain decomposition in Schwarz methods as truncation of the domain onto subdomains. The first truly optimal Schwarz method that converges in a finite number of steps was proposed in 1994 and used precisely transparent boundary conditions as transmission conditions between subdomains. Approximating these transparent boundary conditions for fast convergence of Schwarz methods led to the development of optimized Schwarz methods -- a name that has become common for Schwarz methods based on domain truncation. Compared to classical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
