@incollection{SB_1986-1987__29__19_0, author = {Marin, Alexis}, title = {G\'eom\'etrie des polyn\^omes. {Co\^ut} global moyen de la m\'ethode de {Newton}}, booktitle = {S\'eminaire Bourbaki : volume 1986/87, expos\'es 669-685}, series = {Ast\'erisque}, note = {talk:670}, pages = {19--36}, publisher = {Soci\'et\'e math\'ematique de France}, number = {152-153}, year = {1987}, mrnumber = {936846}, zbl = {0634.65034}, language = {fr}, url = {http://archive.numdam.org/item/SB_1986-1987__29__19_0/} }
TY - CHAP AU - Marin, Alexis TI - Géométrie des polynômes. Coût global moyen de la méthode de Newton BT - Séminaire Bourbaki : volume 1986/87, exposés 669-685 AU - Collectif T3 - Astérisque N1 - talk:670 PY - 1987 SP - 19 EP - 36 IS - 152-153 PB - Société mathématique de France UR - http://archive.numdam.org/item/SB_1986-1987__29__19_0/ LA - fr ID - SB_1986-1987__29__19_0 ER -
%0 Book Section %A Marin, Alexis %T Géométrie des polynômes. Coût global moyen de la méthode de Newton %B Séminaire Bourbaki : volume 1986/87, exposés 669-685 %A Collectif %S Astérisque %Z talk:670 %D 1987 %P 19-36 %N 152-153 %I Société mathématique de France %U http://archive.numdam.org/item/SB_1986-1987__29__19_0/ %G fr %F SB_1986-1987__29__19_0
Marin, Alexis. Géométrie des polynômes. Coût global moyen de la méthode de Newton, in Séminaire Bourbaki : volume 1986/87, exposés 669-685, Astérisque, no. 152-153 (1987), Talk no. 670, 18 p. http://archive.numdam.org/item/SB_1986-1987__29__19_0/
[Ba] Uber Divergenzpunkte des Newtonshe Verfahrens zur Bestimmung von Würzeln algebraischer Gleichungen III, Publ. Math. Debrecen 8 (1961), 193-207. | MR | Zbl
,[C] On zero finding methods of higher order from data at one point, MSRI Berkeley (1986).
,[DH] On the dynamics of polynomial like mappings, Ann. Sci. E.N.S., 4e série, t.18 (1985), 287-343. | Numdam | MR | Zbl
AND ,[F] Estimations uniformes pour les domaines de convergence de la méthode de Newton, Séminaire de Géométrie Algébrique Réelle ( ), Publ. Univ. Paris VII, 24 (1986). | MR | Zbl
,[G] Diverses interventions au Séminaire Bourbaki, tradition orale.
,[H] Multivalent functions", Cambridge Univ. Press, Cambridge, 1958. | MR | Zbl
, "[HPS] Invariant manifolds, Lectures Notes in Math. 583 (1977), Springer, New-York. | MR | Zbl
, AND ,[HM] Newton's algorithm and chaotic dynamical systems, SIAM J. Math. Anal. 15 (1984), 238-252. | MR | Zbl
AND ,[Ka] Analyse fonctionnelle, t.2, Editions MIR, Moscou, 1981. | Zbl
ET ,[McM] Families of Rationals Maps and Iterative Root-Finding Algorithms", Ph. D., Harvard Univ., Mai 1985, à paraître. | Zbl
, "[M] Les arbres de Shub-Smale, Séminaire de Géométrie algébrique réelle ( ), Publ. Univ. Paris VII 24 (1986). | MR
,[O] Démonstration de la conjecture de Bieberbach, exposé n°649 du Séminaire Bourbaki (juin 1985). | Numdam | Zbl
,[R1] On the efficiency of Newton's method in approximating all zeros of a system of complex polynomials, à paraître dans Mathematics of Operations Research. | Zbl
,[R2] A polynomial-time algorithm based on Newton's method for linear programming, MSRI Berkeley (1986).
,[SU] Newton's method, circle maps and chaotic motions, Amer. Math. Monthly 91 (1984), 3-17. | MR | Zbl
AND ,[Sh] The geometry and topology of dynamical systems, and algorithms for numerical problems, notes préparées pour des conférences données à D.D.A, Université de Peking, Bejing, Chine, Août-Septembre 1983.
,[ShSm1&2] Computational complexity on the geometry of polynomials and a theory of cost, PartI, Ann. Sci. E.N.S. (4) t.18 (1985), 107-161; Part II, SIAM J. Computing 15 (1986), 145-161. | MR | Zbl
AND ,[ShSm3] On the existence of generally convergent algorithms, Jour. of Complexity 2 (1986), 2-11. | MR | Zbl
AND ,[STW] The Newtonian graph of a complex polynomial, soumis à SIAM J. of Math. Analysis. | MR | Zbl
, AND ,[Sm1] A Convergent process of price adjustment and global Newton methods, J. Math. Econom. 3 (1976), 107-120. | MR | Zbl
,[Sm2] The fundamental theorem of algebra and complexity theory, Bull. Amer. Math. Soc. 4 (1981), 107-120. | MR | Zbl
,[Sm3] The Problem of the average speed of the simplex method, in "Mathematical Programming: the state of the Art", Bonn 1982 (editors Bachem et al.), Springer, 1983. | MR | Zbl
,[Sm4] On the efficiency of algorithms of analysis, Bull. Amer. Math. Soc. 13 (1985), 87-121. | MR | Zbl
,[Sm5] Newton's method estimates from data at one point, à paraître dans: Proceedings of a Conference at Laramie in Honor of Gail S. Young, Springer New York (1986). | MR | Zbl
,[Sm6] Algorithms for solving equations, MSRI Berkeley, 1986 (texte écrit pour le congrès mondial de Berkeley). | MR | Zbl
,