RUS  ENG
Full version
JOURNALS // Matematicheskoe modelirovanie // Archive

Mat. Model., 2021 Volume 33, Number 10, Pages 19–38 (Mi mm4324)

This article is cited in 7 papers

MPI+OpenMP parallel implementation of conjugate gradient method with factored implicit preconditioners

O. Yu. Milyukova

Keldysh Institute of Applied Mathematics of Rus. Acad. Sci.

Abstract: Non-iterative algorithms based on MPI+OpenMP techniques are proposed for the construction and application of the Block Jacobi preconditioner combined with incomplete parameter-trimmed decomposition IC1 and stabilized incomplete parameter-trimmed decomposition IC2S. At the same time, the number of blocks in the Jacobi block is a multiple of the number of processors used and the number of threads used. Estimates of the number of iterations of conjugate gradients method with the Block Jacobi preconditioner combined with IC1 or IC2S methods obtained. Using model tasks calculations and a number of tasks from the sparse matrix collection SuiteSparse shown that the use of MPI+OpenMP technology makes it possible to significantly speed up calculations compared to the use of only MPI for not too many nodes of a supercomputer system.

Keywords: sparse matrixes, conjugate gradient method, incomplete Cholesky factorization, parallel computing.

Received: 24.02.2019
Revised: 24.05.2021
Accepted: 02.06.2021

DOI: 10.20948/mm-2021-10-02


 English version:
Mathematical Models and Computer Simulations, 2022, 14:3, 367–380


© Steklov Math. Inst. of RAS, 2025