The behavior of domain decomposition methods when the overlapping length is large

Abstract

In this paper, we introduce a new approach for the convergence problem of optimized Schwarz methods by studying a generalization of these methods for a semilinear elliptic equation. We study the behavior of the algorithm when the overlapping length is large.