next up previous
Next: 2.iii. Real Solutions to Sparse Systems
Up: 2. Polynomial Systems
Previous: 2.i. Sparse Polynomial Systems

2.ii. The Polyhedral Homotopy Algorithm

The polyhedral homotopy algorithm of Huber and Sturmfels [HS] deforms the sparse system (2.1) into a system where the number of solutions is evident. The deformed system is a disjunction of systems whose Newton polytope is a simplex, an important example treated in Section 2.ii.a. The deformation relies on the combinatorial structure of a regular triangulation, discussed in Section 2.ii.b. Finally, we give the polyhedral homotopy algorithm in Section 2.ii.c.
Subsections
  1. A Simplex System
  2. Regular Triangulations
  3. Polyhedral Homotopy Algorithm

next up previous
Next: 2.iii. Real Solutions to Sparse Systems
Up: 2. Polynomial Systems
Previous: 2.i. Sparse Polynomial Systems