Wrapping effect — where it appears
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
A bound that is proved
Every error statement on this site so far is a measurement of one run. Interval arithmetic makes a different kind of claim — the answer lies in this set, for this input, with no probability attached — and its failure mode is that it returns nothing at all. On a Hilbert system it proves a bound 23 times the error it bounds, and one size later it refuses.
Nine steps of pessimism
A proved bound is 8 to 26 times the error it bounds, at every precision from 16 to 40 significand bits. A carried interval is (√2)ᵐ times too wide after m re-enclosures. The two cross between eight and nine, so the method everybody warns against is the tighter of the two for a short computation.
Named alongside it
The objects these essays reach for when they reach for this one.
Condition numberDirected roundingHilbert matrixInterval arithmeticUnit roundoffVerified computingCancellationForward errorResidual