Skip to main content
Log in

A convergence analysis for directional two-step Newton methods

  • Original Paper
  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

A semilocal convergence analysis for directional two-step Newton methods in a Hilbert space setting is provided in this study. Two different techniques are used to generate the sufficient convergence results, as well as the corresponding error bounds. The first technique uses our new idea of recurrent functions, whereas the second uses recurrent sequences. We also compare the results of the two techniques.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Argyros, I.K.: A unified approach for constructing fast two-step Newton-like methods. Monatsh. Math. 119, 1–22 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  2. Argyros, I.K.: A convergence analysis of Newton-like methods for singular equations using outer or generalized inverses. Appl. Math. (Warsaw) 32, 37–49 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  3. Argyros, I.K.: A unifying local–semilocal convergence analysis and applications for two-point Newton-like methods in Banach space. J. Math. Anal. Appl. 298, 374–397 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  4. Argyros, I.K.: Computational theory of iterative methods. In: Chui, C.K., Wuytack, L. (eds.) Series: Studies in Computational Mathematics, 15. Elsevier, New York (2007)

    Google Scholar 

  5. Argyros, I.K.: A semilocal convergence analysis for directional Newton methods. Math. Comput. A.M.S. (2010, in press)

  6. Argyros, I.K., Hilout, S.: Efficient Methods for Solving Equations and Variational Inequalities. Polimetrica, Milan (2009)

    Google Scholar 

  7. Argyros, I.K., Hilout, S.: Enclosing roots of polynomial equations and their applications to iterative processes. Surveys Math. Appl. 4, 119–132 (2009)

    MATH  MathSciNet  Google Scholar 

  8. Ben-Israel, A., Levin, Y.: Maple programs for directional Newton methods. Available at ftp://rutcor.rutgers.edu/pub/bisrael/Newton-Dir.mws

  9. Levin, Y., Ben-Israel, A.: Directional Newton methods in n variables. Math Comput A.M.S. 237, 251–262 (2002)

    MathSciNet  Google Scholar 

  10. Ezquerro, J.A., Hernández, M.A.: Recurrence relations for Chebyshev-type methods. Appl. Math. Optim. 41, 227–236 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  11. Ezquerro, J.A., Hernández, M.A.: New iterations of R-order four with reduced computational cost. BIT Numer. Math. 49, 325–342 (2009)

    Article  MATH  Google Scholar 

  12. Hernández, M.A., Rubio, M.J.: Recurrence relations for the super-Halley method. Comput. Math. Appl. 36, 1–8 (1998)

    MATH  Google Scholar 

  13. Ortega, J.M., Rheinboldt, W.C.: Iterative Solution of Nonlinear Equations in Several Variables. Academic, New York (1970)

    MATH  Google Scholar 

  14. Pereyra, V.: Iterative methods for solving nonlinear least square problems. SIAM J. Numer. Anal. 4, 27–36 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  15. Polyak, B.T.: Introduction to optimization. Translated from the Russian. With a foreword by D.P. Bertsekas. Translations Series in Mathematics and Engineering. Optimization Software, Inc., Publications Division, New York (1987)

    Google Scholar 

  16. Ralston, A., Rabinowitz, P.: A First Course in Numerical Analysis, 2nd edn. McGraw-Hill, New York (1978)

    MATH  Google Scholar 

  17. Stoer, J., Bulirsch, K.: Introduction to Numerical Analysis. Springer, Berlin (1976)

    Google Scholar 

  18. Walker, H.F., Watson, L.T.: Least-change Secant update methods. SIAM J. Numer. Anal. 27, 1227–1262 (1990)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ioannis K. Argyros.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Argyros, I.K., Hilout, S. A convergence analysis for directional two-step Newton methods. Numer Algor 55, 503–528 (2010). https://doi.org/10.1007/s11075-010-9368-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11075-010-9368-y

Keywords

AMS Subject Classifications

Navigation