An iterative substructuring method for maxwell's equations in two dimensions

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

Research output: Contribution to journalArticlepeer-review


Iterative substructuring methods, also known as Schur complement methods, form an important family of domain decomposition algorithms. They are preconditioned conjugate gradient methods where solvers on local subregions and a solver on a coarse mesh are used to construct the preconditioner. For conforming finite element approximations of H1, it is known that the number of conjugate gradient steps required to reduce the residual norm by a fixed factor is independent of the number of substructures, and that it grows only as the logarithm of the dimension of the local problem associated with an individual substructure. In this paper, the same result is established for similar iterative methods for low-order Nédélec finite elements, which approximate H(curl; Ω) in two dimensions. Results of numerical experiments are also provided.

Original languageEnglish (US)
Pages (from-to)935-949
Number of pages15
JournalMathematics of Computation
Issue number235
StatePublished - Jul 2001


  • Domain decomposition
  • Iterative substructuring methods
  • Maxwell's equations
  • Nédélec finite elements

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'An iterative substructuring method for maxwell's equations in two dimensions'. Together they form a unique fingerprint.

Cite this