For the solution of practical flow problems in arbitrarily shaped domains, simple Schwarz domain decomposition methods with minimal overlap are quite efficient, provided Krylov subspace methods, e.g. the GMRES method, are used to accelerate convergence. With an accurate subdomain solution, the amount of time spent solving these problems may be quite large. To reduce computing time, an inaccurate solution of subdomain problems is considered, which requires a GCR-based acceleration technique. Much emphasis is put on the multiplicative domain decomposition algorithm since we also want an algorithm which is fast on a single processor. Nevertheless, the prospects for parallel implementation are also investigated. © 1998 John Wiley & Sons, Ltd. KEY WORDS: domain decomposition; GCR; Krylov–Schwarz; incompressible Navier–Stokes; boundary-fitted coordinates; finite volume 1
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.