On generalized Newton algorithms: Quadratic convergence, path-following and error analysis (Q1338218): Difference between revisions

The paper deals with the analysis of Newton-like methods for the computation of the zeros of systems of polynomials. For example, Newton- like operators are studied for embeddings of polynomial systems in complex projective space, and for homotopy maps. The author obtains Kantorovich type convergence theorems and extensions of the complexity results of \textit{M. Shub} and \textit{S. Smale} [Complexity of Bezout's theorem. I: Geometric aspects. J. Am. Math. Soc. 6, No. 2, 459-501 (1993), II: Volumes and probabilities. Computational algebraic geometry. Papers from a conference, held in Nice, France, April 21-25, 1992. Boston: Birkhäuser (ISBN 0-8176-3678-1). Prog. Math. Boston, Mass. Prog. Math. (Boston Mass.) v. 109, 267-285 (1993), III: Condition number and packing. J. Complexity 9, No. 1, 4-14 (1993), IV: Probability of success, extensions. SIAM J. Comput. (to appear)].