Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal for Numerical Methods in Fluids
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.