Numerical and theoretical treatment for solving differential

equation with retarded argument using an efficient iterative

iteration method

xxxxxx
1
xxxxxxxxxxxxx
Place - Pin Code Sate,
India

xxxxxxxx
Department of Mathematics, xxxxxxxxx,
2,†

University, Place - Pin Code

State, Country
e-mail: xxxxxxxxxxx@gmail.com

∗
Abstract. This paper includes a new three stage iteration method AM and uses that method to test some
∗
convergence theorems in Banach spaces, together with the example to prove efficiency of AM is the
∗
central focus of this paper, along with explaining, using an example, that AM is converging to an invariant
point faster than all Picards, Mann, Ishikawa, Noor, SP, S, Picard-S, Garodia, K and K ∗ . It must be noted
∗
that it is also addressed by the AM iteration method, the effects of stability and data dependency on
∗
contraction mapping. In addition, the AM iteration method can be used to resolve differential equations
with a time-delayed argument.

∗ ∗
Keywords: AM iteration scheme, convergence analysis, Banach spaces, AM iteration, stability, data
dependence

1. Introduction
It is well known
equations may notthat many real
necessarily life problems
always can
be directly be to
easy simulated into differential
solve. Instead, equations,
solutions can but these
be approximated
using numeric methods. And the theory of fixed point plays an magnificent role in solving those
problems which sometimes do not have a closed form of solution. If we consider
 2
a ∈ B, where B is an ambient space, a transformation τ : B → B such that

τ a = a, (1.1)
then B fields
related is saidofto study
be a fixed
such point. Problems identified
as management, economics,today in various
medical, fields ofchemical
engineering, science and other
sciences,
physics, etc. can be easily and conveniently formulated by employing the equation

τ a = 0, (1.2)
and it canequations:
modeled be either linear
one isor non linear.
a direct Usually,
method and thetwo approaches
other are used
is an indirect to find
method. a solution
The for
direct method
often fails due to a variety of problems and is therefore considered to be impractical. As such, the
Iterative Method remains the best and most viable option for solving the equation. The small but
significant issue that arises from the use of Iterative Method is that it is cumbersome. The prime
objective of the mathematicians, even so, is to introduce such a method, which offers a better
convergence rate, in order to provide a solution at a faster rate, because speed and stability play a
significant role in favoring the iteration process over yet another iteration process. Some
important iteration methods are referred to as Mann [1], Ishikawa[2], Noor [3], SP by
Phuengattana and Suantai [4], S by Agarwal, O’Regan and Sahu [5], Picard-S by Faik Gursoy and
Vatan Karakaya [6] and many more. In the entire article, fτ is used to denote the set of all the fixed
points of τ . Consequently, the literature of this highly dynamic research area abounds many
iterative methods that have been introduced and developed by a wide audience of researchers to
serve various purposes, viz. [6,7,8,9,10,11,12,13,14] among others. We’ll begin with a description
of different iterative methodologies. Throughout the whole work, we shall use the notation N to
signify the set of all non-negative integers. Suppose S be a non- empty convex subset of a
Banach space B, and τ : S → S. A  really well and straightforward iteration approach is
formulated by

p0 ∈ S

 (1.3)
pη+1 = τ pη , η∈

N.
This is referred as the Picard iteration method [15], which is extensively used to approximate

fixed point of contraction maps that satisfy certain condition as :

∥τ a − τ b∥ ≤ µ∥a − b∥, µ ∈ (0, 1), (1.4)

 3
∀ a, b ∈ S. Mann [1], Ishikawa [2], Noor [3], SP [49], S [5], [16], Picard-S [17], Garodia’s [18], K
 ∀ η ∈ N of are as follows:
[19] and K ∗ [20] iterative approaches

v0 ∈ S,
 (1.5)
aη+1 = (1 − ℓ0 )aη + ℓ0 τ aη ,
η η


v0 ∈ S,

v = (1 − ℓ0 )vη η + ℓ τw
0
η η, (1.6)
 η+1 η η

 w0 ∈ S,
 w η = (1 − ℓ )vη +
1

η η η η
 (1.
wη+1 = (1 − ℓ0 )wη +
η η


vη =u(1
η =−
(1ℓ−
1
)wℓ2η)w
+ ηℓ+1 τu η,
q0 ∈ S,


η η η η
 (1.
qη+1 = (1 − ℓ0 )rη +
 η η

rηt0=∈
sη(1S,
=−(1 ℓ−1)sℓη2 )q
+ ηℓ+1 τs η,

t = (1 − ℓ0 )τ η tη + ℓ τ u
0
ηη , (1.9)
 η+1 η η

 u ∈ S,
 0uη = (1 − ℓ )τη +
1

 η η η η
uη+1 = (1 − ℓ0 )vη + (1.1
 η η
u η = (1 −1 ℓ )uη +1 ℓ τ uη ,
2
vη = (1 − ℓ )τuη + ℓ τwη,
2
 
4 y0 ∈ S,


bη+1 = τ kη ,
(1.11)
kη = (1 − ℓ0)τ bη + ℓ0τℓη,
η η

η η

ℓη = (1 − ℓ1 )bη + ℓ1 τ
a′0′ ∈ S,

 ′ ′
a = τ b′ ′ ,
η +1 η
b′ ′ = (1 − ℓ0)c′η′ + ℓ0τ c′η (1.12)
′ η
, η η


c′η′ = τ a′η′ ,

x0 ∈ S,
aη+1 = τ bη ,
bη = τ ((1 − ℓ0)τ aη + ℓ0τ cη), (1.13)
η η

η η

cη = (1 − ℓ1 )aη + ℓ1 τ
a′0 ∈ S,

 ′
a = τ b′ ,
η+1 η
(1.14)
b η = τ ((1 − ℓ )c + ℓ 0 τ c′ η
′ 0 ′
η η η
),

η η
 ′
c η = (1 − ℓ1 )a′η + ℓ1 τ a′η ,
To carve out the delliled analysis of related theory there are many research articles mentioned in
references
choice among(refer, [21],given
some [1], [22], [4], [23],
iteration [24], by
methods [25], [26], into
taking [27], account
[14]). Insome
such cases, one must
important make
criteria. Fora
example, there are two main criteria such as the speed of convergence and simplicity which make an
iteration method more effective than others. In such cases, the following problems arise naturally:
Which one of these iteration methods converges faster to the fixed point? and How do we compare the
speed of these iteration methods that converge to the same fixed point? There are only a few attempts
to solve such an important numerical problem, see ([37], [40], [41], [42], [43], [2], [25], [44], [28],
[29], [17], [19], [20], [18]).
 2. Preliminaries 5

The ∞definitions of the rate of convergence given below are based on Berinde [39] as: Let {aη }∞η=0 and
{bη } η=0 be two sequences of real numbers with limits a and S, respectively. For
|aη − a|
lim = ℓ, (1.15)
n→∞ |bη − b|

(i) If ℓ = 0, then we say that {aη }∞η=0 converges faster to a than {bη }∞η=0 to b.

(ii) If 0 < ℓ < ∞, then we say that {aη }∞η=0 and {bη }∞η=0 have the same rate of convergence.

In 2007, Agarwal et al. [5] addressed the following question:

Problem 1. Is it(1.3)?
Picard iteration possible to develop an iteration process whose rate of convergence is faster than the
They dealt with
the category the problem
of contraction by establishing
mappings the S-iteration
(1.4), it was establishedmethod, thatthewas
in [5] that describedapproach
S- iteration by (1.9).(1.9)
For
converges at almost the same rate as the Picard iteration method (1.3) and better than that of the Mann
iteration method (1.5). For the class of contraction mappings (1.4), Sahu [16] proved both
conceptually and empirically that the S-iteration approach (1.9) converges at a better rate than both
Picard iteration method (1.3) and Mann iteration method (1.5).
For a given∗ category of quasi-contractive operators, a recent research by Chugh, et al. [30] proved
that the AM iterative approach (1.10) converges better than the Picard (1.3), Mann (1.5), Ishikawa
(1.6), Noor (1.7), SP (1.8), and S (1.9) iterative method. Furthermore, a similar research by Ullah and
Muhammad (1.14), Hussin et al. (1.13), and Garodia (1.12) signifies that their iterative methods
converge faster than all of the above referenced methods for a different category of mappings, which
encompasses the afore - mentioned class of contraction operators. Inspired by the works mentioned
above, we propose the following problem:
Problem
that of the2.iterations
Is it possible
(1.12),to(1.13),
establish
andan iterative approach which has a faster convergence rate than
(1.14)?
 6
∗
To answer this problem, we introduce the following iteration method namely AM iteration:

x0 ∈ S,
η η

(1.18)
b
η = τ cη ,
cη = τ ((1 − ℓ )aη + ℓ τ
0 0
 η η

aη+1 = τ (ℓ1 bη + (1 − ℓ1 )τ bη ), η ∈ N, ∗
This
estimate fixed point for contraction mappings. Furthermore, ∗we establishmethod
article is basically two-fold. The first is to establish that the iteration AMthe can beclass
used of
to
that for same
mappings, our proposed iteration method is equivalent to K and Garodia’s iteration approach and
significantly better. ∗There is a reference made to carve out a detailed analysis and review of literature
with respect to K and Garodias [20,18] repectively. To make this article self-contained, the
exposition includes the following definitions and lemmas to achieve the primary results.
Definition 1. [8] Let τ , τ˜ : S → S be two operators. We say that τ˜ is an approximate operator for τ
if, for some ϵ > 0, we have

∥τ a − τ˜a∥ ≤ ϵ (1.19)
∀ a ∈ S.

The following Lemma given by Weng in 1991 is useful in our subsequent discussion.

Lemma 1. [31] Let {ψη} and {ϕη} be any two nonnegative real sequences satisfying the following

Σ∞ ψη+1 ≤ (1 − ϕη)ψη + φη, (1.20)

where ϕη ∈ (0, 1) ∀ η ∈ N, η=0 ϕη = ∞, and → 0 as η → ∞, then limn→∞ ψη = 0. The
φ
ϕ

following Lemma given by Soltuz and Grosan in 2008 is useful in our subsequent discussion.
Lemma 2. [23] Let {ψη} non negative real sequence for which one assumes existence of η0 ∈ N

∋ for all η ≥ n0, the following inequalities satisfies

Σ∞ ψη+1 ≤ (1 − ϕη)ψη + ϕ η φ η , (1.21)
where ϕη ∈ (0, 1) ∀ η ∈ N, η=0 ϕη = ∞, and φ ≥ 0 ∀ η ∈ N, then

0 ≤ lim sup ψη ≤ lim sup φη (1.22)

n→∞ n→∞
Lemma 3. [19]Letmapping
a nonexpansive S be a nonempty
on S. thenclosed
I − τ convex subset at
is demiclosed a uniformly convex Banach space S and τ 7
of0.

3. Convergence Analysis

Theorem 1. Let S ⊆ B be a nonempty closed and convex set of a banach space B. Also,
∗
τ : S → S ∋ {aη}∞ be an iterative succession generated by AM with real sequences {ℓ0}∞
η η η
Σ∞
and {ℓ1}η ∞η ∈ [0, 1] ∋ η ℓ0ℓ1η =η∞. Then, {aη}∞ converges
η
strongly to a fixed point of τ .
Proof. The Banach contraction theorem ensures the existence as well as uniqueness of the fixed

∗
point aδ. Now, it is to prove that aη → aδ for η → ∞. From AM iteration scheme it follows
0 0
∥cη − aδ∥ = ∥τ ((1 − ℓη )aη + ℓητ aη) − aδ∥
= ∥τ ((1 − ℓ0)aη + ℓ0τ aη) − τ aδ∥
η η
0 0

≤ κ∥(1 −0ℓη )aη + ℓητ aη − a0 δ∥

≤ κ(1 − ℓ0η )∥aη − aδ∥ + κℓ0 η∥τ
2
aη − τ aδ∥
≤ κ(1 − ℓη )∥aη − aδ∥ + ℓηκ ∥aη − aδ∥

η
= κ(1 − (1 − κ)ℓ0)∥aη − aδ∥
∥bη − aδ∥ ≤ ∥τ cη − aδ∥

also,
= ∥τ cη − τ aδ∥
≤ κ∥cη − aδ∥.

η
Using the value of ∥cη − aδ∥, we have ∥bη − aδ∥ ≤ κ2(1 − (1 − κ)ℓ0)∥a η − aδ∥. Similarly, we have
1 1
∥aη+1 − aδ∥ = ∥τ ((1 − ℓη )τ bη + ℓη bη) − aδ∥
= ∥τ ((1 − ℓ1)τ bη + ℓ1bη) − τ aδ∥
η η
1 1

≤ κ∥(1 − 1ℓη )τ bη + ℓη bη − aδ∥1

≤ κ(1
2
− ℓη1)∥τ bη − τ aδ∥ +0κℓη∥bη − aδ∥
≤ κ (1 − ℓη )∥bη − aδ∥ + ℓηκ∥bη − aδ∥

= κ(κ − (1 − κ)ℓ )∥bη − aδ∥.

1
 8
Using the value of ∥bη − aδ∥, we have
3 0 1

∥aη+1 − aδ ∥ ≤ κ (1 − (1 − κ)ℓη )(κ − (1 − κ)ℓη ))∥aη − aδ∥. (3.1)

Since, κ ∈ (0, 1) and ℓ1 ∈

η [0, 1]. Hence, (κ − (1 − κ)ℓ1) <
η 1
3 0

∥aη+1 − aδ ∥ ≤ κ (1 − (1 − κ)ℓη )∥aη − aδ ∥

(3.2)

Now, using the behaviour of sequence inductively, we have

3 0

∥aη − aδ∥ ≤ κ (1 − (1 − κ)ℓη−1)∥aη−1 − aδ∥

3 0

∥aη−1 − aδ∥ ≤ κ (1 − (1 − κ)ℓη−2)∥aη−2 − aδ∥.

The repetition results
3 0

∥x1 − aδ∥ ≤ κ (1 − (1 − κ)ℓ0)∥x0 − aδ∥.

Proceeding in the same manner, we have

Y η
∥aη+1 − aδ∥ ≤ ∥x0 − aδ∥κ3(η+1) (1 − (1 − κ)ℓ0)
k=0 k

where (1 − ℓ0(1 − κ)) ∈ (0, 1) because κ ∈ (0, 1) and ℓ0 ∈ [0, 1], ∀ η ∈ N. Since, we know that
η η

1 − a ≤ e−a ∀ x ∈ [0, 1], so from the above inequality

∥aη+1 − aδ∥ ≤ ∥x0 − aδ∥κ3(η+1)
Ση
e(1−κ) ℓ0 .
k=0

So when limits on both sides of the inequality are taken into account, the consequence is

lim a∥η+1 −aδ =∥ 0,

n→∞

which implies that aη → aδ for η → ∞, as required. □

Theorem 2. Let B be a Banach space and S ⊆ B be a nonempty closed and convex set. Also, τ

∗
be a self-mapping on S for which {aη }∞η=0 be an iterative succession devised by AM for given
 9
a′0 = x0 ∈ S, let the real sequences {aη }∞η=0 and {aη′ }∞η=0 be the iterative successions generated
∗
by AM and K ∗ respectively, with real sequences {ℓ0 }∞ η, {ℓ
η }
1 ∞
η ∈η (0, 1) ∋ ℓ ≤ ℓ η< 1,ηfor
0 0

∗
some ℓ0 >
η 0 and ∀ η ∈ N. Then AM converges to aδ faster than K iteration scheme.
∗

Proof. It is observable from the consequence of Theorem (1) that

Y η
∥aη+1 − aδ∥ ≤ ∥x0 − aδ∥κ3(η+1) (1 − (1 − κ)ℓ0)
k
k=0

Now, for the K ∗ iteration scheme,

∥c′η − aδ∥ = ∥(1 − ℓ1)a

η η + ℓ Tηa η − aδ∥
′ 0 ′

≤ (1 − ℓ1η)∥a′ η− aδ∥ + ℓ0∥τ

η a −
′
η τ aδ∥

≤ (1 − ℓη1)∥a′η− aδ∥ + κℓ0∥a

η −
′
η aδ∥

η η
≤ (1 − ℓ1(1 − κ))∥a′ − aδ∥.

Similarly ∥b′η − aδ∥ ≤ ∥τ ((ℓ0c′ + (1 − ℓ0)τ c′η ) − aδ∥

η η

≤ κ∥ℓ ηc + (1 − ℓ )τ
0 ′
η c −
0′
η aδ∥

≤ κℓ0η∥c′ η− aδ∥ + (1 − ℓ0)∥τ

η c −
′
η aδ∥

≤ κℓ0η∥c′ η− aδ∥ + κ(1 − ℓ0)κ∥c

η
′
−
η aδ∥

≤ κ(1 − (1 − κ)ℓ0η)∥c′ η− aδ∥

η η η
≤ κ(1 − (1 − κ)ℓ0)(1 − (1 − κ)ℓ1)∥a′ − aδ∥.

Similarly,
∥a′η+1 − aδ∥ = ∥τ b′η − aδ∥ ≤ κ∥b′η − aδ∥.

For the fact ∥b′η − aδ ∥ and (1 − (1 − κ)ℓ1) <η 0, we have

∥a′η+1 − aδ∥ ≤ κ2(1 − (1 − κ)ℓ0η)

1 )∥a′η−1 − aδ ∥ (3.3)
∥a′η − aδ∥ ≤ κ2(κ − (1 − κ)ℓ0η

also,
η
∥a′η−1 − a δ∥ ≤ κ2(1 − (1 − 2 )∥a′η−2 − aδ∥.

κ)ℓ0
 1

Continually, we have
∥a′1 − aδ∥ ≤ κ2(1 − (1 − κ)ℓ0)∥a
1 ′0 − aδ∥.

So, it is quite obvious that the following deduction

Yη
∥a′η+1 − aδ∥ ≤ ∥a′0 − aδ∥κ2(η+1) (1 − (1 − κ)ℓ0)
k
k=0

is appropriate. Now, let

Y η
rη = ∥x0 − aδ∥κ3(η+1) (1 − (1 − κ)ℓ0) (3.4)
k
k=0

and
Y η
∗
AM = ∥a′0 − aδ∥κ2(η+1) (1 − (1 − κ)ℓ0). (3.5)
k
k=1

Then Qη (1 − (1 − κ)ℓ0)
aη ∥a′ − aδ∥κ2(η+1)
→
η
0
0 δ k k 0 (3.6)
r = ∥x Qk=0 (1 − (1 − κ)ℓ0)
η
− a ∥κ3(η+1) ∗ k
as η → ∞. Thus, {aη} is a sequence defined in AM iteration defined by (1.14), then {aη}

converges faster than the iteration scheme of Ullah and Muhhamad known as K ∗ .
□
Theorem 3. Let for a banach space B, S ⊆ B is nonempty closed and convex. For a contraction ∗
mapping τ : S → S is a contraction mapping ∋ fτ ̸= ∅. Then {aη } is a sequence defined in AM
iteration defined by (1.14) converges faster than the iteration scheme devised by Garodia and Uddin
defined by (1.12).

Proof. Using the result of Theorem1it is clear that

Y η
∥aη+1 − aδ∥ ≤ ∥x0 − aδ∥κ3(η+1) (1 − ℓ0(1 − κ))
k
k=0
 1
Now, for iterative method1 .12,

∥c′η′ − aδ∥ = ∥τ a′η′ − aδ∥

≤ κ∥a′η′ − a δ∥ (3.7)

∥b′η′ − aδ ∥ = ∥(1 − ℓ0η)c′η′ − ℓ0ηT c′η′ − aδ ∥

≤ ∥(1 − ℓ0η)c′′ η− ℓ0T

η c η− a δ∥
′′

≤ (1 − ℓ0η)∥c′′η− aδ∥ + κℓ0∥T

η c η− aδ∥]
′′

≤ (1 − ℓη0)∥c′′η − aδ∥ + κℓ0∥c

η η− aδ∥
′′

η η
= (1 − (1 − κ)ℓ0)∥c′′ − aδ∥.

Thus, ∥a′η′+1 − aδ∥ = ∥τ b′η′ − a δ∥ ≤ κ∥b′η′ − aδ∥. Using the value of ∥b′η′ − aδ∥, inductively, we have

∥a′η′+1 − aδ∥ = κ2(1 − (1 − κ)ℓ0)∥a ′ ′

η η − aδ∥
− aδ∥
∥a′η′ − aδ ∥ = κ2(1 − (1 − κ)ℓ0 η 1)∥a′η −
1

2 ′
−

∥a′η′ − 2η a
′∥′ 2 − aδ∥.
1 − aδ∥ = κ (1 − (1 −

κ)ℓη−

On combining all the inequalities, we have

Yη
∥a′η′+1 − aδ ∥ ≤ ∥a0′′ − aδ ∥κ2(η+1) (1 − ℓ0 (1 − κ)).
k
k=0

Let
η
3(η+1) 0
Y k
k=0
r = ∥x − a ∥κ (1 −
and
η
2(η+1) 0
Y k
′′ k=0
a = ∥a − a ∥κ (1 −
Then
Qη
aη ∥a′′ − aδ∥κ2(η+1) (1 − (1 − κ)ℓ0)
Q k →0
η (1 − (1 − κ)ℓ0)
r = ∥x0 0 δ
k
k=0
η
− a than
as η → ∞. Hence, {aη} converges faster ∥κ3(η+1) k
the iteration scheme of Garodia and Uddin defined

by (1.12).
 1
□

4. Empirical study
∗
behaviour
addressed of
by AM is illustrated in this[47]
section with an example.
the proof Weof will utilise a numerical
Karahan and Ozdemir to support Theorems2and3for the example
sake of
consistency but with a different initial value to support the proof of Theorems2and 3.
Example 1. Let S = (−∞, ∞) and S = [1, 50]. Let τ : S → S be mapping defined as τ (a) =

a2 − 9a + 54 ∀ a ∈ S. Set ℓ0 = ηℓ1 = ℓ2η= 0.75η ∀ η ∈ N. Consider initial value as 40 (i.e.

∗
a0 = 40). The Table, given below, illustrates
∗ the convergence behaviour of AM iteration scheme.
The Table deals with the behaviour of AM iterative method.

Comparison Table
Step CR Picard−S S Mann Ishikawa
a0 40 40 40 40 40
a1 30.79269 29.81058 33.73902 36.97916 34.74597
a2 22.04554 20.22167 27.64779 33.99074 29.60941
a3 14.21323 11.96130 21.81068 31.04083 24.63615
a4 8.47662 7.00092 16.38287 28.13712 19.90092
a5 6.298022 6.04969 11.66859 25.28971 15.53166
∗
Step Noor SP Garodia’s K* AM
a0 40 40 40 40 40
a1 33.09913 31.04083 329.08214 26.20949 24.32891
a2 26.43652 22.51204 10.48478 6.76933 6.13759
a3 20.15596 14.81676 6.45267 6.01132 6.00079
a4 14.54284 8.97765 6.014592 6.00013 6.00000
a5 10.14751 6.45359 6.00040 6.00000 6.00000
∗
As shown bymore
the tables andthan
graphs above, the newly defined iteration scheme AM converges much
faster and is efficient several existing iteration approaches.
1
 1
∗
FIGURE 1. Comparison Tableattoinitial
provevalue
the convergence behaviour of AM with than al- most all
the existing iteration schemes 40.

5. T-stability of AM∗ iteration method

∗
Now, we prove the stability of AM .

Theorem 4. Suppose for a Banach space B, S ⊆ B is nonempty closed and convex and a
∗
contraction mapping τ : S → S. Let {aη }∞η=0 beΣan iterative succession generated by AM and
∞ 0 ∗
with real sequence {ℓ0}∞ and {ℓ1}∞ ∈ [0, 1] ∋ ℓ = ∞. Then AM iterative approach
η η=0 η η=0 η=0 η

is T − stable.
∗
Proof. For AM iteration scheme, aη+1 = f (τ, aη) converges to a fixed point aδ (by Theorem
1) and ϵη = ∥τ
Theorem1, − f (τ, tη)∥. It is to prove that limn→∞ tη = p. Let limn→∞ ϵη = 0. From
weη+1have
3 0

∥aη+1 − aδ∥ ≤ κ (κ − (1 − κ)ℓη )∥aη − aδ∥,

we have,
∥τη+1 − aδ ∥ ≤ ∥τη+1 − f (τ, τη )∥ + |f (τ, τη ) − aδ ∥
= ϵη + ∥T ((1 − ℓ0)τ (τ (aη)) + ℓ0T (τ (τ (aη)))) − aδ∥
η η
3 0

≤ κ (1 − (1 − κ)ℓη )∥τη − aδ∥ + ϵη.

As, ψη = ∥τη − aδ∥, ϕη = (1 − κ)ℓ0 ∈ (0,
φη → 0 as η → ∞. Now, for
η 1) and φ = ϵη =⇒ ϕη

limn→∞ tη = p, we have

ϵη = ∥τη+1 − f (τ, τη)∥

≤ ∥τη+1 − aδ∥ − ∥f (τ, τη) − aδ∥

3 0

≤ κ (κ − (1 − κ)ℓη )∥τη − aδ∥ + ϵη

∗
This implies that limn→∞ tη = 0. This also implies that AM is T − stable with respect to τ .
□ 1

Lemma 4. Let S ⊆ B be a nonempty closed convex subset and ∗ a nonexpansiv mapping τ : S → S with
fτ ̸= ∅. Let {aη } be an iterative succession defined as AM . Then limn→∞ ∥aη − aδ ∥ exists ∀ aδ ∈ fτ
.

∗
Proof. From AM iteration scheme it follows that,
0 0
∥cη − aδ∥ = ∥τ ((1 − ℓη )aη + ℓητ aη) − aδ∥
= ∥τ ((1 − ℓ0)aη + ℓ0τ aη) − τ aδ∥
η η
0 0

≤ ∥(1 −0ℓη )aη + ℓητ aη −0 aδ∥

≤ (1 − ℓ0η )∥aη − aδ∥ + ℓ0η∥τ aη − τ aδ∥

Also, ≤ (1 − ℓη )∥aη − aδ∥ + ℓη∥aη − aδ∥

≤ ∥aη − aδ∥.

∥bη − aδ∥ ≤ ∥τ cη − aδ∥

= ∥τ cη − τ aδ∥
≤ ∥cη − aδ∥.

Using the value of ∥cη − aδ∥, we have

∥bη − a δ∥ ≤ ∥aη − aδ∥.

Similarly, we have
1 1
∥aη+1 − aδ∥ = ∥τ ((1 − ℓη )τ bη + ℓη bη) − aδ∥
= ∥τ ((1 − ℓ1)τ bη + ℓ1bη) − τ aδ∥
η η
1 1

≤ ∥(1 − 1ℓη )τ bη + ℓη bη − a1δ∥

≤ (1 − ℓ1η )∥τ bη − τ aδ∥ 0+ ℓη∥bη − aδ∥
≤ (1 − ℓη )∥bη − aδ∥ + ℓη∥bη − aδ∥

= ∥bη − aδ∥

Using the value of ∥bη − aδ∥, we have

∥aη+1 − aδ∥ ≤ ∥aη − aδ∥
 1
which confirms thef existence of limn→∞ ∥aη − aδ ∥ ∀ aδ ∈ fτ . Since, {∥aη − aδ ∥} is bounded and non-
increasing ∀ aδ ∈ τ .

∗
We now establish that the AM iteration is weakly convergent.
Theorem 5. Suppose
nonempty closed andS convex
⊆ B, is satisfying
nonempty Opial’s
closed and convex and
Condition having
alsoa that
nonempty
there subset S, which is
is a nonexpansive
∗
mapping τ : S → S with fτ ̸= ∅. If {aη } is an iterative succession defined by AM , then {aη }
converges weakly to a fixed point of τ .
Proof. Let aδ ∈ fτ . ∗Then from Lemma 3.1, it is obvious that limn→∞ ∥aη − aδ∥ exists. To prove weak
convergence of AM iterative process, it is sufficient to prove {aη} has a weak subsequential limit in
fτ . Let {anu } → u and {anv } → v are the sub sequences of {aη}. By Lemma4lim n→∞ ∥τη − aη∥ =
0. By demiclosedness of I − τ at 0, u, v ∈ fτ .
Next, to show the uniqueness, we assume that limn→∞ ∥aη − u∥ and limn→∞ ∥aη − v∥ exists.

Assuming u ̸= v. Then using Opial’s Condition, we have

lim ∥aη − u∥ = lim ∥anu − u∥

n→∞
n→∞

< lim ∥anu − v∥

n
= lim a∥η −v
n→∞

= lim ∥anv − v∥
n

< lim
n ∥anv − u∥

gives a contradiction, so u = v. It confirms the weak convergence of {aη}. □

6. Data Dependence Result

In this section we establish some data dependence result.

∞
Theorem 6. Let be an approximate
∗ operator of a contraction mapping τ . Let
∞ {aη } η=0 be an iterative
succession defines as AM for τ and defined an iterative succession {a˜η} η=0 for τ˜, as
follows constructed as, for
arbitrary a˜0 ∈ S by 1
˜cη = τ˜((1 − ℓ0 )a˜η + ℓ0 τ˜a˜η)

a˜η+1 = τ˜(ℓ1ηb˜η + (1 η− ℓ1 )τ˜b˜η ), η ∈ N
b˜ =
η η η Σ 0
where real sequence {ℓ0}∞ in [0, 1] satisfying 1 ≤ ℓ0, ∀ η ∈ N and ℓ = ∞. Aso, if = p
and τ˜p˜ = p˜ ∋ limn→∞ a˜ = p˜, then we have
η η 2 η η
9ϵ
∞ ∞ ∥p − p˜∥ ≤
Proof. Using {aη } η=0 and {a˜η } η=0 , we have 1− κ
∥cη − ˜cη ∥ = ∥τ ((1 − ℓ 0)aη + ℓ00τ aη ) − τ˜((1 − ℓ00 )a˜η + ℓ00 τ˜a˜η )∥
0
≤ ∥τ ((1 − ℓ )aη + 0ℓ τ aη ) − τ ((1 − ℓ 0)a˜η + ℓ 0τ˜a˜η )
+ T ((1 − ℓ0 )a ˜η
η +− ℓ τ˜aη˜η ) − 0τ˜((1 − ℓ )aη˜η + ℓ τ˜a ˜η )∥
≤ κ((1 − ℓ0 )∥a η η a˜ηη∥ + 0ℓ ∥τ aη − τ˜aη˜η )∥) + ϵηη
≤ κ((1 − ℓ0 )∥a − a ˜η ∥ + ℓ (∥τ a − τ a ˜η ∥ + ∥τ a ˜η − τ˜a˜η )∥)) + ϵ
≤ κ((1 − ℓ0ηη)∥aη −0 aη˜η ∥ + ℓ0η(κ(∥aη − η η
η η
0 a˜η ∥) + ϵ + ϵ)) + ϵ
≤ κ(1 − (1 − η κ)ℓ )∥a η − a ˜η
η ∥ + κℓ ϵ + ϵ.
η η
∥bη −η b˜η ∥ = ∥τ cη − τ˜˜c η η∥
≤ κ∥cη − ˜c∥ + ϵ.
In similar manner, we have
On substituting the value of ∥c˜ η − ˜cη ∥, we have
∥bη − b η ∥ ≤ κ(κ(1 − (1 − κ)ℓ0 )∥aη − a˜η ∥ + κℓ0 ϵ + ϵ) + ϵ

η η
 1
In a similar manner, we have
∥aη − a˜η ∥ = ∥τ ((1 − ℓ11 )τ bη + ℓ01 bη ) − τ˜((1 − ℓ1 )τ˜b ˜η + ℓ1 b˜η )∥
≤ ∥τ ((1 −1 ℓ )τ˜ bη + 1ℓ ˜τ bη ) − τ ((1 − 1ℓ1 )τ˜b˜ ˜η + 1ℓ1 b ˜
˜η η)∥)
+ T ((1 − ℓ )τ˜b η η + ℓ b ηη ) − τ˜((1 − ℓ )τ˜b
η η + ℓ b η
≤ κ((1 − ℓ1 )∥τη bη − T ηbη˜η1∥ + ℓ1 ∥bη − ηb˜˜ηη )∥) + ϵη ˜ η
≤ κ(ℓ1 ∥bη − bη˜η ∥ + (1 − ℓ )(∥τ bη − τ b η ∥ + ∥τ b η − τ˜b˜η )∥)) + ϵ
η η
≤ κ(κ −η (1 − κ)ℓη)∥bη − bη˜η ∥ + κℓη1 ϵ + ϵ
1

On substituting the value of ∥bη − b˜η ∥, we have

∥aη − a˜η ∥ ≤ κ(κ − (1 − κ)ℓ

η )(κ(κ(1 − (1 − κ)ℓη )∥aη − a˜η ∥ + κℓ
1 0
η ϵ + ϵ) + ϵ)
0

+ κℓ1ϵη+ ϵ.
Using {ℓ }η η=0
0 ∞
in [0, 1] and κ ∈ (0, 1) and combining the above inequalities of same theorem,we
∥aη − a˜η ∥ ≤ (1 − (1 − κ)ℓ0 )∥aη − a˜η ∥ + ℓ0 ϵ + 4ϵ
η η

have

≤ (1 − (1 − κ)ℓη0 )∥aη − a˜η∥ + ℓη0 ϵ

+ 4(1 − ℓ0 + ℓ0)ϵ
η η 9ϵ
∥a − a˜ ∥ ≤ (1 − (1 − κ)ℓ )∥a − a˜ ∥ + ℓ (1 − κ)
0 0
η η η η η
η 1−κ
Let ψη = ∥aη − a˜η∥, ϕη = (1 − ℓ η)(1 − κ), φη =
0 9ϵ
, then
1−κ from the Lemma 2.1, we have
9ϵ
0 ≤ lim sup ∥a
− a˜ ∥ ≤ lim sup
η η
n→∞ n→∞

1−κ
considering the result of Theorem 3.1 we have lim supn→∞ aη = p and by the assumption we
have that lim supn→∞ a˜η = p˜. Using the results together with
∥a 0 )∥a
κ)ℓ − a˜ ∥ ≤ (1 − (1 − 9ϵ
η η − a˜ ∥ + ℓ0 (1 − κ)
η η η
η

1−κ
1
we have, ∥p − p˜η ∥ ≤ as required.

9ϵ
 1
7. An Application

Let a Banach space (C([a, b]), ||.||∞) which is space of all continuous real valued functions on
a closed interval [a, b] a with endowed chebyshev norm ∥a − b∥∞ = max |a(t) − b(t)|. In this
t∈[a,b]
∗
section solution of a particular delay differential equation has a solution generated by AM

iteration scheme.

a′(t) = f (t, a(t), a(t − τ )), t ∈ [t0, b] (7.1)

with initial Condition

a(t) = ψ(t), t ∈ [t0 − τ, τ0]. (7.2)

We opine that the following Conditions are performed

1. t0, b ∈ R, τ > 0;

2. f ∈ C([t0, b] × R2, R);

3. ψ ∈ C([t0 − τ, b], R);

4.if 2L f (b − τ0) < 1, ∃ Lf > 0 ∋

2
|f (t, u1 , u2 ) − f (t, v1 , v2 )| ≤ Lf Σ|ui − vi |, (7.3)
η=0

∀ui, vi ∈ R, i = 1, 2, t ∈ [t0, b],

By
Theaproblem
solution (7.1)-(7.2)
of the problem (7.1)-(7.2)
can be we understand
reformulated function
in the following x ∈ofC([t
form 0 −τ, b], R)
integral TC1([t0, b], R).

ψ(t), t ∈ [t0 − τ, τ0]

a(t 0 t 0 (7.4)
 ∫t
ψ(t ) + g f (s, a(s), a(s − τ ))ds, t ∈ [t ,

b].
 2
Theorem 7. Suppose that Conditions (1)
T − (4) are satisfied. Then the problem (7.1) − (7.4) has a
unique solution in C([t0 − τ, b], R) C1([t0, b], R).
∗
Proof. Let {aη }∞η=0 be an iterative succession generative by AM iteration method (1.18) for the
operator


 ψ(t), t ∈ [t0 − τ, τ0]

τ  0 ∫t 0 (7.5)
ψ(t ) + gt f (s, a(s), a(s − τ ))ds, t ∈ [t ,

b].
Let aδ denote the fixed point of τ . We will show that aη → aδ as η → ∞. For t ∈ [t0 − τ, τ0], it

is easy to see that aη → aδ as η → ∞. For t ∈ [t0, b] we obtain

0 0
∥cη − aδ∥∞ = ∥τ ((1 − ℓη )aη + ℓητ aη) − aδ∥∞
= ∥τ ((1 − ℓ0)aη + ℓ0τ aη) − τ aδ∥
η η
0 0

≤ ∥(1 −0ℓη )aη + ℓητ aη − a0δ∥

|τ aη − τ aδ|
≤(1 −ℓη ) ∥
aη −aδ ∥ + ℓη max
∞ ∈[t0 −τ,b]
∫ t

= |ψ(τ0) f (s, a(s), a(s − τ

m (1 − ℓ )∥aη − aδ∥∞ +
0
0
η
t∈[t0 −τ,b] t
η t
∫
f (s, aδ(s), aδ(s −τ ))ds
− ψ(τ0) − t0
= (1 − ℓ )∥aη − aδ∥∞ + ℓ0
0
max |ψ(τ0) + ∫
t
η
t∈[t0 −τ,b] t
f (s, a(s), a(s − τ ))ds
η t
∫ 0

f (s, aδ(s), aδ(s −τ ))ds

t0
− ψ(τ0) − ∫ t
η η
t∈[t0 −τ,b]
m | t
=∫(1t − ℓ0)∥aη − aδ∥∞ + 0
f (s, a(s), a(s − τ
t f (s, aδ(s), aδ (s τ ))ds
− 0 − ∫ t
t
−= f(1(s, η m ∫ L|f
− aℓ0δη)∥a
(s),η a−δ(saδ−
∥∞ τ+ t∈[t0 (s,η(s)
t0 f (|a a(s),
−a(s −
aδ(s)|
max
))ds|
= (1 − ℓ0η)∥aη − aδ∥∞ + ℓ0 η
t∈[t0 −τ,b] t
 t
2
+ |aη(s − τ ) − aδ(s − τ ∫ Lf (|aη(s) − aδ(s)| + |aη(s − τ )
max
)|)ds 0

= (1 − ℓ0)∥aη − aδ∥∞ + ℓ0 η
t∈[t0 −τ,b] t
η

− aδ(s − τ

)|)ds
= (1 − ℓ0)∥aη − aδ∥∞ + ℓ0Lf ( max |aη(s) − aδ(s)| + max
t∈[t0 −τ,b]|aη(s − τ )
η η
∫t t∈[t0 −τ,b]

− aδ(s − τ )|) t ds
= (1 − ℓ0)∥aη − aδ∥∞ + 2ℓ0Lf (b − τ0)∥aη − aδ∥
η η
∥cη − aδ∥∞ = [1 − ℓ0η (1 − 2Lf (b − τ0))]∥aη − aδ∥. (7.6)

Similarly, we have

∥bη − aδ∥∞ = ∥τ cη − τ aδ∥∞

∫ t
= max |
f (s, cη(s), aη(s − τ )) − f (s, aδ(s), aδ(s − τ
t
∫t
max
≤∈[t −τ,b]
0

t |f (s, cη (s), cη (s − τ )) − f (s, aδ (s), aδ (s − τ ))|ds

∫t
= max
t∈[t0 −τ,b]

t Lf (|cη(s) − aδ(s)| + |cη(s − τ ) − aδ(s − τ )|)ds

∥bη − aδ∥∞ ≤ 2Lf (b − τ0)∥cη − aδ∥∞ (7.7)

and hence, we have

1 1
∥aη+1 − aδ∥∞ = ∥τ ((1 − ℓη )τ bη + ℓη bη) − aδ∥∞
= ∥τ ((1 − ℓ1)τ bη + ℓ1bη) − τ aδ∥
η η
1 1

≤ ∥(1
1
− ℓη )τ bη + ℓη bη − 1aδ∥
≤ℓη ∥bη −bδ ∥ + (1 −ℓ∞η ) max |τ aη − τ aδ|
∈[t −τ,b] 0 t
|ψ(τ0) + ∫ f (s, y(s), y(s − τ ))ds
= ℓ1η∥bη − aδ∥∞ + (1 − ℓ1) ηmax
t∈[t0 −τ,b] t0
∫ t f (s, a (s), a (s τ ))ds
t0 δ δ

− ψ(τ0) − − ∫ t

η
= ℓ1∥bη − aδ∥∞ + (1 − ℓ1) max t∈[t0 |ψ(τ0) t f (s,
0
a(s), a(s − τ
η
 t
2 ∫
f (s, aδ(s), aδ(s −τ ))ds
t0
− ψ(τ0) − ∫ t

|
= ℓη1∥bη − aδ∥∞ + (1 − ℓ1)η max f (s, y(s), y(s − τ
t∈[t0 −τ,b] t0
∫ t
t0 f (s, aδ(s), aδ(s τ ))ds
− − ∫ t
t
−= fℓ1η∥b
(s,η a−δ(s),
aδ∥∞aδ+(s(1−−τ ℓ))ds|
1 η
) max ∫ L|f (s,η(s)
y(s),
−y(s −
t∈[t0 t0 f (|b aδ(s)|
= ℓ ∥bη − aδ∥∞ + (1 − ℓ ) max
1 1
η η
t∈[t0 −τ,b] t0
t
+ |bη(s − τ ) − aδ(s − τ )|)ds ∫ Lf (|bη(s) − aδ(s)| + |bη(s − τ )
= ℓ1η∥bη − aδ∥∞ + (1 − ℓ1) max
η
t∈[t0 −τ,b] t0

− aδ(s − τ

)|)ds
= ℓ1∥bη − aδ∥∞ + (1 − ℓ1n)Lf ( max |bη(s) − aδ(s)| + max |aη(s − τ )
η t∈[t0 −τ,b] t∈[t0 −τ,b]
t
∫
− aδ(s − τ )|) t ds
= ℓ1∥bη − aδ∥∞ + 2(1 − ℓ1)Lf (b − τ0)∥bη − aδ∥∞
η η
1 1

∥aη+1 − aδ∥ = [ℓη + 2Lf (1 − ℓη )(b − τ0))]∥bη − aδ∥∞ (7.8)

using the equations (7.6), (7.7) and (7.8)

1 1
∥aη+1 − aδ∥∞ = [ℓη + 2Lf (1 − ℓη )(b − τ0)][2Lf (b − τ0)

([1 − ℓ0(1
η − 2Lf (b − τ0))]∥aη − aδ∥)]
0
∥aη+1 − aδ∥∞ ≤ [1 − ℓη (1 − 2Lf (b − τ0))]∥aη − aδ∥∞

Proceeding in the same manner, we have

0

∥aη − aδ∥∞ ≤ [1 − ℓη (1 − 2Lf (b − τ0))]∥aη−1 − aδ∥∞

and
0

∥aη−1 − aδ∥∞ ≤ [1 − ℓη (1 − 2Lf (b − τ0))]∥aη−2 − aδ∥∞

 2
and hence we have
Yn
∥aη+1 − aδ∥∞ ≤ [1 − ℓ0(1
k
− 2Lf (b − τ0))]∥x0 − aδ∥∞ (7.9)
k=0

where [1 − ℓ0(1 − 2Lf (b − τ0)) ∈ (0, 1) because ℓ0 ∈ (0, 1), ∀ natural numbers η. Also, since
k k

(1 − a) ≤ e −a
∀ x ∈ [0, 1], from (7.9) we can easily conclude that
∥a −a∥ ∥x0 −
η δ ≤δ ∥
∞a ∞
e(1−(2Lf
Σ
k=
k (7.10)

which led us to limn→∞ ∥aη+1 − aδ∥∞ = 0 when taking limits of both sides of equation (7.10).
References
[1] Mann, W.R., Mean value methods in iteration. Proceedings of the American Mathematical Society, 4, 506-
510 (1953)

[2] Ishikawa, S., Fixed points by a new iteration method. Proceedings of the American Mathematical Society,
44, 147-150 (1974)

[3] Noor, M.A., New approximation schemes for general variational inequalities. Journal of Mathe- matical
Analysis and Applications, 251, 217-229 (2000)

[4] Phuengrattana, W., Suantai, S., Comparison of the Rate of Convergence of Various Iterative Methods for the
Class of Weak Contractions in Banach Spaces. Thai Journal of Mathematics, 11(1), 217-226 (2012)

[5] Agarwal, R., O Regan, D. Sahu, D., Iterative construction of fixed points of nearly asymptotically
nonexpansive mappings. Journal of Nonlinear and Convex Analysis 8, 61-79 (2007)

[6] Gursoy, F., Karakaya, V., Some Convergence and Stability Results for Two New Kirk Type Hybrid Fixed
Point Iterative methods. Journal of Function Spaces doi:10.1155/2014/684191 (2014)

[7] Gursoy, F., Karakaya, V., Rhoades, B.E., Data dependence results of new multistep and S-iterative schemes
for contractive-like operators. Fixed Point Theory and Applications doi:10.1186/1687- 1812-2013-76 (2013)

[8] Hammerlin, G., Hoffmann, K. H., Numerical mathematics. Springer.

[9] Karakaya, V., Dogan, K., Gursoy, F., Erturk, M., Fixed Point of a New Three-Step Iteration method under
Contractive-Like Operators over Normed Spaces. Abstract and Applied Analysis 2013 (2013)
2
[10] Kirk, W., On successive approximations for nonexpansive mappings in Banach spaces. Glasgow Math. J.,
12, 6-9 (1971)

[11] Olatinwo, M., Owojori, O., Imoru, C., Some stability results for fixed point iteration processes.
Aus. J. Math. Anal. Appl., 3, 1-7 (2006)

[12] Schaefer, H., Uber die Methode sukzessiver Approximationen. Jahresbericht der Deutschen Mathematiker-
Vereinigung, 59, 131-140 (1957)

[13] Soltuz, S.M., Otrocol, D., The convergence of Mann iteration with delay. Mathematical Sciences Research,
11(3), 390-393 (2007)

[14] Sun, H., Xue, Z., Reconsiderations on the Equivalence of Convergence between Mann and Ishikawa Iterations
for Asymptotically Pseudocontractive Mappings. Journal of Applied Mathematics, 2013 (2013)

[15] Popescu, O., Picard iteration converges faster than Mann iteration for a class of quasiontractive operators.
Math. Commun., 12, 195-202 (2007)

[16] Sahu, D. R., Petrusel, A., Strong convergence of iterative methods by strictly pseudocontractive mappings in
Banach spaces. NonlinearAnalysis: Theory, Methods Applications, 74(17), 6012-6023 (2011)

[17] Gursoy, F., Karakaya, V., A Picard-Shybrid type iteration method for solving a differential equa- tion
withrellrded argument, ArXiv preprint arXiv:1403, 25-46 (2014)

[18] Garodia, C., Uddin, I., Solution of a nonlinear integral equation via new fixed point iterationpro- cess,
arXiv:1809.03771v1 [math.F.A] 11 Sep. (2018)

[19] Hussain, N., Ullah, K., Muhammad, A.: Fixed point approximation of Suzuki generalized non- expansive
mapping via new faster iteration process, arXiv:1802.09888v1 [math.FA] 27 Feb 2018 (2018)

[20] Ullah, k., Muhammad, A., On different results for new three step iteration process in Banach spaces,
Springer-Plus, 5, 1-15 (2016)

[21] Krasnosel’skii, M.A., Two remarks on the method of successive approximations. Uspekhi Matem-
aticheskikh Nauk, 10, 123-127 (1955)

[22] Olatinwo, M.O., Some stabilty results for two hybrid fixed point iterative methods of Kirk-Ishikawa and
Kirk-Mann type. Journal of AdvancedMathematical Studies, 1(1-2), 87-96 (2008)
[23] Soltuz, S.M., Grosan, T., Data dependence for Ishikawa iteration when dealing with contractive like
2
operators. Fixed Point Theory and Applications 2008: 242916, 1-7 (2008)

[24] Chang, S. S., Cho, Y. J. Kim, J. K., The equivalence between the convergence of modified Picard, modified
Mann, and modified Ishikawa iterations. Mathematical and Computer Modelling, 37(9), 985-991 (2003)

[25] Khan, S. H., A Picard-Mann hybrid iterative process. Fixed Point Theory and Applications, 2013(1), 1-10
(2013)

[26] Rhoades, B., Soltuz, S.M., The equivalence between Mann–Ishikawa iterations and multistep iter- ation.
Nonlinear Analysis: Theory, Methods & Applications 58, 219-228 (2004)

[27] Rhoades, B. E., Comments on two fixed point iteration methods. J. Math. Anal. Appl., 56(2), 741-750
(1976)

[28] Rhoades, B. E., Soltuz, S. M., The equivalence between the convergences of Ishikawa and Mann iterations for
an asymptotically nonexpansive in the intermediate sense and strongly successively pseudocontractive
maps. Journal of mathematical analysis and applications, 289(1), 266-278 (2004)

[29] Yuan, Q., Rhoades, B.E., Comments on the rate of convergence between Mann and Ishikawa iterations
applied to Zamfirescu operators. Fixed Point Theory and Applications (2008)

[30] Chugh, R., Kumar, V., Kumar, S., Strong Convergence of a new three step iterative scheme in Banach
spaces. American Journal of Computational Mathematics, 2, 345-357 (2012)

[31] Weng, X., Fixed point iteration for local strictly pseudocontractive mapping. Proc. Amer. Math.
Soc., 113, 727-731 (1991)

[32] Dhompongsa,S., Kirk,W.A., Panyanak,B., Nonexpansive set-valued mappings in metric and Ba- nach
spaces, J. Nonlinear Convex Anal. 8, 35-45 (2007)

[33] Kirk, W.A, Panyanak, B., A concept of convergence in geodesic spaces, Nonlinear Anal., 68 (2008)

[34] Suzuki, T., Fixed point theorems and convergence theorems for some generalized nonexpansive mappings.
J. Math. Anal. Appl. 340, 10881095 (2008)

[35] Lawaong, W., Panyanak, B., Approximating fixed points of nonexpansive nonself mappings in CAT(0)
spaces. Fixed Point Theory Appl., 2010, Article ID 367274 (2010)

[36] Abbas, M. Nazir, T., A new faster iteration process applied to constrained minimization and feasibility
problems. Matematicki Vesnik, Article (2013)
2
[37] Babu, G. V. R., Prasad, K. N. V. V. V., Mann iteration converges faster than Ishikawa iteration for the class
of Zamfirescu operators. Fixed Point Theory and Applications, 2006, 1–6, (2006)

[38] Berinde, V., Iterative Approximation of Fixed Points. Springer, Berlin (2007)

[39] Berinde, V. Picard iteration converges faster than the Mann iteration in the class of quasi- contractive
operators. Fixed Point Theory Appl., 2, 97-105 (2004)

[40] Berinde, V., Comparing Krasnoselskij and Mann iterations for Lipschitzian generalized pseudo- contractive
operators. Proceed. of Int. Conf. On Fixed Point Theory, Univ. of Valencia. Yokohama Publishers (2004)

[41] Berinde, V., Berinde, M., The fastest Krasnoselskij iteration for approximating fixed points of strictly
pseudo-contractive mappings. Carpathian J. Math, 21, 13-20 (2005)

[42] Chugh, R. Kumar, V., Stability of hybrid fixed point iterative methods of Kirk- Noor type in normed
linear space for self and nonself operators. International Journal of Contemporary Mathematical sciences 7,
1165-1184 (2012)

[43] Hussain, N., Rafiq, A., Damjanovi ´c, B., Lazovi´c, R., On rate of convergence of various iterative schemes.
Fixed Point Theory and Applications 2011(1), 1-6 (2011)

[44] Phuengrattana, W., Suantai, S., On the rate of convergence of Mann, Ishikawa, Noor and SP- iterations for
continuous functions on an arbitrary interval. Journal of Computational and Applied Mathematics, 235,
3006-3014 (2011)

[45] Gursoy, F., Karakaya, V., Rhoades, B.E., Some Convergence and Stability Results for the Kirk Multistep
and Kirk-SP Fixed Point Iterative methods. Abstract and Applied Analysis doi:10.1155/2014/806537 (2014)

[46] Hussain, N., Chugh, R., Kumar, V., Rafiq, A., On the rate of convergence of Kirk-type iterative schemes.
Journal of Applied Mathematics 2012 (2012)

[47] Karahan, I. Ozdemir, M., A general iterative method for approximation of fixed points and their
applications. Advances in Fixed Point Theory 3(3) (2013)

[48] Karakaya, V., G ¨ursoy, F., Ert¨urk, M., Comparison of The Speed of Convergence Among Various Iterative
Schemes. arXiv preprint arXiv:1402.6080. ( 2014)

[49] Picard, E., Memoire sur la theorie des equations aux derivees partielles et la methode des approx- imations
successives, Journal de Mathematiques pures et appliquees, 6, 145-210 (1890)
[50] Karakaya, V., Gursoy, F., Dogan, K., Erturk, M., Data Dependence Results for Multistep and Iterative
2
Schemes in the Class of Contractive-Like Operators. Abstract and Applied Analysis
doi:10.1155/2013/381980. (2103)

[51] Olatinwo, M., Some stability results for two hybrid fixed point iterative methods in normed linear space.
Matematique Vesnik, 61, 247-256 (2009)

[52] Sahu, D. R., Applications of the S-iteration process to constrained minimization problems and split
feasibility problems. Fixed Point Theory, 12(1), 187-204 (2011)

[53] Soltuz, S. M., Otrocol, D., Classical results via Mann-Ishikawa iteration. Revue d’Analyse Nu- merique de
l’Approximation, 36(2) (2007)

[54] Thianwan, S., Common fixed points of new iterations for two asymptotically nonexpansive nonself-
mappings in a Banach space. Journal of Computational and Applied Mathematics, 224, 688-695 (2009)

[55] Xue, Z., The comparison of the convergence speed between Picard, Mann, Krasnoselskij and Ishikawa
iterations in Banach spaces. Fixed Point Theory Appl. (2008)

[56] Tan, K. K. Xu, H. K., Approximating fixed points of nonexpansive mappings by the Ishikawa
iterationprocess, J. Math. Anal. Appl., 178, 301-308 (1993)

[57] Saluja, G.S., Postolache, M., Three-step iterations for total asymptotically nonexpansive mappings in
CAT(0) spaces. Filomat, 31(5), 1317-1330 (2017)

[58] Abbas, M., Khan, S.H., Postolache, M., Existence and approximation results for SKC map- pings in CAT(0)
spaces. J. Inequal. Appl., 2014, Article ID 212 (2014)

[59] Dhompongsa, S., Panyanak, B., On -convergence theorem in CAT(0) spaces. Comput. Math.
Appl., 56, 2572-2579 (2008)

[60] Bridson, M., Hea inger, A., Metric Space of Non-positive Curvature. Springer, Berlin (1999) [61]Basarir,

M., Sahin, A., On the strong and Delta-convergence of S-iteration process for generalized
nonexpansive mappings on CAT(0) space. Thai J. Math., 12, 549-559 (2014)

[62] Takahashi, T., A convexity in metric spaces and nonexpansive mappings. Kodai Math. Semin.
Rep., 22, 142-149 (1970)

[63] Ullah, K., Muhammad,A., Some convergence results using K iteration process in CAT(0) spaces, Fixed
Point Theory Appl., 11, 1-10 (2018)
2