Solving Polynomials II
summary
Homotopy continuation constructs explicit start systems and traces solution paths so each isolated root receives exactly as many paths as its multiplicity, using a Bézout homotopy (6^5 = 7,776 start paths) and projective compactification to turn divergent paths finite. Singular endpoints use endgames (Puiseux series or contour integrals) and deflation by adding Jacobian minors to restore quadratic Newton convergence. Exploiting structure yields 3264 conics or the mixed volume (BKK) bound instead of crude overcounts.
AI-written summary · about
chapters (20)
- 0:00Introduction
- 1:07Homotopy setup for solutions
- 3:15Real coefficients and gamma
- 7:11Solution paths in homotopy
- 12:58Paths diverging to infinity
- 17:14Compactification and projective space
- 19:23Singular endpoints
- 26:12End games and singular points
- 30:41Newton's method convergence
- 35:41Bertini's theorem for overdetermined
- 40:31Multiplicity and F2 G example
- 43:49Steiner's problem and conics
- 47:25Exploiting system structure
- 50:01Multihomogeneous and polytope homotopies
- 52:08Determinantal systems
- 56:13Newton and fixed-point homotopies
- 59:19Coefficient parameter homotopy
- 1:02:34Smale's 17th problem
- 1:09:32Complexity and numerical methods
- 1:15:22Q&A
