Some lower bounds for the complexity of continuation methods

Journal of Complexity

Volumn 14, Issue 4, 1998, Pages 454-465

  Dedieu, Jean Pierre ^a   Smale, Steve ^b  

^a UNIVERSITÉ PAUL SABATIER   (France)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001577527     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.1998.0486     Document Type: Article

References (10)

1. Blum L., Cucker F., Shub M., Smale S. Complexity and Real Computation. 1997;Springer-Verlag, New York/Berlin.
2. Dedieu J. P. Condition number analysis for sparse polynomial systems. Foundations of Computational Mathematics. 1997;Springer-Verlag, New York.
3. Dedieu J. P., Shub M. Multihomogeneous Newton's method. Math. of Comp. 1997.
4. Dedieu, J. P. Shub, M. 1998, Newton and predictor-corrector methods for over-determined systems of equations.
5. Malajovich G. On generalized Newton algorithms. Theor. Comput. Sci. 133:1994;65-84.
6. Shub M. Some remarks on Bézout's theorem and complexity. Hirsch M. V., Marsden J. E., Shub M. Proceedings of the Smalefest. 1993;443-455 Springer-Verlag, New York.
7. Shub M., Smale S. Complexity of Béout's theorem. I. Geometric aspects. J. Am. Math. Soc. 6:1993;459-501.
8. Shub M., Smale S. Complexity of Bézout's theorem. IV. Probability of success, extensions. SIAM J. Numer. Anal. 33:1996;128-148.
9. Shub M., Smale S. Complexity of Bézout's theorem. V. Polynomial time. Theor. Comput. Sci. 133:1994;141-164.
10. Smale S. Newton's method estimates from data at one point. Ewing R., Gross K., Martin C. The Merging of Disciplines: New Directions in Pure, Applied and Computational Mathematics. 1986;Springer-Verlag, New York/Berlin.