Nonlinear Equations - UFRJ

BIBLIOGRAPHY 167
[27] David Cox, John Little, and Donal O’Shea, Ideals, varieties, and algorithms,
3rd ed., Undergraduate Texts in Mathematics, Springer, New York, 2007. An
introduction to computational algebraic geometry and commutative algebra.
[28] Jean-Pierre Dedieu, Estimations for the separation number of a polynomial
system, J. Symbolic Comput. 24 (1997), no. 6, 683–693, DOI
10.1006/jsco.1997.0161.
[29] , Estimations for the separation number of a polynomial system, J.
Symbolic Comput. 24 (1997), no. 6, 683–693, DOI 10.1006/jsco.1997.0161.
[30] , Points fixes, zéros et la méthode de Newton, Mathématiques & Applications
(Berlin) [Mathematics & Applications], vol. 54, Springer, Berlin,
2006 (French). With a preface by Steve Smale.
[31] Jean-Pierre Dedieu, Gregorio Malajovich, and Michael Shub, Adaptative
Step Size Selection for Homotopy Methods to Solve Polynomial Equations.
Preprint, ArXiV, 11 apr 2011, http://arxiv.org/abs/1104.2084.
[32] Jean-Pierre Dedieu, Pierre Priouret, and Gregorio Malajovich, Newton’s
method on Riemannian manifolds: convariant alpha theory, IMA J. Numer.
Anal. 23 (2003), no. 3, 395–419, DOI 10.1093/imanum/23.3.395.
[33] Jean-Pierre Dedieu and Mike Shub, Multihomogeneous Newton methods,
Math. Comp. 69 (2000), no. 231, 1071–1098 (electronic), DOI
10.1090/S0025-5718-99-01114-X.
[34] Thomas Delzant, Hamiltoniens périodiques et images convexes de
l’application moment, Bull. Soc. Math. France 116 (1988), no. 3, 315–339
(French, with English summary).
[35] James W. Demmel, The probability that a numerical analysis problem is
difficult, Math. Comp. 50 (1988), no. 182, 449–480, DOI 10.2307/2008617.
[36] Carl Eckart and Gale Young, The approximation of a matrix by another
of lower rank, Psychometrika 1 (1936), no. 3, 211–218, DOI
10.1007/BF02288367.
[37] , A principal axis transformation for non-hermitian matrices, Bull.
Amer. Math. Soc. 45 (1939), no. 2, 118–121, DOI 10.1090/S0002-9904-1939-
06910-3.
[38] Alan Edelman, On the distribution of a scaled condition number, Math.
Comp. 58 (1992), no. 197, 185–190, DOI 10.2307/2153027.
[39] Ioannis Z. Emiris and Victor Y. Pan, Improved algorithms for computing
determinants and resultants, J. Complexity 21 (2005), no. 1, 43–71, DOI
10.1016/j.jco.2004.03.003.
[40] O. P. Ferreira and B. F. Svaiter, Kantorovich’s theorem on Newton’s method
in Riemannian manifolds, J. Complexity 18 (2002), no. 1, 304–329, DOI
10.1006/jcom.2001.0582.
[41] Noaï Fitchas, Marc Giusti, and Frédéric Smietanski, Sur la complexité du
théorème des zéros, Approximation and optimization in the Caribbean, II
(Havana, 1993), Approx. Optim., vol. 8, Lang, Frankfurt am Main, 1995,
pp. 274–329 (French, with English and French summaries). With the collaboration
of Joos Heintz, Luis Miguel Pardo, Juan Sabia and Pablo Solernó.