sign in
english version rss feed

inria-00429617, version 1

Exact and Approximated error of the FMA

Sylvie Boldo () 12, Jean-Michel Muller () 34

IEEE Transactions on Computers 60, 2 (2011) 157-164

Abstract: 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.

  • Domain : Computer Science/Logic in Computer Science
    Computer Science/Numerical Analysis
 
  • inria-00429617, version 1
  • oai:hal.inria.fr:inria-00429617
  • From: 
  • Submitted on: Tuesday, 3 November 2009 16:45:02
  • Updated on: Monday, 12 December 2011 11:17:54
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...