How to count efficiently all affine roots of a polynomial system

DOI10.1016/S0166-218X(99)00003-7MaRDI QIDQ1289017zbMATH OpenOpenAlexFDO

Authors Ioannis Z. Emiris, J. Verschelde

Publication date 1999

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(99)00003-7

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites work

• A convex geometric approach to counting the roots of a polynomial system
• A Polyhedral Method for Solving Sparse Polynomial Systems
• Bernstein's theorem in affine space
• Counting affine roots of polynomial systems via pointed Newton polytopes
• Efficient incremental algorithms for the sparse resultant and the mixed volume
• Fiber polytopes
• Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
• scientific article; zbMATH DE number 50337 (Why is no real title available?)
• scientific article; zbMATH DE number 3601710 (Why is no real title available?)
• scientific article; zbMATH DE number 503188 (Why is no real title available?)
• scientific article; zbMATH DE number 1069614 (Why is no real title available?)
• scientific article; zbMATH DE number 236540 (Why is no real title available?)
• Mixed volumes of polytopes
• Mixed-volume computation by dynamic lifting applied to polynomial system solving
• On The Complexity of Computing Mixed Volumes
• On the complexity of sparse elimination
• On the Newton polytope of the resultant
• The BKK root count in $\mathbf {C}^n$
• Toric intersection theory for affine root counting

Cited in

(9)

• Mixed volume techniques for embeddings of Laman graphs
• Numerical homotopies to compute generic points on positive dimensional algebraic sets
• Matrices in elimination theory
• Elimination for generic sparse polynomial systems
• On the multiplicity of isolated roots of sparse polynomial systems
• Computing isolated roots of sparse polynomial systems in affine space
• Singular bifurcations in higher index differential-algebraic equations
• Global optimality conditions and optimization methods for polynomial programming problems
• Sparse systems and algorithmic equidimensional decomposition

This page was built for publication: How to count efficiently all affine roots of a polynomial system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1289017)