What Every Computer Scientist Should Know About Floating-Point Arithmetic.¶
Goldberg, D. (1991). What Every Computer Scientist Should Know About Floating-Point Arithmetic. ACM Computing Surveys, 23(1), 5-48.
Cited by¶
5 citations across 5 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Algorithm
- A common failure is reasoning about the abstract algorithm while the implementation silently violates its assumptions
This sourceCanonical survey of how finite-precision floating-point implementation diverges from abstract real-number computation, producing rounding error, cancellation, and overflow not visible at the specification level
- A common failure is reasoning about the abstract algorithm while the implementation silently violates its assumptions
- Dense Set
- The substitute-the-dense-subset move is what every floating-point computation relies on — finite-precision rationals standing in for the continuum up to machine tolerance.
This sourceCanonical reference on finite-precision rationals standing in for the continuum up to machine tolerance.
- The substitute-the-dense-subset move is what every floating-point computation relies on — finite-precision rationals standing in for the continuum up to machine tolerance.
- Monoid
- IEEE-754 floating-point addition has a plausible unit in +0.0 and is not associative, so parallel summation of the same floats returns different totals under different partitionings — a defect that hides because it is invisible at small scale and on one core.
This sourceShows that floating-point addition is not associative, so a summation's result depends on how the terms are grouped.
- IEEE-754 floating-point addition has a plausible unit in +0.0 and is not associative, so parallel summation of the same floats returns different totals under different partitionings — a defect that hides because it is invisible at small scale and on one core.
Domain-specific¶
Mechanisms¶
- Cross-Representation Regression Suite
- Set with the numerical realities in mind: floating-point arithmetic is not associative, so different summation orders legitimately differ in the last digits.
This sourceExplains that floating-point addition is nonassociative and that reordered sums can legitimately produce different rounded results.
- Set with the numerical realities in mind: floating-point arithmetic is not associative, so different summation orders legitimately differ in the last digits.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Links previously used in the corpus¶
Before the registry existed this work was also linked 1 other way.
Registry ID ref:1b5cfb774b77 · see in the full table