The development of coarse spaces for domain decomposition algorithms

Olof B. Widlund

Research output: Chapter in Book/Report/Conference proceedingConference contribution


The importance of using coarse components, and thus at least one additional level, in the design of domain decomposition methods has been understood for at least twenty years. For many problems of interest, such a device, which provides at least a minimal amount of global transfer of information in each step, is necessary in order to obtain convergence rates which are independent of the number of subdomains. An historical overview, colored by the scientific history of its author, is given of the development of such coarse components of the domain decomposition algorithms. These algorithms are all preconditioned conjugate gradient methods or they are accelerated by using some alternative Krylov space method. The preconditioners are built from solvers of the given problem restricted to subdomains and a coarse approximation which often can be quite exotic.

Original languageEnglish (US)
Title of host publicationDomain Decomposition Methods in Science and Engineering XVIII
Number of pages8
StatePublished - 2009
Event18th International Conference of Domain Decomposition Methods - Jerusalem, Israel
Duration: Jan 12 2008Jan 17 2008

Publication series

NameLecture Notes in Computational Science and Engineering
Volume70 LNCSE
ISSN (Print)1439-7358


Other18th International Conference of Domain Decomposition Methods

ASJC Scopus subject areas

  • Modeling and Simulation
  • General Engineering
  • Discrete Mathematics and Combinatorics
  • Control and Optimization
  • Computational Mathematics


Dive into the research topics of 'The development of coarse spaces for domain decomposition algorithms'. Together they form a unique fingerprint.

Cite this