  Approximating periodic solutions to the coupled Duffing equations amounts to
solving a system of polynomial equations. The number of complex solutions
measures the algebraic complexity of this approximation problem. Using the
theory of Khovanskii bases, we show that this number is given by the volume of
a certain polytope. We also show how to compute all solutions using numerical
nonlinear algebra.
