Name
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 the framework developed in [5] 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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1145/3208976.3209007 | ISSAC'18: PROCEEDINGS OF THE 2018 ACM INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION |
Keywords | DocType | Volume |
Solving systems of polynomial equations, homotopy continuation, monodromy, probabilistic algorithm, parallel computation | Conference | abs/1805.12212 |
Citations | PageRank | References |
0 | 0.34 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nathan Bliss | 1 | 3 | 1.78 |
| Timothy Duff | 2 | 6 | 2.85 |
| Anton Leykin | 3 | 173 | 18.99 |
| Jeff Sommars | 4 | 10 | 3.07 |