951 search results - page 2 / 191 » On the Computation of Correctly-Rounded Sums |
ARITH
2001
IEEE
13 years 9 months ago
2001
IEEE
We give the results of our search for the worst cases for correct rounding of the major elementary functions in double precision floating-point arithmetic. These results allow the...
ITA
2007
13 years 5 months ago
2007
We explicit the link between the computer arithmetic problem of providing correctly rounded algebraic functions and some diophantine approximation issues. This allows to get bounds...
TC
1998
13 years 5 months ago
1998
—The Table Maker’s Dilemma is the problem of always getting correctly rounded results when computing the elementary functions. After a brief presentation of this problem, we pr...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
We introduce two algorithms for accurately evaluating powers to a positive integer in floating-point arithmetic, assuming a fused multiply-add (fma) instruction is available. We ...
ARITH
2009
IEEE
13 years 10 months ago
2009
IEEE
This paper deals with the design and implementation of low latency software for binary floating-point division with correct rounding to nearest. The approach we present here targe...