Inner/outer iterative methods and numerical Schwarz algorithms (Q1099936)

The author examines an approach based on the domain decomposition ideas for solving elliptic partial differential equations on multiprocessing systems such that the individual scientific processes are weakly coupled to one another to reduce the communication between the algorithmic tasks. It is shown that under certain matrix nonnegative conditions the convergence rate of the global iteration is invariant to the amount of overlap of the subdomains.