Geodesic
On the peculiarities of solving large systems of linear algebraic
Numerical methods and programming, Tome 12 (2011) no. 1, pp. 176-182 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The results of testing a set of the Krylov subspace iterative methods (CGS, BiCGStab) with algebraic multigrid preconditioner for solving large sparse systems of linear algebraic equations are discussed. The scalability characteristics for the MPI and hybrid versions of the code on three HPC-systems are given. The peculiarities of using these methods on computer systems of different processor architecture (Intel Harpertown, Intel Nehalem, and AMD Magny-Cours) are analyzed.
Keywords: iterative methods; systems of linear algebraic equations; scalability. 
@article{VMP_2011_12_1_a21,
     author = {B. I. Krasnopolsky},
     title = {On the peculiarities of solving large systems of linear algebraic},
     journal = {Numerical methods and programming},
     pages = {176--182},
     year = {2011},
     volume = {12},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMP_2011_12_1_a21/}
}
TY  - JOUR
AU  - B. I. Krasnopolsky
TI  - On the peculiarities of solving large systems of linear algebraic
JO  - Numerical methods and programming
PY  - 2011
SP  - 176
EP  - 182
VL  - 12
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/VMP_2011_12_1_a21/
LA  - ru
ID  - VMP_2011_12_1_a21
ER  - 
%0 Journal Article
%A B. I. Krasnopolsky
%T On the peculiarities of solving large systems of linear algebraic
%J Numerical methods and programming
%D 2011
%P 176-182
%V 12
%N 1
%U http://geodesic.mathdoc.fr/item/VMP_2011_12_1_a21/
%G ru
%F VMP_2011_12_1_a21
B. I. Krasnopolsky. On the peculiarities of solving large systems of linear algebraic. Numerical methods and programming, Tome 12 (2011) no. 1, pp. 176-182. http://geodesic.mathdoc.fr/item/VMP_2011_12_1_a21/