Computational costs per iteration are similar to BiCG, but the method doesn't require the transpose matrix. Unlike BiCG, the two matrix-vector products are not independent, so the number of synchronization points in a parallel environment is larger. Applicable to nonsymmetric matrices. Computational costs per iteration are similar to BiCG and CGS, but the method doesn't require the transpose matrix. The computational structure is similar to that of CG, but there are no synchronization points.
Table shows the type of operations performed per iteration.
Based on the particular problem or data structure, the user may observe that a particular operation could be performed more efficiently.