Levinson recursion — where it appears
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
A nearby problem of the wrong kind
A good algorithm returns the exact answer to a nearby problem. A hundred and eighteen essays have measured the distance and not one has asked what the nearby problem looks like. On a Toeplitz system it is a rank-one matrix that is constant along none of its diagonals — and the smallest one that is Toeplitz is two and a half million times larger.
The number that cannot rank them
Levinson and Gaussian elimination are indistinguishable on the backward error a library reports — every one of ninety-six measurements between 1.16·10⁻¹⁷ and 5.73·10⁻¹⁷. The structured backward error separates them by up to a hundredfold, in whichever direction the point happens to give. Only the forward error ranks them, and only because this family's exact answer is known.
Named alongside it
The objects these essays reach for when they reach for this one.
Backward errorBackward stabilityCondition numberExact inverseStructured perturbationToeplitz matrixFast algorithmForward errorGaussian eliminationLow-rank updateStructured backward error