Path tracking is the fundamental computational tool in homotopy continuation and is therefore key in most algorithms in the emerging field of numerical algebraic geometry. Though the basic notions of predictor-corrector methods have been known for years, there is still much to be considered, particularly in the specialized algebraic setting of solving polynomial systems. In this article, the effects of the choice of predictor method on the performance of a tracker is analyzed, and details for using Runge-Kutta methods in conjunction with adaptive precision are provided. These methods have been implemented in the Bertini software package, and several examples are described.
Efficient path tracking methodsArticle
|Journal or Work Title|
|Departments and Units|
|Record Visibility and Access||Public|
Digital Object Identifier
This DOI is the best way to cite this article.
|Collections Featuring this Article|