Domain decomposition algorithms

Tony F. Chan, Tarek P. Mathew

Research output: Contribution to journalArticlepeer-review

461 Scopus citations


Domain decomposition refers to divide and conquer techniques for solving partial differential equations by iteratively solving subproblems defined on smaller subdomains. The principal advantages include enhancement of parallelism and localized treatment of complex and irregular geometries, singularities and anomalous regions. Additionally, domain decomposition can sometimes reduce the computational complexity of the underlying solution method. In this article, we survey iterative domain decomposition techniques that have been developed in recent years for solving several kinds of partial differential equations, including elliptic, parabolic, and differential systems such as the Stokes problem and mixed formulations of elliptic problems. We focus on describing the salient features of the algorithms and describe them using easy to understand matrix notation. In the case of elliptic problems, we also provide an introduction to the convergence theory, which requires some knowledge of finite element spaces and elementary functional analysis.

Original languageEnglish (US)
Pages (from-to)61-143
Number of pages83
JournalActa Numerica
Issue number7-8
StatePublished - Jan 1994
Externally publishedYes

ASJC Scopus subject areas

  • Numerical Analysis
  • General Mathematics


Dive into the research topics of 'Domain decomposition algorithms'. Together they form a unique fingerprint.

Cite this