Issue No. 02 - February (2011 vol. 60)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2010.139
Sylvie Boldo , INRIA Saclay, Orsay and University Parid-Sud, CNRS, Orsay
Jean-Michel Muller , CNRS, Université de Lyon, Lyon and INRIA/Arénaire
The fused multiply accumulate-add (FMA) instruction, specified by the IEEE 754-2008 Standard for Floating-Point Arithmetic, eases some calculations, and is already available on some current processors such as the Power PC or the Itanium. We first extend an earlier work on the computation of the exact error of an FMA (by giving more general conditions and providing a formal proof). Then, we present a new algorithm that computes an approximation to the error of an FMA, and provide error bounds and a formal proof for that algorithm.
Floating-point arithmetic, FMA, fused multiply-add, computer arithmetic, error-free transforms, error compensation, error of an FMA.
J. Muller and S. Boldo, "Exact and Approximated Error of the FMA," in IEEE Transactions on Computers, vol. 60, no. , pp. 157-164, 2010.