Skip to main content
Log in

New iterations of R-order four with reduced computational cost

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

From a one-point iterative method of R-order at least three, we construct new two-point iterations to solve nonlinear equations in Banach spaces such that the computational cost is reduced, whereas the R-order of convergence is increased to at least four.

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.

Similar content being viewed by others

References

  1. Amat, S., Busquier, S., Gutiérrez, J.M.: An adaptative version of a fourth-order iterative method for quadratic equations. J. Comput. Appl. Math. 191, 259–268 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  2. Argyros, I.K., Chen, D., Qian, Q.: The Jarratt method in Banach space setting. J. Comput. Appl. Math. 51, 103–106 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  3. Argyros, I.K., Chen, D., Qian, Q.: An inverse-free Jarratt type approximation in a Banach space. Approx. Theory Appl. 12, 19–30 (1996)

    MATH  MathSciNet  Google Scholar 

  4. Bruns, D.D., Bailey, J.E.: Nonlinear feedback control for operating a nonisothermal CSTR near an unstable steady state. Chem. Eng. Sci. 32, 257–264 (1977)

    Article  Google Scholar 

  5. Ezquerro, J.A., Gutiérrez, J.M., Hernández, M.A., Salanova, M.A.: Chebyshev-like methods and quadratic equations. Rev. Anal. Numér. Théor. Approx. 28, 23–35 (1999)

    MATH  MathSciNet  Google Scholar 

  6. Frontini, M., Sormani, E.: Some variant of Newton’s method with third-order convergence. Appl. Math. Comput. 140, 419–426 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hernández, M.A.: Chebyshev’s approximation algorithms and applications. Comput. Math. Appl. 41, 433–445 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  8. Homeier, H.H.H.: A modified Newton method for rootfinding with cubic convergence. J. Comput. Appl. Math. 157, 227–230 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Homeier, H.H.H.: On Newton-type methods with cubic convergence. J. Comput. Appl. Math. 176, 425–432 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  10. Kantorovich, L.V., Akilov, G.P.: Functional Analysis. Pergamon, Oxford (1982)

    MATH  Google Scholar 

  11. Potra, F.A., Pták, V.: Nondiscrete Induction and Iterative Processes. Pitman, New York (1984)

    MATH  Google Scholar 

  12. Schröeder, E.: Über unendlich viele Algorithmen zur Auflösung der Gleichugen. Math. Ann. 2, 317–365 (1870)

    Article  MathSciNet  Google Scholar 

  13. Traub, J.F.: Iterative Methods for the Solution of Equations. Prentice Hall, Englewood Cliffs (1964)

    MATH  Google Scholar 

  14. Weerakoon, S., Fernando, T.G.I.: A variant of Newton’s method with accelerated third-order convergence. Appl. Math. Lett. 13, 87–93 (2000)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to J. A. Ezquerro.

Additional information

Communicated by Lothar Reichel.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ezquerro, J.A., Hernández, M.A. New iterations of R-order four with reduced computational cost. Bit Numer Math 49, 325–342 (2009). https://doi.org/10.1007/s10543-009-0226-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10543-009-0226-z

Keywords

Mathematics Subject Classification (2000)

Navigation