Cancellation — where it appears
Named by 2 essays across 2 fields — each of them below, with the objects they name alongside it.
Counting what cannot be looked at
The trace is n additions and one of the most expensive quantities in the subject to estimate, because the matrices whose trace is wanted are never stored. Hutchinson's estimator is unbiased with one line of algebra — and its variance depends on which random vector is used, by a factor that is a property of the matrix, and on a diagonal matrix one choice is exact from the first probe and the other is not.
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.
Named alongside it
The objects these essays reach for when they reach for this one.
Condition numberDirected roundingGeneralised cross validationHilbert matrixHutchinson's estimatorInfluence matrixInterval arithmeticMatrix-freeProbabilistic boundsRandom projectionSpectral decayTrace estimation