Nonlinear Equations - UFRJ

170 BIBLIOGRAPHY
[69] , Complexity of Bezout’s theorem. VI. Geodesics in the condition
(number) metric, Found. Comput. Math. 9 (2009), no. 2, 171–178, DOI
10.1007/s10208-007-9017-6.
[70] Michael Shub and Steve Smale, Complexity of Bézout’s theorem. I. Geometric
aspects, J. Amer. Math. Soc. 6 (1993), no. 2, 459–501, DOI
10.2307/2152805.
[71] M. Shub and S. Smale, Complexity of Bezout’s theorem. II. Volumes and
probabilities, Computational algebraic geometry (Nice, 1992), Progr. Math.,
vol. 109, Birkhäuser Boston, Boston, MA, 1993, pp. 267–285.
[72] Michael Shub and Steve Smale, Complexity of Bezout’s theorem. III. Condition
number and packing, J. Complexity 9 (1993), no. 1, 4–14, DOI
10.1006/jcom.1993.1002. Festschrift for Joseph F. Traub, Part I.
[73] , Complexity of Bezout’s theorem. IV. Probability of success;
extensions, SIAM J. Numer. Anal. 33 (1996), no. 1, 128–148, DOI
10.1137/0733008.
[74] M. Shub and S. Smale, Complexity of Bezout’s theorem. V. Polynomial
time, Theoret. Comput. Sci. 133 (1994), no. 1, 141–164, DOI 10.1016/0304-
3975(94)90122-8. Selected papers of the Workshop on Continuous Algorithms
and Complexity (Barcelona, 1993).
[75] S. Smale, Topology and mechanics. I, Invent. Math. 10 (1970), 305–331.
[76] Steve Smale, On the efficiency of algorithms of analysis, Bull. Amer. Math.
Soc. (N.S.) 13 (1985), no. 2, 87–121, DOI 10.1090/S0273-0979-1985-15391-1.
[77] , Newton’s method estimates from data at one point, computational
mathematics (Laramie, Wyo., 1985), Springer, New York, 1986, pp. 185–196.
[78] , Mathematical problems for the next century, Math. Intelligencer 20
(1998), no. 2, 7–15, DOI 10.1007/BF03025291.
[79] , Mathematical problems for the next century, Mathematics: frontiers
and perspectives, Amer. Math. Soc., Providence, RI, 2000, pp. 271–294.
[80] Andrew J. Sommese and Charles W. Wampler II, The numerical solution of
systems of polynomials, World Scientific Publishing Co. Pte. Ltd., Hackensack,
NJ, 2005. Arising in engineering and science.
[81] A. M. Turing, Rounding-off errors in matrix processes, Quart. J. Mech. Appl.
Math. 1 (1948), 287–308.
[82] Constantin Udrişte, Convex functions and optimization methods on Riemannian
manifolds, Mathematics and its Applications, vol. 297, Kluwer Academic
Publishers Group, Dordrecht, 1994.
[83] Jan Verschelde, Polyhedral methods in numerical algebraic geometry, Interactions
of classical and numerical algebraic geometry, Contemp. Math.,
vol. 496, Amer. Math. Soc., Providence, RI, 2009, pp. 243–263.
[84] Wang Xinghua, Some result relevant to Smale’s reports, in: M.Hirsch, J.
Marsden and S. Shub(eds): From Topolgy to Computation: Proceedings of
Smalefest, Springer, new-york, 1993, pp. 456-465.