A Parallel Endgame



Numerical algebraic geometry is the area devoted to the solution and manipulation of polynomial systems by numerical methods, which are mainly based on continuation. Due to the extreme intrinsic parallelism of continuation, polynomial systems may be successfully dealt with that are much larger than is possible with other methods. Singular solutions require special numerical methods called endgames, and the endgames currently used do not take advantage of parallelism. This article gives an overview of continuation and endgames in the context of parallel computation. We also introduce a novel parallel algorithm for performing endgames at the end of homotopy paths, based on the Cauchy endgame, along with some heuristics useful in its implementation. This method , which has been implemented in the Bertini software package, leads to a significant gain in efficiency.


Attribute NameValues
  • Daniel Bates

  • Andrew Sommese

  • Jonathan Hauenstein

Journal or Work Title
  • Contemporary Mathematics

  • 556

First Page
  • 25

Last Page
  • 35

  • American Mathematical Society

Date Created
  • 2016-11-03

Bibliographic Citation
  • English

Departments and Units
Member of
Access Rights Open Access
Content License
  • All rights reserved

Digital Object Identifier


This DOI is the best way to cite this article.


Please Note: You may encounter a delay before a download begins. Large or infrequently accessed files can take several minutes to retrieve from our archival storage system.


Collections Featuring this Article