World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.
No Access

COMPUTATIONAL COMPLEXITY OF THE SCHWARZ ALTERNATING PROCEDURE

    https://doi.org/10.1142/S0129053389000020Cited by:7 (Source: Crossref)
    Next

    Abstract

    This paper develops sharp convergence rate estimates of the Schwarz alternating procedure. We do this for a model Poisson problem in one and two dimensions with multiple subdomains We then use these estimates to assess the serial and parallel complexity of the optimal Schwarz algorithm. We finish with a comparison of this optimal algorithm, using multigrid as the subdomain solver, and multigrid by itself, without domain decomposition.