Hutchinson's estimator — where it appears
Named by 2 essays across one field — 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 rate that belongs to the matrix
Hutchinson's fitted exponent sits near a half on every spectrum measured. Hutch++'s runs from −7.15 to −0.67 across the same four budgets, decided entirely by how fast the singular values fall — so one of the two methods has a convergence rate and the other has a rate per matrix. The ±1 probe's advantage moves the same way, from 1.56× at n = 10 to 1.09× at n = 120.
Named alongside it
The objects these essays reach for when they reach for this one.
Matrix-freeProbabilistic boundsRandom projectionSpectral decayTrace estimationCancellationDeflationFrobenius normGeneralised cross-validationInfluence matrix