How the numbers are computed
Every number on this site comes from one kinematics engine: the same code runs when the pages are built and in your browser. It solves the positions of rigid links in a plane and the exact rates at which they change as the input moves. Forces appear only as input-to-output ratios found by virtual work under frictionless assumptions; friction, inertia, joint forces and strength are not computed. Engine version 0.1.0.
What is computed
- Positions of every joint and tracing point for each value of the input (crank angle or slider position).
- First and second derivatives with respect to the input, computed exactly from the constraint equations, not by finite differences. For an input turning at ω (rad/s) with angular acceleration α, velocity = d1·ω and acceleration = d2·ω² + d1·α.
- Range of the input: where the loop closes (found analytically), and the poses where the motion stops or can branch.
- Derived quantities: transmission angle, Grashof type, stroke, time ratio and the measured error of a synthesised path.
Methods
Closed-form solutions
The four-bar linkage and the slider-crank are solved in closed form: the moving joint is where two circles cross, or where a circle crosses the slide line. There are two such points, and which one is used (the assembly mode, open or crossed) stays fixed for the whole motion; it is never switched silently. The input range follows from the closure condition |b − c| ≤ f ≤ b + c as an exact interval of angles.
General constraint solver
Mechanisms without a closed form are solved by Newton's method on the constraint equations, with each step taken through a singular value decomposition. The same decomposition tells how many independent motions the model has, so a model with too few, too many or repeated constraints is reported as such instead of being given an arbitrary answer. A pose counts as solved when the residual is below 10−12 of the model's characteristic length, within 60 iterations.
Following a motion
A sweep moves the input in steps and compares each new pose with the prediction from the derivatives. A step that would jump to the other assembly branch is halved until it no longer does. Where the linkage folds flat (a change point), the sweep says so.
Path synthesis
The path-synthesis tool compares the shape of your path with a seeded catalogue of four-bars, aligns the closest ones exactly and refines them with the Levenberg–Marquardt method. Every error it reports is measured afterwards on the candidate's actual curve, including at points the optimiser never used. When candidates are ordered, errors below 0.2 % of the path size count as equally accurate.
Tolerances
| Quantity | Value | Why |
|---|---|---|
| Convergence of the solver | 10−12 × length | Rounding in double precision is about 10−15: three digits of margin. |
| Rank of the constraints | 10−8 | Between normal singular values (0.01 and up) and rounding noise. |
| Singular pose (general solver) | 10−7 | Below this, velocities would be amplified ten million times and mean nothing. |
| Singular pose (closed form) | |sin μ| < 10−6 | Near a dead point the position itself is known only to about 1.5 × 10−8 of a length, so no derivatives are given there. |
| Largest value / largest length ratio | 109 / 106 | Values outside the tested range are refused rather than answered plausibly. |
How the engine is checked
- Against independent derivations that share no code with the engine: Freudenstein's equation for the four-bar, the textbook slider-crank formulas and their derivatives, and poses checked by hand.
- Derivatives against central finite differences, the general solver against the closed forms, and Peaucellier's linkage against its exact straight line.
- Grashof's rule against the rotation range computed from closure, over many random linkages (property-based tests).
- Cognates: the three linkages of the Roberts–Chebyshev theorem trace the same point at every pose.
- Every sentence in the articles that states a number or a behaviour is recomputed when the site is built, and the build stops if the engine disagrees. This has stopped wrong sentences before publication more than once.
Reproducing a result
Downloads state the engine version, the units and the assumptions. A saved model gives the same numbers again with the same engine version, and a path search with the same seed and settings gives the same candidates. When a change to the engine can alter results, its version number goes up. What the engine does not cover is listed on the limitations page.