On various ways to split a floating-point number - Archive ouverte HAL Access content directly
Conference Papers Year :

On various ways to split a floating-point number

(1) , (1, 2) , (3)
1
2
3

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.
Fichier principal
Vignette du fichier
split.pdf (274.61 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01774587 , version 1 (23-04-2018)
hal-01774587 , version 2 (24-04-2018)

Identifiers

Cite

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. pp.53-60, ⟨10.1109/ARITH.2018.8464793⟩. ⟨hal-01774587v2⟩
466 View
1661 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More