Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods
type: Item
instance of: scholarly article
title: Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods
zbMATH Open document ID: 1018.65068
DOI: 10.1016/S0377-0427(02)00698-2
author: Yang Dai
author: Sunyoung Kim
author: Masakazu Kojima
published in: Journal of Computational and Applied Mathematics
publication date: 2003-05-19T00:00:00Z
Mathematics Subject Classification ID: 65H10
Mathematics Subject Classification ID: 65H20
zbMATH DE Number: 1912260
zbMATH Keywords: systems of equations
zbMATH Keywords: nonlinear programming
zbMATH Keywords: homotopy continuation methods
zbMATH Keywords: isolated solutions
zbMATH Keywords: polynomial equations
zbMATH Keywords: numerical results
describes a project that uses: Database of Polynomial Systems
describes a project that uses: HOMPACK90
MaRDI profile type: Publication
cites work: Q3998344
cites work: The number of roots of a system of equations
cites work: A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic \(n\)-roots
cites work: Efficient incremental algorithms for the sparse resultant and the mixed volume
cites work: A new efficient algorithm for computing Gröbner bases \((F_4)\)
cites work: Determining All Solutions to Certain Systems of Nonlinear Equations
cites work: Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods
cites work: A Polyhedral Method for Solving Sparse Polynomial Systems
cites work: Polyhedral end games for polynomial continuation
cites work: Solving polynomial systems
cites work: Solving polynomial systems by polyhedral homotopies
cites work: Finding mixed cells in the mixed volume computation
cites work: The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations
cites work: Q4000024
cites work: Computing singular solutions to polynomial systems
cites work: Using monodromy to decompose solution sets of polynomial systems into irreducible components
cites work: ENUMERATION OF ALL SOLUTIONS OF A COMBINATORIAL LINEAR INEQUALITY SYSTEM ARISING FROM THE POLYHEDRAL HOMOTOPY CONTINUATION METHOD
cites work: Algorithm 795
cites work: Symmetric Newton polytopes for solving sparse polynomial systems
cites work: Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
cites work: Algorithm 652
cites work: Algorithm 777: HOMPACK90
full work available at URL: s0377-0427(02)00698-2
OpenAlex ID: W2076324373
description: scientific article; zbMATH DE number 1912260