# A Family of Fourteenth-Order Convergent Iterative Methods for Solving Nonlinear Equations

Authors: Fiza Zafar; Gulshan Bibi
Journal: Chinese Journal of Mathematics
 (2014)

---

## Abstract

We present a family of fourteenth-order convergent iterative methods for solving nonlinear equations involving a specific step which when combined with any two-step iterative method raises the convergence order byn
+
10, if n is the order of convergence of the two-step iterative method. This new class include four evaluations of function and one evaluation of the first derivative per iteration. Therefore, the efficiency index of this family is 14
1
/
5
=
1
.
695218203. Several numerical examples are given to show that the new methods of this family are comparable with the existing methods.


---

## Body

## 1. Introduction

Let us consider the equation(1)
f
(
x
)
=
0
,
where f is a real valued univariate nonlinear function.In the recent past, many higher-order convergent iterative methods have been developed. However, in the recent years, locating zeroes of such functions has been addressed majorly in the context of methods with higher-order convergence as well as less computational effort. Thus, the methods are now usually described in terms of their computational order of convergence, efficiency index, and computational efficiency index. The conjecture of Kung and Traub [1] has also remained under consideration to develop the computationally efficient classes of iterative methods for solving nonlinear equations.Definition 1 (computational order of convergence).
Letx
* be a root of the function f
(
x
) and suppose that x
n
+
1
,
x
n
,
x
n
-
1 are three consecutive iterates closer to the root x
*. Then, the computational order of convergence ρ can be approximated using the following formula:
(2)
ρ
≈
ln
|
(
x
n
+
1
-
x
*
)
/
(
x
n
-
x
*
)
|
ln
|
(
x
n
-
x
*
)
/
(
x
n
-
1
-
x
*
)
|
.Definition 2 (efficiency index).
The efficiency index of the iterative method is given by(3)
Efficiency
Index
=
p
1
/
d
,
where p is the order of convergence and d is computational cost.Conjecture 3 (optimal order of convergence).
An optimal iterative method without memory based onn evaluations could achieve an optimal convergence order of 2
n
-
1.In 1973, King [2] developed a one parameter family of fourth-order convergent iterative methods for nonlinear equations given by
(4)
y
n
=
x
n
-
f
(
x
n
)
f
′
(
x
n
)
,
x
n
+
1
=
y
n
-
f
(
x
n
)
+
β
f
(
y
n
)
f
(
x
n
)
+
(
β
-
2
)
f
(
y
n
)
f
(
y
n
)
f
′
(
x
n
)
,
where β
∈
ℝ is a constant. It is a two-step family which at the second step adds only one more function evaluation and the order of convergence increases from two to four with efficiency index of 4
3
=
1.587401052. The Ostowski's Method [3, 4] is a member of this family for β
=
0, given as
(5)
y
n
=
x
n
-
f
(
x
n
)
f
′
(
x
n
)
,
x
n
+
1
=
y
n
-
(
x
n
-
y
n
)
f
(
y
n
)
f
(
x
n
)
-
2
f
(
y
n
)
.In 2009, Bi et al. [5] presented a family of three-step eighth-order convergent iterative methods for solving nonlinear equations. This scheme is based on King's fourth-order convergent iterative methods and the family of sixth-order iterative methods developed by Chun and Ham [6]. The first two steps are the King's fourth-order method and the third step is developed with a real-valued function H
(
μ
n
), similar to that introduced by Chun and Ham [6], where μ
n
=
f
(
z
n
)
/
f
(
x
n
). The method is given as follows:
(6)
y
n
=
x
n
-
f
(
x
n
)
f
′
(
x
n
)
,
z
n
=
y
n
-
f
(
x
n
)
+
β
f
(
y
n
)
f
(
x
n
)
+
(
β
-
2
)
f
(
y
n
)
f
(
y
n
)
f
′
(
x
n
)
,
x
n
+
1
=
z
n
-
H
(
μ
n
)
f
(
z
n
)
f
′
(
z
n
)
,
where
(7)
f
′
(
z
n
)
=
f
[
z
n
,
y
n
]
+
f
[
z
n
,
x
n
,
x
n
]
(
z
n
-
y
n
)
.In the third step, only one additional function evaluation increases the order of convergence from four to eight. The efficiency index of this family is8
4
=
1.681792831, which is the optimal order of convergence with four function evaluations.In 2011, Sargolzaei and Soleymani [7] presented new fourteenth order convergent iterative methods to approximate the simple roots of nonlinear equations. The three-step eighth-order construction can be viewed as a variant of Newton's method by using Hermite interpolation to reduce the number of function evaluations. The method is given in the following form:
(8)
y
n
=
x
n
-
f
(
x
n
)
f
′
(
x
n
)
,
z
n
=
y
n
-
f
(
x
n
)
f
(
x
n
)
-
2
f
(
y
n
)
f
(
y
n
)
f
′
(
x
n
)
,
w
n
=
z
n
-
f
(
x
n
)
+
f
(
z
n
)
f
(
x
n
)
f
(
z
n
)
f
[
x
n
,
y
n
]
f
[
x
n
,
z
n
]
f
[
y
n
,
z
n
]
,
x
n
+
1
=
w
n
-
f
(
w
n
)
f
′
(
w
n
)
,
where
(9)
f
′
(
w
n
)
=
2
f
[
x
n
,
w
n
]
+
f
[
z
n
,
w
n
]
-
2
f
[
x
n
,
z
n
]
+
(
z
n
-
w
n
)
f
[
z
n
,
x
n
,
x
n
]
.This method requires five evaluations per iteration. So, the efficiency index of this method is14
5
=
1.695218203.Also in 2011, Soleymani and Sharifi [8] presented an efficient class of iterative methods. This class of methods consists of optimal eighth-order convergent iterative methods with an additional fourth-step developed by Soleymani and Sharifi. A method from this class is given by
(10)
y
n
=
x
n
-
f
(
x
n
)
f
′
(
x
n
)
,
z
n
=
y
n
-
f
(
x
n
)
f
(
x
n
)
-
2
f
(
y
n
)
f
(
y
n
)
f
′
(
x
n
)
,
w
n
=
z
n
-
f
(
z
n
)
f
[
x
n
,
y
n
]
f
[
x
n
,
z
n
]
f
[
y
n
,
z
n
]
(
1
+
f
(
z
n
)
f
(
x
n
)
)
,
x
n
+
1
=
w
n
-
f
(
w
n
)
f
′
(
w
n
)
,
where f
[
x
n
,
y
n
], f
[
x
n
,
z
n
], and f
[
y
n
,
z
n
] are the divided differences and f
′
(
w
n
) is approximated by
(11)
f
′
(
w
n
)
=
f
[
x
n
,
w
n
]
+
(
f
[
y
n
,
x
n
,
z
n
]
-
f
[
y
n
,
x
n
,
w
n
]
-
f
[
z
n
,
x
n
,
w
n
]
)
(
x
n
-
w
n
)
.The first three steps are the eighth-order convergent iterative method of [9]. The method requires five evaluations per iteration. So, the efficiency index of this class of methods is 15
5
=
1.718771928. This index is just a little bit lower than that of optimal sixteenth-order methods, 1.741101127.In this paper, we, by using the divided difference decomposition of the derivative involved in the third step, have developed a specific step which when combined with any two-step iterative method raises the convergence order byn
+
10, where n is the order of convergence of the two-step iterative method. Specifically, we have taken King's fourth order convergent iterative methods which when combined with our specific third step raises the convergence order of the new family of methods to fourteen with the efficiency index 14
5
=
1.695218203. In Section 2, we have presented a general family of fourteenth-order convergent iterative methods and its convergence analysis. The convergence analysis of the two specific methods and their comparison with the existing higher-order convergent and computationally efficient iterative methods is also given.


## 2. Development of the New Class

In this section, we first construct a general class of three-step fourteenth-order convergent iterative methods by combining a new derivative free step with a general fourth order convergent iterative method. We suggest the following specific step:(12)
x
n
+
1
=
z
n
-
f
(
z
n
)
f
′
(
z
n
)
-
f
(
w
n
)
f
′
(
w
n
)
,
where
(13)
w
n
=
z
n
-
f
(
z
n
)
f
′
(
z
n
)
,
(14)
f
′
(
z
n
)
=
f
[
z
n
,
y
n
]
+
f
[
z
n
,
x
n
,
x
n
]
(
z
n
-
y
n
)
,
(15)
f
′
(
w
n
)
=
f
[
x
n
,
w
n
]
+
(
f
[
y
n
,
x
n
,
z
n
]
-
f
[
y
n
,
x
n
,
w
n
]
-
f
[
z
n
,
x
n
,
w
n
]
)
(
x
n
-
w
n
)
.This approximation off
′
(
w
n
) is taken from [8].Now the general three-step fourteenth-order convergent iterative method has the following form:(16)
z
n
=
g
4
(
x
n
)
,
x
n
+
1
=
z
n
-
f
(
z
n
)
f
′
(
z
n
)
-
f
(
w
n
)
f
′
(
w
n
)
,
where g
4
(
x
n
) is any two-step fourth-order convergent iterative method and w
n
=
z
n
-
(
f
(
z
n
)
/
f
′
(
z
n
)
).The order of convergence of the iterative method (16) using Maple 7.0 is given in the form of the following theorem.Theorem 4.
Letx
*
∈
I be a simple zero of sufficiently differentiable function f
:
I
⊑
ℝ
→
ℝ for an open interval I. If x
0 is sufficiently close to x
*, then the iterative method (16) is fourteenth-order convergent. The error equation is given by
(17)
e
n
+
1
=
(
4
c
3
2
a
1
4
c
2
-
2
c
3
a
1
4
c
4
)
e
n
14
+
O
(
e
n
15
)
,
where
(18)
c
k
=
1
k
!
f
(
k
)
(
x
*
)
f
′
(
x
*
)
,
k
=
2,3
,
…
,
a
1
∈
ℝ
.Proof.
Letz
n be a fourth-order convergent method
(19)
z
n
=
x
*
+
a
1
e
n
4
+
a
2
e
n
5
+
a
3
e
n
6
+
a
4
e
n
7
+
a
5
e
n
8
+
O
(
e
n
9
)
,
a
i
′
s
∈
ℝ
.
Letx
* be the zero of f and x
n
=
x
*
+
e
n with an error e
n. By Taylor's expansion, we have
(20)
f
(
z
n
)
=
f
′
(
x
*
)
(
a
1
e
n
4
+
a
2
e
n
5
+
a
3
e
n
6
+
a
4
e
n
7
+
(
a
5
+
c
2
a
1
2
)
e
n
8
+
2
c
2
a
1
a
2
e
n
9
+
c
2
(
2
a
1
a
3
+
a
2
2
)
e
n
10
+
2
c
2
(
a
1
a
4
+
a
2
a
3
)
e
n
11
+
(
2
c
2
a
1
a
5
+
2
c
2
a
2
a
4
+
c
2
a
3
2
+
c
3
a
1
3
)
e
n
12
+
(
2
c
2
a
2
a
5
+
2
c
2
a
3
a
4
+
3
c
3
a
1
2
a
2
)
e
n
13
+
(
2
c
2
a
3
a
5
+
c
2
a
4
2
+
3
c
3
a
3
a
1
2
+
3
c
3
a
2
2
a
1
)
e
n
14
)
+
O
(
e
n
15
)
.
For the calculation off
′
(
z
n
), we have used divided difference approximation of f
′
(
z
n
) given by
(21)
f
′
(
z
n
)
=
f
[
z
n
,
y
n
]
+
f
[
z
n
,
x
n
,
x
n
]
(
z
n
-
y
n
)
.
The simplified form of (21) is given by
(22)
f
′
(
z
n
)
=
f
(
z
n
)
-
f
(
y
n
)
z
n
-
y
n
+
f
(
z
n
)
-
f
(
x
n
)
-
f
′
(
x
n
)
(
z
n
-
x
n
)
(
z
n
-
x
n
)
2
(
z
n
-
y
n
)
.
Now we have(23)
f
′
(
z
n
)
=
f
′
(
x
*
)
(
1
-
2
c
3
a
1
e
n
3
+
(
-
3
a
1
c
4
-
2
a
2
c
3
+
2
a
1
c
2
+
a
1
2
c
3
)
e
n
4
+
(
2
a
1
c
3
-
4
a
1
c
5
+
2
a
2
c
2
-
3
a
2
c
4
+
2
c
3
a
1
a
2
-
2
a
2
c
3
)
e
n
5
)
+
O
(
e
n
6
)
,
where(24)
c
k
=
1
k
!
f
(
k
)
(
x
*
)
f
′
(
x
*
)
,
k
=
2,3
,
…
.
Using (23), we have
(25)
f
(
z
n
)
f
′
(
z
n
)
=
a
1
e
n
4
+
a
2
e
n
5
+
a
3
e
n
6
+
(
a
4
+
2
c
2
c
3
a
1
)
e
n
7
+
(
3
c
4
a
1
c
2
-
c
2
a
1
2
-
5
c
3
a
1
c
2
2
+
2
c
3
a
2
c
2
+
4
c
3
2
a
1
+
a
5
)
e
n
8
+
(
12
c
4
a
1
c
3
-
18
c
2
c
3
2
a
1
+
12
c
3
c
2
3
a
1
-
6
c
2
2
c
4
a
1
-
5
c
2
2
c
3
a
2
+
4
c
5
a
1
c
2
+
3
c
4
a
2
c
2
-
2
c
2
a
1
a
2
-
2
c
3
a
1
2
+
4
c
3
2
a
2
+
2
c
3
a
3
c
2
)
e
n
9
+
O
(
e
n
10
)
.
Thus, by using (25) we get
(26)
w
n
=
x
*
-
2
c
2
c
3
a
e
n
7
+
(
5
c
3
a
1
c
2
2
+
c
2
a
1
2
-
4
c
3
2
a
1
-
2
c
3
a
2
c
2
-
3
c
4
a
1
c
2
)
e
n
8
+
(
6
c
2
2
c
4
a
1
+
2
c
3
a
1
2
-
2
c
3
a
3
c
2
-
4
c
5
a
1
c
2
-
12
c
3
c
2
3
a
1
-
4
c
3
2
a
2
+
5
c
2
2
c
3
a
2
+
18
c
2
c
3
2
a
1
-
12
c
4
a
1
c
3
+
2
c
2
a
1
a
2
-
3
c
4
a
2
c
2
6
c
2
2
)
e
n
9
+
O
(
e
n
10
)
.
Also for the calculation off
′
(
w
n
) we have used divided difference approximation of f
′
(
w
n
) as follows:
(27)
f
′
(
w
n
)
=
f
[
x
n
,
w
n
]
+
(
f
[
y
n
,
x
n
,
z
n
]
-
f
[
y
n
,
x
n
,
w
n
]
-
f
[
z
n
,
x
n
,
w
n
]
)
×
(
x
n
-
w
n
)
.
Using this approximation we have found that(28)
f
(
w
n
)
f
′
(
w
n
)
=
-
2
c
3
a
1
2
e
n
7
+
(
-
3
a
1
2
c
4
-
4
a
1
a
2
c
3
+
a
1
3
c
3
+
a
1
2
c
2
)
e
n
8
+
(
2
a
1
2
c
3
-
4
a
1
2
c
5
+
3
a
2
a
1
2
c
3
-
2
c
3
a
2
2
-
4
a
3
a
1
c
3
-
6
a
2
a
1
c
4
+
2
a
1
a
2
c
2
)
e
n
9
+
(
-
a
7
-
c
2
a
3
2
-
4
c
3
a
2
a
3
-
3
c
4
a
2
2
-
2
c
2
a
2
a
4
-
6
c
4
a
3
a
1
+
c
2
a
2
2
+
2
c
2
a
1
a
3
-
5
c
6
a
1
2
-
2
c
2
a
1
a
5
-
4
c
3
a
1
a
4
+
4
c
3
a
1
a
2
-
8
c
5
a
2
a
1
+
3
c
4
a
1
2
-
4
c
3
2
a
1
3
)
e
n
10
+
O
(
e
n
11
)
.
Finally, combining (26) and (28), we get
(29)
x
n
+
1
=
x
*
+
(
4
c
3
2
a
1
4
c
2
-
2
c
3
a
1
4
c
4
)
e
n
14
+
O
(
e
n
15
)
,
and the error equation is given by
(30)
e
n
+
1
=
(
4
c
3
2
a
1
4
c
2
-
2
c
3
a
1
4
c
4
)
e
n
14
+
O
(
e
n
15
)
,
where
(31)
c
k
=
1
k
!
f
(
k
)
(
x
*
)
f
′
(
x
*
)
,
k
=
2,3
,
…
,
a
1
∈
ℝ
.
The error equation shows that the order of convergence of the new family of iterative methods is fourteen.


## 3. The Iterative Methods

In this section we give two special cases of formula (16) as follows.Method 1.
Specifically we take the two-step fourth-order convergent iterative method as King's fourth-order family of methods [2] for β
=
-
1
/
2, so
(32)
y
n
=
x
n
-
f
(
x
n
)
f
′
(
x
n
)
,
z
n
=
y
n
-
2
f
(
x
n
)
-
f
(
y
n
)
2
f
(
x
n
)
-
5
f
(
y
n
)
f
(
y
n
)
f
′
(
x
n
)
,
x
n
+
1
=
z
n
-
f
(
z
n
)
f
′
(
z
n
)
-
f
(
w
n
)
f
′
(
w
n
)
,
where w
n, f
′
(
z
n
), and f
′
(
w
n
) are given by (13), (14), and (15), respectively.Method 2.
Take two-step fourth-order convergent iterative method as Ostrowski's fourth-order method [3]. Therefore, Method 2 has the following formula:
(33)
y
n
=
x
n
-
f
(
x
n
)
f
′
(
x
n
)
,
z
n
=
y
n
-
(
x
n
-
y
n
)
f
(
y
n
)
f
(
x
n
)
-
2
f
(
y
n
)
,
x
n
+
1
=
z
n
-
f
(
z
n
)
f
′
(
z
n
)
-
f
(
w
n
)
f
′
(
w
n
)
,
where w
n, f
′
(
z
n
), and f
′
(
w
n
) are given by (13), (14), and (15), respectively.The methods (32) and (33) achieve fourteenth-order convergence. Per iteration the presented methods require four evaluations of functions and one evaluation of the first derivative. We note that the new class of methods (16) has the efficiency index of 14
5
=
1.695218203 which is better than 2
=
1.414213562 of Newton's method, 4
3
=
1.587401052 of King's method [2], and 8
4
=
1.681792831 of three-step iterative method with eighth-order convergence [5]. However, the fourteenth-order convergent iterative method of Sargolzaei and Soleymani [7] has the same efficiency index 14
5
=
1.695218203 and that of fifteenth-order convergent iterative method of Soleymani and Sharifi [8] is with greater 15
5
=
1.718771928, yet it can be observed from Table 2 that our methods are comparable with these methods.


## 4. Numerical Examples

In this section, we now consider some numerical examples to demonstrate the performance of the newly developed iterative methods. All the computations for the above-mentioned methods are performed using software Maple 7 with 500 digits precision andɛ
=
1
0
-
17 is taken as tolerance. The following criteria is used for estimating the zeros:(i)
|
f
(
x
n
)
|
<
∈.Thus, for convergence criteria, it is required that the functional value at the root must be less than1
0
-
17. x
0 represents the initial guess and x
* the exact zero of the nonlinear function f
(
x
).The numerical examples used for comparison are given in Table1, most of which are taken from [5, 7, 8].Table 1
Numerical examples.
Examples
Exact zero
f
1
(
x
)
=
(
x
-
1
)
3
-
1,
x
*
=
2.0000000000000000000
f
2
(
x
)
=
x
2
+
2
x
+
5
-
2
sin
x
-
x
2
+
3
x
*
=
2.3319676558839640103
f
3
(
x
)
=
x
3
-
10
x
*
=
2.1544346900318837217
f
4
(
x
)
=
x
5
+
x
-
10
,

000
x
*
=
6.3087771299726890947
f
5
(
x
)
=
x
-
1
x
-
3
x
*
=
9.6335955628326951924
f
6
(
x
)
=
e
x
+
x
-
20
x
*
=
2.8424389537844470678
f
7
(
x
)
=
ln
x
+
x
-
5
x
*
=
8.3094326942315717953
f
8
(
x
)
=
x
5
+
x
4
+
4
x
2
-
15
x
*
=
1.3474280989683049815
f
9
(
x
)
=
e
-
x
2
+
x
+
2
-
1
x
*
=
-
1.000000000000000000
f
10
(
x
)
=
arcsin
(
x
2
-
1
)
-
1
2
x
+
1
x
*
=
0.5948109683983691775
f
11
(
x
)
=
10
x
e
-
x
2
-
1
x
*
=
1.67963061042844994067
f
12
(
x
)
=
sin
2
x
-
x
2
+
1
x
*
=
1.40449164821534122603
f
13
(
x
)
=
sin
(
1
x
)
-
x
x
*
=
-
0.8975394612804871843
f
14
(
x
)
=
x
3
-
3
x
2
+
x
-
2
x
*
=
2.89328919630449778890
f
15
(
x
)
=
cos
2
x
-
x
5
x
*
=
2.32020427449572608989Table 2
Numerical comparisons.
f
(
x
)
NM
BI
SP
SS
M1
M2
f
1
(
x
), x
0
=
4.9
n
8
499
2
499
3
2
nfe
16
—
10
—
15
10
COC
1.99
—
10.80
—
11.89
11.68
|
f
(
x
n
)
|
0.127
1
0
-
18
D
0.127
1
0
-
17
D
0.197
1
0
-
24
0.623
1
0
-
50
f
2
(
x
)

,
x
0
=
9.9
n
7
3
2
2
2
2
nfe
14
12
10
10
10
10
COC
2.00
8.33
11.83
13.02
12.05
12.11
|
f
(
x
n
)
|
0.759 1
0
-
20
0.116
1
0
-
51
0.221
1
0
-
26
0.124
1
0
-
27
0.516
1
0
-
30
0.297
1
0
-
31
f
3
(
x
)

,
x
0
=
8.0
n
8
9
2
3
3
2
nfe
16
36
10
15
15
10
COC
1.99
7.72
11.21
14.81
13.50
12.01
|
f
(
x
n
)
|
0.245
1
0
-
19
0.116
1
0
-
41
0.287
1
0
-
18
0.641
1
0
-
62
0.318
1
0
-
87
0.481
1
0
-
63
f
4
(
x
)

,
x
0
=
9.8
n
7
3
2
2
2
2
nfe
14
12
10
10
10
10
COC
1.99
8.00
13.30
14.07
13.02
13.03
|
f
(
x
n
)
|
0.165
1
0
-
19
0.555
1
0
-
114
0.304
1
0
-
37
0.475
1
0
-
54
0.543
1
0
-
50
0.225
1
0
-
32
f
5
(
x
)

,
x
0
=
15.5
n
5
2
2
2
2
2
nfe
10
8
10
10
10
10
COC
2.00
7.82
13.90
14.84
13.87
13.88
|
f
(
x
n
)
|
0.119
1
0
-
24
0.751
1
0
-
49
0.155
1
0
-
170
0.512
1
0
-
165
0.279
1
0
-
142
0.584
1
0
-
151
f
6
(
x
)

,
x
0
=
7.7
n
7
3
3
2
2
2
nfe
14
12
15
10
10
10
COC
1.99
7.96
13.94
11.64
10.76
13.91
|
f
(
x
n
)
|
0.486
1
0
-
22
0.941
1
0
-
45
0.538
1
0
-
63
0.229
1
0
-
23
0.140
1
0
-
21
0.570
1
0
-
20
f
7
(
x
)

,
x
0
=
11.9
n
5
2
2
2
2
2
nfe
10
8
10
10
10
10
COC
2.00
7.89
13.91
14.91
14.07
14.05
|
f
(
x
n
)
|
0.311
1
0
-
26
0.185
1
0
-
49
0.649
1
0
-
176
0.474
1
0
-
174
0.449
1
0
-
166
0.261
1
0
-
179
f
8
(
x
)

,
x
0
=
1.6
n
5
2
2
2
2
2
nfe
10
8
10
10
10
10
COC
1.99
7.86
13.96
14.94
13.91
13.93
|
f
(
x
n
)
|
0.354
1
0
-
18
0.402
1
0
-
36
0.213
1
0
-
137
0.359
1
0
-
144
0.128
1
0
-
127
0.233
1
0
-
128
f
9
(
x
)

,
x
0
=
-
0.5
n
6
2
2
2
2
2
nfe
12
8
10
10
10
10
COC
1.99
7.45
13.76
14.69
13.50
13.54
|
f
(
x
n
)
|
0.103
1
0
-
25
0.514
1
0
-
27
0.149
1
0
-
80
0.290
1
0
-
100
0.486
1
0
-
117
0.231
1
0
-
97
f
10
(
x
)

,
x
0
=
1.0
n
5
2
2
2
2
2
nfe
10
8
10
10
10
10
COC
2.00
8.32
14.17
15.25
14.19
14.17
|
f
(
x
n
)
|
0.265
1
0
-
26
0.164
1
0
-
43
0.152
1
0
-
136
0.518
1
0
-
148
0.188
1
0
-
132
0.864
1
0
-
138
f
11
(
x
)

,
x
0
=
1.8
n
5
2
2
2
2
2
nfe
10
8
10
10
10
10
COC
1.99
8.19
14.02
15.08
14.17
14.08
|
f
(
x
n
)
|
0.593
1
0
-
28
0.503
1
0
-
55
0.600
1
0
-
179
0.952
1
0
-
223
0.138
1
0
-
198
0.946
1
0
-
184
f
12
(
x
)

,
x
0
=
3.5
n
6
3
2
2
2
2
nfe
12
12
10
10
10
10
COC
1.99
7.99
12.44
13.69
12.92
12.52
|
f
(
x
n
)
|
0.980
1
0
-
21
0.227
1
0
-
124
0.985
1
0
-
58
0.186
1
0
-
62
0.186
1
0
-
53
0.122
1
0
-
51
f
13
(
x
)

,
x
0
=
-
1.5
n
4
2
2
2
2
2
nfe
8
8
10
10
10
10
COC
1.99
7.84
13.78
14.87
13.87
13.89
|
f
(
x
n
)
|
0.315
1
0
-
17
0.682
1
0
-
43
0.171
1
0
-
126
0.406
1
0
-
149
0.343
1
0
-
136
0.192
1
0
-
133
f
14
(
x
)

,
x
0
=
25.0
n
12
499
3
6
4
3
nfe
24
—
15
30
20
15
COC
1.99
—
12.81
14.14
11.10
13.31
|
f
(
x
n
)
|
0.382
1
0
-
32
D
0.115
1
0
-
28
0.123
1
0
-
44
0.101
1
0
-
16
0.539
1
0
-
75
f
15
(
x
)

,
x
0
=
2.1
n
4
2
2
2
2
2
nfe
8
8
10
10
10
10
COC
1.99
8.30
14.33
15.28
14.26
14.28
|
f
(
x
n
)
|
0.547
1
0
-
21
0.237
1
0
-
55
0.272
1
0
-
160
0.119
1
0
-
203
0.155
1
0
-
164
0.185
1
0
-
79In Table2, we compare the classical Newton's method (NM), the eighth-order convergent iterative method (BI) of Bi et al. [5], the fourteenth-order convergent iterative method (SP) of Sargolzaei and Soleymani [7], the fifteenth-order convergent iterative method (SS) of Soleymani and Sharifi [8], and the newly developed fourteenth-order convergent iterative methods (M1) and (M2). The methods are compared in terms of number of iterations (
n
), the total number of function evaluations (NFE), the computational order of convergence (COC), and the absolute values of the function |
f
(
x
n
)
|.


## 5. Conclusion

New methods are tested for almost all types of nonlinear functions, polynomials, and transcendental functions. Table2 shows that the newly developed fourteenth-order methods are comparable with the existing methods of this domain in terms of number of iterations and number of function evaluations per iteration. In many examples, the newly developed methods perform better than the existing methods. For example, the method (BI) diverges for the functions f
1 and f
14, the method (SS) diverges for function f
1, but the new methods (M1) and (M2) converge for these cases. Similarly, for the function f
2 the method (BI) approximates the root in three iterations, while the new methods in two iterations with ten evaluations. For the function f
3, the method (BI) gives the approximate root in nine iterations with thirty-six evaluations while the methods (M1) and (M2) give the approximate root in three and two iterations, respectively. For the function f
14, the method (SS) approximates the root in six iterations while the method (M1) approximates the root in four iterations and the method (M2) approximates the root in three iterations. It may be noted that for almost all functions the new methods (M1) and (M2) are correct up to more significant decimal places as compared to the method (BI) and in some cases to the method (SP). The performance of the fourteenth-order method (SP) [7] is the same as that of the new methods of the family. It is also clear from the tables that for the choice of initial guess, near to exact root or far from the exact root, the performance of the new methods is good. Although the order and efficiency index of the method (SS) is greater than the new methods; but it can be seen from the comparison tables that the new methods are comparable with this method in terms of number of iterations and in some cases perform better than the method (SS).



---

*Source: 313691-2014-01-29.xml*