# On a New Efficient Steffensen-Like Iterative Class by Applying a Suitable Self-Accelerator Parameter

Authors: Taher Lotfi; Elahe Tavakoli
Journal: The Scientific World Journal
 (2014)

---

## Abstract

It is attempted to present an efficient and free derivative class of Steffensen-like methods for solving nonlinear equations. To this end, firstly, we construct an optimal eighth-order three-step uniparameter without memory of iterative methods. Then the self-accelerator parameter is estimated using Newton’s
interpolation in such a way that it improves its convergence order from 8 to 12 without any extra function evaluation. Therefore, its efficiency index is increased from 81/4 to 121/4 which is the main feature of this class. To show applicability of the proposed methods, some numerical illustrations are presented.


---

## Body

## 1. Introduction

Kung and Traub are pioneers in constructing optimal general multistep methods without memory. They devised two generaln-step methods based on interpolation. Moreover, they conjectured any n-step methods without memory using n
+
1 function evaluations may reach the convergence order at most 2
n [1]. Accordingly, many authors during the last years, specially the four past years, are attempted to construct iterative methods without memory which support this conjecture with optimal order [1–22].Although construction of optimal methods without memory is still an active field, however, much attention has not been paid for developing methods with memory. Based on our best knowledge, Traub in his book introduces the first method with memory. The main feature of these methods is that they improve convergence order as well as efficiency index without any new function evaluations. Indeed, Traub changed Steffensen's method slightly as follows (see [18, pp 185–187]):
(1)
x
0
,
w
0
,
γ
0
are
given
suitably
,
x
n
+
1
=
x
n
-
f
(
x
n
)
f
[
x
n
,
w
n
]
,
0
≠
γ
n
∈
R
,
n
=
0,1
,
2
,
…
,
N
1
(
x
)
=
f
(
x
n
)
+
(
x
-
x
n
)
f
[
x
n
,
w
n
]
,
γ
n
+
1
=
-
1
N
1
′
(
x
n
)
,
w
n
+
1
=
x
n
+
1
+
γ
n
+
1
f
(
x
n
+
1
)
.
The parameter γ
n is called self-accelerator and method (1) has convergence order 2.41. It is still possible to increase the convergence order using better self-accelerator parameter based on better Newton interpolation. Free-derivative can be considered as another virtue of (1).In this work, motivated by Traub’s work (1), we construct a new class of methods with memory. To this end, we first try to devise a new optimal free-derivative three-step without memory of iterative methods with eight order of convergence and using merely four function evaluations per step. In other words, our first step is the same as Traub’s method (1). The second and third steps use combination Steffensen-like methods and weight function idea so that we achieve an optimal class of methods without memory. Finally, we apply a self-accelerator parameter to extend it to with memory case. We remember two main properties of this work: increasing efficiency index without any new functional evaluations and nonusing derivatives of a given function.We use the symbols→, O, and ~ according to the following conventions [18]: if lim
⁡
x
n
→
∞
g
(
x
n
)
=
C, we write g
(
x
n
)
→
C or g
→
C. If lim
⁡
x
→
a
g
(
x
)
=
C, we write g
(
x
)
→
C or g
→
C. If f
/
g
→
C, where C is a nonzero constant, we write f
=
O
(
g
) or f
~
C
g. Let f
(
x
) be a function defined on an interval I, where I is the smallest interval containing k
+
1 distinct nodes x
1
,
x
2
,
…
,
x
k. The divided difference f
[
x
0
,
x
1
,
…
,
x
k
] with kth-order is defined as follows: f
[
x
0
]
=
f
(
x
0
)
(2)
f
[
x
0
]
=
f
[
x
1
]
-
f
[
x
0
]
x
1
-
x
0
,
…
,
f
[
x
0
,
x
1
,
…
,
x
k
]
=
f
[
x
1
,
x
2
,
…
,
x
k
]
-
f
[
x
0
,
x
1
,
…
x
k
-
1
]
x
k
-
x
0
.
Moreover, we recall the definition of efficiency index (EI) as E
=
p
1
/
n, where p is the order of convergence and n is the total number of function evaluations per iteration.This work is organized as follows: Section2 present construction and error analysis of optimal three-step class of without memory class. Section 3 is devoted to with memory extension. Numerical results are demonstrated in Section 5. We sum up this work in Section 5.


## 2. Derivative-Free Three-Point Method

This section concerns construction a new class of three-step free-derivative methods without memory for solving nonlinear equations. In the next section, it is extended to its with memory cases. To this end, let us first start with the following three-step Steffensen-type [23] initiative:
(3)
y
n
=
x
n
-
f
(
x
n
)
f
[
x
n
,
w
n
]
,
w
n
=
x
n
+
γ
n
f
(
x
n
)
,
0000011000000
0
≠
γ
n
∈
R
,
n
=
0,1
,
2
,
…
,
z
n
=
y
n
-
f
(
y
n
)
f
[
y
n
,
w
n
]
,
x
n
+
1
=
z
n
-
f
(
z
n
)
f
[
z
n
,
w
n
]
.
This scheme is not optimal in the sense of Kung and Traub [1] as it is of fourth-order convergence using four functions evaluations per iteration. In other words, its error equation has the form
(4)
e
n
+
1
=
(
1
+
f
1
a
γ
)
3
c
2
3
e
n
4
+
O
(
e
n
5
)
.
Therefore, some modifications based on applying weight function ideas must be considered in such a way that the scheme (3) changes into an optimal method. Accordingly, we put forward the following iterative plan:
(5)
y
n
=
x
n
-
f
(
x
n
)
f
[
x
n
,
w
n
]
,
z
n
=
y
n
-
H
(
t
n
,
u
n
)
f
(
y
n
)
f
[
y
n
,
w
n
]
,
x
n
+
1
=
z
n
-
G
(
t
n
,
s
n
)
W
(
v
n
,
s
n
)
f
(
z
n
)
f
[
z
n
,
w
n
]
,
where t
n
=
f
(
y
n
)
/
f
(
x
n
), u
n
=
f
(
w
n
)
/
f
(
x
n
), s
n
=
f
(
z
n
)
/
f
(
y
n
), v
n
=
f
(
z
n
)
/
f
(
x
n
).The main contribution of this section lies in the following Theorem which provides sufficient conditions for drawing optimal three-step iterations without memory class.Theorem 1.
LetH
(
t
n
,
u
n
), G
(
t
n
,
s
n
), and W
(
v
n
,
s
n
) be differentiable two-variable functions that satisfy the conditions
(6)
H
(
0,0
)
=
H
1,0
(
0,0
)
=
1
,
H
0,1
(
0,0
)
=
H
0,2
(
0,0
)
=
H
0,3
(
0,0
)
=
H
1,1
(
0,0
)
=
H
1,2
(
0,0
)
=
H
2,0
(
0,0
)
=
H
2,1
(
0,0
)
=
0
,
G
(
0,0
)
=
G
1,0
(
0,0
)
=
G
0,1
(
0,0
)
=
1
,
G
2,0
(
0,0
)
=
0
,
G
1,1
(
0,0
)
=
2
,
G
3,0
(
0,0
)
=
H
3,0
(
0,0
)
-
6
-
6
1
+
γ
n
f
[
x
n
,
w
n
]
,
W
(
0,0
)
=
1
,
W
1,0
(
0,0
)
=
W
0,1
(
0,0
)
=
0
.
If the initial approximation x
0 is sufficiently close to the zero α of a function f, then the convergence order of the family (5) is eight.Proof.
Lete
n
=
x
n
-
α, e
y
n
=
y
n
-
α, e
z
n
=
z
n
-
α, e
w
n
=
e
n
+
γ
n
f
(
x
n
), and c
n
=
f
(
n
)
(
α
)
/
n
!
f
′
(
α
), n
=
1,2
,
…. Using Taylor’s expansion and taking into account f
(
α
)
=
0, we have
(7)
f
(
x
n
)
=
f
′
(
α
)
[
e
n
+
c
2
e
n
2
+
c
3
e
n
3
+
c
4
e
n
4
+
c
5
e
n
5
000000000000000
+
c
6
e
n
6
+
c
7
e
n
7
+
O
(
e
n
8
)
]
,
f
[
x
n
,
w
n
]
=
f
′
(
α
)
[
1
+
c
2
(
2
+
γ
f
′
(
α
)
)
e
n
00000000
+
(
c
2
2
γ
f
′
(
α
)
+
c
3
(
3
+
γ
f
′
(
α
)
(
3
+
γ
f
′
(
α
)
)
)
)
e
n
2
00000000
f
′
+
⋯
+
O
(
e
n
8
)
]
.
Substituting these into the first step of (5) gives
(8)
e
y
n
=
e
n
-
f
(
x
n
)
f
[
x
n
,
w
n
]
=
c
2
(
1
+
γ
f
′
(
α
)
)
e
2
+
(
(
2
+
γ
f
′
(
α
)
(
2
+
γ
f
′
(
α
)
)
)
c
3
(
1
+
γ
f
′
(
α
)
)
(
2
+
γ
f
′
(
α
)
)
000
-
c
2
2
(
2
+
γ
f
′
(
α
)
(
2
+
γ
f
′
(
α
)
)
)
)
e
n
3
+
(
(
7
+
γ
f
′
(
α
)
(
10
+
γ
f
′
(
α
)
(
7
+
2
γ
f
′
(
α
)
)
)
)
(
7
+
2
γ
f
′
(
α
)
)
)
)
c
4
(
1
+
γ
f
′
(
α
)
)
(
3
+
γ
f
′
(
α
)
(
3
+
γ
f
′
(
α
)
)
)
000
+
c
2
3
(
4
+
γ
f
′
(
α
)
(
5
+
γ
f
′
(
α
)
(
3
+
γ
f
′
(
α
)
)
)
)
000
-
c
2
c
3
(
(
7
+
2
γ
f
′
(
α
)
)
7
+
γ
f
′
(
α
)
(
(
7
+
2
γ
f
′
(
α
)
)
)
10
+
γ
f
′
(
α
)
000
000000000000000
×
(
7
+
2
γ
f
′
(
α
)
)
)
)
)
e
n
4
+
⋯
+
O
(
e
n
8
)
.
Set t
n
=
f
(
y
n
)
/
f
(
x
n
), u
n
=
f
(
w
n
)
/
f
(
x
n
),  and H
i
,
j
=
∂
H
(
t
n
,
u
n
)
/
∂
t
n
i
∂
u
n
j, and expanding H
(
t
n
,
u
n
) about (
0,0
), yields
(9)
H
(
t
n
,
u
n
)
=
H
0,0
+
H
1,0
t
n
+
H
0,1
u
n
+
1
2
(
H
2,0
t
n
2
+
2
H
1,1
t
n
u
n
+
H
0,2
u
n
2
)
+
⋯
.
Substituting (9) into (5), we can assert that
(10)
e
z
n
=
y
n
-
H
(
t
n
,
u
n
)
f
(
y
n
)
f
[
y
n
,
w
n
]
=
k
1
e
n
2
+
k
2
e
n
3
+
k
4
e
n
4
+
k
5
e
n
5
+
k
6
e
n
6
+
k
7
e
n
7
+
O
(
e
n
8
)
,
where
(11)
k
1
=
-
1
6
(
c
2
(
1
+
γ
n
f
′
(
α
)
)
(
f
′
(
α
)
)
2
00000
×
(
-
6
+
6
H
0,0
+
3
H
0,2
(
1
+
γ
n
f
′
(
α
)
)
2
00000
000000
+
H
0,3
(
1
+
γ
n
f
′
(
α
)
)
3
000000000
(
1
+
γ
n
f
′
(
α
)
)
2
+
6
(
H
0,1
+
H
0,1
γ
n
f
′
(
α
)
)
)
)
,
(12)
k
2
=
(
-
2
c
2
2
+
2
c
3
-
2
c
2
2
γ
n
f
′
(
α
)
+
3
c
3
γ
n
f
′
(
α
)
(
γ
n
f
′
(
α
)
)
3
0000
-
c
2
2
γ
n
2
f
′
(
α
)
2
+
c
3
γ
n
2
f
′
(
α
)
2
0000
-
1
2
c
2
2
(
1
+
γ
n
f
′
(
α
)
)
0000
×
(
2
H
1,1
(
γ
n
f
′
(
α
)
)
2
+
H
1,2
(
γ
n
f
′
(
α
)
)
3
0000000
+
2
(
H
1,0
+
H
1,0
γ
n
f
′
(
α
)
)
0000000
+
γ
n
f
′
(
α
)
(
2
+
γ
n
f
′
(
α
)
)
0000000
×
(
2
H
0,1
+
(
1
+
γ
n
f
′
(
α
)
)
0000000100
(
γ
n
f
′
(
α
)
)
3
×
(
2
H
0,2
+
H
0,3
+
H
0,3
γ
n
f
′
(
α
)
)
)
)
0000
+
1
6
(
-
c
3
(
1
+
γ
n
f
′
(
α
)
)
(
2
+
γ
n
f
′
(
α
)
)
00010000
+
c
2
2
(
3
+
2
γ
n
f
′
(
α
)
(
2
+
γ
n
f
′
(
α
)
)
)
)
0000
×
(
6
H
0,0
+
(
1
+
γ
n
f
′
(
α
)
)
00000000
×
(
6
H
0,1
+
(
1
+
γ
n
f
′
(
α
)
)
000000010000
(
γ
n
f
′
(
α
)
)
3
×
(
3
H
0,2
+
H
0,3
+
H
0,3
γ
n
f
′
(
α
)
)
)
)
)
e
n
3
.
To achieve the fourth-order methods in the first two steps of (5), we attempt to vanish the coefficients of e
n
2
,
e
n
3 in (10). For this purpose, it suffices to set
(13)
H
0,0
=
H
1,0
=
1
,
H
0,1
=
H
0,3
=
H
0,2
=
H
1,1
=
H
1,2
=
0
.
Define s
n
=
f
(
z
n
)
/
f
(
y
n
),v
n
=
f
(
z
n
)
/
f
(
x
n
), G
i
,
j
=
∂
G
(
t
n
,
s
n
)
/
∂
t
n
i
∂
s
n
j, and W
i
,
j
=
(
∂
W
(
v
n
,
s
n
)
)
/
(
∂
v
n
i
∂
s
n
j
), i
,
j
=
1,2
,
…. Taylor's series for G
(
t
n
,
s
n
)
,
W
(
v
n
,
s
n
) about (
0,0
) are
(14)
G
(
t
n
,
s
n
)
=
G
0,0
+
G
1,0
t
n
+
G
0,1
s
n
G
(
t
n
,
s
n
)
=
+
1
2
(
G
2,0
t
n
2
+
2
G
1,1
t
n
s
n
+
G
0,2
s
n
2
)
+
⋯
,
W
(
v
n
,
s
n
)
=
W
0,0
+
W
1,0
v
n
+
W
0,1
s
n
W
(
v
n
,
s
n
)
=
+
1
2
(
W
2,0
v
n
2
+
2
W
1,1
v
n
s
n
+
W
0,2
s
n
2
)
+
⋯
.
Under the conditions stated above (13) and substituting these Taylor's series into the third step of (5), we obtain
(15)
e
n
+
1
=
z
n
-
G
(
t
n
,
s
n
)
·
W
(
v
n
,
s
n
)
f
(
z
n
)
f
[
z
n
,
w
n
]
=
R
4
e
n
4
+
R
5
e
n
5
+
R
6
e
n
6
+
R
7
e
n
7
+
O
(
e
n
8
)
,
where
(16)
R
4
=
1
2
c
2
(
-
1
+
G
0,0
W
0,0
)
(
1
+
γ
n
f
′
(
α
)
)
2
×
(
(
+
H
2,1
(
1
+
γ
n
f
′
(
α
)
)
2
-
2
(
3
+
γ
n
f
′
(
α
)
)
)
2
c
3
+
c
2
2
(
H
2,0
+
γ
n
f
′
(
α
)
H
2,0
0000000000000
+
H
2,1
(
1
+
γ
n
f
′
(
α
)
)
2
0000000000000
-
2
(
3
+
γ
n
f
′
(
α
)
)
)
.
Fix G
0,0
=
W
0,0
=
1; then R
4
=
0.
Assuming these conditions, (15) alters
(17)
R
5
=
1
2
c
2
2
(
-
1
+
G
1,0
)
(
1
+
γ
n
f
′
(
α
)
)
3
×
(
(
(
+
H
2,1
(
1
+
γ
n
f
′
(
α
)
)
2
-
2
(
3
+
γ
n
f
′
(
α
)
)
2
c
3
+
c
2
2
(
(
+
H
2,1
(
1
+
γ
n
f
′
(
α
)
)
2
-
2
(
3
+
γ
n
f
′
(
α
)
)
H
2,0
+
γ
n
f
′
(
α
)
H
2,0
0000000000000
+
H
2,1
(
1
+
γ
n
f
′
(
α
)
)
2
0000000000000
-
2
(
3
+
γ
n
f
′
(
α
)
)
)
)
,
and to get R
5
=
0, it is sufficient to put G
1,0
=
1.
In the same manner, we can see that the coefficient ofe
n
6 is
(18)
R
6
=
-
1
4
c
2
(
1
+
γ
n
f
′
(
α
)
)
3
×
(
2
c
3
+
c
2
2
(
H
2,0
+
γ
n
f
′
(
α
)
H
2,0
+
H
2,1
(
1
+
γ
n
f
′
(
α
)
)
2
000.0000000010
×
(
1
+
γ
n
f
′
(
α
)
2
-
2
(
3
+
γ
n
f
′
(
α
)
)
)
)
×
(
2
c
3
(
-
1
+
G
0,1
+
W
0,1
)
(
1
+
γ
n
f
′
(
α
)
)
2
000
+
c
2
2
(
6
+
(
-
6
+
H
2,0
+
H
2,1
)
W
0,1
(
1
+
γ
n
f
′
(
α
)
)
0000000010
+
2
γ
n
f
′
(
α
)
-
G
2,0
(
1
+
γ
n
f
′
(
α
)
)
)
)
0000
+
γ
n
f
′
(
α
)
W
0,1
0000
×
(
-
2
+
H
2,0
+
H
2,1
(
2
+
γ
n
f
′
(
α
)
)
)
+
G
0,1
0000
×
(
H
2,0
+
γ
n
f
′
(
α
)
H
2,0
+
H
2,1
(
1
+
γ
n
f
′
(
α
)
)
2
000010
(
1
+
γ
n
f
′
(
α
)
)
2
-
2
(
3
+
γ
n
f
′
(
α
)
)
)
)
.
To vanish the coefficient of e
n
6, set G
0,1
=
1, W
0,1
=
H
2,0
=
H
2,1
=
G
2,0
=
0, and we conclude similarly that
(19)
R
7
=
1
6
c
2
2
(
1
+
γ
n
f
′
(
α
)
)
4
(
-
c
3
+
c
2
2
(
3
+
γ
n
f
′
(
α
)
)
)
×
(
-
6
c
3
(
-
2
+
G
1,1
+
W
1,0
)
00000
+
c
2
2
(
-
24
+
18
G
1,1
+
G
3,0
-
H
3,0
(
-
2
+
G
1,1
+
W
1,0
)
0000000000
+
18
W
1,0
+
γ
n
f
′
(
α
)
0000000000
×
(
-
6
+
6
G
1,1
+
G
3,0
-
H
3,0
+
6
W
1,0
)
)
)
.
As in the above cases, choosing G
1,1
=
2, W
1,0
=
0, and G
3,0
=
H
3,0
-
6
-
6
/
(
1
+
γ
n
f
[
x
n
,
w
n
]
) gives R
7
=
0.
On account of the above conditions, we see that(20)
e
n
+
1
=
-
1
6
c
2
(
1
+
γ
n
f
′
(
α
)
)
4
×
[
(
-
c
3
+
c
2
2
(
3
+
γ
n
f
′
(
α
)
)
)
(
f
′
(
α
)
(
7
+
γ
n
f
′
(
α
)
)
)
)
)
00000
×
(
-
6
c
2
c
4
+
3
c
3
2
(
-
2
+
G
0,2
+
W
0,2
)
)
000000
-
3
c
2
2
c
3
(
-
22
+
6
G
0,2
+
G
2,1
(
G
0,2
+
2
W
0,2
)
00000000000000
+
6
W
0,2
+
γ
n
f
′
(
α
)
00000000000000
×
(
-
6
+
2
G
0,2
+
G
2,1
+
2
W
0,2
)
)
000000
+
c
2
4
(
-
H
3,0
(
1
+
γ
n
f
′
(
α
)
)
2
(
f
′
(
α
)
(
7
+
γ
n
f
′
(
α
)
)
)
)
0000000000
+
3
G
2,1
(
1
+
γ
n
f
′
(
α
)
)
(
3
+
γ
n
f
′
(
α
)
)
0000000000
+
3
G
0,2
(
3
+
γ
n
f
′
(
α
)
)
2
0000000000
+
3
(
W
0,2
(
3
+
γ
n
f
′
(
α
)
)
2
(
f
′
(
γ
n
f
′
(
α
)
)
)
000000000000000
-
2
(
13
+
γ
n
f
′
(
α
)
(
7
+
γ
n
f
′
(
α
)
)
)
)
)
]
×
e
n
8
+
O
[
e
n
9
]
.Some simple but efficient weight functions satisfying the conditions of Theorem1 are
(21)
H
1
(
t
n
,
u
n
)
=
1
+
t
n
,
H
2
(
t
n
,
u
n
)
=
3
+
t
n
t
n
+
sin
⁡
(
2
t
n
(
-
2
/
9
)
t
n
2
+
3
)
,
G
1
(
t
n
,
s
n
)
=
1
+
t
n
+
s
n
+
2
t
n
s
n
+
(
-
1
-
ϕ
n
)
t
n
3
,
G
2
(
t
n
,
s
n
)
=
1
/
(
1
+
ϕ
n
)
(
1
+
t
n
+
s
n
+
2
t
n
s
n
)
+
t
n
2
1
/
(
1
+
ϕ
n
)
+
t
n
2
,
where ϕ
n
=
1
/
(
1
+
γ
n
f
[
x
n
,
w
n
]
).Consider(22)
W
1
(
s
n
,
v
n
)
=
1
+
s
n
2
+
v
n
2
,
W
2
(
s
n
,
v
n
)
=
1
+
s
n
2
v
n
2
+
1
.
In the next section we introduce a new three-step method with memory. The efficiency index of the optimal class (5) is E
=
8
1
/
4. we extent proposed class (5) to its with memory version, using an accelerator parameter, which improves the efficiency index to 1
2
1
/
4.


## 3. A New Method with Memory

Looking at the error equation (20) of the class (5) reveals that we can increase the convergence order of this class if the crucial element 1
+
γ
n
f
′
(
α
) vanishes. This can be done if γ
n
=
-
1
/
f
′
(
α
). Although this is true theoretically, it is not possible practically since α is unknown. Fortunately, during the iterative process (5), finer approximations to α are generated by the sequence {
x
n
}, and therefor we try to obtain a good approximate for f
′
(
α
). Each iteration, x
n, w
n,y
n, z
n, and x
n
+
1, are accessible, except at the initial step. Hence, we can interpolate f
′
(
α
) using these nodes. It is natural that we estimate the best interpolator, and as a result we consider Newton interpolating polynomial as follows:
(23)
N
4
′
(
x
n
)
=
[
d
d
t
N
4
(
t
;
x
n
-
1
,
w
n
-
1
,
y
n
-
1
,
z
n
-
1
,
x
n
)
]
t
=
x
n
=
[
d
d
t
(
f
(
x
n
)
+
f
[
x
n
,
z
n
-
1
]
(
t
-
x
n
)
(
t
-
y
n
-
1
)
000000
+
f
[
x
n
,
z
n
-
1
,
y
n
-
1
]
(
t
-
x
n
)
(
t
-
z
n
-
1
)
000000
+
f
[
x
n
,
z
n
-
1
,
y
n
-
1
,
x
n
-
1
]
(
t
-
x
n
)
000000
×
(
t
-
z
n
-
1
)
(
t
-
y
n
-
1
)
000000
+
f
[
x
n
,
z
n
-
1
,
y
n
-
1
,
x
n
-
1
,
w
n
-
1
]
(
t
-
x
n
)
d
d
t
000000
×
(
t
-
z
n
-
1
)
(
t
-
y
n
-
1
)
(
t
-
x
n
-
1
)
)
]
t
=
x
n
=
f
[
x
n
,
z
n
-
1
]
+
f
[
x
n
,
z
n
-
1
,
y
n
-
1
]
(
x
n
-
z
n
-
1
)
+
f
[
x
n
,
z
n
-
1
,
y
n
-
1
,
x
n
-
1
]
(
x
n
-
z
n
-
1
)
(
x
n
-
y
n
-
1
)
+
f
[
x
n
,
z
n
-
1
,
y
n
-
1
,
x
n
-
1
,
w
n
-
1
]
×
(
x
n
-
z
n
-
1
)
(
x
n
-
y
n
-
1
)
(
x
n
-
x
n
-
1
)
.In the next theorem we prove that ifγ
n
≃
-
1
/
N
4
′
(
x
n
), then convergence order of the proposed class in Theorem 1 improves to 12.Theorem 2.
Suppose thatx
0 is an approximation to a simple zero α of f, then the R-order of convergence of the three-point method (5) is at least 12.Proof.
Suppose that an iterative method generates a sequence{
x
n
} approximating a zero α of f and C
n tends to the asymptotic error constant D
r when n
→
∞, so
(24)
e
n
+
1
~
D
n
e
n
r
,
e
n
=
x
n
-
α
.
Assume that the iterative sequences{
w
n
}, {
y
n
}, and {
z
n
} have the R-order p, q, and s, respectively; that is,
(25)
e
n
,
w
~
A
n
e
n
p
=
A
n
(
D
n
-
1
e
n
-
1
r
)
p
=
A
n
D
n
-
1
p
e
n
-
1
r
p
,
e
n
,
y
~
B
n
e
n
q
=
B
n
(
D
n
-
1
e
n
-
1
r
)
q
=
B
n
D
n
-
1
q
e
n
-
1
r
q
,
e
n
,
z
~
C
n
e
n
s
=
C
n
(
D
n
-
1
e
n
-
1
r
)
s
=
C
n
D
n
-
1
s
e
n
-
1
r
s
,
e
n
+
1
~
D
n
(
D
n
-
1
e
n
-
1
r
)
r
=
D
n
D
n
-
1
r
e
n
-
1
r
2
.
On the other hand, based on error analysis of the Theorem 1, we have
(26)
e
w
n
~
(
1
+
γ
n
f
′
(
α
)
)
e
n
,
e
y
n
~
c
2
(
1
+
γ
n
f
′
(
α
)
)
e
n
2
,
e
z
n
~
a
k
,
4
(
1
+
γ
n
f
′
(
α
)
)
2
e
n
4
,
e
n
+
1
~
a
k
,
8
(
1
+
γ
n
f
′
(
α
)
)
4
e
n
8
,
where a
n
,
4
=
-
(
1
/
2
)
c
2
(
2
c
3
+
c
2
2
(
H
2,0
(
1
+
γ
n
f
′
(
α
)
)
+
H
2,1
(
1
+
γ
n
f
′
(
α
)
)
2
-
(
3
+
γ
n
f
′
(
α
)
)
)
) and a
n
,
8 are explicit from (20) and depend on iteration index since γ
k is recalculated in each step.
By (23) and the order of interpolatory iteration function, see Section 4.2 in [18], we can also conclude that
(27)
N
4
′
(
x
n
)
=
f
′
(
α
)
(
1
+
c
5
e
n
-
1
e
w
n
-
1
e
y
n
-
1
e
z
n
-
1
+
⋯
)
.
Since γ
n
=
-
1
/
N
4
′
(
x
n
), then
(28)
1
+
γ
n
f
′
(
α
)
~
c
5
e
n
-
1
e
w
n
-
1
e
y
n
-
1
e
z
n
-
1
.
Combining (26) with (28), we infer that
(29)
e
w
n
~
c
5
e
n
-
1
e
w
n
-
1
e
y
n
-
1
e
z
n
-
1
e
n
~
c
5
A
n
-
1
B
n
-
1
C
n
-
1
D
n
-
1
e
n
-
1
r
+
p
+
q
+
s
+
1
,
e
y
n
~
c
5
e
n
-
1
e
w
n
-
1
e
y
n
-
1
e
z
n
-
1
e
n
2
~
c
2
c
5
A
n
-
1
B
n
-
1
C
n
-
1
D
n
-
1
2
e
n
-
1
2
r
+
p
+
q
+
s
+
1
,
e
z
n
~
a
n
,
4
c
5
2
e
n
-
1
2
e
w
n
-
1
2
e
y
n
-
1
2
e
z
n
-
1
2
e
n
4
~
a
n
,
4
c
5
2
A
n
-
1
2
B
n
-
1
2
C
n
-
1
2
D
n
-
1
4
e
n
-
1
4
r
+
2
p
+
2
q
+
2
s
+
2
,
e
n
+
1
~
a
n
,
8
c
5
4
e
n
-
1
4
e
w
n
-
1
4
e
y
n
-
1
4
e
z
n
-
1
4
e
n
8
~
a
n
,
8
c
5
4
A
n
-
1
4
B
n
-
1
4
C
n
-
1
4
D
n
-
1
8
e
n
-
1
8
r
+
4
p
+
4
q
+
4
s
+
4
.
Equating powers on right-hand-side of relations (25) and (29), correspondingly, we form the following system of equations:
(30)
r
q
-
r
-
s
-
p
-
q
-
1
=
0
,
r
p
-
2
r
-
s
-
p
-
q
-
1
=
0
,
r
s
-
4
r
-
2
s
-
2
p
-
2
q
-
2
=
0
,
r
2
-
8
r
-
4
s
-
4
p
-
4
q
-
4
=
0
.
Nontrivial solution of this system is q
=
2, p
=
3, s
=
6, and r
=
12. Therefore, the R-order of the methods with memory (5) under assumptions of Theorem 1, when γ
n
=
1
/
N
4
′
(
x
n
), is at least 12.Remark 3.
If we use lower Newton interpolation, we achieve lowerR-order.


## 4. Numerical Results

In this section, we test our proposed methods and compare their results with some other methods of the same order of convergence. First, we introduce some concrete methods based on the proposed class in this work.Considering weight functions (21)–(22), we haveConcrete method 1(31)
x
0
,
w
0
,
γ
0
are
given
suitably
,
y
n
=
x
n
-
f
(
x
n
)
f
[
x
n
,
w
n
]
,
n
=
0,1
,
2
,
…
,
z
n
=
y
n
-
(
1
+
t
n
)
f
(
y
n
)
f
[
y
n
,
w
n
]
,
x
n
+
1
=
z
n
-
(
1
+
t
n
+
s
n
+
2
t
n
s
n
+
(
-
1
-
ϕ
n
)
t
n
3
)
×
(
1
+
s
n
2
+
v
n
2
)
f
(
z
n
)
f
[
z
n
,
w
n
]
,
γ
n
+
1
=
-
1
N
4
′
(
x
n
)
,
w
n
+
1
=
x
n
+
1
+
γ
n
+
1
f
(
x
n
+
1
)
.
Concrete method 2(32)
x
0
,
w
0
,
γ
0
are
given
suitably
,
y
n
=
x
n
-
f
(
x
n
)
f
[
x
n
,
w
n
]
,
n
=
0,1
,
2
,
…
,
z
n
=
y
n
-
(
1
+
t
n
)
·
f
(
y
n
)
f
[
y
n
,
w
n
]
,
x
n
+
1
=
z
n
-
(
1
/
(
1
+
ϕ
n
)
(
1
+
t
n
+
s
n
+
2
t
n
s
n
)
+
t
n
2
1
/
(
1
+
ϕ
n
)
+
t
n
2
)
×
(
1
+
s
n
2
v
n
2
+
1
)
f
(
z
n
)
f
[
z
n
,
w
n
]
,
γ
n
+
1
=
-
1
N
4
′
(
x
n
)
,
w
n
+
1
=
x
n
+
1
+
γ
n
+
1
f
(
x
n
+
1
)
.
Concrete method 3(33)
x
0
,
w
0
,
γ
0
are
given
suitably
,
n
=
0,1
,
2
,
…
,
y
n
=
x
n
-
f
(
x
n
)
f
[
x
n
,
w
n
]
,
z
n
=
y
n
-
(
3
+
t
n
t
n
+
sin
2
t
n
(
-
2
/
9
)
t
n
2
+
3
)
f
(
y
n
)
f
[
y
n
,
w
n
]
,
x
n
+
1
=
z
n
-
(
1
/
(
1
+
ϕ
n
)
(
1
+
t
n
+
s
n
+
2
t
n
s
n
)
+
t
n
2
1
/
(
1
+
ϕ
n
)
+
t
n
2
)
×
(
1
+
s
n
2
+
v
n
2
)
f
(
z
n
)
f
[
z
n
,
w
n
]
,
γ
n
+
1
=
-
1
N
4
′
(
x
n
)
,
w
n
+
1
=
x
n
+
1
+
γ
n
+
1
f
(
x
n
+
1
)
.
Concrete method 4(34)
x
0
,
w
0
,
γ
0
are
given
suitably
,
y
n
=
x
n
-
f
(
x
n
)
f
[
x
n
,
w
n
]
,
n
=
0,1
,
2
,
…
,
z
n
=
y
n
-
(
3
+
t
n
t
n
+
sin
2
t
n
(
-
2
/
9
)
t
n
2
+
3
)
f
(
y
n
)
f
[
y
n
,
w
n
]
,
x
n
+
1
=
z
n
-
(
1
+
t
n
+
s
n
+
2
t
n
s
n
+
(
-
1
-
ϕ
n
)
t
n
3
)
×
(
1
+
s
n
2
v
n
2
+
1
)
f
(
z
n
)
f
[
z
n
,
w
n
]
,
γ
n
+
1
=
-
1
N
4
′
(
x
n
)
,
w
n
+
1
=
x
n
+
1
+
γ
n
+
1
f
(
x
n
+
1
)
.For comparison purposes, we consider the following methods:Three-point by Sharma et al. [20]:
(35)
x
0
,
w
0
,
γ
0
are
given
suitably
,
y
n
=
x
n
-
f
(
x
n
)
f
[
w
n
,
x
n
]
,
n
=
0,1
,
2
,
…
,
z
n
=
y
n
-
1
+
u
n
1
-
v
n
f
(
y
n
)
f
[
w
n
,
x
n
]
,
x
n
+
1
=
z
n
-
f
(
z
n
)
×
(
f
[
z
n
,
y
n
]
+
f
[
z
n
,
y
n
,
x
n
]
(
z
n
-
y
n
)
00000
+
f
[
z
n
,
y
n
,
x
n
,
w
n
]
(
z
n
-
y
n
)
(
z
n
-
x
n
)
)
-
1
,
γ
n
+
1
=
-
1
N
4
′
(
x
n
)
,
w
n
+
1
=
x
n
+
1
+
γ
n
+
1
f
(
x
n
+
1
)
,
where u
n
=
f
(
y
n
)
/
f
(
x
n
), and v
n
=
f
(
y
n
)
/
f
(
w
n
).
Three-point by Kung and Traub [1]:
(36)
x
0
,
w
0
,
γ
0
are
given
suitably
,
y
n
=
x
n
-
f
(
x
n
)
f
[
w
n
,
x
n
]
,
n
=
0,1
,
2
,
…
,
z
n
=
y
n
-
f
(
y
n
)
f
(
w
n
)
[
f
(
w
n
)
-
f
(
y
n
)
]
f
[
x
n
,
y
n
]
,
k
=
0,1
,
…
,
x
n
+
1
=
z
n
-
f
(
y
n
)
f
(
w
n
)
(
y
n
-
x
n
+
f
(
x
n
)
/
f
[
x
n
,
z
n
]
)
[
f
(
y
n
)
-
f
(
z
n
)
]
[
f
(
w
n
)
-
f
(
z
n
)
]
+
f
(
y
n
)
f
[
y
n
,
z
n
]
,
γ
n
+
1
=
-
1
N
4
′
(
x
n
)
,
w
n
+
1
=
x
n
+
1
+
γ
n
+
1
f
(
x
n
+
1
)
.
Three-point by Zheng et al. [21]:
(37)
x
0
,
w
0
,
γ
0
are
given
suitably
,
y
n
=
x
n
-
f
(
x
n
)
f
[
x
n
,
w
n
]
,
n
=
0,1
,
2
,
…
,
z
n
=
y
n
-
f
(
y
n
)
f
[
y
n
,
w
n
]
+
f
[
y
n
,
x
n
,
w
n
]
(
y
n
-
x
n
)
,
x
n
+
1
=
z
n
-
f
(
z
n
)
×
(
f
[
z
n
,
y
n
]
+
f
[
z
n
,
y
n
,
x
n
]
(
z
n
-
y
n
)
00000
+
f
[
z
n
,
y
n
,
x
n
,
w
n
]
(
z
n
-
y
n
)
(
z
n
-
x
n
)
)
-
1
,
γ
n
+
1
=
-
1
N
4
′
(
x
n
)
,
w
n
+
1
=
x
n
+
1
+
γ
n
+
1
f
(
x
n
+
1
)
.
Three-point by Soleymani et al. [22]:
(38)
x
0
,
w
0
,
γ
0
are
given
suitably
,
y
n
=
x
n
-
f
(
x
n
)
f
[
w
n
,
x
n
]
,
n
=
0,1
,
2
,
…
,
z
n
=
y
n
-
f
(
y
n
)
×
(
+
(
y
n
-
x
n
)
(
y
n
-
w
n
)
f
[
y
n
,
x
n
]
+
f
[
w
n
,
x
n
,
y
n
]
(
y
n
-
x
n
)
00000
+
(
y
n
-
x
n
)
(
y
n
-
w
n
)
)
-
1
,
x
n
+
1
=
z
n
-
f
(
z
n
)
×
(
f
[
x
n
,
z
n
]
+
(
f
[
w
n
,
x
n
,
y
n
]
-
f
[
w
n
,
x
n
,
z
n
]
0000000000000000
-
f
[
y
n
,
x
n
,
z
n
]
)
(
x
n
-
z
n
)
00000
+
(
z
n
-
x
n
)
(
z
n
-
w
n
)
(
z
n
-
y
n
)
)
-
1
,
γ
n
+
1
=
-
1
N
4
′
(
x
n
)
,
w
n
+
1
=
x
n
+
1
+
γ
n
+
1
f
(
x
n
+
1
)
.By|
x
n
-
α
| we denote approximations to the zero α, b
(
-
a
) stands for b
×
1
0
-
a, and the computational order of convergence (COC). Here, COC is defined by [16]:
(39)
COC
=
ln
⁡
⁡
(
|
x
n
+
1
-
α
|
/
|
x
n
-
α
|
)
ln
⁡
⁡
(
|
x
n
-
α
|
/
|
x
n
-
1
-
α
|
)
.
Also the following functions are used:
(40)
f
(
x
)
=
exp
⁡
⁡
(
x
2
-
3
x
)
sin
⁡
(
x
)
f
(
x
)
=
+
log
⁡
⁡
(
x
2
+
1
)
,
x
0
=
0.35
,
α
=
0
,
f
(
x
)
=
exp
⁡
⁡
(
x
2
+
x
cos
⁡
⁡
(
x
)
-
1
)
sin
⁡
(
π
x
)
f
(
x
)
=
+
x
log
⁡
⁡
(
x
sin
⁡
(
x
)
+
1
)
,
x
0
=
0.6
.
Tables 1 and 2 show numerical results for various optimal without memory methods (31)–(38). It is clear that all these methods behave very well practically and confirm their relevant theories.Table 1
f
(
x
)
=
exp
⁡
(
x
2
-
3
x
)
sin
⁡
(
x
)
+
log
⁡
(
x
2
+
1
)
,
x
0
=
0.35, α
=
0, γ
=
1.
Methods
|
x
1
-
α
|
|
x
2
-
α
|
|
x
3
-
α
|
COC (39)
New Method (31)
0.61569 (−3)
0.23067 (−21)
0.91264 (−169)
7.999
New Method (32)
0.56124 (−3)
0.32323 (−21)
0.38634 (−167)
8.000
New Method (33)
0.55232 (−3)
0.28429 (−21)
0.13833 (−167)
8.000
New Method (34)
0.62453 (−3)
0.25853 (−21)
0.22480 (−168)
7.999
Method (35)
0.19676 (−4)
0.44197 (−33)
0.28657 (−262)
8.000
Method (36)
0.85597 (−4)
0.28686 (−29)
0.45644 (−233)
8.000
Method (37)
0.17236 (−4)
0.32121 (−35)
0.46744 (−281)
8.000
Method (38)
0.34824 (−4)
0.36172 (−33)
0.48972 (−265)
8.000Table 2
f
(
x
)
=
exp
⁡
(
x
2
+
x
cos
⁡
(
x
)
-
1
)
sin
⁡
(
π
x
)
+
x
log
⁡
(
x
sin
⁡
(
x
)
+
1
)
,
x
0
=
0.6, α
=
0, γ
=
-
1.
Methods
|
x
1
-
α
|
|
x
2
-
α
|
|
x
3
-
α
|
COC (39)
New Method (31)
0.57578 (−3)
0.71057 (−29)
0.38797 (−236)
7.999
New Method (32)
0.45807 (−3)
0.5295 (−31)
0.35165 (−254)
7.999
New Method (33)
0.46574 (−3)
0.65400 (−31)
0.10135 (−253)
7.999
New Method (34)
0.56806 (−3)
0.63795 (−29)
0.16377 (−236)
7.999
Method (35)
0.48202 (−3)
0.27805 (−30)
0.34404 (−248)
7.999
Method (36)
0.31009 (−3)
0.26712 (−31)
0.841965 (−256)
7.999
Method (37)
0.23448 (−3)
0.10417 (−32)
0.15929 (−267)
7.999
Method (38)
0.46334 (−3)
0.23577 (−30)
0.10713 (−248)
7.999Tables3 and 4 present numerical results for various with memory methods (31)–(38). It is also clear that all these methods behave very well practically and confirm their relevant theories. They all provide 12th-order of convergence asymptotically without any new function evaluations.Table 3
f
(
x
)
=
exp
⁡
(
x
2
-
3
x
)
sin
⁡
(
x
)
+
log
⁡
(
x
2
+
1
)
,
x
0
=
0.35, α
=
0, γ
0
=
0.01.
Methods
|
x
1
-
α
|
|
x
2
-
α
|
|
x
3
-
α
|
COC (39)
New Method (31)
0.91937 (−4)
0.18790 (−44)
0.11705 (−532)
11.998
New Method (32)
0.11053 (−3)
0.77050 (−44)
0.31600 (−525)
11.988
New Method (33)
0.11306 (−3)
0.99434 (−44)
0.67431 (−524)
11.987
New Method (34)
0.89413 (−4)
0.13787 (−44)
0.28524 (−534)
11.998
Method (35)
0.14850 (−5)
0.17577 (−61)
0.48167 (−738)
12.097
Method (36)
0.84533 (−4)
0.39381 (−45)
0.10032 (−540)
11.991
Method (37)
0.30874 (−6)
0.17978 (−67)
0.12617 (−812)
12.169
Method (38)
0.16768 (−4)
0.15361 (−56)
0.21643 (−680)
11.988Table 4
f
(
x
)
=
exp
⁡
(
x
2
+
x
cos
⁡
(
x
)
-
1
)
sin
⁡
(
π
x
)
+
x
log
⁡
(
x
sin
⁡
(
x
)
+
1
)
,
x
0
=
0.6, α
=
0, γ
0
=
-
0.1.
Methods
|
x
1
-
α
|
|
x
2
-
α
|
|
x
3
-
α
|
COC (39)
New Method (31)
0.71066 (−4)
0.20396 (−49)
0.49715 (−596)
12.002
New Method (32)
0.80715 (−4)
0.15495 (−49)
0.65738 (−595)
11.929
New Method (33)
0.78950 (−4)
0.14520 (−49)
0.30139 (−596)
11.931
New Method (34)
0.72833 (−4)
0.22472 (−49)
0.15905 (−595)
12.000
Method (35)
0.64946 (−4)
0.48258 (−50)
0.11725 (−600)
11.936
Method (36)
0.60478 (−4)
0.17480 (−48)
0.27838 (−582)
11.985
Method (37)
0.65693 (−4)
0.27775 (−50)
0.42521 (−607)
11.993
Method (38)
0.86612 (−4)
0.81112 (−64)
0.23877 (−765)
12.089


## 5. Conclusions

In this work we proposed a new optimal class of methods without and with memory for computing simple root of a nonlinear equation. Its without and with memory methods attain 8 and 12 orders of convergence, respectively, using only four function evaluations per iterations. This class is free-derivative which can be considered as another virtue for it. All together, we managed to increase efficiency index of methods without memory from8
1
/
4 to 1
2
1
/
4 using a very suitable self-accelerator parameter based on Newton interpolation.



---

*Source: 769758-2014-03-03.xml*