Abstract
The paper proposes a new preconditioner for solving systems of linear algebraic equations with a symmetric positively defined matrix by the method of conjugate gradients – Block Incomplete Inverse Cholesky BIIC preconditioner in combination with a triangular first-order decomposition "by value" - BIIC-IC1. The algorithm based on MPI+OpenMP techniques is proposed for the construction and application of the BIIC preconditioner combined with stabilized triangular decomposition of the second order "by value" (BIIC-IS2S). In this case, the BIIC-IC2S preconditioner uses the number of blocks multiple of the number of processors used and the number of threads used. Two algorithms based on MPI+OpenMP techniques are proposed for the construction and application of the BIIC-IC1 preconditioner. Comparative timing results for the MPI+OpenMP and MPI implementations of the proposed preconditioning used with the conjugate gradient method for a model problem and the sparse matrix collections SuiteSparse are presented.
Sign-in/Register to access full text options 
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.
