POLSYS_GLP

POLSYS_GLP is Fortran 95 parallel code for solving N complex coefficient polynomial systems of equations in N unknowns by a probability-one, globally convergent homotopy method. The package is fully portable across various distributed and parallel computing platforms since it uses the Message Passing Interface (MPI) communication library. It has been tested on UCI’s Beowulf system, the Blue Horizon and Data Star system at the San Diego Supercomputer Center. The codes were adapted from POLSYS_PLP written by Wise, S. M., Sommese, A. J., and Watson, L. T., 2000.

POLSYS_GLP consists of two modules: GLOBAL_GLP and POLSYS2. The module GLOBAL_GLP contains the derived data types that define the polynomial system, the system covering, and the start system of the homotopy; the module POLSYS2 contains the actual solver POLSYS_GLP and its internal routines, CHECK_GLP that verifies the input set covering structure, and the routines responsible for root counting, BEZOUT_GLP and SINGSYS_GLP. POLSYS_GLP uses the HOMPACK90 modules HOMOTOPY, HOMPACK90_GLOBAL, and REAL_PRECISION, the HOMPACK90 path tracking routine STEPNX, and numerous BLAS and LAPACK routines.

• Accept generalized linear product (GLP) start systems
• Support Message Passing Interface (MPI) for parallel computation
• Compute Bezout root count only by setting ROOT_COUNT_ONLY = .TRUE.
  

• Fortran 90 source code
• A Mathematica notebook for preparing input data file
• User's guide
  

• POLSYS_PLP by Wise, S. M., Sommese, A. J., and Watson, L. T.
• PHC by Jan Verschelde
• HomLab by Charles Wampler