A family of three-point methods of optimal order for solving nonlinear equations

Authors:
R. Thukral;M. S. Petković
Affiliations:
Padé Research Centre, 39 Deanswood Hill, Leeds, West Yorkshire, LS17 5JS, England, United Kingdom;Faculty of Electronic Engineering, Department of Mathematics, University of Niš, 18000 Niš, Serbia
Venue:
Journal of Computational and Applied Mathematics
Year:
2010

Citing 3
Cited 5

Optimal Order of One-Point and Multipoint Iteration

Journal of the ACM (JACM)
Some variants of Ostrowski's method with seventh-order convergence

Journal of Computational and Applied Mathematics
Three-step iterative methods with eighth-order convergence for solving nonlinear equations

Journal of Computational and Applied Mathematics

New eighth-order iterative methods for solving nonlinear equations

Journal of Computational and Applied Mathematics
New modifications of Potra-Pták's method with optimal fourth and eighth orders of convergence

Journal of Computational and Applied Mathematics
Regarding the accuracy of optimal eighth-order methods

Mathematical and Computer Modelling: An International Journal
A new family of Newton-type iterative methods with and without memory for solving nonlinear equations

Calcolo: a quarterly on numerical analysis and theory of computation
Accelerated iterative methods for finding solutions of nonlinear equations and their dynamical behavior

Calcolo: a quarterly on numerical analysis and theory of computation

Quantified Score

Hi-index	7.29

Visualization

Abstract

A family of three-point iterative methods for solving nonlinear equations is constructed using a suitable parametric function and two arbitrary real parameters. It is proved that these methods have the convergence order eight requiring only four function evaluations per iteration. In this way it is demonstrated that the proposed class of methods supports the Kung-Traub hypothesis (1974) [3] on the upper bound 2^n of the order of multipoint methods based on n+1 function evaluations. Consequently, this class of root solvers possesses very high computational efficiency. Numerical examples are included to demonstrate exceptional convergence speed with only few function evaluations.