Worst Cases for Correct Rounding of the Elementary Functions in Double Precision

We give the results of our search for the worst cases for correct rounding of the major elementary functions in double precision floating-point arithmetic. These results allow the design of reasonably fast routines that will compute these functions with correct rounding, at least in some interval, for any of the four rounding modes specified by the IEEE-754 standard. They will also allow one to easily test libraries that are claimed to provide correctly rounded functions. Keywords Elementary functions, floating-point arithmetic, computer arithmetic, Table Maker's Dilemma. 1 

• Type: Conference
• Year: 2001
• Where: ARITH
• Authors: Vincent Lefèvre, Jean-Michel Muller
• Keywords: Applied Computing, ARITH 2001, Correct Rounding, Elementary Functions, Floating-Point Arithmetic