Stochastic Rounding: Implementation, Error Analysis, and Applications

Croci, Matteo and Fasi, Massimiliano and Higham, Nicholas J. and Mary, Theo and Mikaitis, Mantas (2021) Stochastic Rounding: Implementation, Error Analysis, and Applications. [MIMS Preprint] (Submitted)

This is the latest version of this item.

[thumbnail of cfhm22.pdf] Text
cfhm22.pdf
Download (486kB)

Abstract

Stochastic rounding randomly maps a real number to one of the two nearest values in a finite precision number system. First proposed for use in computer arithmetic in the 1950s, it is attracting renewed interest. If used in floating-point arithmetic in the computation of the inner product of two vectors of length n, it yields an error bounded by \sqrt(n)u with high probability, where u is the unit roundoff, which is not necessarily the case for round to nearest. A particular attraction of stochastic rounding is that, unlike round to nearest, it is immune to the phenomenon of stagnation, whereby a sequence of tiny updates to a relatively large quantity are lost. We survey stochastic rounding, covering its mathematical properties and probabilistic error analysis, its implementation, and its use in applications, including deep learning and the numerical solution of differential equations.

Item Type: MIMS Preprint
Subjects: MSC 2010, the AMS's Mathematics Subject Classification > 65 Numerical analysis
MSC 2010, the AMS's Mathematics Subject Classification > 68 Computer science
Depositing User: Mr Mantas Mikaitis
Date Deposited: 18 Jan 2022 18:27
Last Modified: 18 Jan 2022 18:27
URI: https://eprints.maths.manchester.ac.uk/id/eprint/2843

Available Versions of this Item

Actions (login required)

View Item View Item