COMPLEXITY OF BEZOUT THEOREM .4. PROBABILITY OF SUCCESS - EXTENSIONS

Authors
Citation
M. Shub et S. Smale, COMPLEXITY OF BEZOUT THEOREM .4. PROBABILITY OF SUCCESS - EXTENSIONS, SIAM journal on numerical analysis, 33(1), 1996, pp. 128-148
Citations number
30
Categorie Soggetti
Mathematics,Mathematics
ISSN journal
00361429
Volume
33
Issue
1
Year of publication
1996
Pages
128 - 148
Database
ISI
SICI code
0036-1429(1996)33:1<128:COBT.P>2.0.ZU;2-G
Abstract
We estimate the probability that a given number of projective Newton s teps applied to a linear homotopy of a system of n homogeneous polynom ial equations in n + 1 complex variables of fixed degrees will find al l the roots of the system. We also extend the framework of our analysi s to cover the classical implicit function theorem and revisit the con dition number in this context. Further complexity theory is developed.