Monodromy Solver: Sequential and Parallel
Symbolic Computation
2018-06-01 v1 Distributed, Parallel, and Cluster Computing
Algebraic Geometry
Abstract
We describe, study, and experiment with an algorithm for finding all solutions of systems of polynomial equations using homotopy continuation and monodromy. This algorithm follows a framework developed in previous work and can operate in the presence of a large number of failures of the homotopy continuation subroutine. We give special attention to parallelization and probabilistic analysis of a model adapted to parallelization and failures. Apart from theoretical results, we developed a simulator that allows us to run a large number of experiments without recomputing the outcomes of the continuation subroutine.
Cite
@article{arxiv.1805.12212,
title = {Monodromy Solver: Sequential and Parallel},
author = {Nathan Bliss and Timothy Duff and Anton Leykin and Jeff Sommars},
journal= {arXiv preprint arXiv:1805.12212},
year = {2018}
}
Comments
19 pages, accepted to ISSAC 2018