MultiRegeneration for polynomial system solving
We demonstrate our implementation of a continuation method as described in [7] for solving polynomials systems. Given a sequence of (multi)homogeneous polynomials, the software multiregeneration outputs the respective (multi)degree in a wide range of cases and partial multidegree in all others. We u...
Gespeichert in:
Veröffentlicht in: | ACM communications in computer algebra 2020-06, Vol.54 (2), p.39-43 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | We demonstrate our implementation of a continuation method as described in [7] for solving polynomials systems. Given a sequence of (multi)homogeneous polynomials, the software multiregeneration outputs the respective (multi)degree in a wide range of cases and partial multidegree in all others. We use Python for the file processing, while Bertini [2] is needed for the continuation. Moreover, parallelization options and several strategies for solving structured polynomial systems are available. |
---|---|
ISSN: | 1932-2240 |
DOI: | 10.1145/3427218.3427221 |