Multiregeneration for polynomial system solving
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:IRXTUEJUrecord.jsonopen to challenge →
classification
math.AG
keywords
solvingcontinuationmultimultiregenerationpolynomialpolynomialssystemsavailable
read the original abstract
We demonstrate our implementation of a continuation method as described in \cite{HR2015} 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 is needed for the continuation. Moreover, parallelization options and several strategies for solving structured polynomial systems are available.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.