On the nonlinear domain decomposition method
- Cite this article as:
- Dryja, M. & Hackbusch, W. Bit Numer Math (1997) 37: 296. doi:10.1007/BF02510214
- 192 Views
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.