Home Derivative free iterative methods with memory having higher R-order of convergence
Article
Licensed
Unlicensed Requires Authentication

Derivative free iterative methods with memory having higher R-order of convergence

  • Pankaj Jain EMAIL logo and Prem Bahadur Chand
Published/Copyright: July 5, 2020

Abstract

We derive two iterative methods with memory for approximating a simple root of any nonlinear equation. For this purpose, we take two optimal methods without memory of order four and eight and convert them into the methods with memory without increasing any further function evaluation. These methods involve a self-accelerator (parameter) that depends upon the iteration index to increase the order of the optimal methods. Consequently, the efficiency of the new methods is considerably high as compared to the methods without memory. Some numerical examples are provided in support of the theoretical results.

2010 AMS Subject Classifcation: 65H05

Corresponding author: Pankaj Jain, Department of Mathematics, South Asian University, Akbar Bhawan, Chanakya Puri, New Delhi, 110021, India, E-mail:

  1. Author contribution: All the authors have accepted responsibility for the entire content of this submitted manuscript and approved submission.

  2. Research funding: None declared.

  3. Employment or leadership: None declared.

  4. Honorarium: None declared.

  5. Conflict of interest statement: The authors declare no conflicts of interest regarding this article.

References

[1] H. T. Kung and J. F. Traub, “Optimal order of one-point and multipoint iterations,” J. Assoc. Comput. Mach., vol. 21, no. 4, pp. 643–651, 1974, https://doi.org/10.1145/321850.321860.10.1145/321850.321860Search in Google Scholar

[2] A. M. Ostrowski, Solutions of Equations and System of Equations, New York, USA, Academic Press, 1966.Search in Google Scholar

[3] F. I. Chicharro, A. Cordero, and J. R. Torregrosa, “Dynamics and fractal dimension of Steffensen-type methods,” Algorithms, vol. 8, no. 2, pp. 271–279, 2015, https://doi.org/10.3390/a8020271.Search in Google Scholar

[4] A. Cordero and J. R. Torregrosa, “Low-complexity root-finding iteration functions with no derivatives of any order of convergence,” J. Comp. Appl. Math., vol. 275, pp. 502–515, 2015, https://doi.org/10.1016/j.cam.2014.01.024.Search in Google Scholar

[5] M. U. D. Junjua, F. Zafar, and N. Yasmin, “Optimal derivative-free root finding methods based on inverse interpolation,” Mathematics, vol. 7, no. 2, pp. 164–173, 2019, https://doi.org/10.3390/math7020164.Search in Google Scholar

[6] F. Soleimani, F. Soleymani, and S. Shateyi, “Some iterative methods free from derivatives and their basin of attraction for nonlinear equations,” Discrete Dyn. Nat. Soc., vol. 2013, p. 10, 2013, Art Id 301718, https://doi.org/10.1155/2013/301718.Search in Google Scholar

[7] P. Jain, “Steffensen type methods for solving nonlinear equations,” Appl. Math. Comput., vol. 194, no. 2, pp. 527–533, 2007, https://doi.org/10.1016/j.amc.2007.04.087.Search in Google Scholar

[8] J. F. Traub, Iterative Methods for the Solution of Equations, Englewood Cliffs, NJ, New Jersey, Prentice-Hall, 1964.Search in Google Scholar

[9] F. I. Chicharro, A. Cordero, J. R. Torregrosa, and M. P. Vassileva, “King-type derivative-free iterative families: real and memory dynamics,” Complexity, vol. 2017, pp. 1–15, 2017, https://doi.org/10.1155/2017/2713145.Search in Google Scholar

[10] S. Sharifi, S. Siegmund, and M. Salimi, “Solving nonlinear equations by a derivative-free form of the King's family with memory,” Calcolo, vol. 53, no. 2, pp. 201–215, 2016, https://doi.org/10.1007/s10092-015-0144-1.Search in Google Scholar

[11] M. S. Petkovic, S. Ilic, and J. Dzunic, “Derivative free two-point methods with and without memory for solving nonlinear equations,” Appl. Math. Comput., vol. 217, no. 5, pp. 1887–1895, 2010, https://doi.org/10.1016/j.amc.2010.06.043.Search in Google Scholar

[12] J. Dzunic, M. S. Petkovic, and L. D. Petkovic, “Three point method with and without memory for solving nonlinear equations,” Appl. Math. Comput., vol. 218, no. 9, pp. 4917–4927, 2012, https://doi.org/10.1016/j.amc.2011.10.057.Search in Google Scholar

[13] J. M. Ortega and W. C. Rheinbolt, Iterative Solution of Nonlinear Equations in Sevral Variables, New York, Academic Press, 1970.Search in Google Scholar

[14] J. Dzunic, “On efficient two parameter method for solving nonlinear equations,” Numer. Algor., vol. 63, no. 3, pp. 549–569, 2013, https://doi.org/10.1007/s11075-012-9641-3.Search in Google Scholar

[15] M. Grau-Sánchez, M. Noguera, and J. M. Gutiérrez, “On some computational orders of convergence,” Appl. Math. Lett., vol. 23, no. 4, pp. 472–478, 2010, https://doi.org/10.1016/j.aml.2009.12.006.Search in Google Scholar

Received: 2019-06-19
Accepted: 2020-05-03
Published Online: 2020-07-05
Published in Print: 2020-10-25

© 2020 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 23.11.2025 from https://www.degruyterbrill.com/document/doi/10.1515/ijnsns-2019-0174/html
Scroll to top button