TY - JOUR
T1 - Breakdown-free ML(k)BiCGStab algorithm for non-hermitian linear systems
AU - Moriya, Kentaro
AU - Nodera, Takashi
PY - 2005
Y1 - 2005
N2 - ML(k)BiCGStab algorithm stabilizes BiCGStab algorithm by using k pseudo Krylov subspaces. However, if k is too large, the computation cost often becomes expensive, and the performance of BiCGStab algorithm is not always improved. In this paper, a new variant of ML(k)BiCGStab algorithm is proposed. In the proposed scheme, k is varied and pseudo Krylov subspaces are recomputed when the Lanczos breakdown occurs. Numerical experiments are reported which indicate that the proposed scheme performs better than the original ML(k)BiCGStab algorithm and BiCGStab algorithm.
AB - ML(k)BiCGStab algorithm stabilizes BiCGStab algorithm by using k pseudo Krylov subspaces. However, if k is too large, the computation cost often becomes expensive, and the performance of BiCGStab algorithm is not always improved. In this paper, a new variant of ML(k)BiCGStab algorithm is proposed. In the proposed scheme, k is varied and pseudo Krylov subspaces are recomputed when the Lanczos breakdown occurs. Numerical experiments are reported which indicate that the proposed scheme performs better than the original ML(k)BiCGStab algorithm and BiCGStab algorithm.
UR - http://www.scopus.com/inward/record.url?scp=24944535419&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=24944535419&partnerID=8YFLogxK
U2 - 10.1007/11424925_102
DO - 10.1007/11424925_102
M3 - Conference article
AN - SCOPUS:24944535419
SN - 0302-9743
VL - 3483
SP - 978
EP - 988
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
IS - IV
T2 - International Conference on Computational Science and Its Applications - ICCSA 2005
Y2 - 9 May 2005 through 12 May 2005
ER -