Polynomial systems occur in many areas of science and engineering. Unlike general nonlinear systems, the algebraic structure enablesto compute all solutions of a polynomial system. We describe our massively parallel predictor-corrector algorithmsto track many solution paths of a polynomial homotopy. The data parallelism that provides the speedups stems from theevaluation and differentiation of the monomials in the same polynomialsystem at different data points, which are the points on the solution paths. Polynomial homotopies that have tens of thousands of solution pathscan keep a sufficiently large amount of threads occupied. Our accelerated code combines the reverse mode of algorithmic differentiationwith double double and quad double arithmetic to compute more accurateresults faster.
['Jan Verschelde', 'Xiangcheng Yu']
Tracking Many Solution Paths of a Polynomial Homotopy on a Graphics Processing Unit in Double Double and Quad Double Arithmetic