RUS  ENG
Full version
JOURNALS // Sibirskii Zhurnal Vychislitel'noi Matematiki // Archive

Sib. Zh. Vychisl. Mat., 2012 Volume 15, Number 2, Pages 223–228 (Mi sjvm474)

Iterative solver for systems of linear equations with a sparse stiffness matrix for clusters

A. A. Kalinkinab, Yu. M. Laevskyab

a Institute of Computational Mathematics and Mathematical Geophysics (Computing Center), Siberian Branch of the Russian Academy of Sciences, Novosibirsk
b Novosibirsk State University, Novosibirsk

Abstract: In this paper, a package of programs for solving systems of linear equations with a sparse matrix for computers with distributed memory is proposed. This package is based on the iterative algorithm for solving the initial system of equations with preconditioner constructed using the algebraic domain decomposition. Such an approach makes possible to multiply by the preconditioner and a stiffness matrix on cluster. Also, to improve the efficiency of computation, PARDISO and SparseBlas functionalities from Intel$\circledR$MKL library are used on each process. In addition to parallelization among processes, this package uses OpenMP parallelization on each of these processes as well as Intel$\circledR$MKL internal functional parallelization.

Key words: sparse solver, domain decomposition, parallelization, MPI and OpenMP.

UDC: 519.63

Received: 06.10.2011
Revised: 17.01.2012


 English version:
Numerical Analysis and Applications, 2012, 5:2, 182–186

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024