Mechanizing Olver's Error Arithmetic
We mechanize the fundamental properties of a rounding error model for floating-point arithmetic based on relative precision, a measure of error proposed as a substitute for relative error in rounding error analysis.A key property of relative precision is that it forms a true metric, providing a well-defined measure of distance between exact results and their floating-point approximations while offering a structured approach to propagating error bounds through sequences of computations.Our mechanization formalizes this property, establishes rules for converting between relative precision and relative error, and shows that the rounding error model based on relative precision slightly overapproximates the standard rounding error model.Finally, we demonstrate, with a simple example of the inner product of two vectors, that this alternative model facilitates a tractable approach to developing certified rounding error bounds.
Authors
- Samuel Pollard (ORCID: https://orcid.org/0000-0002-3275-4064)
- Ariel Kellison (ORCID: https://orcid.org/0000-0003-3177-7958)
- Max Fan (ORCID: https://orcid.org/0009-0001-3664-6538)
Institutions
- Cornell University (US)
- Sandia National Laboratories (US)
Publication Details
- Journal
- Electronic Proceedings in Theoretical Computer Science
- Published
- 2025-10-14
- DOI
- https://doi.org/10.4204/eptcs.432.6
- Primary Topic
- Computability, Logic, AI Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation
- U.S. Department of Energy
- National Nuclear Security Administration
- Sandia National Laboratories