Summary. The succc~s of the cyclic Richardson iteration depends on the properordering of the acceleration parameters. We give a rigorous error analysis to show that, with the proper ordering, the relative error in the iterative method, when properly terminated, is not larger than the error incurred in stable direct methods such as Cholesky factorization. For both the computed approximation fi to u = L-if satisfies Ilu-~ll < cond(L)lluH2 -t and this bound is attainable. We also show that the residual norm IIf -L~II is bounded by HLllcond(L) 11~l12-t. This bound is attainable for a small cycle length N. Our analysis suggests that for a larger cycle length N the residuals are bounded by liE II [I~H2-t. We construct a theoretical example in which this bound is attainable. However we observed in all numerical tests that ultimately the residual norms were of order [ILII 11~112 -t. We explain why in practice even the factor ~ is never encountered. Therefore the residual stopping criterion for the Richardson iteration appears to be very reliable and the method itself appears to be stable.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.