Algorithm 857: POLSYS_GLP—a parallel general linear product homotopy code for solving polynomial systems of equations

Globally convergent, probability-one homotopy methods have proven to be very effective for finding all the isolated solutions to polynomial systems of equations. After many years of development, homotopy path trackers based on probability-one homotopy methods are reliable and fast. Now, theoretical advances reducing the number of homotopy paths that must be tracked and handling singular solutions have made probability-one homotopy methods even more practical. POLSYS_GLP consists of Fortran 95 modules for finding all isolated solutions of a complex coefficient polynomial system of equations. The package is intended to be used on a distributed memory multiprocessor in conjunction with HOMPACK90 (Algorithm 777), and makes extensive use of Fortran 95-derived data types and MPI to support a general linear product (GLP) polynomial system structure. GLP structure is intermediate between the partitioned linear product structure used by POLSYS_PLP (Algorithm 801) and the BKK-based structure used by PHCPACK. The code requires a GLP structure as input, and although finding the optimal GLP structure is a difficult combinatorial problem, generally physical or engineering intuition about a problem yields a very good GLP structure. POLSYS_GLP employs a sophisticated power series end game for handling singular solutions, and provides support for problem definition both at a high level and via hand-crafted code. Different GLP structures and their corresponding Bezout numbers can be systematically explored before committing to root finding.

[1]  Layne T. Watson,et al.  Finding all isolated solutions to polynomial systems using HOMPACK , 1989, TOMS.

[2]  Jan Verschelde,et al.  Homotopy continuation methods for solving polynomial systems , 1996 .

[3]  Layne T. Watson,et al.  Algorithm 652: HOMPACK: a suite of codes for globally convergent homotopy algorithms , 1987, TOMS.

[4]  Akiko Takeda,et al.  PHoM – a Polyhedral Homotopy Continuation Method for Polynomial Systems , 2004, Computing.

[5]  Charles W. Wampler,et al.  A product-decomposition bound for Bezout numbers , 1995 .

[6]  J. Verschelde,et al.  The GBQ -algorithm for constructing start systems of homotopies for polynomial systems , 1993 .

[7]  Alexander P. Morgan,et al.  A Method for Computing All Solutions to Systems of Polynomials Equations , 1983, TOMS.

[8]  A. Morgan,et al.  A methodology for solving chemical equilibrium systems , 1987 .

[9]  A. Morgan,et al.  Computing singular solutions to nonlinear analytic systems , 1990 .

[10]  A. Morgan,et al.  Errata: Computing all solutions to polynomial systems using homotopy continuation , 1987 .

[11]  Layne T. Watson,et al.  Generalized Linear Product Homotopy Algorithms and the Computation of Reachable Surfaces , 2004, J. Comput. Inf. Sci. Eng..

[12]  E. Allgower,et al.  Numerical Continuation Methods , 1990 .

[13]  Jan Verschelde,et al.  Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation , 1999, TOMS.

[14]  A. Griewank.  On Solving Nonlinear Equations with Simple Singularities or Nearly Singular Solutions , 1985 .

[15]  A. B. BASSET,et al.  Modern Algebra , 1905, Nature.

[16]  Layne T. Watson,et al.  Message length effects for solving polynomial systems on a hypercube , 1989, Parallel Comput..

[17]  Tangan Gao,et al.  Algorithm 846: MixedVol: a software package for mixed-volume computation , 2005, TOMS.

[18]  Eugene L. Allgower,et al.  Numerical continuation methods - an introduction , 1990, Springer series in computational mathematics.

[19]  A. Morgan.  Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems , 1987 .

[20]  Layne T. Watson,et al.  Note on unit tangent vector computation for homotopy curve tracking on a hypercube , 1991, Parallel Comput..

[21]  A. Morgan,et al.  Solving the Kinematics of the Most General Six- and Five-Degree-of-Freedom Manipulators by Continuation Methods , 1985 .

[22]  A. Morgan,et al.  A homotopy for solving general polynomial systems that respects m-homogeneous structures , 1987 .

[23]  W. I. Zangwill,et al.  Global Continuation Methods for Finding all Solutions to Polynomial Systems of Equations in N Variables , 1980 .

[24]  Masha Sosonkina,et al.  Note on the end game in homotopy zero curve tracking , 1996, TOMS.

[25]  Ronald Cools,et al.  Symbolic homotopy construction , 2005, Applicable Algebra in Engineering, Communication and Computing.

[26]  Alexander P. Morgan.  A homotopy for solving polynomial systems , 1986 .

[27]  E. Davison,et al.  The numerical solution of A'Q+QA =-C , 1968 .

[28]  A. Morgan.  A transformation to avoid solutions at infinity for polynomial systems , 1986 .

[29]  Andrew J. Sommese,et al.  The numerical solution of systems of polynomials - arising in engineering and science , 2005 .

[30]  Tien-Yien Li,et al.  Mixed Volume Computation for Semi-Mixed Systems , 2003, Discret. Comput. Geom..

[31]  Masha Sosonkina,et al.  Algorithm 777: HOMPACK90: a suite of Fortran 90 codes for globally convergent homotopy algorithms , 1997, TOMS.

[32]  A. Morgan,et al.  Computing singular solutions to polynomial systems , 1992 .

[33]  Layne T. Watson,et al.  The Parallel Complexity of Embedding Algorithms for the Solution of Systems of Nonlinear Equations , 1993, IEEE Trans. Parallel Distributed Syst..

[34]  A. Morgan,et al.  A power series method for computing singular solutions to nonlinear analytic systems , 1992 .

[35]  Aubrey B. Poore,et al.  Variable Order Adams-Bashforth Predictors with an Error-Stepsize Control for Continuation Methods , 1991, SIAM J. Sci. Comput..

[36]  L. T. Watson,et al.  Granularity issues for solving polynomial systems via globally convergent algorithms on a hypercube , 1989, C3P.

[37]  J. Yorke,et al.  A homotopy method for locating all zeros of a system of polynomials , 1979 .

[38]  Steven M. Wise,et al.  Algorithm 801: POLSYS_PLP: a partitioned linear product homotopy code for solving polynomial systems of equations , 2000, TOMS.

[39]  Layne T. Watson,et al.  A globally convergent parallel algorithm for zeros of polynomial systems , 1989 .

[40]  A. Wright.  Finding all solutions to a system of polynomial equations , 1985 .

[41]  F. Drexler.  Eine Methode zur berechnung sämtlicher Lösungen von Polynomgleichungssystemen , 1977 .

[42]  G. Björck,et al.  A Faster Way to Count the Solution of Inhomogeneous Systems of Algebraic Equations, with Applications to Cyclic n-Roots , 1991, J. Symb. Comput..

[43]  Felipe Cucker,et al.  COMPLEXITY AND REAL COMPUTATION: A MANIFESTO , 1996 .

[44]  Charles W. Wampler,et al.  An efficient start system for multi-homogeneous polynomial continuation , 1993 .

[45]  Layne T. Watson,et al.  The Granularity of Parallel Homotopy Algorithms for Polynomial Systems of Equations , 1988 .

[46]  J. R. Cash,et al.  The numerical solution of systems of stiff ordinary differential equations , 1974, Mathematical Proceedings of the Cambridge Philosophical Society.