A Smoothed Conjugate Residual Squared Algorithm for Solving Nonsymmetric Linear Systems

Recently the conjugate residual squared (CRS) method has been proposed as an attractive variant of the bi-conjugate residual method. However, in many situations, the CRS algorithm exhibits an irregular convergence behavior. To overcome the disadvantage, we apply a smoothing technique to the CRS algorithm and derived the smoothed CRS algorithm. Numerical experiments indicate that the new method give smoother convergence behavior than CRS and compete with well-known BiCGSTAB method.