SOURCE-LINKED INTELLIGENCE

Equilibria for Networks of Linear Translational Springs

arXiv · AI, language, vision and robotics · article · Sep 2, 2026 · UTC

We use tools from nonlinear algebra to study the equilibria of small linear translational spring networks. Specifically we use the techniques of homotopy continuation, monodromy, and parameter homotopy (a.k.a. cheater homotopy) to solve all rigid linear translational spring networks up to $5$ nodes in both $2$ and $3$ dimensions. We describe a method of implementing parameter homotopy that arises naturally from the physical structure of the system. We give precise total degree bounds on the maximum number of solutions for general planar spring networks. We discuss further efficiency gains obta

Read original source ↗ Open in workspace

recordType

paper

region

Global