### 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 language | English |
---|---|

Title of host publication | Lecture Notes in Computer Science |

Editors | O. Gervasi, M.L. Gavrilova, V. Kumar, A. Lagana, H.P. Lee, Y. Mun, D. Taniar, C.J.K. Tan |

Pages | 978-988 |

Number of pages | 11 |

Volume | 3483 |

Edition | IV |

Publication status | Published - 2005 |

Event | International Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore Duration: 2005 May 9 → 2005 May 12 |

### Other

Other | International Conference on Computational Science and Its Applications - ICCSA 2005 |
---|---|

Country | Singapore |

Period | 05/5/9 → 05/5/12 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science (miscellaneous)

### Cite this

*Lecture Notes in Computer Science*(IV ed., Vol. 3483, pp. 978-988)

**Breakdown-free ML(k)BiCGStab algorithm for non-hermitian linear systems.** / Moriya, Kentaro; Nodera, Takashi.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Lecture Notes in Computer Science.*IV edn, vol. 3483, pp. 978-988, International Conference on Computational Science and Its Applications - ICCSA 2005, Singapore, 05/5/9.

}

TY - GEN

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

M3 - Conference contribution

AN - SCOPUS:24944535419

VL - 3483

SP - 978

EP - 988

BT - Lecture Notes in Computer Science

A2 - Gervasi, O.

A2 - Gavrilova, M.L.

A2 - Kumar, V.

A2 - Lagana, A.

A2 - Lee, H.P.

A2 - Mun, Y.

A2 - Taniar, D.

A2 - Tan, C.J.K.

ER -