Abstract: We introduce the Cox homotopy algorithm for solving a sparse system of polynomial equations on a compact toric variety . The algorithm lends its name from a construction, described by Cox, of as a GIT quotient of a quasi-affine variety by the action of a reductive group. Our algorithm tracks paths in the total coordinate space of and can be seen as a homogeneous version of the standard polyhedral homotopy, which works on the dense torus of . It furthermore generalizes the commonly used path tracking algorithms in (multi)projective spaces in that it tracks a set of homogeneous coordinates contained in the -orbit corresponding to each solution. The Cox homotopy combines the advantages of polyhedral homotopies and (multi)homogeneous homotopies, tracking only mixed volume many solutions and providing an elegant way to deal with solutions on or near the special divisors of . In addition, the strategy may help to understand the deficiency of the root count for certain families of systems with respect to the BKK bound.
Recommendations
Cites work
- A Polyhedral Method for Solving Sparse Polynomial Systems
- A robust numerical path tracking algorithm for polynomial homotopy continuation
- Adaptive step-size selection for homotopy methods to solve polynomial equations
- Adaptive strategies for solving parameterized systems using homotopy continuation
- Algorithm 795
- An Interval Step Control for Continuation Methods
- Complexity of sparse polynomial solving 2: renormalization
- Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
- Dynamic enumeration of all mixed cells
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Geometric Invariant Theory
- High probability analysis of the condition number of sparse polynomial systems
- Higher Order Predictors and Adaptive Steplength Control in Path Following Algorithms
- Hom4PS-3: a parallel numerical solver for systems of polynomial equations based on polyhedral homotopy continuation methods
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- HomotopyContinuation.jl: a package for homotopy continuation in Julia
- scientific article; zbMATH DE number 47206 (Why is no real title available?)
- scientific article; zbMATH DE number 50337 (Why is no real title available?)
- scientific article; zbMATH DE number 621807 (Why is no real title available?)
- scientific article; zbMATH DE number 729195 (Why is no real title available?)
- Introduction to Toric Varieties. (AM-131)
- Mixed precision path tracking for polynomial homotopy continuation
- Numerical algebraic geometry
- Numerical decomposition of the solution sets of polynomial systems into irreducible components
- Numerical root finding via Cox rings
- Numerically solving polynomial systems with Bertini
- Okounkov bodies and toric degenerations
- Polyedres de Newton et nombres de Milnor
- Polyhedral end games for polynomial continuation
- Polymake.jl: a new interface to \texttt{polymake}
- polymake: a framework for analyzing convex polytopes
- Regeneration homotopies for solving systems of polynomials
- Software for numerical algebraic geometry: a paradigm and progress towards its implementation
- Solving polynomial systems via homotopy continuation and monodromy
- Some basic results on actions of nonaffine algebraic groups
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- The topology of torus actions on symplectic manifolds. Transl. from the French by the author
- Toric eigenvalue methods for solving sparse polynomial systems
- Toric Newton method for polynomial homotopies
- Toric varieties
This page was built for publication: Polyhedral homotopies in Cox coordinates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6183986)
