Three-step iterative methods with eighth-order convergence for solving nonlinear equations
A family of eighth-order iterative methods for the solution of nonlinear equations is presented. The new family of eighth-order methods is based on King’s fourth-order methods and the family of sixth-order iteration methods developed by Chun et al. Per iteration the new methods require three evaluat...
Saved in:
Published in | Journal of computational and applied mathematics Vol. 225; no. 1; pp. 105 - 112 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Kidlington
Elsevier B.V
01.03.2009
Elsevier |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | A family of eighth-order iterative methods for the solution of nonlinear equations is presented. The new family of eighth-order methods is based on King’s fourth-order methods and the family of sixth-order iteration methods developed by Chun et al. Per iteration the new methods require three evaluations of the function and one evaluation of its first derivative. Therefore this family of methods has the efficiency index which equals 1.682. Kung and Traub conjectured that a multipoint iteration without memory based on
n
evaluations could achieve optimal convergence order
2
n
−
1
. Thus we provide a new example which agrees with the conjecture of Kung–Traub for
n
=
4
. Numerical comparisons are made to show the performance of the presented methods. |
---|---|
ISSN: | 0377-0427 1879-1778 |
DOI: | 10.1016/j.cam.2008.07.004 |