An iterative substructuring method for Raviart-Thomas vector fields in three dimensions

Barbara I. Wohlmuth, Andrea Toselli, Olof B. Widlund

Research output: Contribution to journalArticlepeer-review


The iterative substructuring methods, also known as Schur complement methods, form one of two important families of domain decomposition algorithms. They are based on a partitioning of a given region, on which the partial differential equation is defined, into nonoverlapping substructures. The preconditioners of these conjugate gradient methods are then given in terms of local problems, defined on individual substructures and pairs of substructures, and, in addition, a global problem of low dimension. An iterative method of this kind is introduced for the lowest order Raviart-Thomas finite elements in three dimensions and it is shown that the condition number of the relevant operator is independent of the number of substructures and grows only as the square of the logarithm of the number of unknowns associated with an individual substructure. The theoretical bounds are confirmed by a series of numerical experiments.

Original languageEnglish (US)
Pages (from-to)1657-1676
Number of pages20
JournalSIAM Journal on Numerical Analysis
Issue number5
StatePublished - 2000


  • Domain decomposition
  • Iterative substructuring methods
  • Raviart-Thomas finite elements

ASJC Scopus subject areas

  • Numerical Analysis
  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'An iterative substructuring method for Raviart-Thomas vector fields in three dimensions'. Together they form a unique fingerprint.

Cite this