Skip to main content
Log in

Widening basins of attraction of optimal iterative methods

  • Original Paper
  • Published:
Nonlinear Dynamics Aims and scope Submit manuscript

Abstract

In this work, we analyze the dynamical behavior on quadratic polynomials of a class of derivative-free optimal parametric iterative methods, designed by Khattri and Steihaug. By using their parameter as an accelerator, we develop different methods with memory of orders three, six and twelve, without adding new functional evaluations. Then a dynamical approach is made, comparing each of the proposed methods with the original ones without memory, with the following empiric conclusion: Basins of attraction of iterative schemes with memory are wider and the behavior is more stable. This has been numerically checked by estimating the solution of a practical problem, as the friction factor of a pipe and also of other nonlinear academic problems.

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.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

References

  1. Amat, S., Busquier, S., Bermúdez, C., Plaza, S.: On two families of high order Newton type methods. Appl. Math. Lett. 25, 2209–2217 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  2. Amat, S., Busquier, S., Bermúdez, C., Magreñán, Á.A.: On the election of the damped parameter of a two-step relaxed Newton-type method. Nonlinear Dyn. 84(1), 9–18 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chun, C., Neta, B.: An analysis of a family of Maheshwari-based optimal eighth order methods. Appl. Math. Comput. 253, 294–307 (2015)

    MathSciNet  MATH  Google Scholar 

  4. Babajee, D.K.R., Cordero, A., Soleymani, F., Torregrosa, J.R.: On improved three-step schemes with high efficiency index and their dynamics. Numer. Algorithms 65(1), 153–169 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  5. Argyros, I.K., Magreñán, Á.A.: On the convergence of an optimal fourth-order family of methods and its dynamics. Appl. Math. Comput. 252, 336–346 (2015)

    MathSciNet  MATH  Google Scholar 

  6. Petković, M., Neta, B., Petković, L., Džunić, J.: Multipoint Methods for Solving Nonlinear Equations. Academic Press, London (2013)

    MATH  Google Scholar 

  7. Ostrowski, A.M.: Solution of Equations and System of Equations. Prentice-Hall, Englewood Cliffs, NJ (1964)

  8. Kung, H.T., Traub, J.F.: Optimal order of one-point and multipoint iteration. J. ACM 21, 643–651 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  9. Khattri, S.K., Steihaug, T.: Algorithm for forming derivative-free optimal methods. Numer. Algorithms 65(4), 809–824 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  10. Traub, J.F.: Iterative Methods for the Solution of Equations. Prentice Hall, New York (1964)

    MATH  Google Scholar 

  11. Cordero, A., Soleymani, F., Torregrosa, J.R., Shateyi, S.: Basins of Attraction for Various Steffensen-Type Methods. J. Appl. Math. 2014, 1–17 (2014)

  12. Devaney, R.L.: The Mandelbrot Set, the Farey Tree and the Fibonacci sequence. Am. Math. Mon. 106(4), 289–302 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  13. McMullen, C.: Families of rational maps and iterative root-finding algorithms. Ann. Math. 125(3), 467–493 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  14. Chicharro, F., Cordero, A., Gutiérrez, J.M., Torregrosa, J.R.: Complex dynamics of derivative-free methods for nonlinear equations. Appl. Math. Comput. 219, 70237035 (2013)

    MathSciNet  MATH  Google Scholar 

  15. Magreñán, Á.A.: Different anomalies in a Jarratt family of iterative root-finding methods. Appl. Math. Comput. 233, 29–38 (2014)

    MathSciNet  MATH  Google Scholar 

  16. Neta, B., Chun, C., Scott, M.: Basins of attraction for optimal eighth order methods to find simple roots of nonlinear equations. Appl. Math. Comput. 227, 567–592 (2014)

    MathSciNet  Google Scholar 

  17. Lotfi, T., Magreñán, Á.A., Mahdiani, K., Rainer, J.J.: A variant of Steffensen–King’s type family with accelerated sixth-order convergence and high efficiency index: dynamic study and approach. Appl. Math. Comput. 252, 347–353 (2015)

    MathSciNet  MATH  Google Scholar 

  18. Chicharro, F.I., Cordero, A., Torregrosa, J.R.: Drawing dynamical and parameters planes of iterative families and methods. Sci. World J. 2013, 1–11 (2013)

  19. Cordero, A., Lotfi, T., Torregrosa, J.R., Assari, P., Mahdiani, K.: Some new bi-accelerator two-point methods for solving nonlinear equations. Comput. Appl. Math. 35(1), 251–267 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  20. Cordero, A., Lotfi, T., Bakhtiari, P., Torregrosa, J.R.: An efficient two-parametric family with memory for nonlinear equations. Numer. Algorithms 68(2), 323–335 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  21. Lotfi, T., Mahdiani, K., Bakhtiari, P., Soleymani, F.: Constructing two-step iterative methods with and without memory. Comput. Math. Math. Phys. 55(2), 183–193 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  22. Cordero, A., Maimó, J.G., Torregrosa, J.R., Vassileva, M.P.: Solving nonlinear problems by Ostrowski–Chun type parametric families. J. Math. Chem. 53, 430–449 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  23. Abad, M., Cordero, A., Torregrosa, J.R.: A family of seventh-order schemes for solving nonlinear systems. Bull. Math. Soc. Sci. Math. Roum. Tome 57(105), 133–145 (2014)

    MathSciNet  MATH  Google Scholar 

  24. 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  MathSciNet  MATH  Google Scholar 

  25. White, F.: Fluid Mechanics. McGraw-Hill, Boston (2003)

    Google Scholar 

  26. Zheng, Q., Li, J., Huang, F.: An optimal Steffensen-type family for solving nonlinear equations. Appl. Math. Comput. 217, 9592–9597 (2011)

    MathSciNet  MATH  Google Scholar 

  27. Soleymani, F., Babajee, D.K.R., Shateyi, S., Motsa, S.S.: Construction of optimal derivative-free techniques without memory. J. Appl. Math. (2012). doi:10.1155/2012/497023

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

The authors thank to the anonymous referees for their valuable comments and for the suggestions that have improved the final version of the paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Juan R. Torregrosa.

Additional information

This research was supported by Islamic Azad University, Hamedan Branch, Ministerio de Economía y Competitividad MTM2014-52016-C02-2-P and Generalitat Valenciana PROMETEO/2016/089.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bakhtiari, P., Cordero, A., Lotfi, T. et al. Widening basins of attraction of optimal iterative methods. Nonlinear Dyn 87, 913–938 (2017). https://doi.org/10.1007/s11071-016-3089-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11071-016-3089-2

Keywords

Navigation