Synchronous and asynchronous optimized Schwarz methods for one-way subdivision of bounded domains
Convergence of both synchronous and asynchronous optimized Schwarz algorithms for the shifted Laplacian operator on a bounded rectangular domain, in a one-way subdivision of the computational domain, with overlap, is shown. Convergence results are obtained under very mild conditions on the size of the subdomains and on the amount of overlap. A couple of results are also given, relating the convergence rate of the asynchronous method to changes in the size of the domain. Numerical experiments illustrate the theoretical results.
97 MATHEMATICS AND COMPUTING↗