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

Kentaro Moriya, Takashi Nodera

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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
Title of host publicationLecture Notes in Computer Science
EditorsO. Gervasi, M.L. Gavrilova, V. Kumar, A. Lagana, H.P. Lee, Y. Mun, D. Taniar, C.J.K. Tan
Pages978-988
Number of pages11
Volume3483
EditionIV
Publication statusPublished - 2005
EventInternational Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore
Duration: 2005 May 92005 May 12

Other

OtherInternational Conference on Computational Science and Its Applications - ICCSA 2005
CountrySingapore
Period05/5/905/5/12

    Fingerprint

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Moriya, K., & Nodera, T. (2005). Breakdown-free ML(k)BiCGStab algorithm for non-hermitian linear systems. In O. Gervasi, M. L. Gavrilova, V. Kumar, A. Lagana, H. P. Lee, Y. Mun, D. Taniar, ... C. J. K. Tan (Eds.), Lecture Notes in Computer Science (IV ed., Vol. 3483, pp. 978-988)