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. |
Year | DOI | Venue |
---|---|---|
2018 | 10.1109/ARITH.2018.8464793 | 2018 IEEE 25th Symposium on Computer Arithmetic (ARITH) |
Keywords | Field | DocType |
integer functions,IEEE floating-point operations,floating-point number | Integer,MATLAB,Hypotenuse,Floating point,Computer science,Parallel computing,Rounding,Computational science,Scaling,Spurious relationship,Computation | Conference |
ISSN | ISBN | Citations |
1063-6889 | 978-1-5386-2665-8 | 2 |
PageRank | References | Authors |
0.45 | 4 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Claude-Pierre Jeannerod | 1 | 224 | 22.05 |
Jean-Michel Muller | 2 | 466 | 66.61 |
PAUL ZIMMERMANN | 3 | 524 | 34.13 |