On various ways to split a floating-point number

Claude-Pierre Jeannerod 1 Jean-Michel Muller 1 Paul Zimmermann 2
1 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
2 CARAMBA - Cryptology, arithmetic : algebraic methods for better algorithms
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : We review several ways to split a floating-point number, that is, to decompose it into the exact sum of two floating-point numbers of smaller precision. All the methods considered here involve only a few IEEE floating-point operations, with rounding to nearest and including possibly the fused multiply-add (FMA). Applications range from the implementation of integer functions such as round and floor to the computation of suitable scaling factors aimed, for example, at avoiding spurious underflows and overflows when implementing functions such as the hypotenuse.
Type de document :
Communication dans un congrès
ARITH 2018 - 25th IEEE Symposium on Computer Arithmetic, Jun 2018, Amherst (MA), United States. IEEE, pp.1-8
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01774587
Contributeur : Paul Zimmermann <>
Soumis le : lundi 23 avril 2018 - 17:04:17
Dernière modification le : mardi 24 avril 2018 - 12:38:56
Document(s) archivé(s) le : mercredi 19 septembre 2018 - 01:56:30

Fichier

split.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01774587, version 1

Citation

Claude-Pierre Jeannerod, Jean-Michel Muller, Paul Zimmermann. On various ways to split a floating-point number. ARITH 2018 - 25th IEEE Symposium on Computer Arithmetic, Jun 2018, Amherst (MA), United States. IEEE, pp.1-8. 〈hal-01774587v1〉

Partager

Métriques

Consultations de la notice

22

Téléchargements de fichiers

18