Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

21

TC
2011

favoriteEmaildiscussreport

219views Information Technology» more TC 2011»

Exact and Approximated Error of the FMA

12 years 11 months ago

Exact and Approximated Error of the FMA

Download perso.ens-lyon.fr

Abstract—The fused multiply accumulate-add (FMA) instruction, speciﬁed 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 ﬁrst 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.

Sylvie Boldo, Jean-Michel Muller

Real-time Traffic

Exact Error | Formal Proof | Ieee 754-2008 Standard | Software Engineering | TC 2011 |

claim paper

Related Content

» Exact real arithmetic using centred intervals and bounded error terms

» On TaylorEddy solutions of approximate deconvolution models of turbulence

» Pixel Approximation Errors in Common Watershed Algorithms

» Exact and errorbounded approximate color buffer compression and decompression

» Exact and Approximate Methods for Calculating Signal and Transition Probabilities in FSMs

» Exact integration of diffusion orientation distribution functions for graphbased diffusion...

» Exact and Approximate Aggregation in Constraint Query

» Discontinuous Galerkin approximations of the Stokes and NavierStokes equations

» Error Analysis of Approximated PCRLBs for Nonlinear Dynamics

Post Info
More Details (n/a)

Added	15 May 2011
Updated	15 May 2011
Type	Journal
Year	2011
Where	TC
Authors	Sylvie Boldo, Jean-Michel Muller

Comments (0)