Concept

Weak admissibility — where it appears

The rule that compresses every off-diagonal block of a partition without asking whether its clusters are separated. It gives far fewer blocks than a geometric test and a rank that grows slowly with the size, and it is the format almost every hierarchical solver actually uses.

Named by 2 essays across one field — each of them below, with the objects they name alongside it.

Named alongside it

The objects these essays reach for when they reach for this one.

AdmissibilityBlock methodsCluster treeHierarchical matrixOff diagonal rankAsymptotic analysisFlop countKernel matrixLower boundMatrix structureNumerical rankSubdivision

All concepts