Abstract
In this paper we study the parallel scalability of variants of an algebraic additive Schwarz preconditioner for the solution of large three dimensional convection diffusion problems in a non-overlapping domain decomposition framework. To alleviate the computational cost, both in terms of memory and floating-point complexity, we investigate variants based on a sparse approximation or on mixed 32- and 64-bit calculation. The robustness and the scalability of the preconditioners are investigated through extensive parallel experiments on up to 2,000 processors. Their efficiency from a numerical and parallel performance view point are reported.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
