ML(k)BiCGSTAB: A biCGSTAB variant based on multiple Lanczos starting vectors. (English) Zbl 0959.65048
A variant of the popular BiCGSTAB method for solving nonsymmetric linear systems is discussed. The new method requires less matrix-vector products to generate. It is discussed that the new method can be implemented as a \(k\)-term recurrence and can be viewed as a bridge connecting the Arnoldi-based FOM-GMRES methods and the Lanczos-based BiCGSTAB methods.
Reviewer: T.C.Mohan (Chennai)
MSC:
65F10 | Iterative numerical methods for linear systems |