Unit in the last place

In computer science and numerical analysis, unit in the last place or unit of least precision (ulp) is the spacing between two consecutive floating-point numbers, i.e., the value the least significant digit (rightmost digit) represents if it is 1. It is used as a measure of accuracy in numeric calculations. ^[1]

Definition

The most common definition is: In radix ${\displaystyle b}$ with precision ${\displaystyle p}$, if ${\displaystyle b^{e}\leq |x|<b^{e+1}}$, then ${\displaystyle \operatorname {ulp} (x)=b^{\max\{e,\,e_{\min }\}-p+1}}$, ^[2] where ${\displaystyle e_{\min }}$ is the minimal exponent of the normal numbers. In particular, ${\displaystyle \operatorname {ulp} (x)=b^{e-p+1}}$ for normal numbers, and ${\displaystyle \operatorname {ulp} (x)=b^{e_{\min }-p+1}}$ for subnormals.

Another definition, suggested by John Harrison, is slightly different: ${\displaystyle \operatorname {ulp} (x)}$ is the distance between the two closest straddling floating-point numbers ${\displaystyle a}$ and ${\displaystyle b}$ (i.e., satisfying ${\displaystyle a\leq x\leq b}$ and ${\displaystyle a\neq b}$), assuming that the exponent range is not upper-bounded. ^{[3] [4]} These definitions differ only at signed powers of the radix. ^[2]

The IEEE 754 specification—followed by all modern floating-point hardware—requires that the result of an elementary arithmetic operation (addition, subtraction, multiplication, division, and square root since 1985, and FMA since 2008) be correctly rounded, which implies that in rounding to nearest, the rounded result is within 0.5 ulp of the mathematically exact result, using John Harrison's definition; conversely, this property implies that the distance between the rounded result and the mathematically exact result is minimized (but for the halfway cases, it is satisfied by two consecutive floating-point numbers). Reputable numeric libraries compute the basic transcendental functions to between 0.5 and about 1 ulp. Only a few libraries compute them within 0.5 ulp, this problem being complex due to the Table-maker's dilemma. ^[5]

Examples

Example 1

Let ${\displaystyle x}$ be a positive floating-point number and assume that the active rounding mode is round to nearest, ties to even, denoted ${\displaystyle \operatorname {RN} }$. If ${\displaystyle \operatorname {ulp} (x)\leq 1}$, then ${\displaystyle \operatorname {RN} (x+1)>x}$. Otherwise, ${\displaystyle \operatorname {RN} (x+1)=x}$ or ${\displaystyle \operatorname {RN} (x+1)=x+\operatorname {ulp} (x)}$, depending on the value of the least significant digit and the exponent of ${\displaystyle x}$. This is demonstrated in the following Haskell code typed at an interactive prompt:^{[ citation needed ]}

> until(\x->x==x+1)(+1)0::Float 1.6777216e7 > it-1 1.6777215e7 > it+1 1.6777216e7 

Here we start with 0 in single precision (binary32) and repeatedly add 1 until the operation does not change the value. Since the significand for a single-precision number contains 24 bits, the first integer that is not exactly representable is 2²⁴+1, and this value rounds to 2²⁴ in round to nearest, ties to even. Thus the result is equal to 2²⁴.

Example 2

The following example in Java approximates π as a floating point value by finding the two double values bracketing ${\displaystyle \pi }$: ${\displaystyle p_{0}<\pi <p_{1}}$.

// π with 20 decimal digitsBigDecimalπ=newBigDecimal("3.14159265358979323846");// truncate to a double floating pointdoublep0=π.doubleValue();// -> 3.141592653589793  (hex: 0x1.921fb54442d18p1)// p0 is smaller than π, so find next number representable as doubledoublep1=Math.nextUp(p0);// -> 3.1415926535897936 (hex: 0x1.921fb54442d19p1)

Then ${\displaystyle \operatorname {ulp} (\pi )}$ is determined as ${\displaystyle \operatorname {ulp} (\pi )=p_{1}-p_{0}}$.

// ulp(π) is the difference between p1 and p0BigDecimalulp=newBigDecimal(p1).subtract(newBigDecimal(p0));// -> 4.44089209850062616169452667236328125E-16// (this is precisely 2**(-51))// same result when using the standard library functiondoubleulpMath=Math.ulp(p0);// -> 4.440892098500626E-16 (hex: 0x1.0p-51)

Example 3

Another example, in Python, also typed at an interactive prompt, is:

>>> x=1.0>>> p=0>>> whilex!=x+1:... x=x*2... p=p+1... >>> x9007199254740992.0>>> p53>>> x+2+19007199254740996.0

In this case, we start with x = 1 and repeatedly double it until x = x + 1. Similarly to Example 1, the result is 2⁵³ because the double-precision floating-point format uses a 53-bit significand.

Language support

The Boost C++ libraries provides the functions boost::math::float_next, boost::math::float_prior, boost::math::nextafter and boost::math::float_advance to obtain nearby (and distant) floating-point values, ^[6] and boost::math::float_distance(a, b) to calculate the floating-point distance between two doubles. ^[7]

The C language library provides functions to calculate the next floating-point number in some given direction: nextafterf and nexttowardf for float, nextafter and nexttoward for double, nextafterl and nexttowardl for long double, declared in <math.h>. It also provides the macros FLT_EPSILON, DBL_EPSILON, LDBL_EPSILON, which represent the positive difference between 1.0 and the next greater representable number in the corresponding type (i.e. the ulp of one). ^[8]

The Java standard library provides the functions Math.ulp(double) and Math.ulp(float) . They were introduced with Java 1.5.

The Swift standard library provides access to the next floating-point number in some given direction via the instance properties nextDown and nextUp. It also provides the instance property ulp and the type property ulpOfOne (which corresponds to C macros like FLT_EPSILON ^[9] ) for Swift's floating-point types. ^[10]

See also

• IEEE 754
• ISO/IEC 10967, part 1 requires an ulp function
• Least significant bit (LSB)
• Machine epsilon
• Round-off error

References

1. Goldberg, David (March 1991). "What Every Computer Scientist Should Know About Floating-Point Arithmetic" (PDF). ACM Computing Surveys . 23 (1): 5–48. doi: 10.1145/103162.103163 . S2CID   222008826. Archived (PDF) from the original on 20 July 2006. Retrieved 20 January 2016. (, , ).
2. 1 2 Muller, Jean-Michel; Brunie, Nicolas; de Dinechin, Florent; Jeannerod, Claude-Pierre; Joldes, Mioara; Lefèvre, Vincent; Melquiond, Guillaume; Revol, Nathalie; Torres, Serge (2018) [2010]. Handbook of Floating-Point Arithmetic (2 ed.). Birkhäuser. doi:10.1007/978-3-319-76526-6. ISBN   978-3-319-76525-9.
3. Harrison, John. "A Machine-Checked Theory of Floating Point Arithmetic" . Retrieved 17 July 2013.
4. Muller, Jean-Michel (2005–11). "On the definition of ulp(x)". INRIA Technical Report 5504. ACM Transactions on Mathematical Software, Vol. V, No. N, November 2005. Retrieved in 2012-03 from http://ljk.imag.fr/membres/Carine.Lucas/TPScilab/JMMuller/ulp-toms.pdf.
5. Kahan, William. "A Logarithm Too Clever by Half" . Retrieved 14 November 2008.
6. Boost float_advance.
7. Boost float_distance.
8. ISO/IEC 9899:1999 specification (PDF). p. 237, §7.12.11.3 The nextafter functions and §7.12.11.4 The nexttoward functions.
9. "ulpOfOne - FloatingPoint | Apple Developer Documentation". Apple Inc. Apple Inc. Retrieved 18 August 2019.
10. "FloatingPoint - Swift Standard Library | Apple Developer Documentation". Apple Inc. Apple Inc. Retrieved 18 August 2019.

Bibliography

• Goldberg, David (1991–03). "Rounding Error" in "What Every Computer Scientist Should Know About Floating-Point Arithmetic". Computing Surveys, ACM, March 1991. Retrieved from http://docs.oracle.com/cd/E19957-01/806-3568/ncg_goldberg.html#689.
• Muller, Jean-Michel (2010). Handbook of floating-point arithmetic. Boston: Birkhäuser. pp. 32–37. ISBN   978-0-8176-4704-9.