Elimination order — where it appears
Named by 3 essays across 2 fields — each of them below, with the objects they name alongside it.
Two ends of the same arrow
One matrix, one row moved from the front of the elimination order to the back, and the factor goes from completely dense to no fill at all. Both factorisations are exact to rounding, and nothing numerical chose between them.
The same matrix, numbered twice
One symmetric permutation. The condition number is 24.3948 either way to eight digits and the Frobenius norm is 6.13996414·10³ either way to twelve. The partition that stored 27,008 numbers now finds no admissible pair anywhere and stores all 65,536, and the format that compresses regardless stores 118,208.
The fill that is not independent
Eliminate both halves of a grid and what is left on the separator is 100 per cent nonzero — the sparsity field's result, unchanged. Its off-diagonal block is 11 by 12 and six columns describe it to eight digits. Renumber the separator and the same block needs all eleven.
Named alongside it
The objects these essays reach for when they reach for this one.
Fill-reducing orderingFill-inHierarchical matrixOff diagonal rankAdmissibilityArrowhead matrixCholeskyCluster treeCondition numberGaussian eliminationGreens functionKernel matrix