Several two-point with memory iterative methods for solving nonlinear equations
- 44 Downloads
In this article, our main motivation is to present two-step with memory iterative methods for solving nonlinear equations. We attempted to convert the existing fourth-order without memory method into a with memory method. Further acceleration of convergence order is attained by means of different approximations of self-accelerating parameters. The parameters are calculated by Hermite interpolating polynomial and applied to accelerate the order of convergence of the without memory methods. In particular, the R-order of the proposed two-step with memory iterative method is increased without any additional calculations and it possesses high computational efficiency. At the end, the theoretical results are confirmed by considering different numerical examples. Numerical comparisons specify that the new family is efficient and give tough competition to some existing with memory iterative methods.
KeywordsIterative method With memory scheme Hermite interpolation polynomial Computational efficiency Numerical result
Mathematics Subject Classification34G20 74G15
- 6.Kumar, S., Kanwar, V., Tomar, S.K., Singh, S.: Geometrically constructed families of Newton’s method for unconstrained optimization and nonlinear equations. Int. J. Math. Math. Sci. Article ID 972537, 1–9 (2011)Google Scholar
- 10.Lotfi, T., Assari, P.: Two new three and four parametric with memory methods for solving nonlinear equations. Int. J. Ind. Math. 7(3), 1–8 (2015)Google Scholar
- 13.Ortega, J.M., Rheinbolt, W.C.: In Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York (1997)Google Scholar