Abstract
In the parallel finite element domain decomposition methods (FEM-DDM), one of the key step is to solve the reduced linear system defined on the subdomain interfaces iteratively using a Krylov subspace method such as the biconjugate gradient stabilized (BICGSTAB) method. In each iteration of BICGSTAB, multiple global MPI communication collectives are required, which are becoming increasingly expensive when many processors are used on modern computers, especially on a large-scale system. To address this limitation, a communication-avoiding variant of BICGSTAB (CA-BICGSTAB) is realized and implemented to minimize global communication therefore improve massively parallel efficiency of the FEM-DDM in this paper. A series of numerical examples are presented to demonstrate the superior performance of CA-BICGSTAB over conventional BICGSTAB.
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.
