Generalised cross validation — where it appears
Named by 2 essays across 2 fields — each of them below, with the objects they name alongside it.
Also named here as influence matrix — the same set of essays touches all of them, so they are one junction rather than several.
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 parameter chosen on a smaller problem
Inside a hybrid method the regularisation parameter is chosen on a 25×24 problem rather than a 64×64 one. The rule that reads a residual transfers exactly; the rule that reads a trace is biased by exactly two grid steps at twenty-four steps and one at forty, at every noise level from 10% to 0.1%.
Named alongside it
The objects these essays reach for when they reach for this one.
Influence matrixCancellationDiscrepancy principleGolub kahan bidiagonalisationHutchinson's estimatorHybrid regularisationIll posed problemMatrix-freeOracleParameter choiceProbabilistic boundsProjected problem