A new range-reduction algorithm

Jean-Michel Muller (1, 2) , Nicolas Brisebarre (3) , Peter Kornerup (4) , David Defour (5) , Nathalie Revol (1, 2)

1 LIP - Laboratoire de l'Informatique du Parallélisme
2 ARENAIRE - Computer arithmetic
3 LArAl - Laboratoire d'Arithmétique et d'Algèbre
4 IMADA - Department of Mathematics and Computer Science [Odense]
5 LP2A - Laboratoire de Physique Appliquée et d'Automatique

Range-reduction is a key point for getting accurate elementary function routines. We introduce a new algorithm that is fast for input arguments belonging to the most common domains, yet accurate over the full double-precision range.

Keywords: floating point arithmetic; elementary function evaluation; range reduction

Domains: Computer Science [cs]; Other [cs.OH]

Jean-Michel Muller, Nicolas Brisebarre, Peter Kornerup, David Defour, Nathalie Revol. A new range-reduction algorithm. IEEE Transactions on Computers, 2005, 54 (3), pp.331- 339. ⟨10.1109/TC.2005.36⟩. ⟨ensl-00086904⟩