Tracking Many Solution Paths of a Polynomial Homotopy on a Graphics Processing Unit
Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago, 851 South Morgan (M/C 249), Chicago, IL 60607-7045, USA
arXiv:1505.00383 [cs.MS], (3 May 2015)
@article{verschelde2015tracking,
title={Tracking Many Solution Paths of a Polynomial Homotopy on a Graphics Processing Unit},
author={Verschelde, Jan and Yu, Xiangcheng},
year={2015},
month={may},
archivePrefix={"arXiv"},
primaryClass={cs.MS}
}
Polynomial systems occur in many areas of science and engineering. Unlike general nonlinear systems, the algebraic structure enables to compute all solutions of a polynomial system. We describe our massive parallel predictor-corrector algorithms to track many solution paths of a polynomial homotopy. The data parallelism that provides the speedups stems from the evaluation and differentiation of the monomials in the same polynomial system at different data points, which are the points on the solution paths. Polynomial homotopies that have tens of thousands of solution paths can keep a sufficiently large amount of threads occupied. Our accelerated code combines the reverse mode of algorithmic differentiation with double double and quad double precision to compute more accurate results faster.
May 10, 2015 by hgpu
