A p × p bit fraction model of binary floating point division and extremal rounding cases
Theoretical Computer Science - Real numbers and computers
| Hi-index | 0.00 |
The Table Maker's Dilemma is the problem of always getting exactly rounded results when computing the elementary functions. After a brief presentation of this problem, we present new developments that helped us to solve this problem for the double-precision exponential function in a small domain. These new results show that this problem can be solved, at least for the double-precision format, for the most usual functions.