Machine Kinematics
solved, then drawn
Concept

Summing chain — where it appears

The chain of links a compiled machine adds its terms along, head to tail from the pivot, with its last vertex held on a line. That last constraint is the curve's equation, and getting each term's direction to its place along the chain is most of the machine.

Named by 3 essays across one field — each of them below, with the objects they name alongside it.

How much of a compiled machine is computing anything. Each machine's bars split two ways: the ones that build an angle — reflectors, means, rigid offsets, the arm — and the ones that carry a direction from where it was computed to where it is needed. On the smallest machines the arithmetic is nearly all of it. By the quintic the carrying is 80 per cent, and it goes on rising, because the arithmetic grows with the number of terms and the carrying grows with the number of pairs of them. That is the answer to why a universality construction is enormous, and it is not about the algebra being hard.

A parallelogram carries an angle, and only so far

A direction computed at the frame is no use where it is needed. A parallelogram carries one from point to point — but only between two points a fixed distance apart, and that single proviso is what makes a compiled machine quadratic in the number of terms and turns most of it into transport.

computing · Compute The machine compiled from a rectangular hyperbola. xy − 0.5, compiled: 20 bars and 20 joints, painted by what each part is for. The two-link arm at the pivot carries the tracing point; the reflectors and means build each term's angle; the rigid offsets fix the constant φₖ and the amplitude; the translators carry those directions out along the summing chain, whose last vertex is held on a line. That last constraint is the equation. Every joint drawn is the output of a Newton–Raphson solve on 36 equations, converged to 4.2e-16, and the polynomial at the tracing point is 2.2e-16.

The machine, compiled

Twenty bars, twenty joints, and one degree of freedom. Every position is a converged solve on thirty-five equations, none of which mentions the polynomial — and the polynomial at the tracing point reads 1.3 × 10⁻¹⁴ across the whole working arc.

computing · Compute Every curve in the catalogue, compiled and counted. The bar count is not a formula: it is the number of bar constraints the compiled mechanism actually carries, asked of the object rather than predicted. A line costs five bars and a quintic four hundred and thirteen, which is the field's central number — exactness is paid for in size. The all-revolute column replaces the one prismatic pair that closes the chain with a Peaucellier cell, which costs seven bars whatever the curve, so it is more than half the machine on a line and a rounding error on a quintic. The last column is the polynomial evaluated at the traced point, worst over each machine's working arc.

Five bars for a line, four hundred for a quintic

Nine curves compiled and counted: a line at five bars, a circle at eleven, a lemniscate at fifty, a general quintic at four hundred and thirteen. The growth is a fourth power of the degree, and three quarters of the largest machine is not computing anything at all.

computing · Compute

Named alongside it

The objects these essays reach for when they reach for this one.

Compiled linkageTranslatorWorking arcAssembly branchCost modelDegreeLinkageLoop closureNewton–RaphsonOverconstraintParallelogram linkagePrismatic pair

All concepts