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.
|ジャーナル||Lecture Notes in Computer Science|
|出版物ステータス||Published - 2005 9 26|
|イベント||International Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore|
継続期間: 2005 5 9 → 2005 5 12
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)