Abstract
We discuss a parallel and vectorizable ILU type preconditioner for conjugate-gradient algorithms for problems with general sparsity patterns. The algorithm partitions the matrix in overlapping blocks, and performs local incomplete factorizations. The resulting algorithm typically requires a few iterations more to converge than its uniprocessor counterpart, but it has a very large granularity that makes it suitable for execution on coarse grain parallel systems with a high cost of synchronization. We obtain speed-ups of up to 3.3 on 4 processors compared to a good uniprocessor implementation on some problems from a finite element application.
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.
