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

From MaRDI portal





A new approach for the convergence problem of optimized Schwarz methods by studying a generalization of these methods for a semilinear elliptic equation is introduced. The behavior of the algorithm for large overlapping lengths is studied.











This page was built for publication: The behavior of domain decomposition methods when the overlapping length is large

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403181)