Iterative refinement is an iterative method proposed by James H. Wilkinson to improve the accuracy of numerical solutions to systems of linear equations. When solving a linear system A x = b , {\displaystyle A\mathbf {x} =\mathbf {b} \,,} due to the compounded accumulation of rounding errors, the computed solution x ^ {\displaystyle {\hat {\mathbf {x} }}} may sometimes deviate from the exact solution x ⋆ . {\displaystyle \mathbf {x} _{\star }\,.} Starting with x 1 = x ^ , {\displaystyle \mathbf {x} _{1}={\hat {\mathbf {x} }}\,,} iterative refinement computes a sequence { x 1 , x 2 , x 3 , … } {\displaystyle \{\mathbf {x} _{1},\,\mathbf {x} _{2},\,\mathbf {x} _{3},\dots \}} which converges to x ⋆ , {\displaystyle \mathbf {x} _{\star }\,,} when certain assumptions are met.
Description For m = 1 , 2 , 3 , … , {\displaystyle m=1,2,3,\dots \,,} the mth iteration of iterative refinement consists of three steps:
The crucial reasoning for the refinement algorithm is that although the solution for cm in step (ii) may indeed be troubled by similar errors as the first solution, x ^ {\displaystyle {\hat {\mathbf {x} }}} , the calculation of the residual rm in step (i), in comparison, is numerically nearly exact: You may not know the right answer very well, but you know quite accurately just how far the solution you have in hand is from producing the correct outcome (b). If the residual is small in some sense, then the correction must also be small, and should at the very least steer the current estimate of the answer, xm, closer to the desired one, x ⋆ . {\displaystyle \mathbf {x} _{\star }\,.}
The iterations will stop on their own when the residual rm is zero, or close enough to zero that the corresponding correction cm is too small to change the solution xm which produced it; alternatively, the algorithm stops when rm is too small to convince the linear algebraist monitoring the progress that it is worth continuing with any further refinements. Note that the matrix equation solved in step (ii) uses the same matrix A {\displaystyle A} for each iteration. If the matrix equation is solved using a direct method, such as Cholesky or LU decomposition, the numerically expensive factorization of A {\displaystyle A} is done once and is reused for the relatively inexpensive forward and back substitution to solve for cm at each iteration.
Error analysis As a rule of thumb, iterative refinement for Gaussian elimination produces a solution correct to working precision if double the working precision is used in the computation of r, e.g. by using quad or double extended precision IEEE 754 floating point, and if A is not too ill-conditioned (and the iteration and the rate of convergence are determined by the condition number of A). More formally, assuming that each step (ii) can be solved reasonably accurately, i.e., in mathematical terms, for every m, we have
A ( I + F m ) c m = r m {\displaystyle A\left(I+F_{m}\right)\mathbf {c} _{m}=\mathbf {r} _{m}}
where ‖Fm‖∞ < 1, the relative error in the m-th iterate of iterative refinement satisfies
… excerpt ends here. Continue reading the full article.
