Residual Smoothing Techniques: Do They Improve the Limiting Accuracy of Iterative Solvers?

Abstract

Many iterative methods for solving linear systems, in particular the biconjugate gradient (BiCG) method and its “squared” version CGS (or BiCGS), produce often residuals whose norms decrease far from monotonously, but fluctuate rather strongly. Large intermediate residuals are known to reduce the ultimately attainable accuracy of the method, unless special measures are taken to counteract this effect. One measure that has been suggested is residual smoothing: by application of simple recurrences, the iterates x n and the corresponding residuals r n :≡ b − Ax n are replaced by smoothed iterates y n and corresponding residuals s n :≡ b− Ay n. We address the question whether the smoothed residuals can ultimately become markedly smaller than the primary ones. To investigate this, we present a roundoff error analysis of the smoothing algorithms. It shows that the ultimately attainable accuracy of the smoothed iterates, measured in the norm of the corresponding residuals, is, in general, not higher than that of the primary iterates. Nevertheless, smoothing can be used to produce certain residuals, most notably those of the minimum residual method, with higher attainable accuracy than by other frequently used algorithms.