Parallel implementation of an iterative algorithm for solving nonsymmetric
Numerical methods and programming, Tome 11 (2010) no. 4, pp. 373-381
Voir la notice de l'article provenant de la source Math-Net.Ru
A parallel implementation of the SOFGMRES(m) iterative algorithm with partial
retention of information on explicit restarts is discussed. An arbitrary
initial subspace is an important degree of freedom for this algorithm. From
the convergence substantiation of the SOFGMRES(m) algorithm it follows that an
appropriately chosen initial subspace can be considered as an additional
preconditioner, since this subspace reduces the generalized condition number
of a matrix and accelerates the convergence of the SOFGMRES(m) algorithm. The
numerical results show the reliability of the proposed algorithm and its
algebraic and parallel efficiency compared to the classical Krylov
subspace-type algorithms.
Keywords:
parallel iterative algorithm; explicit restarts; subspace condition; additional preconditioning.
@article{VMP_2010_11_4_a9,
author = {S. A. Kharchenko},
title = {Parallel implementation of an iterative algorithm for solving nonsymmetric},
journal = {Numerical methods and programming},
pages = {373--381},
publisher = {mathdoc},
volume = {11},
number = {4},
year = {2010},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMP_2010_11_4_a9/}
}
S. A. Kharchenko. Parallel implementation of an iterative algorithm for solving nonsymmetric. Numerical methods and programming, Tome 11 (2010) no. 4, pp. 373-381. http://geodesic.mathdoc.fr/item/VMP_2010_11_4_a9/