EECS Publication
Computational Variants of the CGS and BiCGstab Methods
Victor Eijkhout
The CGS and BiCGstab algorithms were derived by their authors from the bi-conjugate gradient iteration. In this paper a derivation from the (unnormalized) Lanczos algorithm is given. Experimental results are given, showing that these methods offer no immediate advantage over their earlier counterparts.
Published 1994-08-01 05:00:00 as ut-cs-94-241 (ID:448)