BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum. (English) Zbl 0820.65016

Summary: For a number of linear systems of equations arising from realistic problems, using the Bi-CGSTAB algorithm of H. A. van der Vorst [SIAM J. Sci. Stat. Comput. 13, No. 2, 631-644 (1992; Zbl 0761.65023)] to solve these equations is very attractive. Unfortunately, for a large class of equations, where, for instance, Bi-CG performs well, the convergence of Bi-CGSTAB stagnates. This was observed specifically in case of discretized advection dominated partial differential equations. The stagnation is due to the fact that for this type of equations the matrix has almost pure imaginary eigenvalues. With his BiCGStab2 algorithm M. H. Gutknecht [ibid. 14, No. 5, 1020-1033 (1993)] attempted to avoid this stagnation.
Here, we generalize the Bi-CGSTAB algorithm further, and overcome some shortcomings of BiCGStab2. In some sense, the new algorithm combines GMRES(\(I\)) and Bi-CG and profits from both.


65F10 Iterative numerical methods for linear systems


Zbl 0761.65023


Full Text: EuDML EMIS