Exhaustive Tests for the Correct Rounding of Mathematical Functions
Participant : Vincent Lefèvre.
The programs to search for the worst cases for the correct rounding of mathematical functions (exp , log , sin , cos , etc.) in a fixed precision (mainly double precision) using Lefèvre's algorithm have been further improved, in particular: The computations can optionally stop at the right time in case of high load average, in order to get results faster. Heuristics based on consistency of the results have been added to detect bugs in the compiler/libraries/etc.