抄録
The Bi-CGSTAB(L) proposed by Sleijpen, et.al. is one of iterative solvers for large and sparse nonsymmetric linear systems, and is used extensively. However, it is hard to estimate a suitable value of the restart number L for good convergence behavior in realistic problems. In this paper, we propose a way to select dynamically L for getting more efficient convergence behavior in Bi-CGSTAB(L). Finally, we compare the Bi-CGSTAB(L) using the dynamic selection of L with the original Bi-CGSTAB(L) by several numerical experiments.
