Finding All Real Points of a Complex Curve

摘要

An algoiithm is given to compute the leal points of the irreducible one-dimensional complex components of the solution sets of systems of polynomials with real coefficients The algorithm is based on homotopy continuation and the numerical irreducible decomposition An extended application is made to foldable Griffis-Duffy platforms, a class of Stewart-Gough platform robots.