Top Cited Papers
Open Access
Abstract
We propose a general algorithm for solving an $n\times n$ nonsingular linear system $Ax = b$ based on iterative refinement with three precisions. The working precision is combined with possibly different precisions for solving for the correction term and for computing the residuals. Via rounding error analysis of the algorithm we derive sufficient conditions for convergence and bounds for the attainable forward error and normwise and componentwise backward errors. Our results generalize and unify many existing rounding error analyses for iterative refinement. With single precision as the working precision, we show that by using LU factorization in IEEE half precision as the solver and calculating the residuals in double precision it is possible to solve $Ax = b$ to full single precision accuracy for $\infty$-norm condition numbers $\kappa_{\infty}(A) \le 10^4$, with the $O(n^3)$ part of the computations carried out entirely in half precision. We show further that by solving the correction equations by GMR...
Funding Information
  • MathWorks
  • Engineering and Physical Sciences Research Council (EP/P020720/1)

This publication has 31 references indexed in Scilit: