New modifications of Newton-type methods with eighthorder convergence for solving nonlinear equations
DOI:
https://doi.org/10.24297/jam.v10i3.1540Keywords:
Nonlinear equations, Optimal order of convergence, Computational efficiency, Multipoint methods, Weight functionAbstract
The aims of this paper are, firstly, to define a new family of the Thukral and Petkovic type methods for finding zeros of nonlinear equations and secondly, to introduce new formulas for approximating the order of convergence of the iterative method. It is proved that these methods have the convergence order of eight requiring only four function evaluations per iteration. In fact, the optimal order of convergence which supports the Kung and Traub conjecture have been obtained. Kung and Traub conjectured that the multipoint iteration methods, without memory based on n evaluations, could achieve optimal convergence order 2n-1. Thus, new iterative methods which agree with the Kung and Traub conjecture for n = 4 have been presented. It is observed that our proposed methods are competitive with other similar robust methods and very effective in high precision computations.
Downloads
Downloads
Published
How to Cite
Issue
Section
License
All articles published in Journal of Advances in Linguistics are licensed under a Creative Commons Attribution 4.0 International License.