Iterative refinement implies numerical stability

Suppose that a method computes an approximation of the exact solution of a linear systemAx=b with the relative errorq,q<1. We prove that if all computations are performed in floating point arithmeticfl and single precision, then with iterative refinement is numerically stable and well-behaved wheneverqA A ^–1 is at most of order unity.