Carson, Erin and Higham, Nicholas J. (2017) Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions. SIAM Journal on Scientific Computing (2017.24). ISSN 1749-9097
This is the latest version of this item.
Text
cahi18.pdf - Published Version Available under License Creative Commons Attribution. Download (2MB) |
Abstract
We propose a general algorithm for solving a $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 normwise 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 condition numbers $\kappa_2(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 GMRES preconditioned by the LU factors the restriction on the condition number can be weakened to $\kappa_2(A) \le 10^8$, although in general there is no guarantee that GMRES will converge quickly. Taking for comparison a standard $Ax = b$ solver that uses LU factorization in single precision, these results suggest that on architectures for which half precision is efficiently implemented it will be possible to solve certain linear systems $Ax = b$ up to twice as fast \emph{and} to greater accuracy. Analogous results are given with double precision as the working precision.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | iterative refinement, linear system, multiple precision, mixed precision, rounding error analysis, backward error, forward error, GMRES, preconditioning |
Subjects: | MSC 2010, the AMS's Mathematics Subject Classification > 15 Linear and multilinear algebra; matrix theory MSC 2010, the AMS's Mathematics Subject Classification > 65 Numerical analysis |
Depositing User: | Nick Higham |
Date Deposited: | 17 Mar 2018 09:07 |
Last Modified: | 17 Mar 2018 09:07 |
URI: | https://eprints.maths.manchester.ac.uk/id/eprint/2629 |
Available Versions of this Item
-
Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions. (deposited 26 Jul 2017)
- Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions. (deposited 17 Mar 2018 09:07) [Currently Displayed]
Actions (login required)
View Item |