Error accumulation — where it appears
Named by 3 essays across 2 fields — each of them below, with the objects they name alongside it.
One input at one end
A lazy tong's reach is 2nL cos θ — exactly, to a part in a million million, over eight sizes and sixty openings — so it multiplies its input by the number of units. It multiplies everything else by the same number, including the part of the drawing nobody wanted multiplied: a unit cut a hundredth of a radian out puts a tong of thirty-two units 0.374 out at the far end.
The error that is repeated
Thirty-two units cut on one setting of one machine are thirty-two copies of one error, not thirty-two draws from a distribution — so a tong's span is out by thirty-two times a unit's, not by the square root of thirty-two times it. The two estimates differ by a factor of 5.66, and the second one is the comforting one.
Where the shortest loops are
A tolerance stack-up goes round a loop, and every link the loop passes through is a dimension in it. Two eight-link chains with the same links, the same pins and the same number of loops can need twelve link lengths in their shortest independent set or fifteen — decided by the graph, before any dimension is chosen.
Named alongside it
The objects these essays reach for when they reach for this one.
ToleranceDeployableMobilityNetworkScissor linkageWorst caseAmplificationAssemblyCanonical formCycle basisDesign ruleGrübler's criterion