Polyhedral homotopies in Cox coordinates
type: Item
instance of: scholarly article
title: Polyhedral homotopies in Cox coordinates
arXiv ID: 2012.04255
author: Timothy Duff
author: Simon Telen
author: Q6045333
author: Thomas Yahl
publication date: 2024-01-24T00:00:00Z
full work available at URL: https://arxiv.org/abs/2012.04255
Mathematics Subject Classification ID: 13P15
Mathematics Subject Classification ID: 14M25
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 7793928
zbMATH Keywords: toric varieties
zbMATH Keywords: numerical algebraic geometry
zbMATH Keywords: polynomial systems
zbMATH Keywords: algebraic geometry
zbMATH Keywords: Cox rings
zbMATH Keywords: computer algebra
zbMATH Keywords: homotopy continuation
MaRDI profile type: Publication
OpenAlex ID: W3113027391
cites work: Q3998344
cites work: Okounkov bodies and toric degenerations
cites work: The topology of torus actions on symplectic manifolds. Transl. from the French by the author
cites work: Q3514371
cites work: Numerically solving polynomial systems with Bertini
cites work: Toric eigenvalue methods for solving sparse polynomial systems
cites work: HomotopyContinuation.jl: a package for homotopy continuation in Julia
cites work: Some Basic Results on Actions of Nonaffine Algebraic Groups
cites work: Hom4PS-3: A Parallel Numerical Solver for Systems of Polynomial Equations Based on Polyhedral Homotopy Continuation Methods
cites work: Q4324883
cites work: Toric varieties
cites work: Adaptive step-size selection for homotopy methods to solve polynomial equations
cites work: Solving polynomial systems via homotopy continuation and monodromy
cites work: Introduction to Toric Varieties. (AM-131)
cites work: polymake: a framework for analyzing convex polytopes
cites work: Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
cites work: Adaptive strategies for solving parameterized systems using homotopy continuation
cites work: Regeneration homotopies for solving systems of polynomials
cites work: A Polyhedral Method for Solving Sparse Polynomial Systems
cites work: Polyhedral end games for polynomial continuation
cites work: Polymake.jl: A New Interface to polymake
cites work: An Interval Step Control for Continuation Methods
cites work: Polyedres de Newton et nombres de Milnor
cites work: Numerical algebraic geometry
cites work: Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
cites work: Complexity of sparse polynomial solving 2: renormalization
cites work: High probability analysis of the condition number of sparse polynomial systems
cites work: Dynamic enumeration of all mixed cells
cites work: Q4000024
cites work: Geometric Invariant Theory
cites work: Higher Order Predictors and Adaptive Steplength Control in Path Following Algorithms
cites work: Q4302493
cites work: Numerical decomposition of the solution sets of polynomial systems into irreducible components
cites work: The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
cites work: Numerical root finding via Cox rings
cites work: A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation
cites work: Mixed precision path tracking for polynomial homotopy continuation
cites work: Algorithm 795
cites work: Toric Newton method for polynomial homotopies
cites work: Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
DOI: 10.1142/S0219498824500737
published in: Journal of Algebra and its Applications
description: scientific article; zbMATH DE number 7793928