Message length effects for solving polynomial systems on a hypercube (Q1121641)

The authors investigate a recently proposed homotopy algorithm for polynomial systems that is globally convergent with probability one and finds all solutions to the polynomial system. For this homotopy algorithm and a given decomposition strategy, the communication overhead for several possible communication strategies is explored empirically. The experiments were done on an iPSC-32 hypercube.