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

@article{Su2006Algorithm8P,
title={Algorithm 857: POLSYS_GLP - a parallel general linear product homotopy code for solving polynomial systems of equations},
author={Hai-Jun Su and J. Michael McCarthy and Masha Sosonkina and Layne T. Watson},
journal={ACM Trans. Math. Softw.},
year={2006},
volume={32},
pages={561-579}
}

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… CONTINUE READING