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
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
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
Abstract : 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
Document type :
Journal articles
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download
https://hal-ens-lyon.archives-ouvertes.fr/ensl-00086904
Contributor : Jean-Michel Muller <>
Submitted on : Thursday, July 20, 2006 - 12:41:24 PM
Last modification on : Wednesday, November 20, 2019 - 7:24:29 AM
Long-term archiving on : Monday, April 5, 2010 - 10:38:17 PM

File

RangeReductionIEEETC0305.pdf

Identifiers

Collections

INRIA | UNIV-ST-ETIENNE | CNRS | UNIV-PERP | LIP | ENS-LYON | UNIV-LYON1

Citation

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

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

357

Files downloads

1066

Contact

CCSD