Breakdown-free ML(k)BiCGStab algorithm for non-hermitian linear systems

Kentaro Moriya, Takashi Nodera

研究成果: Conference article査読

2 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)978-988
ページ数11
ジャーナルLecture Notes in Computer Science
3483
IV
DOI
出版ステータスPublished - 2005
イベントInternational Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore
継続期間: 2005 5 92005 5 12

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Breakdown-free ML(k)BiCGStab algorithm for non-hermitian linear systems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル