Michael Shub (City University of New York)
Calvin Lab 116
The Complexity of Homotopy Methods for Solving Systems of Polynomial Equations
A homotopy method begins with a system path f_t and a root z_0 of f_0 and continues the root along f_t to find a root of f_1. We give a complexity upper bound and explore the problem of "finding hay in the haystack",,, that is good starting point.