Incomplete factorisation — where it appears
Named by 2 essays across 2 fields — each of them below, with the objects they name alongside it.
The zero you are allowed to write
A deflation criterion sets a subdiagonal entry to zero because it is small. A drop tolerance discards an entry of a factor because it is small. A truncation discards a singular value because it is small. Three fields, three vocabularies, no shared arithmetic — and plotted as work saved against error accepted, one curve.
An operator with no entries
At the sizes where linear algebra is expensive the matrix does not exist. What exists is a subroutine that returns Av. Every Krylov method survives that unchanged; every algorithm that reads an entry disappears. And the derivative such a code computes is accurate to ten digits instead of sixteen, which turns out to cost nothing at all.
Named alongside it
The objects these essays reach for when they reach for this one.
PreconditioningBackward errorCancellationDeflationDrop toleranceEckart–YoungFinite differenceJacobianKrylov subspaceLow-rank approximationMatrix-freeNewton iteration