Iterative algorithms of domain decomposition for the solution of a quasilinear elliptic problem

This paper deals with iterative algorithms for domain decomposition applied to the solution of a quasilinear elliptic problem. Two iterative algorithms are examined: the first one is the Schwarz alternating procedure and the second algorithm is suitable for parallel computing. Convergence results are established in the two-domain and multidomain decomposition cases. Some issues of parallel implementation of these algorithms are discussed.