Message length effects for solving polynomial systems on a hypercube
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.
parallel implementation on iPSC-32 hypercube
scientific article; zbMATH DE number 4104268
scientific article