Optimal eighth-order simple root-finders free from derivative

Authors:
F. Soleymani
Affiliations:
Department of Mathematics, Islamic Azad University, Zahedan, Iran
Venue:
WSEAS Transactions on Information Science and Applications
Year:
2011

Citing 5
Cited 0

Optimal Order of One-Point and Multipoint Iteration

Journal of the ACM (JACM)
Numerical Analysis

Numerical Analysis
A family of optimal sixteenth-order multipoint methods with a linear fraction plus a trivariate polynomial as the fourth-step weighting function

Computers & Mathematics with Applications
Optimal Steffensen-type methods with eighth order of convergence

Computers & Mathematics with Applications
Finding the solution of nonlinear equations by a class of optimal methods

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The calculation of derivatives of a function mostly takes up a great deal of time and even in some cases, such as the existing problems in engineering and optimization, is impossible to be evaluated directly. Accordingly, an accurate derivative-free class of three-step methods is suggested for solving f(x) = 0. The proposed three-step technique comprises four evaluations of the function per iteration. The analytical proof of the main contribution is given. And finally, the accuracy of the developed techniques is tested numerically by solving numerical examples.