Series

Determinacy — the series

2 essays on one idea, from the one that introduces it to the one that assumes the rest.
  1. Counting unknowns against equations. Three frames differing by one member. Two equilibrium equations per joint, one unknown per member and one per restraint: fewer unknowns than equations is a mechanism, equal is solvable by statics, more needs stiffness.

    Counting the unknowns, and finding out whether statics can answer

    Two equations per joint, one unknown per member, one per restraint. Subtract, and the sign of the answer says whether the structure is a mechanism, solvable, or beyond what equilibrium alone can settle.

    part 1 · equilibrium
  2. The count is necessary and not sufficient. Two pin-jointed frames, each satisfying m + r = 2j exactly. One of them folds anyway, because the equations are not independent; the ghosted outline is the motion that costs no member any change of length, drawn at an exaggeration of 0.55 of the span.

    The count that does not see it

    A frame can have exactly as many unknowns as equations and fold up anyway. The count asks whether there are enough equations; it never asks whether they are different from one another.

    part 2 · equilibrium

All series