How this site is made

The figure library

Every picture here is generated from code at build time, and asserts its own claims on the way. This page lists the generators, each rendered at its defaults, with what each one checked and whether it prints a residual.

No figure on this site is a drawing that was made once and saved. Each one is a function: it takes parameters and returns SVG, so the same generator produces the loss-of-orthogonality curve at 53 mantissa bits and at 11 without either being redrawn, and the essay that argues about eight-bit arithmetic gets a figure drawn at eight bits rather than one drawn at the generator's convenience.

That is the reason the collection can keep growing without the illustrations drifting apart. A generator is written once, checked once, and every essay that calls it inherits the same line weights, the same colour roles, and the same behaviour in dark mode. There are 397 of them so far, called 3010 times.

Each has its own page — every set of arguments an essay passes it, the claims it put to the test while drawing them, and where it stands against the rule this site is named for. Those claims are collected by running the generator rather than written down: between them the library made 6825 distinct assertions during this build, and 0 generators made none, which is a debt the pages state plainly.

The rule reaches 217 of them: 199 draw a decomposition and print its residual, and 18 call a factoriser without drawing one and carry a written reason. The remaining 180 factorise nothing.

This page was a gallery — one rendering of each generator — until the library passed a hundred and thirty and the page passed half a megabyte. It is a list now, and the rendering is on each generator's own page, beside the arguments the essays pass it and the claims it checked while drawing them.

  • aaa-support — 7 placements across 1 essay, 14 claims, prints its residual.
  • accumulation-excess — 6 placements across 1 essay, 15 claims, prints its residual.
  • accuracy-optimum — 2 placements across 2 essays, 12 claims, prints its residual.
  • adi-identity — 7 placements across 2 essays, 8 claims, prints its residual.
  • aggregate-map — 6 placements across 1 essay, 4 claims.
  • aimed-not-general — 8 placements across 3 essays, 5 claims, prints its residual.
  • angle-cliff — 6 placements across 1 essay, 8 claims, prints its residual.
  • angle-floor — 3 placements across 3 essays, 30 claims.
  • anisotropy-factors — 8 placements across 3 essays, 4 claims.
  • approximant-contest — 6 placements across 1 essay, 5 claims, prints its residual.
  • approximant-error — 6 placements across 1 essay, 6 claims, prints its residual.
  • arrowhead-model — 2 placements across 2 essays, 8 claims.
  • arrowhead-projection — 2 placements across 2 essays, 11 claims.
  • arrowhead-two-ways — 7 placements across 2 essays, 4 claims, prints its residual.
  • backward-chosen — 5 placements across 2 essays, 11 claims, prints its residual.
  • balancing-kappa — 7 placements across 2 essays, 11 claims, exempt — the bars are condition numbers of two Gramians; the Gramian's agreement with its closed form is asserted at 10⁻¹⁴ inside the generator and no factor of any matrix is drawn.
  • bareiss-minors — 19 placements across 3 essays, 37 claims.
  • barrier-error — 29 placements across 4 essays, 31 claims, prints its residual.
  • barrier-reuse — 6 placements across 1 essay, 11 claims, prints its residual.
  • barrier-skeel — 8 placements across 2 essays, 11 claims, prints its residual.
  • basis-conditioning — 13 placements across 2 essays, 36 claims, prints its residual.
  • basis-orthogonality — 6 placements across 2 essays, 11 claims.
  • bit-swell — 11 placements across 5 essays, 6 claims.
  • block-crossing — 4 placements across 3 essays, 3 claims.
  • block-deflation — 2 placements across 2 essays, 7 claims.
  • block-multiplicity — 7 placements across 2 essays, 6 claims, prints its residual.
  • block-ordering — 8 placements across 2 essays, 6 claims.
  • block-partition — 4 placements across 2 essays, 11 claims, prints its residual.
  • block-scan — 24 placements across 4 essays, 55 claims, prints its residual.
  • block-step — 6 placements across 1 essay, 5 claims.
  • block-width-cost — 6 placements across 2 essays, 8 claims.
  • border-approach — 9 placements across 2 essays, 18 claims.
  • bound-tightness — 3 placements across 2 essays, 11 claims.
  • box-verdict — 8 placements across 2 essays, 6 claims.
  • breakdown-approach — 2 placements across 1 essay, 6 claims, prints its residual.
  • breakdown-onset — 6 placements across 1 essay, 5 claims, prints its residual.
  • bulge-chase — 7 placements across 1 essay, 8 claims, prints its residual.
  • cancellation — 11 placements across 5 essays, 13 claims.
  • cg-convergence — 8 placements across 3 essays, 263 claims.
  • cg-filter-shape — 6 placements across 2 essays, 6 claims, prints its residual.
  • chan-vs-strang — 6 placements across 1 essay, 19 claims.
  • cheeger-band — 10 placements across 2 essays, 18 claims, exempt — each bar spans λ₂/2 and √(2λ₂) and the dot inside it is the conductance the sweep achieved — the figure is the inequality and its three numbers, and a badge would print the dot a second time.
  • cholesky-growth — 7 placements across 2 essays, 29 claims, prints its residual.
  • cholesky-stops — 5 placements across 1 essay, 8 claims, prints its residual.
  • chung-reduction — 2 placements across 1 essay, 13 claims.
  • circulant-construction — 2 placements across 2 essays, 5 claims.
  • circulant-margin — 2 placements across 2 essays, 4 claims.
  • circulant-spectrum — 22 placements across 4 essays, 93 claims, prints its residual.
  • cluster-thinning — 7 placements across 2 essays, 19 claims.
  • clustered-spectrum — 2 placements across 1 essay, 10 claims, prints its residual.
  • coarse-stencil — 2 placements across 1 essay, 7 claims.
  • complex-pair-plane — 2 placements across 2 essays, 5 claims, prints its residual.
  • complex-symbol — 8 placements across 2 essays, 6 claims.
  • componentwise-bound — 8 placements across 3 essays, 14 claims, prints its residual.
  • condition-amplify — 9 placements across 4 essays, 7 claims, exempt — uses the SVD only to obtain κ for the axis.
  • congruence-bars — 6 placements across 1 essay, 5 claims.
  • constraint-cost — 2 placements across 2 essays, 6 claims.
  • constraint-spectrum — 7 placements across 1 essay, 11 claims, prints its residual.
  • contour-count — 9 placements across 3 essays, 7 claims, prints its residual.
  • contour-recovery — 8 placements across 2 essays, 10 claims, prints its residual.
  • contraction-determinant — 6 placements across 1 essay, 4 claims.
  • core-energy — 2 placements across 1 essay, 7 claims.
  • cospectral-pair — 6 placements across 1 essay, 25 claims, prints its residual.
  • cramer-backward — 6 placements across 1 essay, 7 claims.
  • crosswind-repair — 2 placements across 1 essay, 9 claims, prints its residual.
  • crosswind-slice — 4 placements across 1 essay, 14 claims.
  • curvature-trail — 7 placements across 2 essays, 6 claims, prints its residual.
  • decomposition-kappa — 5 placements across 1 essay, 33 claims.
  • definiteness-edge — 2 placements across 1 essay, 10 claims, prints its residual.
  • definiteness-verdict — 6 placements across 1 essay, 5 claims, prints its residual.
  • degree-deficit — 6 placements across 1 essay, 7 claims, prints its residual.
  • delay-branches — 6 placements across 1 essay, 7 claims.
  • depth-residual — 7 placements across 1 essay, 12 claims, prints its residual.
  • derived-weights — 2 placements across 2 essays, 4 claims, prints its residual.
  • description-ladder — 4 placements across 3 essays, 14 claims, prints its residual.
  • det-routes — 5 placements across 3 essays, 7 claims.
  • detection-onset — 7 placements across 2 essays, 12 claims, prints its residual.
  • determinant-sweep — 7 placements across 3 essays, 4 claims.
  • diagonal-exact — 7 placements across 2 essays, 9 claims.
  • difference-floor — 6 placements across 1 essay, 7 claims.
  • dimension-steps — 6 placements across 1 essay, 10 claims.
  • directed-bracket — 2 placements across 2 essays, 10 claims.
  • directed-spectrum — 8 placements across 1 essay, 13 claims.
  • double-root-loss — 3 placements across 2 essays, 12 claims.
  • downdate-leverage — 7 placements across 2 essays, 14 claims.
  • drift-ends — 6 placements across 1 essay, 20 claims.
  • drift-growth — 7 placements across 2 essays, 9 claims.
  • e4m3-values — 3 placements across 2 essays, 5 claims.
  • eigen-sensitivity — 6 placements across 1 essay, 41 claims, exempt — measures eigenvalue movement; the eigenvectors are never drawn.
  • eigenvalue-conditioning — 7 placements across 2 essays, 33 claims, prints its residual.
  • elimination-fill — 7 placements across 1 essay, 17 claims, prints its residual.
  • elimination-steps — 22 placements across 5 essays, 43 claims, prints its residual.
  • energy-gap — 5 placements across 1 essay, 9 claims.
  • error-after-smoothing — 6 placements across 2 essays, 4 claims.
  • error-triangle — 16 placements across 7 essays, 5 claims, exempt — the factorisation is a step towards the solution; the figure is the error identity.
  • estimate-spread — 9 placements across 3 essays, 10 claims, prints its residual.
  • estimator-walk — 7 placements across 1 essay, 8 claims.
  • exact-ground-truth — 8 placements across 7 essays, 4 claims, exempt — shows a solution vector against the exact one; the badge carries the backward error instead.
  • exp-hump — 2 placements across 2 essays, 6 claims.
  • exp-routes — 12 placements across 2 essays, 7 claims.
  • factor-tolerance — 8 placements across 2 essays, 12 claims, prints its residual.
  • false-certificate — 2 placements across 1 essay, 15 claims, prints its residual.
  • fiedler-sweep — 9 placements across 4 essays, 10 claims, prints its residual.
  • fill-anisotropy — 1 placement across 1 essay, 14 claims, prints its residual.
  • fill-growth — 4 placements across 1 essay, 3 claims.
  • fill-pattern — 2 placements across 1 essay, 4 claims.
  • fill-rank — 7 placements across 1 essay, 9 claims, prints its residual.
  • fill-spectrum — 6 placements across 1 essay, 9 claims, prints its residual.
  • filter-comparison — 1 placement across 1 essay, 4 claims, prints its residual.
  • filter-factors — 49 placements across 6 essays, 154 claims, prints its residual.
  • filter-identity-gap — 7 placements across 2 essays, 6 claims, prints its residual.
  • filter-misfit — 2 placements across 1 essay, 5 claims, prints its residual.
  • flat-valley — 3 placements across 2 essays, 3 claims, exempt — uses the SVD for the worst-conditioned direction only.
  • fooling-ladder — 3 placements across 2 essays, 25 claims.
  • forcing-trail — 3 placements across 1 essay, 7 claims, prints its residual.
  • forcing-u — 2 placements across 2 essays, 4 claims.
  • format-ladder — 2 placements across 2 essays, 16 claims.
  • format-map — 6 placements across 2 essays, 25 claims.
  • format-plane — 5 placements across 1 essay, 7 claims.
  • forward-predicted — 6 placements across 1 essay, 13 claims, prints its residual.
  • gap-cost — 2 placements across 2 essays, 10 claims, prints its residual.
  • gap-sweep — 8 placements across 3 essays, 8 claims.
  • gap-vs-iterate — 7 placements across 2 essays, 11 claims.
  • ghost-ladder — 6 placements across 1 essay, 9 claims, prints its residual.
  • gmres-spectrum — 7 placements across 2 essays, 32 claims.
  • grading-sweep — 7 placements across 2 essays, 44 claims, prints its residual.
  • gram-schmidt-order — 4 placements across 3 essays, 13 claims, exempt — prints the pairwise dot products, which is ‖QᵀQ − I‖ entry by entry.
  • gramian-decay — 7 placements across 2 essays, 7 claims, prints its residual.
  • graph-picture — 5 placements across 4 essays, 10 claims, prints its residual.
  • grid-hierarchy — 3 placements across 2 essays, 7 claims.
  • grounding-choice — 6 placements across 1 essay, 9 claims.
  • growth-factor — 39 placements across 8 essays, 241 claims, prints its residual.
  • hankel-values — 6 placements across 3 essays, 10 claims, prints its residual.
  • hessenberg-reduction — 2 placements across 1 essay, 8 claims, prints its residual.
  • heuristic-excess — 40 placements across 6 essays, 142 claims.
  • hierarchy-cost — 8 placements across 1 essay, 8 claims, prints its residual.
  • householder-reflection — 3 placements across 2 essays, 7 claims.
  • hybrid-curves — 6 placements across 1 essay, 5 claims.
  • hyperbolic-boundary — 7 placements across 2 essays, 13 claims, prints its residual.
  • ichol-ageing — 7 placements across 2 essays, 5 claims.
  • inexact-data — 6 placements across 1 essay, 7 claims.
  • inner-plateau — 25 placements across 4 essays, 20 claims.
  • inner-rule-map — 8 placements across 1 essay, 9 claims.
  • interpolation-points — 6 placements across 1 essay, 11 claims, prints its residual.
  • inverse-backward — 2 placements across 1 essay, 14 claims.
  • inverse-sides — 5 placements across 1 essay, 5 claims.
  • irka-shifts — 4 placements across 1 essay, 12 claims, prints its residual.
  • iteration-race — 5 placements across 1 essay, 5 claims, prints its residual.
  • jacobi-convergence — 2 placements across 2 essays, 12 claims, exempt — plots the off-diagonal norm, which is the convergence measurement.
  • kahan-gap — 7 placements across 2 essays, 25 claims, prints its residual.
  • kappa-census — 10 placements across 2 essays, 4 claims.
  • kernel-cutoff — 6 placements across 1 essay, 3 claims.
  • kernel-spectra — 8 placements across 2 essays, 6 claims, prints its residual.
  • knob-floor — 15 placements across 2 essays, 27 claims.
  • kron-cost — 6 placements across 2 essays, 3 claims.
  • kron-inverse — 7 placements across 1 essay, 6 claims.
  • kron-solve — 7 placements across 2 essays, 17 claims.
  • kron-spectrum — 3 placements across 1 essay, 5 claims, prints its residual.
  • kronecker-size — 6 placements across 2 essays, 3 claims.
  • krylov-exp — 6 placements across 1 essay, 7 claims.
  • krylov-orthogonality — 8 placements across 2 essays, 3 claims.
  • krylov-turn — 2 placements across 2 essays, 6 claims.
  • laplacian-spectrum — 5 placements across 1 essay, 8 claims, prints its residual.
  • lattice-basis — 25 placements across 4 essays, 66 claims.
  • leverage-hat — 28 placements across 4 essays, 57 claims.
  • linearisation-choice — 7 placements across 2 essays, 13 claims.
  • loewner-model — 7 placements across 1 essay, 12 claims, prints its residual.
  • low-rank-error — 11 placements across 6 essays, 59 claims, prints its residual.
  • lu-fill-pattern — 10 placements across 4 essays, 5 claims, prints its residual.
  • markov-blowup — 7 placements across 2 essays, 9 claims.
  • mcmillan-degree — 6 placements across 2 essays, 12 claims, prints its residual.
  • mgw-convergence — 5 placements across 3 essays, 23 claims, prints its residual.
  • mgw-spectrum — 19 placements across 3 essays, 30 claims, prints its residual.
  • mixing-rate — 7 placements across 1 essay, 11 claims, prints its residual.
  • moment-basis — 6 placements across 1 essay, 8 claims, prints its residual.
  • moment-ceiling — 4 placements across 1 essay, 10 claims, prints its residual.
  • moment-conditioning — 7 placements across 2 essays, 8 claims, prints its residual.
  • nearest-orthogonal — 29 placements across 6 essays, 92 claims, prints its residual.
  • newton-trails — 2 placements across 2 essays, 8 claims.
  • noise-share — 6 placements across 1 essay, 17 claims, prints its residual.
  • normal-equations-road — 8 placements across 3 essays, 8 claims, exempt — plots the forward error of two least-squares routes; no factor is displayed.
  • normal-form — 6 placements across 3 essays, 7 claims.
  • null-basis-bars — 20 placements across 3 essays, 26 claims, prints its residual.
  • null-basis-sweep — 2 placements across 2 essays, 10 claims, prints its residual.
  • one-step-cost — 7 placements across 2 essays, 9 claims, exempt — the bars ARE the ratio of a measured H∞ error to the Hankel singular value that was removed, and both components are printed beside each bar — a residual badge would restate the figure.
  • one-trade — 6 placements across 1 essay, 9 claims, prints its residual.
  • order-spread — 2 placements across 1 essay, 7 claims.
  • order-stability — 7 placements across 2 essays, 7 claims.
  • ordering-bars — 30 placements across 5 essays, 35 claims.
  • ordering-cost — 4 placements across 3 essays, 12 claims, prints its residual.
  • ordering-fill — 7 placements across 1 essay, 11 claims, prints its residual.
  • ordering-legality — 21 placements across 3 essays, 200 claims, prints its residual.
  • orth-loss-curve — 47 placements across 7 essays, 117 claims, exempt — the whole plot is ‖QᵀQ − I‖ — the residual is the vertical axis.
  • orthogonalisation-order — 7 placements across 2 essays, 12 claims.
  • orthogonality-collapse — 2 placements across 2 essays, 7 claims, prints its residual.
  • orthogonality-spread — 6 placements across 1 essay, 9 claims, prints its residual.
  • orthogonality-vs-kappa — 2 placements across 2 essays, 11 claims, prints its residual.
  • oscillatory-scale — 6 placements across 1 essay, 6 claims, prints its residual.
  • overdamped-gap — 6 placements across 1 essay, 13 claims, prints its residual.
  • overflow-norm — 6 placements across 1 essay, 8 claims.
  • oversampling-band — 8 placements across 2 essays, 11 claims, prints its residual.
  • pagerank-converge — 11 placements across 2 essays, 25 claims, prints its residual.
  • pairing-use — 7 placements across 2 essays, 14 claims.
  • parameter-rules — 42 placements across 7 essays, 50 claims.
  • partial-walk — 7 placements across 2 essays, 5 claims.
  • partition-answers — 6 placements across 1 essay, 5 claims.
  • partition-degeneracy — 4 placements across 1 essay, 7 claims, prints its residual.
  • partition-ranks — 6 placements across 1 essay, 16 claims, prints its residual.
  • pattern-buys — 2 placements across 2 essays, 12 claims.
  • peclet-threshold — 9 placements across 3 essays, 10 claims, prints its residual.
  • penalty-null-space — 3 placements across 3 essays, 7 claims.
  • pencil-projective — 7 placements across 1 essay, 8 claims, prints its residual.
  • pencil-routes — 7 placements across 1 essay, 19 claims, prints its residual.
  • permutation-census — 6 placements across 1 essay, 8 claims.
  • perron-sign — 6 placements across 1 essay, 9 claims, prints its residual.
  • perturbation-shape — 7 placements across 1 essay, 7 claims, prints its residual.
  • perturbed-eigenvalues — 2 placements across 1 essay, 9 claims, prints its residual.
  • picard-plot — 16 placements across 4 essays, 12 claims.
  • pivot-blocks — 10 placements across 3 essays, 21 claims, prints its residual.
  • pivot-conflict — 6 placements across 1 essay, 8 claims, prints its residual.
  • pivot-failure — 8 placements across 1 essay, 5 claims, exempt — prints backward and forward error for both runs, which is the stronger statement here.
  • pivot-ties — 2 placements across 1 essay, 17 claims, prints its residual.
  • pivot-under-scaling — 8 placements across 3 essays, 14 claims, prints its residual.
  • pivot-units — 7 placements across 1 essay, 30 claims.
  • plane-and-vectors — 11 placements across 2 essays, 6 claims.
  • polar-iterations — 5 placements across 1 essay, 13 claims.
  • policy-cost — 11 placements across 2 essays, 7 claims.
  • precision-asymmetry — 8 placements across 3 essays, 16 claims, prints its residual.
  • precision-ladder — 2 placements across 2 essays, 11 claims, exempt — solves a system at eight precisions; the figure is the error, not the factors.
  • precision-nonknob — 2 placements across 2 essays, 6 claims.
  • precision-threshold — 7 placements across 2 essays, 35 claims, prints its residual.
  • precondition-kappa — 7 placements across 2 essays, 17 claims, prints its residual.
  • precondition-steps — 2 placements across 1 essay, 23 claims, prints its residual.
  • precondition-total — 4 placements across 1 essay, 3 claims, prints its residual.
  • preconditioner-effect — 9 placements across 2 essays, 5 claims, prints its residual.
  • prime-budget — 6 placements across 1 essay, 7 claims.
  • probe-ceiling — 2 placements across 2 essays, 5 claims, prints its residual.
  • probe-spread — 3 placements across 2 essays, 9 claims.
  • products-count — 7 placements across 2 essays, 10 claims, prints its residual.
  • projected-floor — 2 placements across 2 essays, 29 claims.
  • projected-residual — 4 placements across 1 essay, 9 claims.
  • projection-geometry — 2 placements across 1 essay, 6 claims, prints its residual.
  • projection-stability — 20 placements across 3 essays, 73 claims.
  • qep-backward-error — 5 placements across 2 essays, 18 claims.
  • qep-conditioning — 7 placements across 2 essays, 13 claims, prints its residual.
  • qep-count — 7 placements across 2 essays, 8 claims, prints its residual.
  • qep-spectrum — 8 placements across 3 essays, 13 claims, prints its residual.
  • qq-printed — 5 placements across 4 essays, 6 claims, prints its residual.
  • qr-iteration — 8 placements across 3 essays, 10 claims, prints its residual.
  • randomised-error — 26 placements across 7 essays, 70 claims, prints its residual.
  • rank-accuracy — 9 placements across 2 essays, 13 claims, prints its residual.
  • rank-band — 9 placements across 3 essays, 6 claims, prints its residual.
  • rank-by-field — 7 placements across 2 essays, 10 claims.
  • rank-decision — 9 placements across 2 essays, 5 claims, exempt — the figure is the singular value spectrum itself.
  • rank-diagonal — 7 placements across 1 essay, 75 claims, prints its residual.
  • rank-floor — 7 placements across 2 essays, 4 claims.
  • rank-guess — 2 placements across 2 essays, 6 claims, prints its residual.
  • rank-region — 4 placements across 3 essays, 3 claims.
  • rank-share — 7 placements across 1 essay, 2 claims.
  • rank-size — 11 placements across 2 essays, 3 claims, prints its residual.
  • rank-verdict — 6 placements across 1 essay, 4 claims, prints its residual.
  • real-schur-form — 6 placements across 2 essays, 8 claims, prints its residual.
  • reciprocal-pairs — 4 placements across 1 essay, 15 claims, prints its residual.
  • reconstruct-cliff — 4 placements across 1 essay, 6 claims.
  • recovered-signal — 3 placements across 2 essays, 5 claims, prints its residual.
  • refinement-ladder — 7 placements across 2 essays, 8 claims, prints its residual.
  • refinement-stalls — 2 placements across 2 essays, 4 claims.
  • refinement-trail — 7 placements across 2 essays, 20 claims.
  • refresh-crossover — 7 placements across 3 essays, 8 claims.
  • refuse-or-lie — 7 placements across 2 essays, 15 claims, prints its residual.
  • regression-window — 5 placements across 1 essay, 6 claims.
  • regularisation-tradeoff — 2 placements across 2 essays, 15 claims, prints its residual.
  • relative-spectrum — 7 placements across 1 essay, 11 claims, prints its residual.
  • reorth-cost — 2 placements across 2 essays, 8 claims, prints its residual.
  • replacement-repair — 3 placements across 3 essays, 6 claims.
  • replication-crossing — 2 placements across 1 essay, 17 claims.
  • representable-line — 4 placements across 3 essays, 4 claims.
  • residual-backwards — 7 placements across 2 essays, 6 claims, prints its residual.
  • residual-blindness — 7 placements across 2 essays, 11 claims, prints its residual.
  • residual-vs-error — 13 placements across 4 essays, 13 claims, exempt — plots two errors against κ — no factor of any matrix is shown.
  • resistance-exact — 7 placements across 1 essay, 13 claims, prints its residual.
  • resolvent-map — 7 placements across 2 essays, 9 claims, prints its residual.
  • restart-convergence — 7 placements across 2 essays, 8 claims.
  • restart-filter — 13 placements across 3 essays, 6 claims, prints its residual.
  • restriction-ratio — 7 placements across 1 essay, 109 claims, prints its residual.
  • reuse-safe — 2 placements across 2 essays, 6 claims.
  • reversal — 7 placements across 1 essay, 11 claims, prints its residual.
  • root-conditioning — 6 placements across 1 essay, 5 claims.
  • rotation-failure — 7 placements across 2 essays, 5 claims, prints its residual.
  • rounding-line — 2 placements across 2 essays, 8 claims.
  • rounds-vs-words — 11 placements across 2 essays, 8 claims, prints its residual.
  • saddle-inertia — 26 placements across 4 essays, 74 claims, prints its residual.
  • scaled-classifier — 3 placements across 3 essays, 5 claims, prints its residual.
  • scaling-recovery — 6 placements across 1 essay, 17 claims.
  • schulz-ball — 2 placements across 2 essays, 4 claims.
  • schur-fill — 2 placements across 1 essay, 4 claims, prints its residual.
  • search-map — 7 placements across 1 essay, 9 claims.
  • second-order-basis — 7 placements across 3 essays, 11 claims.
  • second-pass — 6 placements across 2 essays, 15 claims.
  • seed-against-machine — 6 placements across 1 essay, 4 claims.
  • semiconvergence-curve — 66 placements across 10 essays, 330 claims, prints its residual.
  • sep-vs-gap — 5 placements across 1 essay, 19 claims, prints its residual.
  • sequence-cost — 31 placements across 5 essays, 77 claims.
  • series-cancellation — 6 placements across 1 essay, 7 claims.
  • setup-walk — 6 placements across 1 essay, 5 claims.
  • shadow-cost — 2 placements across 2 essays, 6 claims, prints its residual.
  • sign-window — 6 placements across 1 essay, 2 claims.
  • singular-scatter — 6 placements across 1 essay, 10 claims, prints its residual.
  • singularity-tests — 6 placements across 1 essay, 10 claims.
  • sketch-distortion — 8 placements across 3 essays, 7 claims.
  • sketch-draws — 2 placements across 1 essay, 9 claims.
  • sketch-feasibility — 6 placements across 1 essay, 10 claims, prints its residual.
  • sketch-oversampling — 6 placements across 1 essay, 10 claims, prints its residual.
  • sketch-signal — 6 placements across 1 essay, 14 claims.
  • slice-band — 8 placements across 2 essays, 6 claims, prints its residual.
  • slice-staircase — 3 placements across 1 essay, 5 claims, prints its residual.
  • smoothing-gain — 2 placements across 2 essays, 4 claims, prints its residual.
  • smoothing-spectrum — 8 placements across 2 essays, 14 claims.
  • smoothing-square — 9 placements across 3 essays, 7 claims.
  • solution-length — 8 placements across 3 essays, 6 claims.
  • solve-cost — 7 placements across 1 essay, 9 claims, prints its residual.
  • solver-backward — 7 placements across 2 essays, 13 claims, prints its residual.
  • spanning-tree-count — 9 placements across 2 essays, 32 claims, prints its residual.
  • sparsifier-quality — 7 placements across 1 essay, 11 claims, prints its residual.
  • spectrum-decay — 7 placements across 3 essays, 12 claims, prints its residual.
  • split-rule — 1 placement across 1 essay, 5 claims.
  • spread-and-bound — 7 placements across 2 essays, 4 claims.
  • spurious-spectrum — 6 placements across 1 essay, 8 claims, prints its residual.
  • squaring-cost — 3 placements across 2 essays, 7 claims.
  • stagnation — 8 placements across 1 essay, 5 claims, prints its residual.
  • staleness-trail — 3 placements across 3 essays, 8 claims.
  • stationary-rates — 6 placements across 1 essay, 4 claims.
  • stationary-vs-degree — 2 placements across 1 essay, 13 claims.
  • storage-size — 43 placements across 7 essays, 56 claims, prints its residual.
  • strang-sign-change — 13 placements across 2 essays, 20 claims.
  • strength-graph — 7 placements across 2 essays, 3 claims.
  • subnormal-gap — 6 placements across 1 essay, 14 claims.
  • sum-doubles — 3 placements across 3 essays, 4 claims, prints its residual.
  • summation-error — 7 placements across 2 essays, 3 claims.
  • swamp-trace — 25 placements across 4 essays, 45 claims.
  • sylvester-spy — 4 placements across 2 essays, 7 claims.
  • symbolic-bound — 5 placements across 1 essay, 11 claims, prints its residual.
  • szego-approach — 14 placements across 3 essays, 14 claims.
  • thick-bound — 7 placements across 2 essays, 9 claims.
  • three-counters — 9 placements across 3 essays, 29 claims, prints its residual.
  • three-residuals — 6 placements across 1 essay, 9 claims, prints its residual.
  • three-walks — 7 placements across 3 essays, 13 claims.
  • threshold-stops — 7 placements across 1 essay, 8 claims, prints its residual.
  • threshold-switch — 7 placements across 2 essays, 5 claims, prints its residual.
  • threshold-tradeoff — 28 placements across 5 essays, 55 claims, prints its residual.
  • tls-gap — 3 placements across 2 essays, 16 claims, prints its residual.
  • tolerance-agreement — 5 placements across 1 essay, 7 claims, prints its residual.
  • tolerance-obtained — 3 placements across 3 essays, 16 claims, prints its residual.
  • trace-rate — 18 placements across 4 essays, 33 claims, prints its residual.
  • train-accuracy — 7 placements across 2 essays, 10 claims.
  • train-dimension — 3 placements across 2 essays, 8 claims.
  • train-ranks — 7 placements across 3 essays, 7 claims, prints its residual.
  • transfer-response — 3 placements across 2 essays, 8 claims, prints its residual.
  • transient-growth — 9 placements across 1 essay, 173 claims, prints its residual.
  • tree-stretch — 7 placements across 1 essay, 17 claims, exempt — the bar is the preconditioned spectrum's own two ends and the tick is the total stretch, which is a combinatorial integer with no arithmetic in it; every quantity a badge could carry is already an endpoint of the bar.
  • tropical-prediction — 7 placements across 2 essays, 7 claims.
  • truncated-cg — 9 placements across 2 essays, 4 claims, prints its residual.
  • truncation-bound — 6 placements across 1 essay, 14 claims, prints its residual.
  • trust-region-share — 8 placements across 2 essays, 9 claims, prints its residual.
  • tsqr-ladder — 7 placements across 1 essay, 11 claims, prints its residual.
  • tucker-error — 12 placements across 2 essays, 17 claims.
  • tucker-storage — 7 placements across 2 essays, 3 claims.
  • tuned-solution — 9 placements across 2 essays, 6 claims, prints its residual.
  • two-conductances — 6 placements across 1 essay, 14 claims.
  • two-dimensional-limit — 3 placements across 2 essays, 9 claims.
  • two-eliminations — 6 placements across 1 essay, 9 claims, prints its residual.
  • two-norms — 2 placements across 2 essays, 4 claims, exempt — the bars are ratios of two measured errors, each a norm of a function obtained through a Lyapunov solve; nothing factorised is displayed and the comparison is the whole figure.
  • two-recurrences — 5 placements across 1 essay, 21 claims, prints its residual.
  • two-residuals — 7 placements across 1 essay, 6 claims.
  • two-routes-rank — 3 placements across 3 essays, 17 claims, prints its residual.
  • two-sided-census — 6 placements across 1 essay, 5 claims, prints its residual.
  • ulp-staircase — 6 placements across 1 essay, 6 claims.
  • undefined-eigenvector — 2 placements across 2 essays, 7 claims.
  • unfolding-ranks — 2 placements across 2 essays, 2 claims, prints its residual.
  • uniqueness-width — 2 placements across 2 essays, 12 claims.
  • unit-ladder — 9 placements across 3 essays, 36 claims, prints its residual.
  • units-overflow — 6 placements across 2 essays, 10 claims.
  • unlucky-prime — 8 placements across 1 essay, 6 claims.
  • update-inherits — 7 placements across 2 essays, 13 claims.
  • upwind-identity — 8 placements across 2 essays, 10 claims, prints its residual.
  • vcycle-2d — 7 placements across 1 essay, 9 claims, prints its residual.
  • vcycle-rate — 5 placements across 1 essay, 16 claims.
  • verification-band — 2 placements across 2 essays, 16 claims.
  • verified-boundary — 7 placements across 1 essay, 36 claims.
  • weighting-limit — 26 placements across 5 essays, 37 claims, prints its residual.
  • weighting-order — 2 placements across 1 essay, 12 claims, prints its residual.
  • wilkinson-growth — 6 placements across 2 essays, 7 claims, prints its residual.
  • window-drift — 15 placements across 2 essays, 76 claims.
  • wrapping-growth — 7 placements across 2 essays, 7 claims.
  • wrong-problem — 7 placements across 2 essays, 8 claims, prints its residual.
  • xi-curve — 2 placements across 2 essays, 3 claims.
  • zolotarev-shape — 6 placements across 2 essays, 5 claims.