Matrix norm — where it appears
Named by 2 essays across 2 fields — each of them below, with the objects they name alongside it.
An estimate that can be fooled
Nobody computes a condition number, because forming an inverse costs more than the solve did. Every library estimates it instead, from four or five products with a factorisation already in hand. The estimate is exactly right on four random matrices out of five — and there is a matrix, three distinct entries wide, on which it returns a twentieth of the truth.
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.
Named alongside it
The objects these essays reach for when they reach for this one.
Condition numberAdmissibilityCluster treeCondition estimationCounterexampleElimination orderFill-reducing orderingHierarchical matrixHilbert matrixLower boundLU factorisationOff diagonal rank