|
Vestnik Tomskogo Gosudarstvennogo Universiteta. Matematika i Mekhanika, 2011, Number 2(14), Pages 45–54
(Mi vtgu189)
|
|
|
|
This article is cited in 7 scientific papers (total in 7 papers)
MATHEMATICS
Acceleration of the line-by-line recurretnt method in Krylov subspaces
A. A. Fomina, L. N. Fominab a JSC "Kuzbas"
b Kemerovo State University
Abstract:
Two techniques of acceleration of line-by-line recurrent method in Krylov subspaces are considered by the example of the LR1 algorithm. The van der Vorst Bi-CGStab P algorithm is used as an accelerating method. It is shown that the traditional approach (generation of a preconditioner on the base of LR1 algorithm) doesn't yield the required result. At the same time, the direct combination of LR1 and Bi-CGStab P algorithms allows to raise the convergence speed considerably.
Keywords:
difference elliptic equations, iterative method, Krylov subspaces, line-by-line recurrent method.
Received: 11.09.2010
Citation:
A. A. Fomin, L. N. Fomina, “Acceleration of the line-by-line recurretnt method in Krylov subspaces”, Vestn. Tomsk. Gos. Univ. Mat. Mekh., 2011, no. 2(14), 45–54
Linking options:
https://www.mathnet.ru/eng/vtgu189 https://www.mathnet.ru/eng/vtgu/y2011/i2/p45
|
Statistics & downloads: |
Abstract page: | 266 | Full-text PDF : | 88 | References: | 37 | First page: | 1 |
|