Finding All Isolated Zeros of Polynomial Systems inCnvia Stable Mixed Volumes
Authors:
- Tangan GaoTGTangan Gao
- T.Y. LiTLT.Y. Li
- Xiaoshen WangXWXiaoshen Wang
- 1 July 1999
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 28 (1-2) , 187-211
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Bernstein’s theorem in affine spaceDiscrete & Computational Geometry, 1997
- Numerical solution of multivariate polynomial systems by homotopy continuation methodsActa Numerica, 1997
- The BKK root count in 𝐂ⁿMathematics of Computation, 1996
- A polyhedral method for solving sparse polynomial systemsMathematics of Computation, 1995
- A convex geometric approach to counting the roots of a polynomial systemTheoretical Computer Science, 1994
- Solving a Planar Four-Bar Design Problem Using ContinuationJournal of Mechanical Design, 1990
- The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial EquationsSIAM Journal on Numerical Analysis, 1989
- Newton polyhedra and the genus of complete intersectionsFunctional Analysis and Its Applications, 1978
- Newton polytopes and the Bezout theoremFunctional Analysis and Its Applications, 1976
- The number of roots of a system of equationsFunctional Analysis and Its Applications, 1975