Name
Abstract | ||
|---|---|---|
Amendola et al. proposed a method for solving systems of polynomial equations lying in a family which exploits a recursive decomposition into smaller systems. A family of systems admits such a decomposition if and only if the corresponding Galois group is imprimitive. When the Galois group is imprimitive, we consider the problem of computing an explicit decomposition. A consequence of Esterov's classification of sparse polynomial systems with imprimitive Galois groups is that this decomposition is obtained by inspection. This leads to a recursive algorithm to compute complex isolated solutions to decomposable sparse systems, which we present and give evidence for its efficiency. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s11075-020-01045-x | NUMERICAL ALGORITHMS |
Keywords | DocType | Volume |
Sparse polynomial systems, Homotopy continuation, Algorithm, Galois group | Journal | 88 |
Issue | ISSN | Citations |
1 | 1017-1398 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Brysiewicz Taylor | 1 | 0 | 0.34 |
| Jose Israel Rodriguez | 2 | 17 | 6.01 |
| Sottile Frank | 3 | 0 | 0.68 |
| Yahl Thomas | 4 | 0 | 0.34 |