On the Scalability of the Schwarz Method

SMAI Journal of Computational Mathematics, vol. 6, pp. 33–68

Abstract

In this article, we analyse the convergence behaviour and scalability properties of the one-level Parallel Schwarz method (PSM) for domain decomposition problems in which the boundaries of many subdomains lie in the interior of the global domain. Such problems arise, for instance, in solvation models in computational chemistry. Existing results on the scalability of the one-level PSM are limited to situations where each subdomain has access to the external boundary, and at most only two subdomains have a common overlap. We develop a systematic framework that allows us to bound the norm of the Schwarz iteration operator for domain decomposition problems in which subdomains may be completely embedded in the interior of the global domain and an arbitrary number of subdomains may have a common overlap.

Authors 3

1. Gabriele Ciaramella

   University of Konstanz

   Affiliation as printed

   Fachbereich Mathematik und Statistik , Universität Konstanz , Germany

2. Muhammad Hassan Aachen Department of Mathematics Center for Computational Engineering Science

   RWTH Aachen University

   Affiliation as printed

   Center for Computational Engineering Science , Department of Mathematics , RWTH Aachen University , Germany

3. Benjamin Stamm Aachen Department of Mathematics Center for Computational Engineering Science

   RWTH Aachen University

   Affiliation as printed

   Center for Computational Engineering Science , Department of Mathematics , RWTH Aachen University , Germany