This article is cited in 1 scientific paper (total in 1 paper)
Parallel forming of preconditioners based on the approximation of the Sherman-Morrison inversion formula
N. S. Nedozhogin, S. P. Kopysov, A. K. Novikov
Institute of Mechanics, Ural Branch of RAS, Izhevsk
Acceleration of preconditioned bi-conjugate gradient stabilized (BiCGStab) methods with preconditioners based on the matrix approximation by the Sherman-Morrison inversion formula is studied. A new form of the parallel algorithm using matrix-vector products to generate preconditioning matrices is proposed. A parallelization efficiency of the most resource-intensive operations of such preconditioners on multi-core central and graphics processing units (CPUs and GPUs) is shown.
linear systems, explicit preconditioning, Sherman-Morrison formula, parallel computing, graphics accelerators.
PDF file (217 kB)
N. S. Nedozhogin, S. P. Kopysov, A. K. Novikov, “Parallel forming of preconditioners based on the approximation of the Sherman-Morrison inversion formula”, Num. Meth. Prog., 16:1 (2015), 86–93
Citation in format AMSBIB
\by N.~S.~Nedozhogin, S.~P.~Kopysov, A.~K.~Novikov
\paper Parallel forming of preconditioners based on the approximation of the Sherman-Morrison inversion formula
\jour Num. Meth. Prog.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
N. S. Nedozhogin, S. P. Kopysov, A. K. Novikov, “Variant parallelnogo razlozheniya v predobuslavlivatele AISM”, Izv. IMI UdGU, 2015, no. 2(46), 120–126
|Number of views:|