BIT Numerical Mathematics

, Volume 37, Issue 2, pp 296–311

On the nonlinear domain decomposition method

  • M. Dryja
  • W. Hackbusch

DOI: 10.1007/BF02510214

Cite this article as:
Dryja, M. & Hackbusch, W. Bit Numer Math (1997) 37: 296. doi:10.1007/BF02510214


Any domain decomposition or additive Schwarz method can be put into the abstract framework of subspace iteration. We consider generalizations of this method to the nonlinear case. The analysis shows under relatively weak assumptions that the nonlinear iteration converges locally with the same asymptotic speed as the corresponding linear iteration applied to the linearized problem.

AMS subject classification


Key words

Domain decompositionnonlinear problemspreconditionernonlinear elliptic problems

Copyright information

© BIT Foundaton 1997

Authors and Affiliations

  • M. Dryja
    • 1
  • W. Hackbusch
    • 2
  1. 1.Institute of Applied Mathematics and MechanicsUniversity of WarsawWarsawPoland
  2. 2.Lehrstuhl Praktische MathematikChristian-Albrechts-Universität zu KielKielGermany