951 search results - page 8 / 191 » On the Computation of Correctly-Rounded Sums |
FSTTCS
2010
Springer
14 years 8 months ago
2010
Springer
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...
AML
2008
14 years 10 months ago
2008
ARITH
2007
IEEE
15 years 4 months ago
2007
IEEE
One considers the problem of finding hard to round cases of a periodic function for large floating-point inputs, more precisely when the function cannot be efficiently approxim...
ARITH
1999
IEEE
15 years 2 months ago
1999
IEEE
The design and implementation of a double precision floating-point IEEE-754 standard adder is described which uses "flagged prefix addition" to merge rounding with the s...
SAC
2006
ACM
14 years 10 months ago
2006
ACM
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...