Numerical Linear Algebra
where the algebra stops being the arithmetic
Generator

Four factorisations of one 512×12 matrix, κ = 7151

One function in the cost library, called 7 times across 1 essay. Below: what it draws at its defaults, what it draws at every value an essay asks for, the 11 claims it put to the test while drawing them, and where it stands against the rule this site is named for.

At its defaults it draws four factorisations of one 512×12 matrix, κ = 7151. A ranked bar chart of the departure from orthogonality, on a logarithmic scale. Classical Gram–Schmidt loses 4.6·10⁻¹⁰, modified 1.5·10⁻¹², Householder 2·10⁻¹⁴. The reduction tree, which touches the matrix once instead of 12 times, is of the same size as Householder's — and its error does not grow with the depth of the tree.

tsqr-ladder is one function in lib/figures/cost.js — cost — where the flop count stopped predicting the time. 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.

Four factorisations of one 512×12 matrix, κ = 7151A ranked bar chart of the departure from orthogonality, on a logarithmic scale. Classical Gram–Schmidt loses 4.6·10⁻¹⁰, modified 1.5·10⁻¹², Householder 2·10⁻¹⁴. The reduction tree, which touches the matrix once instead of 12 times, is of the same size as Householder's — and its error does not grow with the depth of the tree.classical Gram–Schmidt4.62·10⁻¹⁰modified Gram–Schmidt1.49·10⁻¹²Householder, one sweep2.03·10⁻¹⁴reduction tree, 16 leaves1.48·10⁻¹⁵departure from orthogonality, logarithmicthe tree, at four depths‖AᵀA − RᵀR‖/‖AᵀA‖, depth 13.4·10⁻¹⁵‖AᵀA − RᵀR‖/‖AᵀA‖, depth 24.3·10⁻¹⁵‖AᵀA − RᵀR‖/‖AᵀA‖, depth 31.7·10⁻¹⁵‖AᵀA − RᵀR‖/‖AᵀA‖, depth 41.5·10⁻¹⁵the same algebra, four timestwo of them are products of reflections

A ranked bar chart of the departure from orthogonality, on a logarithmic scale. Classical Gram–Schmidt loses 4.6·10⁻¹⁰, modified 1.5·10⁻¹², Householder 2·10⁻¹⁴. The reduction tree, which touches the matrix once instead of 12 times, is of the same size as Householder's — and its error does not grow with the depth of the tree.

rows: 512

The arguments are the ones A reduction that changes the order passes. A value nobody placed would be a picture no essay asked for and no claim was ever checked against.

Four factorisations of one 512×12 matrix, κ = 7151A ranked bar chart of the departure from orthogonality, on a logarithmic scale. Classical Gram–Schmidt loses 4.6·10⁻¹⁰, modified 1.5·10⁻¹², Householder 2·10⁻¹⁴. The reduction tree, which touches the matrix once instead of 12 times, is of the same size as Householder's — and its error does not grow with the depth of the tree.classical Gram–Schmidt4.62·10⁻¹⁰modified Gram–Schmidt1.49·10⁻¹²Householder, one sweep2.03·10⁻¹⁴reduction tree, 16 leaves1.48·10⁻¹⁵departure from orthogonality, logarithmicthe tree, at four depths‖AᵀA − RᵀR‖/‖AᵀA‖, depth 13.4·10⁻¹⁵‖AᵀA − RᵀR‖/‖AᵀA‖, depth 24.3·10⁻¹⁵‖AᵀA − RᵀR‖/‖AᵀA‖, depth 31.7·10⁻¹⁵‖AᵀA − RᵀR‖/‖AᵀA‖, depth 41.5·10⁻¹⁵the same algebra, four timestwo of them are products of reflections

A ranked bar chart of the departure from orthogonality, on a logarithmic scale. Classical Gram–Schmidt loses 4.6·10⁻¹⁰, modified 1.5·10⁻¹², Householder 2·10⁻¹⁴. The reduction tree, which touches the matrix once instead of 12 times, is of the same size as Householder's — and its error does not grow with the depth of the tree.

rows: 192

The arguments are the ones A reduction that changes the order passes. A value nobody placed would be a picture no essay asked for and no claim was ever checked against.

Four factorisations of one 192×12 matrix, κ = 7020A ranked bar chart of the departure from orthogonality, on a logarithmic scale. Classical Gram–Schmidt loses 8.5·10⁻¹⁰, modified 8.9·10⁻¹³, Householder 1.1·10⁻¹⁴. The reduction tree, which touches the matrix once instead of 12 times, is of the same size as Householder's — and its error does not grow with the depth of the tree.classical Gram–Schmidt8.5·10⁻¹⁰modified Gram–Schmidt8.94·10⁻¹³Householder, one sweep1.14·10⁻¹⁴reduction tree, 16 leaves1.71·10⁻¹⁵departure from orthogonality, logarithmicthe tree, at four depths‖AᵀA − RᵀR‖/‖AᵀA‖, depth 12.6·10⁻¹⁵‖AᵀA − RᵀR‖/‖AᵀA‖, depth 21.4·10⁻¹⁵‖AᵀA − RᵀR‖/‖AᵀA‖, depth 35·10⁻¹⁶‖AᵀA − RᵀR‖/‖AᵀA‖, depth 41.7·10⁻¹⁵the same algebra, four timestwo of them are products of reflections

A ranked bar chart of the departure from orthogonality, on a logarithmic scale. Classical Gram–Schmidt loses 8.5·10⁻¹⁰, modified 8.9·10⁻¹³, Householder 1.1·10⁻¹⁴. The reduction tree, which touches the matrix once instead of 12 times, is of the same size as Householder's — and its error does not grow with the depth of the tree.

rows: 1024

The arguments are the ones A reduction that changes the order passes. A value nobody placed would be a picture no essay asked for and no claim was ever checked against.

Four factorisations of one 1024×12 matrix, κ = 7196A ranked bar chart of the departure from orthogonality, on a logarithmic scale. Classical Gram–Schmidt loses 7.1·10⁻¹⁰, modified 1.5·10⁻¹², Householder 3.4·10⁻¹⁴. The reduction tree, which touches the matrix once instead of 12 times, is of the same size as Householder's — and its error does not grow with the depth of the tree.classical Gram–Schmidt7.08·10⁻¹⁰modified Gram–Schmidt1.51·10⁻¹²Householder, one sweep3.41·10⁻¹⁴reduction tree, 16 leaves1.4·10⁻¹⁵departure from orthogonality, logarithmicthe tree, at four depths‖AᵀA − RᵀR‖/‖AᵀA‖, depth 110⁻¹⁴‖AᵀA − RᵀR‖/‖AᵀA‖, depth 23.6·10⁻¹⁵‖AᵀA − RᵀR‖/‖AᵀA‖, depth 34.2·10⁻¹⁵‖AᵀA − RᵀR‖/‖AᵀA‖, depth 41.4·10⁻¹⁵the same algebra, four timestwo of them are products of reflections

A ranked bar chart of the departure from orthogonality, on a logarithmic scale. Classical Gram–Schmidt loses 7.1·10⁻¹⁰, modified 1.5·10⁻¹², Householder 3.4·10⁻¹⁴. The reduction tree, which touches the matrix once instead of 12 times, is of the same size as Householder's — and its error does not grow with the depth of the tree.

rows: 384

The arguments are the ones A reduction that changes the order passes. A value nobody placed would be a picture no essay asked for and no claim was ever checked against.

Four factorisations of one 384×12 matrix, κ = 7122A ranked bar chart of the departure from orthogonality, on a logarithmic scale. Classical Gram–Schmidt loses 4.2·10⁻¹⁰, modified 1.6·10⁻¹², Householder 2·10⁻¹⁴. The reduction tree, which touches the matrix once instead of 12 times, is of the same size as Householder's — and its error does not grow with the depth of the tree.classical Gram–Schmidt4.23·10⁻¹⁰modified Gram–Schmidt1.55·10⁻¹²Householder, one sweep2.04·10⁻¹⁴reduction tree, 16 leaves1.13·10⁻¹⁵departure from orthogonality, logarithmicthe tree, at four depths‖AᵀA − RᵀR‖/‖AᵀA‖, depth 11.8·10⁻¹⁵‖AᵀA − RᵀR‖/‖AᵀA‖, depth 22.4·10⁻¹⁵‖AᵀA − RᵀR‖/‖AᵀA‖, depth 31.5·10⁻¹⁵‖AᵀA − RᵀR‖/‖AᵀA‖, depth 41.1·10⁻¹⁵the same algebra, four timestwo of them are products of reflections

A ranked bar chart of the departure from orthogonality, on a logarithmic scale. Classical Gram–Schmidt loses 4.2·10⁻¹⁰, modified 1.6·10⁻¹², Householder 2·10⁻¹⁴. The reduction tree, which touches the matrix once instead of 12 times, is of the same size as Householder's — and its error does not grow with the depth of the tree.

rows: 768

The arguments are the ones A reduction that changes the order passes. A value nobody placed would be a picture no essay asked for and no claim was ever checked against.

Four factorisations of one 768×12 matrix, κ = 7181A ranked bar chart of the departure from orthogonality, on a logarithmic scale. Classical Gram–Schmidt loses 1.4·10⁻¹⁰, modified 2.5·10⁻¹², Householder 2.5·10⁻¹⁴. The reduction tree, which touches the matrix once instead of 12 times, is of the same size as Householder's — and its error does not grow with the depth of the tree.classical Gram–Schmidt1.4·10⁻¹⁰modified Gram–Schmidt2.48·10⁻¹²Householder, one sweep2.54·10⁻¹⁴reduction tree, 16 leaves1.84·10⁻¹⁵departure from orthogonality, logarithmicthe tree, at four depths‖AᵀA − RᵀR‖/‖AᵀA‖, depth 19.9·10⁻¹⁵‖AᵀA − RᵀR‖/‖AᵀA‖, depth 21.7·10⁻¹⁵‖AᵀA − RᵀR‖/‖AᵀA‖, depth 32·10⁻¹⁵‖AᵀA − RᵀR‖/‖AᵀA‖, depth 41.8·10⁻¹⁵the same algebra, four timestwo of them are products of reflections

A ranked bar chart of the departure from orthogonality, on a logarithmic scale. Classical Gram–Schmidt loses 1.4·10⁻¹⁰, modified 2.5·10⁻¹², Householder 2.5·10⁻¹⁴. The reduction tree, which touches the matrix once instead of 12 times, is of the same size as Householder's — and its error does not grow with the depth of the tree.

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.

11 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.

the tree with 2 leaves is backward stable — checked 4 times

a tall matrix the norms can be formed for

and a skinny one

and modified Gram–Schmidt sits between them

and the error does not grow with the depth

each row block is at least as tall as it is wide

matmul shapes agree

while classical Gram–Schmidt is not

Against the rule

It draws a decomposition and prints its residual. It calls gramSchmidt, tsqr, 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.

Where the flop count stopped predicting the time

A reduction that changes the order

A tall-skinny QR computed as a tree of independent block factorisations touches a 512×12 matrix once instead of twelve times, computes a completely different sequence of roundings from the sweep it replaces, and returns ‖AᵀA − RᵀR‖/‖AᵀA‖ = 1.65·10⁻¹⁵ against the sweep's 9.95·10⁻¹⁵. On the same matrix classical Gram–Schmidt returns 4.6·10⁻¹⁰.

The whole library · All essays · What must fail