Two-level Schwarz algorithms with overlapping subregions for mortar finite elements

Hyea Hyun Kim, Olof B. Widlund

Research output: Contribution to journalArticlepeer-review


Preconditioned conjugate gradient methods based on two-level overlapping Schwarz methods often perform quite well. Such a preconditioner combines a coarse space solver with local components which are defined in terms of subregions that form an overlapping covering of the region on which the elliptic problem is defined. Precise bounds on the rate of convergence of such iterative methods have previously been obtained in the case of conforming lower order and spectral finite elements as well as in a number of other cases. In this paper, this domain decomposition algorithm and analysis are extended to mortar finite elements. It is established that the condition number of the relevant iteration operator is independent of the number of subregions and varies with the relative overlap between neighboring subregions linearly as in the conforming cases previously considered.

Original languageEnglish (US)
Pages (from-to)1514-1534
Number of pages21
JournalSIAM Journal on Numerical Analysis
Issue number4
StatePublished - 2006


  • Domain decomposition
  • Elliptic finite element problems
  • Mortar finite elements
  • Overlapping Schwarz algorithms
  • Preconditioned conjugate gradients

ASJC Scopus subject areas

  • Numerical Analysis
  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'Two-level Schwarz algorithms with overlapping subregions for mortar finite elements'. Together they form a unique fingerprint.

Cite this