Bunch–Kaufman — where it appears
Named by 2 essays across 2 fields — each of them below, with the objects they name alongside it.
When symmetry is not enough
The matrix [[0, 1], [1, 0]] is symmetric, nonsingular and perfectly conditioned, and there is no diagonal entry to pivot on. Every factorisation restricted to symmetric interchanges and one-by-one pivots fails on it, at any depth of searching, because every entry it could search is zero. The repair is to take two variables at once.
The regularisation that legalises every order
Perturb a saddle-point matrix's two blocks in opposite directions and it acquires a factorisation with a diagonal D under every symmetric permutation — not under a good one, under all of them. Five hundred random orderings, five hundred successes, and a growth factor that spans six orders across them.
Named alongside it
The objects these essays reach for when they reach for this one.
Growth factorLDLᵀ factorisationSaddle-point systemsCholeskyComplete pivotingConstrained minimisationIndefinite matrixInertiaIterative refinementPartial pivotingQuasi definite matrixRegularisation