Polyhedral homotopies in Cox coordinates
From MaRDI portal
Publication:6183986
DOI10.1142/s0219498824500737arXiv2012.04255OpenAlexW3113027391MaRDI QIDQ6183986
Unnamed Author, Thomas Yahl, Timothy Duff, Simon Telen
Publication date: 24 January 2024
Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.04255
toric varietieshomotopy continuationcomputer algebrapolynomial systemsalgebraic geometrynumerical algebraic geometryCox rings
Symbolic computation and algebraic computation (68W30) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Solving polynomial systems; resultants (13P15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- High probability analysis of the condition number of sparse polynomial systems
- Dynamic enumeration of all mixed cells
- The topology of torus actions on symplectic manifolds. Transl. from the French by the author
- Polyedres de Newton et nombres de Milnor
- Polyhedral end games for polynomial continuation
- Toric Newton method for polynomial homotopies
- HomotopyContinuation.jl: a package for homotopy continuation in Julia
- Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
- Numerical root finding via Cox rings
- Mixed precision path tracking for polynomial homotopy continuation
- Adaptive strategies for solving parameterized systems using homotopy continuation
- Numerical algebraic geometry
- Okounkov bodies and toric degenerations
- Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
- Hom4PS-3: A Parallel Numerical Solver for Systems of Polynomial Equations Based on Polyhedral Homotopy Continuation Methods
- Regeneration homotopies for solving systems of polynomials
- Introduction to Toric Varieties. (AM-131)
- Some Basic Results on Actions of Nonaffine Algebraic Groups
- Higher Order Predictors and Adaptive Steplength Control in Path Following Algorithms
- Geometric Invariant Theory
- An Interval Step Control for Continuation Methods
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Algorithm 795
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Adaptive step-size selection for homotopy methods to solve polynomial equations
- Polymake.jl: A New Interface to polymake
- Toric eigenvalue methods for solving sparse polynomial systems
- A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Solving polynomial systems via homotopy continuation and monodromy
- Complexity of sparse polynomial solving 2: renormalization
This page was built for publication: Polyhedral homotopies in Cox coordinates
