The authors reported on a first parallel implementation of a recent algorithm to factor positive dimensional solution sets of polynomial systems. As the algorithm uses homotopy continuation, a good speedup of the path tracking jobs was observed. However, for solution sets of high degree, the overhead of managing different homotopies and large lists of solutions exposes the limits of the master/servant parallel programming paradigm for this type of problem. A probabilistic complexity study suggests modifications to the method, which will also improve the serial version of the original algorithm.
['Anton Leykin', 'Jan Verschelde']
Factoring solution sets of polynomial systems in parallel