Weak admissibility — where it appears
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
Which pairs are allowed to be small
A hierarchical representation is a partition of the matrix into blocks, and the rule that produces it reads four numbers per pair of index clusters and not one entry of the matrix. On a 256-square it yields 112 blocks, 66 of them stored as two thin factors, none of rank above five.
The test that costs what it saves
The partition that refuses to compress a touching pair keeps every rank at five while the other lets them climb from nine to thirteen. It also stores more numbers at every size measured — 67,968 against 61,440 at n = 512 — and which of those two facts matters is a question about how large the problem is going to get.
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