Parallel Domain Decomposition with Incomplete Subdomain Solution

摘要

In this paper, the authors outline a parallel implementation of Krylov-accelerated Schwarz domain decomposition in which subdomain problems are solved to low precision. By so doing, computational time is focused on the convergence of the global iteration rather than wasted on ineffective subdomain iterations. The authors consider the GCR method using classical Gram-Schmidt and Householder orthogonalization methods. The authors' goal is to apply this approach to the incompressible Navier-Stokes equations. For the parallel implementation, the authors assume a distributed memory system with message passing.