<p>Toward the end of the 20th century, S.-L. Zhang constructed the so-called Zhang’s framework that successfully incorporated the CGS and Bi-CGSTAB methods and subsequently introduced the GPBi-CG method derived from the framework. While the GPBi-CG method often converges faster than the CGS and Bi-CGSTAB methods, there are still cases where the CGS method performs the best. This observation has motivated us to revisit the framework to find a hybrid algorithm, combining the GPBi-CG and CGS methods. In this paper, we introduce the hybrid algorithm, show its efficiency in some numerical experiments, and discuss a possible reason behind its effectiveness.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

GPBi-CG revisited: a hybrid of the CGS method and the GPBi-CG method for nonsymmetric linear systems

  • Tomohiro Sogabe,
  • Shao-Liang Zhang

摘要

Toward the end of the 20th century, S.-L. Zhang constructed the so-called Zhang’s framework that successfully incorporated the CGS and Bi-CGSTAB methods and subsequently introduced the GPBi-CG method derived from the framework. While the GPBi-CG method often converges faster than the CGS and Bi-CGSTAB methods, there are still cases where the CGS method performs the best. This observation has motivated us to revisit the framework to find a hybrid algorithm, combining the GPBi-CG and CGS methods. In this paper, we introduce the hybrid algorithm, show its efficiency in some numerical experiments, and discuss a possible reason behind its effectiveness.