Expression contraction — where it appears
Named by 3 essays across one field — each of them below, with the objects they name alongside it.
Also named here as fused multiply-add — the same set of essays touches all of them, so they are one junction rather than several.
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.
A matrix that is definite on one machine
Two hundred Gram matrices, two conforming builds, and twenty-six of them get different answers to "is this positive definite". The exact verdict, from determinants in BigInt rationals, says the fused build is right nine times and the other one seventeen.
A square that evaluates negative
(x − 1)⁶ evaluated near x = 1 comes out negative at 179 of 401 points on one build and 196 on another, and the two disagree about the sign at 98 of them. Neither is nearer the truth: both traces are made entirely of rounding.
Named alongside it
The objects these essays reach for when they reach for this one.
Fused multiply-addBitwise reproducibilityCatastrophic cancellationDefiniteness testBisectionCholesky factorisationCondition squaringDeterminantError accumulationError-free transformationExact arithmeticGram matrix