Computing correctly rounded integer powers in floating-point arithmetic
ACM Transactions on Mathematical Software (TOMS)
Sollya: an environment for the development of numerical codes
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
Efficient and accurate computation of upper bounds of approximation errors
Theoretical Computer Science
| Hi-index | 0.00 |
The high-quality floating-point implementation of use- ful functions f : R R, such as exp, sin, erf requires bounding the error = p-f f of an approximation p with regard to the function f . This involves bounding the infi- nite norm of the error function. Its value must not be underestimated when implementations must be safe. Previous approaches for computing infinite norm are shown to be either unsafe, not sufficiently tight or too te- dious in manual work. We present a safe and self-validating algorithm for auto- matically upper- and lower-bounding infinite norms of er- ror functions. The algorithm is based on enhanced inter- val arithmetic. It can overcome high cancellation and high condition number around points where the error function is defined only by continuous extension. The given algorithm is implemented in a software tool. It can generate a proof of correctness for each instance on which it is run.