The MathNet Korea
Information Center for Mathematical Science

논문검색

Information Center for Mathematical Science

논문검색

Journal of the American Mathematical Society
( Vol. 6 NO.2 / (1993))
Complexity of Bezout's Theorem. I;Geometric aspects
Michael shub, Steve Smale,
Pages. 459-501
Abstract
Contents 1. The main result and structure of the proof 1.1. Introduction 1.2. Complexity
of path following in Banach spaces 1.3. Complexity for polynomial systems in
terms of the condition number $\mu$ 1.4. Complexity in terms of the distance to
the discriminant variety $\sum$ 2. the abstract theory 2.1. Point estimates 2.2.
The domination theorem 2.3. Robustness 3. reduction to the analysis of the
condition number 3.1. The higher derivative estimate 3.2. Projective Newton
method 4. Characterizing the condition number 4.1. The projective case, $\mu = 1
/ \rho$ 4.2. Bounds on zeros and the affine case
Key words
Mathmatical Subject Classification 65H10