Leverage — where it appears
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
Also named here as low-rank update — the same set of essays touches all of them, so they are one junction rather than several.
A correction cheaper than the problem
Sherman and Morrison's formula updates a solved system for a rank-one change to the matrix, at 4n² operations instead of (2/3)n³. It is exact algebra. On a problem whose updated matrix is the identity — condition number one, the easiest system there is — it returns a forward error of 2.5·10⁻⁴ where a direct solve returns 10⁻¹⁶.
The observation that cannot be removed
Removing a rank-one term from a Cholesky factor needs a rotation that is not orthogonal, and the number under its square root is 1 − h, where h is the leverage of the row being removed. The algorithm's breakdown condition and the statistician's warning are the same quantity, arrived at from opposite ends, and neither field states it in the other's language.
Named alongside it
The objects these essays reach for when they reach for this one.
Condition numberLow-rank updateMatrix inverseCholeskyFlop countForward errorGivens rotationLeast squaresLU factorisationOrthogonality