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

Kentaro Moriya, Takashi Nodera

Research output: Contribution to journalConference article

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)978-988
Number of pages11
JournalLecture Notes in Computer Science
Volume3483
Issue numberIV
DOIs
Publication statusPublished - 2005
EventInternational Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore
Duration: 2005 May 92005 May 12

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Breakdown-free ML(k)BiCGStab algorithm for non-hermitian linear systems'. Together they form a unique fingerprint.

  • Cite this