Skip to main content
SpringerLink
Log in

Convergence rate of some domain decomposition methods for overlapping and nonoverlapping subdomains

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary.

Three iterative domain decomposition methods are considered: simultaneous updates on all subdomains (Additive Schwarz Method), flow directed sweeps and double sweeps. By using some techniques of formal language theory we obtain a unique criterion of convergence for the three methods. The convergence rate is a function of the criterion and depends on the algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. CMAP, CNRS URA756, Ecole Polytechnique, F-91128 Palaiseau Cedex, France; e-mail: nataf@cmapx.polytechnique.fr, , , , , , FR

    F. Nataf

  2. CMAT, CNRS URA169, Ecole Polytechnique, F-91128 Palaiseau Cedex, France; e-mail: nier@orphee.polytechnique.fr, , , , , , FR

    F. Nier

Authors
  1. F. Nataf
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. Nier
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received October 24, 1994 / Revised version received November 27, 1995

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nataf, F., Nier, F. Convergence rate of some domain decomposition methods for overlapping and nonoverlapping subdomains . Numer. Math. 75, 357–377 (1997). https://doi.org/10.1007/s002110050243

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002110050243

Search

Navigation