Stored entries per row at each level, 400 unknowns and 1192 edges
At its defaults it draws stored entries per row at each level, 400 unknowns and 1192 edges. A rising curve of stored entries per row against level in the hierarchy, beside a flat one for a geometric hierarchy on a grid.
hierarchy-cost is one function in lib/figures/amg.js —
algebraic multigrid — a hierarchy with no grid behind it, and what it costs. Everything below came out of it during this build, at
arguments taken from the essays rather than invented for this page. A figure here is the
figure a reader meets in an essay, and if the generator changes, this page changes with it.
At its defaults
Drawn even though every essay passes arguments — which on this site is every essay, at 100% of placements since the standard pass. A default nothing exercises is a trap for the next essay to call this with none, and this is the page where a default that has drifted from the figures around it becomes visible.
A rising curve of stored entries per row against level in the hierarchy, beside a flat one for a geometric hierarchy on a grid.
extra: 2
The arguments are the ones A hierarchy with no grid behind it passes. A value nobody placed would be a picture no essay asked for and no claim was ever checked against.
A rising curve of stored entries per row against level in the hierarchy, beside a flat one for a geometric hierarchy on a grid.
extra: 1
The arguments are the ones A hierarchy with no grid behind it passes. A value nobody placed would be a picture no essay asked for and no claim was ever checked against.
A rising curve of stored entries per row against level in the hierarchy, beside a flat one for a geometric hierarchy on a grid.
extra: 1.5
The arguments are the ones A hierarchy with no grid behind it passes. A value nobody placed would be a picture no essay asked for and no claim was ever checked against.
A rising curve of stored entries per row against level in the hierarchy, beside a flat one for a geometric hierarchy on a grid.
extra: 2.5
The arguments are the ones A hierarchy with no grid behind it passes. A value nobody placed would be a picture no essay asked for and no claim was ever checked against.
A rising curve of stored entries per row against level in the hierarchy, beside a flat one for a geometric hierarchy on a grid.
extra: 3.5
The arguments are the ones A hierarchy with no grid behind it passes. A value nobody placed would be a picture no essay asked for and no claim was ever checked against.
A rising curve of stored entries per row against level in the hierarchy, beside a flat one for a geometric hierarchy on a grid.
What it checked while drawing
Every figure above checked its own claims on the way to being drawn, and a claim that failed
would have stopped the picture rather than shipped a wrong one. Those checks used to leave
no trace at all: a passing one returned true and the only evidence the figure had
checked anything was that nothing crashed. The list below is what they actually said, collected
by running this generator with an observer installed — not a description of
what it is believed to check.
8 distinct claims across 6 sets of arguments, grouped below by shape — because most of them are one sentence with a different number in it, and how many separate times that sentence was put to the test is the informative part.
a graph with between half and four extra chords a vertex
and has levels to cost
and on a dense one it does not
and the algebraic hierarchy stores more than a geometric one
on a sparse graph it converges quickly
some level is far denser than the matrix it came from
the grid size is one less than a power of two
the hierarchy converges on the problem it is being costed for
Against the rule
It draws a decomposition and prints its residual. It calls
amgSolve,
and every figure above carries the badge — which residualcheck verifies by looking
for it in the emitted SVG rather than by finding the call that builds one. A badge that is
constructed and then left out of the body is the failure that check exists for.
Across the library: the rule bites on 217
of 397 generators —
199 print a residual and
18 are exempt with a published reason;
180 factorise nothing.
Read from lib/residual-rule.js, which is the same body the gate enforces from,
and the gate's last check fails the build if this page and it disagree about any generator.
Where it is called
Changing this generator changes every figure on this list. That is what makes the list worth publishing rather than keeping in a check script.