math.AGSep 2, 2026

Equilibria for Networks of Linear Translational Springs

Authors: Luke OedingEthan ClaytonJackson ElseaNicholas WangAdam Rutkowski

Organizations: Auburn University, Department of Mathematics and Statistics, Auburn, AL, USA · New York University, Courant Institute of Mathematical Sciences, New York, NY, USA · Air Force Research Laboratory, Eglin Air Force Base, Florida, USA

Abstract

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 55 nodes in both 22 and 33 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 obtained from polyhedral homotopy methods. We compare the computation efficiency of these techniques against a baseline of Newton's method.

Explore similar work

CardsList
  1. Thermodynamic Networks: Harnessing Non-Equilibrium Steady States for Computation

    May 15, 2026Patryk Lipka-Bartosik, Gianmichele Blasi, Javier Lalueza Puértolas +3ThermodynamicsStatistical Mechanics