Finding all isolated zeros of polynomial systems in \(\mathbb{C}^n\) via stable mixed volumes

DOI10.1006/jsco.1998.0272zbMath0944.65055OpenAlexW2051751555MaRDI QIDQ1808667

Tang'an Gao, Tien-Yien Li, Xiao Shen Wang

Publication date: 13 September 2000

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1998.0272

zbMATH Keywords

algorithmhomotopy continuationpolynomial systemspolyhedral homotopymixed subdivisionisolated rootsstable mixed volumes

Mathematics Subject Classification ID

Related Items (14)

Partial Newton-correction method for multiple fixed points of semi-linear differential operators by Legendre-Gauss-Lobatto pseudospectral method ⋮ Computing isolated roots of sparse polynomial systems in affine space ⋮ A new augmented singular transform and its partial Newton-correction method for finding more solutions ⋮ Heuristic methods for computing the minimal multi-homogeneous Bézout number. ⋮ Mixed cell computation in HOM4ps ⋮ A new augmented singular transform and its partial Newton-correction method for finding more solutions to nonvariational quasilinear elliptic PDEs ⋮ Elimination for generic sparse polynomial systems ⋮ Optimization problem in multi-homogeneous homotopy method ⋮ Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants ⋮ Incomplete Gröbner basis as a preconditioner for polynomial systems ⋮ Solution of the least squares method problem of pairwise comparison matrices ⋮ Numerical homotopies to compute generic points on positive dimensional algebraic sets ⋮ An augmented singular transform and its partial Newton method for finding new solutions ⋮ A family of sparse polynomial systems arising in chemical reaction systems

Cites Work

• Unnamed Item
• Bernstein's theorem in affine space
• The number of roots of a system of equations
• Newton polytopes and the Bezout theorem
• Newton polyhedra and the genus of complete intersections
• A convex geometric approach to counting the roots of a polynomial system
• Mixed-volume computation by dynamic lifting applied to polynomial system solving
• Counting affine roots of polynomial systems via pointed Newton polytopes
• The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations
• The BKK root count in $\mathbf {C}^n$
• A Polyhedral Method for Solving Sparse Polynomial Systems

This page was built for publication: Finding all isolated zeros of polynomial systems in \(\mathbb{C}^n\) via stable mixed volumes