Published in

Association for Computing Machinery (ACM), ACM Transactions on Mathematical Software, 2(41), p. 1-8, 2015

DOI: 10.1145/2629615

Links

Tools

Export citation

Search in Google Scholar

On the error of Computing ab + cd using Cornea, Harrison and Tang's method

Journal article published in 2015 by Jean-Michel Muller ORCID
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

In their book, Scientific Computing on the Itanium , Cornea et al. [2002] introduce an accurate algorithm for evaluating expressions of the form ab + cd in binary floating-point arithmetic, assuming an FMA instruction is available. They show that if p is the precision of the floating-point format and if u = 2 -p , the relative error of the result is of order u . We improve their proof to show that the relative error is bounded by 2 u +7 u 2 +6 u 3 . Furthermore, by building an example for which the relative error is asymptotically (as p → ∞ or, equivalently, as u → 0) equivalent to 2 u , we show that our error bound is asymptotically optimal.