Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods

DOI10.1016/S0377-0427(02)00698-2zbMath1018.65068OpenAlexW2076324373MaRDI QIDQ1872931

Yang Dai, Sunyoung Kim, Kojima, Masakazu

Publication date: 19 May 2003

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-0427(02)00698-2

zbMATH Keywords

numerical resultsnonlinear programmingpolynomial equationssystems of equationshomotopy continuation methodsisolated solutions

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)

Related Items

Generating approximate parametric roots of parametric polynomials, PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems, A TFC-based homotopy continuation algorithm with application to dynamics and control problems, The inverse kinematics problem of spatial 4P3R robot manipulator by the homotopy continuation method with an adjustable auxiliary homotopy function, HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method

Uses Software

• HOMPACK90
• Database of Polynomial Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving polynomial systems
• A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic \(n\)-roots
• Computing singular solutions to polynomial systems
• The number of roots of a system of equations
• Polyhedral end games for polynomial continuation
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Solving polynomial systems by polyhedral homotopies
• Symmetric Newton polytopes for solving sparse polynomial systems
• Efficient incremental algorithms for the sparse resultant and the mixed volume
• Algorithm 652
• The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations
• Determining All Solutions to Certain Systems of Nonlinear Equations
• Algorithm 777: HOMPACK90
• Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
• ENUMERATION OF ALL SOLUTIONS OF A COMBINATORIAL LINEAR INEQUALITY SYSTEM ARISING FROM THE POLYHEDRAL HOMOTOPY CONTINUATION METHOD
• Algorithm 795
• A Polyhedral Method for Solving Sparse Polynomial Systems
• Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods
• Finding mixed cells in the mixed volume computation