grid-hierarchy
At its defaults it draws a 4-level hierarchy on 15 points, and the coarse operator it implies. Rows of dots, each row half the length of the one above it, with lines joining every coarse point to the three fine points it interpolates to.
grid-hierarchy is one function in lib/figures/multigrid.js —
multigrid — the smoother, the coarse grid, and the rate that does not move. 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.
Rows of dots, each row half the length of the one above it, with lines joining every coarse point to the three fine points it interpolates to.
levels: 6
The arguments are the ones A rate that does not notice the size passes. A value drawn at the generator's defaults instead would be a picture no essay asked for and no assertion has been run against.
Rows of dots, each row half the length of the one above it, with lines joining every coarse point to the three fine points it interpolates to.
levels: 4
The arguments are the ones Coarsening in one direction only passes. A value drawn at the generator's defaults instead would be a picture no essay asked for and no assertion has been run against.
Rows of dots, each row half the length of the one above it, with lines joining every coarse point to the three fine points it interpolates to.
levels: 5
The arguments are the ones The coarse problem is a different problem passes. A value drawn at the generator's defaults instead would be a picture no essay asked for and no assertion has been run against.
Rows of dots, each row half the length of the one above it, with lines joining every coarse point to the three fine points it interpolates to.
What it checked while drawing
Every figure above asserted its own claims on the way to being drawn, and a claim that failed
would have failed the build rather than drawn a wrong picture. Those assertions 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.
7 distinct claims across 4 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.
the Galerkin operator at level 1 is the coarse discretisation — asserted 5 times
matmul shapes agree
the hierarchy has at least three levels and at most six
Against the rule
The rule does not apply to it. It factorises nothing, so there is no residual it could be withholding. That is worth stating rather than leaving blank: a site that reported the rule as satisfied by every generator would be counting mostly generators the rule never reached.
Across the library: the rule bites on 52
of 99 generators —
37 print a residual and
15 are exempt with a published reason;
47 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.
A rate that does not notice the size
The V-cycle reduces the residual by a factor of ten a cycle at fifteen points and at a hundred and twenty-seven. Jacobi on the same four problems goes from 0.981 to 0.9978, climbing towards one. One of those is a constant and the other is an exponent, and that is the whole distinction the field turns on.
Iterating, instead of factorisingCoarsening in one direction only
Leave the smoother alone and halve only the strong direction, and the smoothing factor is 0.3340 — identical to line relaxation's, at every anisotropy and every weight, to twelve digits. The convergence factors are then a factor of three apart, and at 45° both repairs fail outright.
Iterating, instead of factorisingThe coarse problem is a different problem
In one dimension the Galerkin coarse operator is the coarse discretisation, entry for entry — this site asserted it. In two dimensions a five-point operator produces a nine-point coarse one, so the recursion solves a different discretisation at every level below the first, and converges at 0.20 a cycle regardless.
Iterating, instead of factorisingThe error smoothing cannot reach
One weighted Jacobi sweep multiplies every mode of the error by a number, and the number is a sine. Half the modes are cut by three or better, and the other half come back at 0.999 — which is not a failure of the method but the fact the whole of multigrid is built on.
Iterating, instead of factorisingThe same problem on a coarser grid
Restriction, the coarse operator and interpolation are three matrices with nine distinct entries between them. Two of the three are each other's transpose, and their product with the fine operator is the coarse discretisation exactly — not approximately, entry for entry, at every level.