BIT Numerical Mathematics

, Volume 37, Issue 2, pp 296–311

On the nonlinear domain decomposition method

Authors

  • M. Dryja
    • Institute of Applied Mathematics and MechanicsUniversity of Warsaw
  • W. Hackbusch
    • Lehrstuhl Praktische MathematikChristian-Albrechts-Universität zu Kiel
Article

DOI: 10.1007/BF02510214

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

Abstract

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

65H1065N55

Key words

Domain decompositionnonlinear problemspreconditionernonlinear elliptic problems

Copyright information

© BIT Foundaton 1997