Error-free transformation — where it appears
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
The sum that cannot be wrong
Snap every addend to a common multiple before adding, and every partial sum is exact — so the order stops mattering, by construction rather than by luck. Four hundred permutations return one value where an ordinary reduction returns three hundred and three.
One multiply the compiler removed
A determinant whose value is exactly 1, computed as exactly 0 by the expression that is written down, and exactly 1 by the same expression with the multiply and the add fused. Both forms conform to IEEE-754, both are legal compilations of the same source, and nothing in the program says which one you have.
Named alongside it
The objects these essays reach for when they reach for this one.
Bitwise reproducibilityCatastrophic cancellationDefiniteness testDeterminantExact accumulationExpression contractionFused multiply-addIEEE 754Kahan summationPre-rounded summationReduction orderReproducible summation