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.
Similar content being viewed by others
References
X.-C. Cai and M. Dryja,Domain decomposition methods for monotone nonlinear elliptic problems, Contemporary Mathematics, v. 180, pp. 21–27, D. Keyes and J. Xu, eds, AMS, 1994.
X.-C. Cai and O. Widlund,Multiplicative Schwarz algorithms for nonsymmetric and indefinite elliptic problems SIAM J. Numer. Anal., 30 (1993), pp. 936–952
P. G. Ciarlet,The Finite Element Method for Elliptic Problems, North-Holland, New York, 1978.
M. Dryja and O. Widlund,An additive variant of the Schwarz alternating method for the case of many subregions, Tech. Report 339, Courant Institute, New York, 1987.
M. Dryja and O. Widlund,Domain decomposition algorithms with small overlap, SIAM J. Sci. Comp., 15 (1994), pp. 604–620.
W. Hackbusch,Multi-grid Methods and Applications, Springer Verlag, Berlin, 1985.
W. Hackbusch,Iterative Solution of Large Sparse Systems, Springer Verlag, Berlin, 1994.
W. Hackbusch and A. Reusken,Analysis of a damped nonlinear multilevel method, Numer. Math., 55 (1989), pp. 225–246.
O. A. Ladyzhenskaya and N. N. Ural’tseva,Linear and Quasilinear Elliptic Equations, Academic Press, 1968.
Xue-Cheng Tai,Parallel function decomposition and space decomposition methods, Beijing Mathematics 1 (1995), pp. 104–152.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dryja, M., Hackbusch, W. On the nonlinear domain decomposition method. Bit Numer Math 37, 296–311 (1997). https://doi.org/10.1007/BF02510214
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02510214