Structured backward error — where it appears
Named by 3 essays across 3 fields — each of them below, with the objects they name alongside it.
A spectrum that comes in reciprocal pairs
A palindromic quadratic reads the same backwards, so λ is an eigenvalue exactly when 1/λ is. A general solver discards that, computes the large half of the spectrum perfectly and the small half to seven digits — and the small half is a division away from being perfect too.
A perturbation that keeps the symmetry
The smallest perturbation that makes a computed answer exact is the backward error. Ask for the smallest one that also keeps the problem's structure and the number can only go up — and measured on a palindromic quadratic it goes up by 1.17, while the structure the computed spectrum has lost is not in either number.
Two condition numbers of one matrix
κ₂ is a worst case over perturbations of a given norm, and a normwise perturbation may put its whole budget on the smallest entry. The componentwise number is a worst case over perturbations proportional to the entries, which is what a backward-stable factorisation actually makes. On one matrix they are 3·10¹³ and 13.3, and the error obeys the second.
Named alongside it
The objects these essays reach for when they reach for this one.
Backward errorPalindromic quadraticQuadratic eigenvalue problemReciprocal pairStructure preservingCayley transformComponentwise condition numberCondition numberExact ground truthForward errorGeneralised eigenvalue problemInterior point method