Skip to main content
SpringerLink
Log in

Developing a new family of Newton–Secant method with memory based on a weight function

  • Published:
SeMA Journal Aims and scope Submit manuscript

Abstract

In this paper, we construct an iterative method with memory based on the Newton–Secants method to solve nonlinear equations. This proposed method has fourth order convergence and costs only three functions evaluation per iteration and without any evaluation of the derivative function. Acceleration of the convergence speed is achieved by an appropriate variation of a free parameter in each step. This self accelerator parameter is estimated using Newtons interpolation polynomial of third degree. The order of convergence is increased from 4 to 5.23 without any extra function evaluation. This method has the efficiency index equal to \(5.23^{\frac{1}{3}}\approx 1.7358\). We describe the analysis of the proposed method along with numerical experiments including comparison with the existing methods. Finally, the attraction basins of the proposed method are shown and compared with other existing methods.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Amat, S., Busquier, S.: On a Steffensen’s type method and its behavior for semismooth equations. Appl. Math. Comput. 177, 819–823 (2006)

    MathSciNet  MATH  Google Scholar 

  2. Amat, S., Busquier, S.: A two-step Steffensen’s method under modified convergence conditions. J. Math. Anal. Appl. 324, 1084–1092 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  3. Amat, S., Busquier, S., Plaza, S.: Review of some iterative root-finding methods from a dynamical point of view. J. Scientia 10, 3–35 (2004)

    MathSciNet  MATH  Google Scholar 

  4. Amat, S., Busquirer, S., Plaza, S.: Dynamics of a family of third-order itrative methods that do not require using second derivatives. J. Appl. Math. Comput. 154, 735–746 (2004)

    Article  MATH  Google Scholar 

  5. Cordero, A., Torregrosa, J.R.: Variants of Newton method using fifth-order quadrature formulas. Appl. Math. Comput. 190, 686–698 (2007)

    MathSciNet  MATH  Google Scholar 

  6. Ezquerro, J.A., Grau-Sánchez, M., Hernández-Verón, M.A., Noguera, M.: A study of optimization for Steffensen-type methods with frozen divided differences. SeMA J. 70, 23–46 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ferrara, M., Sharifi, S., Salimi, M.: Computing multiple zeros by using a parameter in Newton-Secant method. SeMA J. (2016). doi:10.1007/s40324-016-0074-0

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Liu, Z., Zheng, Q., Zhao, P.: A variant of Steffensens method of fourth-order convergence and its applications. Appl. Math. Comput. 216, 1978–1983 (2010)

    MathSciNet  MATH  Google Scholar 

  10. Lotfi, T., Sharifi, S., Salimi, M., Siegmund, S.: A new class of three-point methods with optimal convergence order eight and its dynamics. Numer. Algor. 68, 261–288 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  11. Petković, M.S., Neta, B., Petković, L.D., Džunić, J.: Multipoint methods for solving nonlinear equations. Elsevier/Academic Press, Amsterdam (2013)

    MATH  Google Scholar 

  12. Salimi, M., Lotfi, T., Sharifi, S., Siegmund, S., Optimal Newton-Secant like methods without memory for solving nonlinear equations with its dynamics, Int. J. Comput. Math. (2016) published online. doi:10.1080/00207160.2016.1227800

  13. Sharifi, S., Ferrara, M., Salimi, M., Siegmund, S.: New modification of Maheshwari method with optimal eighth order of convergence for solving nonlinear equations. Open Math. (formerly Central European Journal of Mathematics) 14, 443–451 (2016)

    MathSciNet  MATH  Google Scholar 

  14. Sharifi, S., Siegmund, S., Salimi, M.: Solving nonlinear equations by a derivative-free form of the King’s family with memory. Calcolo 53, 201–215 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  15. Sharifi, S., Salimi, M., Siegmund, S., Lotfi, T.: A new class of optimal four-point methods with convergence order 16 for solving nonlinear equations. Math. Comput. Simulat. 119, 69–90 (2016)

    Article  MathSciNet  Google Scholar 

  16. Sharma, J.R., Guha, R.K., Gupa, P.: Some efficient derivative free methods with memory for solving nonlinear equations. Appl. Math. Comput. 219, 699–707 (2012)

    MathSciNet  MATH  Google Scholar 

  17. Traub, J.F.: Iterative methods for the solution of equations. Prentice Hall, Englewood Cliffs (1964)

    MATH  Google Scholar 

  18. Varona, J.L.: Graphic and numerical comparison between iterative methods. Math. Intelligencer 24, 37–46 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  19. Vrscay, E.R., Gilbert, W.J.: Extraneous fixed points, basin boundaries and chaotic dynamics for Schroder and Konig rational iteration functions. Numer. Math. 52, 1–16 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  20. 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 

  21. 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 

  22. Zheng, Q., Zhao, P., Huang, F.: A family of fourth-order Steffensen-type methods with the applications on solving nonlinear ODEs. Appl. Math. Comput. 217, 8196–8203 (2011)

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The present research was supported by Putra Grant Vot, No. 9442300, Universiti Putra Malaysia.

Author information

Authors and Affiliations

  1. Department of Mathematics, Faculty of Science, Universiti Putra Malaysia, 43400 UPM, Serdang, Selangor, Malaysia

    N. M. A. Nik Long & Mehdi Salimi

  2. Institute for Mathematical Research, Universiti Putra Malaysia, 43400 UPM, Serdang, Selangor, Malaysia

    N. M. A. Nik Long

  3. Center for Dynamics, Department of Mathematics, Technische Universität Dresden, Dresden, Germany

    Mehdi Salimi

  4. MEDAlics, Research Center at Università per Stranieri Dante Alighieri, Reggio Calabria, Italy

    Somayeh Sharifi

  5. Department of Law and Economics, Università Mediterranea di Reggio Calabria, Reggio Calabria, Italy

    Massimiliano Ferrara

Authors
  1. N. M. A. Nik Long
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mehdi Salimi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Somayeh Sharifi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Massimiliano Ferrara
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mehdi Salimi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Nik Long, N.M.A., Salimi, M., Sharifi, S. et al. Developing a new family of Newton–Secant method with memory based on a weight function. SeMA 74, 503–512 (2017). https://doi.org/10.1007/s40324-016-0097-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40324-016-0097-6

Keywords

Mathematics Subject Classification

Search

Navigation