Finding Zeros of Analytic Functions: α Theory for Secant Type Methods

Journal of Complexity

Volumn 15, Issue 2, 1999, Pages 239-281

  Yakoubsohn, Jean Claude ^a  

^a UNIVERSITÉ PAUL SABATIER   (France)

Author keywords

Regula Falsi; secant method; Newton method; approximate zero; theory; homotopy method; complexity

Indexed keywords

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

References (10)

1. Blum L., Cucker F., Shub M., Smale S. Complexity and Real Computation. 1998;Springer-Verlag, New York/Berlin.
2. Dedieu J. P. Condition number analysis for sparse polynomial systems. Cucker F., Shub M. Foundations of Computational Mathematics. 1997;Springer-Verlag, New York/Berlin.
3. M. ElKadi, and, B. Mourrain, Approche effective des résidus algébriques, Rapport de Recherche, 2834, INRIA.
4. Han D.-F., Wang X.-H. On dominating sequence in the point estimate and smale theorem. Sci. China Ser. A. 33:1990;135-144.
5. Kantorovitch L., Akilov G. Analyse fonctionnelle. 1981.
6. Ortega J. M., Rheinboldt W. C. Iterative Solution of Nonlinear Equations in Several Variables. 1970;Academic Press, San Diego.
7. Ostrowski A. M. Solutions of Equations and Systems of Equations. 1973;Academic Press, San Diego.
8. Shub M., Smale S. Complexity of Bezout's theorem. 1. Geometric aspects. J. Amer. Math. Soc. 6:1993;459-501.
9. Smale S. Newton's method estimates from data at one point. Erwing R., Gross K., Martin C. The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics. 1986;Springer-Verlag, New York/Berlin.
10. Yakoubsohn J. C. A universal constant for the convergence of Newton's method and an application to the classical homotopy method. Numer. Algorithms. 9:1995;223-244.