Section:
New Software and Platforms
Exhaustive Tests for the Correct Rounding
of Mathematical Functions
Participant :
Vincent Lefèvre.
The search for the worst cases for the correct rounding
(hardest-to-round cases) of mathematical functions (, ,
, , etc.) in a fixed precision (mainly double precision)
using Lefèvre's algorithm is implemented by a set of utilities written
in Perl, with calls to Maple/intpakX for computations on intervals
and with C code generation for fast computations. It also includes a
client-server system for the distribution of intervals to be tested
and for tracking the status of intervals (fully tested, being tested,
aborted).
The support for the function has been added, and this function
has been tested on the full domain (together with its inverse function).
Results are available from: https://www.vinc17.net/research/testlibm/
Previous | 
Home