Journal of Applied Mathematics

Volume 2012 (2012), Article ID 526503, 22 pages

doi:10.1155/2012/526503

Research Article

On the Rate of Convergence of Kirk-Type Iterative Schemes

Nawab Hussain,¹ Renu Chugh,² Vivek Kumar,² and Arif Rafiq³

¹Department of Mathematics, King Abdulaziz University, P.O. Box 80203, Jeddah 21589, Saudi Arabia

²Department of Mathematics, M. D. University, Rohtak 124001, India

³Hajvery University, 43-52 Industrial Area, Gulberg-III, Lahore, Pakistan

Received 29 January 2012; Revised 21 April 2012; Accepted 14 May 2012

Academic Editor: B. V. Rathish Kumar

Copyright © 2012 Nawab Hussain et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

The purpose of this paper is to introduce Kirk-type new iterative schemes called Kirk-SP and Kirk-CR schemes and to study the convergence of these iterative schemes by employing certain quasi-contractive operators. By taking an example, we will compare Kirk-SP, Kirk-CR, Kirk-Mann, Kirk-Ishikawa, and Kirk-Noor iterative schemes for aforementioned class of operators. Also, using computer programs in C++, we compare the above-mentioned iterative schemes through examples of increasing, decreasing, sublinear, superlinear, and oscillatory functions.

1. Introduction and Preliminaries

There is a close relationship between the problem of solving a nonlinear equation and that of approximating fixed points of a corresponding contractive-type operator. Consequently, there is a theoretical and practical interest in approximating fixed points of various contractive-type operators. Let be a complete metric space and a selfmap of . Suppose that is the set of fixed points of . There are several iterative schemes in the literature for which the fixed points of operators have been approximated over the years by various authors. In a complete metric space, the Picard iterative scheme is defined by

which is used to approximate the fixed points of mappings satisfying the inequality:

for all and . Condition (1.2) is called Banach’s contraction condition.

The following iteration schemes are now well known:

where is a sequences of positive numbers in , due to Mann [1].

where is a sequences of positive numbers in , due to Kirk [2].

where and are sequences of positive numbers in , due to Ishikawa [3].

where , , and are sequences of positive numbers in , due to Noor [4].

In [5], Olatinwo introduced the Kirk-Mann and Kirk-Ishikawa iterative schemes as follows:

where , , , , , and , are fixed integers, called as Kirk-Ishikawa iteration scheme:

where , , , and is a fixed integer and is called as Kirk-Mann iteration scheme.

However, from [6], the Kirk-Noor iterative scheme is given by

In [7], Phuengrattana and Suantai defined the SP iteration scheme as follows:

where , , and are sequences of positive numbers in .

Recently, Chugh and Kumar introduced the following iteration scheme [8]:

where , , and are sequences of positive numbers in .

Remarks 1. (1) If , then (1.6) reduces to the Ishikawa iteration scheme (1.5).

(2) If , then (1.6) reduces to the Mann iteration scheme (1.3).

(3) If , then (1.5) reduces to the Mann iteration scheme (1.3).

(4) If , then (1.10) reduces to the Mann iteration scheme (1.3).

In [9], Zamfirescu obtained the following interesting fixed point theorem.

Theorem 1.1. Let be a complete metric space and a mapping for which there exists real numbers , , and c satisfying such that for each pair at least one of the following conditions holds:

Then, has a unique fixed point and the Picard iteration scheme defined by (1.1) converges to for any arbitrary but fixed .

The operators satisfying the condition (1.12) are called Zamfirescu operators.

Berinde in [10] introduced a new class of operators on an arbitrary Banach space and satisfying

for all and . He proved that this class is wider than the class of Zamfirescu operators and used the Ishikawa iteration scheme to approximate fixed points of this class of operators in an arbitrary Banach space given in the form of following theorem.

Theorem 1.2 (see [10]). Let be a nonempty closed convex subset of an arbitrary Banach space and a mapping satisfying (1.13). Let be defined through the Ishikawa iteration scheme (1.5) and , where , are sequences of positive real numbers in with satisfying . Then, converges strongly to the fixed point of .

However, in [11], Rafiq studied the convergence of the Noor iteration scheme [4] involving quasi-contractive operators.

Also several authors [11–16] have studied the equivalence between different iterative schemes: Şolutz [13, 14] proved that Picard, Mann, Ishikawa, and Noor iteration schemes are equilvalent for quasi-contractive operators. Recently, Chugh and Kumar [17] proved that, for quasi-contractive operators satisfying (1.13), Picard, Mann, Ishikawa, Noor, and SP iterative schemes are equivalent.

Fixed-point iterative schemes are designed to be applied in solving equations arising in physical formulation but there is no systematic study of numerical aspects of these iterative schemes. In computational mathematics, it is of vital interest to know which of the given iterative scheme converges faster to a desired solution, commonly known as rate of convergence. Rhoades in [18] compared the Mann and Ishikawa iterative schemes by concerning their rate of convergences. He illustrated the difference in the rate of convergence for increasing and deceasing functions (see also [19]). However, Olatinwo [5] proved the stability of Kirk-Mann and Kirk-Ishikawa iterative schemes for the following operator which is more general than (1.13). Indeed, he employed the following contractive definition: there exist and a monotone increasing function with , such that

Motivated by the work of Olatinow [5] and Phuengrattana and Suantai [7], in this paper, we introduce the Kirk-CR and Kirk-SP iterative schemes and study the strong convergence of these iterative schemes for quasi-contractive operators satisfying (1.14). Moreover, by using C++ programming, comparison for rate of convergences between the above-mentioned Kirk type iterative schemes is also shown for increasing, decreasing, sublinear, superlinear, and oscillatory functions, respectively.

2. Main Results

We will need the following lemmas and definition in the sequel.

Lemma 2.1 (see [10]). If is a real number such that and is a sequence of nonnegative numbers such that , then, for any sequence of positive numbers satisfying

one has .

Lemma 2.2 (see [5]). Let be a normed linear space and let be a selfmap of satisfying (1.13). Let be a subadditive, monotone increasing function such that , , , . Then, for all , and for all ,

Definition 2.3 (see [20]). Suppose and are two real convergent sequences with limits and , respectively. Then, is said to converge faster than if

Now, we define Kirk-SP and Kirk-CR iterative schemes as follows. Let be a Banach space, a selfmap of and . Then, the sequence defined by

is called Kirk-SP iterative scheme and the sequence defined by

is called Kirk-CR iterative scheme, where , , and are fixed integers with and , , are sequences in satisfying , .

Remarks 2. (5) Putting in (2.4), we obtain the Kirk-Mann iterative scheme (1.9).

(6) Putting in (2.4), we get usual Mann iterative scheme (1.3). With .

(7) Putting , and in (2.4), we obtain the usual Kirk’s iterative scheme (1.4).

(8) Putting in (2.4) and (2.5), we obtain the SP (1.10) and CR (1.11) iterative schemes, respectively.

We now prove our main results.

Theorem 2.4. Let be a normed linear space and a selfmap of satisfying the contractive condition (1.14) and a subadditive monotone increasing function such that and . Let and be the Kirk-SP iterative scheme defined by (2.4). Suppose that has a fixed point . Then, the Kirk-SP iterative scheme converges strongly to .

Proof. Using Kirk-SP iterative scheme (2.4) and Lemma 2.1, we have

Now, we have the following estimates:

It follows from (2.6), (2.7) that

Since and , hence

Using (2.9) and Lemma 2.1, (2.8) yields . Thus, Kirk-SP iterative scheme converges strongly to .

Theorem 2.5. Let be a normed linear space and a selfmap of satisfying the contractive condition (1.14) and a subadditive monotone increasing function such that and . Let and be the Kirk-CR iterative scheme defined by (2.5). Suppose that has a fixed point . Then, the Kirk-CR iterative scheme converges strongly to .

Proof. Using Kirk-CR iterative scheme (2.5) and Lemma 2.2, we have

Now, we have the following estimates:

It follows from (2.10), (2.11) that

Since and with , hence

Using (2.13) and Lemma 2.1, (2.12) yields . Thus, Kirk-CR iterative scheme converges strongly to .

Theorem 2.6. Let be a normed linear space and a selfmap of satisfying the contractive condition (1.14) and a subadditive monotone increasing function such that and , . Let and be the Kirk-Noor iterative scheme defined by (1.9). Suppose that has a fixed point . Then, the Kirk-Noor iterative scheme converges strongly to .

Proof. Using Kirk-Noor iterative scheme (1.9) and Lemma 2.2, we have

Now, we have the following estimates:

It follows from (2.14), (2.15) that

Using Lemma (2.2), (2.16) yields . Thus, Kirk-Noor iterative scheme converges strongly to .

3. Results on Fastness of Kirk-Type Iterative Schemes for Quasi-Contractive Operators

In [20], Berinde showed that Picard iteration is faster than Mann iteration for quasi-contractive operators satisfying (1.14). In [21], Qing and Rhoades by taking example showed that Ishikawa iteration is faster than Mann iteration for a certain quasi-contractive operator. Ciric et al. [22], by providing an example, showed that Noor iterative scheme can be faster than Mann and Ishikawa iterative schemes for some quasi-contractive operator. Recently, Hussian et al. [23], provided an example of a quasi-contractive operator for which the iterative scheme due to Agarwal et al. is faster than Mann and Ishikawa iterative schemes.

Now, by providing Example 3.1, we prove that the decreasing order of Kirk-type iterative schemes is as follows: Kirk-SP, Kirk-CR, Kirk-Noor, Kirk-Ishikawa, and Kirk-Mann iterative scheme.

However, after interchanging the parameters the decreasing order of Kirk-type iterative schemes is as follows: Kirk-CR, Kirk-SP, Kirk-Noor, Kirk-Ishikawa, and Kirk-Mann.

Example 3.1. Let for some and .

It is clear that is a quasi-contractive operator satisfying (1.14) with a unique fixed point 0. Also, it is easy to see that Example 3.1 satisfies all the conditions of Theorems 2.4, 2.5, and 2.6.

Proof. Let and with . Then, for Kirk-Mann and Kirk-Ishikawa iterative schemes, we have

Now, consider

It is easy to see that

Hence, .

Therefore, by Definition 2.3, Kirk-Ishikawa iterative scheme converges faster than Kirk-Mann iterative scheme to the fixed point 0 of .

Similarly,

with

implies

Therefore, by Definition 2.3, Kirk-Noor iterative scheme converges faster than Kirk-Ishikawa iterative scheme to the fixed point 0 of .

Again, similarly

with

implies

It shows Kirk-CR iterative scheme converges faster than Kirk-Noor iterative scheme to the fixed point 0 of .

Again, let . Then, for Kirk-CR iterative scheme, we have

So,

It is easy to see that

Hence, we have . It shows Kirk-SP iterative scheme converges faster than Kirk-CR iterative scheme to the fixed point 0 of .

The following example shows comparison of simple iterative schemes with their corresponding Kirk-type iterative schemes.

Example 3.2. Let , for some and . It is clear that is a quasi-contractive operator satisfying (1.14) with a unique fixed point 0. Also, it is easy to see that Example 3.2 satisfies all the conditions of Theorems 2.4, 2.5, and 2.6. We will show the following:

(1)Kirk-Mann iterative scheme is faster than Mann iterative scheme, (2)Kirk-Ishikawa iterative scheme is faster than Ishikawa iterative scheme, (3)Kirk-Noor iterative scheme is faster than Noor iterative scheme, (4)Kirk-SP iterative scheme is faster than SP iterative scheme,(5)Kirk-CR iterative scheme is faster than CR iterative scheme.

Proof. Let and with . Then, for Kirk-Mann and Mann iterative schemes, we have

Now, consider

It is easy to see that

Hence, we have .

It shows that Kirk-Mann iterative scheme converges faster than Mann iterative scheme to the fixed point 0 of . Similarly,

with

implies

It shows that Kirk-Ishikawa iterative scheme converges faster than Ishikawa iterative scheme to the fixed point 0 of .

Again, similarly,

with

implies

It shows that Kirk-Noor iterative scheme converges faster than Noor iterative scheme to the fixed point 0 of .

Again,

with

implies

It shows that Kirk-SP iterative scheme converges faster than SP iterative scheme to the fixed point 0 of .

Again,

with

implies

It shows that Kirk-CR iterative scheme converges faster than CR iterative scheme to the fixed point 0 of .

4. Applications

In this section, with the help of computer programs in C++, we compare the rate of convergence of Kirk-type iterative schemes, through examples. The outcome is listed in the form of Tables 1, 2, 3, 4, and 5, by taking , and , for all iterative schemes.

Table 1: Decreasing cum sublinear functions.

Kirk-CR iteration
Kirk-SP iteration
Kirk-Noor iteration
Kirk-Mann iteration
Kirk-Ishikawa iteration

0
0.69857
0.710807
0.69857
0.723726
0.69857
0.710384
0.69857
0.710418
0.69857
0.698227

1
0.800542
0.75984
0.78799
0.75565
0.800941
0.770859
0.800909
0.765142
0.812157
0.779333

2
0.7492
0.754819
0.754002
0.754877
0.736164
0.752595
0.743004
0.75401
0.725717
0.750854

3
0.754944
0.754878
0.754878
0.754878
0.75745
0.754879
0.755859
0.754812
0.759396
0.754853

4
0.754878
0.754878
0.754878
0.754878
0.754877
0.754878
0.754952
0.754866
0.754905
0.754875

5
0.754878
0.754878
0.754878
0.754878
0.754878
0.754878
0.754891
0.754875
0.754881
0.754877

6
0.754878
0.754878
0.754878
0.754878
0.754878
0.754878
0.754881
0.754877
0.754878
0.754878

7
0.754878
0.754878
0.754878
0.754878
0.754878
0.754878
0.754879
0.754877
0.754878
0.754878

8
0.754878
0.754878
0.754878
0.754878
0.754878
0.754878
0.754878
0.754878
0.754878
0.754878

9
0.754878
0.754878
0.754878
0.754878
0.754878
0.754878
0.754878
0.754878
0.754878
0.754878

10
0.754878
0.754878
0.754878
0.754878
0.754878
0.754878
0.754878
0.754878
0.754878
0.754878

Table 2: Increasing functions.

Kirk-CR iteration
Kirk-SP iteration
Kirk-Noor iteration
Kirk-Mann iteration
Kirk-Ishikawa iteration

0
1.103589
1.116858
1.103589
1.17464
1.103589
1.451792
1.103589
1.241473
1.103589
1.365883

1
1.142723
1.158453
1.165002
1.15863
1.300429
0.997618
1.193272
1.158697
1.253254
1.076407

2
1.158561
1.158631
1.15863
1.15863
1.102871
1.189602
1.158657
1.158641
1.128293
1.167741

3
1.158631
1.15863
1.15863
1.15863
1.171096
1.15929
1.158635
1.158633
1.162237
1.159321

4
1.15863
1.15863
1.15863
1.15863
1.15889
1.158731
1.158632
1.158631
1.158902
1.158763

5
1.15863
1.15863
1.15863
1.15863
1.15867
1.158655
1.158631
1.158631
1.158682
1.158667

6
1.15863
1.15863
1.15863
1.15863
1.15864
1.158638
1.158631
1.158631
1.158645
1.158643

7
1.15863
1.15863
1.15863
1.15863
1.158633
1.158633
1.158631
1.158631
1.158635
1.158635

8
1.15863
1.15863
1.15863
1.15863
1.158632
1.158632
1.15863
1.15863
1.158632
1.158632

9
1.15863
1.15863
1.15863
1.15863
1.158631
1.158631
1.15863
1.15863
1.158631
1.158631

10
1.15863
1.15863
1.15863
1.15863
1.158631
1.158631
1.15863
1.15863
1.158631
1.158631

11
1.15863
1.15863
1.15863
1.15863
1.158631
1.158631
1.15863
1.15863
1.158631
1.158631

12
1.15863
1.15863
1.15863
1.15863
1.15863
1.15863
1.15863
1.15863
1.158631
1.158631

13
1.15863
1.15863
1.15863
1.15863
1.15863
1.15863
1.15863
1.15863
1.15863
1.158631

14
1.15863
1.15863
1.15863
1.15863
1.15863
1.15863
1.15863
1.15863
1.15863
1.15863

15
1.15863
1.15863
1.15863
1.15863
1.15863
1.15863
1.15863
1.15863
1.15863
1.15863

Table 3: Functions with multiple zeros.

Kirk-CR iteration
Kirk-SP iteration
Kirk-Noor iteration
Kirk-Mann iteration
Kirk-Ishikawa iteration

0
0.01
0.129763
0.01
0.181407
0.01
0.194268
0.01
0.0901
0.01
−0.04247

1
0.757312
0.419604
0.670095
0.38479
0.649205
0.487941
0.827918
0.569045
1.086743
0.695256

2
0.336859
0.382104
0.378484
0.381966
0.262204
0.363223
0.185722
0.402006
0.092869
0.341163

3
0.381795
0.381966
0.381966
0.381966
0.405485
0.381913
0.357596
0.385139
0.434066
0.381282

4
0.381965
0.381966
0.381966
0.381966
0.382031
0.38196
0.378054
0.382721
0.382812
0.381873

5
0.381966
0.381966
0.381966
0.381966
0.381974
0.381965
0.381033
0.382195
0.382081
0.381946

6
0.381966
0.381966
0.381966
0.381966
0.381968
0.381966
0.381683
0.382047
0.381991
0.38196

7
0.381966
0.381966
0.381966
0.381966
0.381966
0.381966
0.381866
0.381998
0.381973
0.381964

8
0.381966
0.381966
0.381966
0.381966
0.381966
0.381966
0.381926
0.38198
0.381968
0.381965

9
0.381966
0.381966
0.381966
0.381966
0.381966
0.381966
0.381949
0.381972
0.381967
0.381966

10
0.381966
0.381966
0.381966
0.381966
0.381966
0.381966
0.381958
0.381969
0.381966
0.381966

11
0.381966
0.381966
0.381966
0.381966
0.381966
0.381966
0.381962
0.381968
0.381966
0.381966

12
0.381966
0.381966
0.381966
0.381966
0.381966
0.381966
0.381964
0.381967
0.381966
0.381966

13
0.381966
0.381966
0.381966
0.381966
0.381966
0.381966
0.381965
0.381966
0.381966
0.381966

14
0.381966
0.381966
0.381966
0.381966
0.381966
0.381966
0.381965
0.381966
0.381966
0.381966

15
0.381966
0.381966
0.381966
0.381966
0.381966
0.381966
0.381966
0.381966
0.381966
0.381966

Table 4: Superlinear functions.

Kirk-CR iteration
Kirk-SP iteration
Kirk-Noor iteration
Kirk-Mann iteration
Kirk-Ishikawa iteration

0
0.988
0.994372
0.988
1.083583
0.988
1.092828
0.988
1.087853
0.988
1.093597

1
0.999968
0.999996
0.994182
0.993672
0.992983
0.960331
0.993638
0.959083
0.992879
0.95975

2
1
1
0.999959
1.000023
0.998302
1.006115
0.998189
1.005282
0.998249
1.006211

3
1
1
1
1
0.999963
1
0.999972
0.999986
0.999962
1

4
1
1
1
1
1
1
1
0.999999
1

5
1
1
1
1
1
1
1
1
1
1

6
1
1
1
1
1
1
1
1
1
1

7
1
1
1
1
1
1
1
1
1
1

8
1
1
1
1
1
1
1
1
1
1

9
1
1
1
1
1
1
1
1
1
1

10
1
1
1
1
1
1
1
1
1
1

Table 5: Oscillatory functions.

Kirk-CR iteration
Kirk-SP iteration
Kirk-Noor iteration
Kirk-Mann iteration
Kirk-Ishikawa iteration

0
0.25
0.25
0.25
0.25
0.25
0.25
0.25
0.25
0.25
0.25

1
4
1.294298
4
0.966905
4
1.768962
4
2.90165
4
2.191915

2
0.772619
0.995245
1.034228
1.000136
0.565303
0.889831
0.344631
1.425355
0.456222
0.833093

3
1.004778
1
0.999864
1
1.123808
1
0.70158
1.063467
1.200346
1.000137

4
1
1
1
1
1
1
0.94032
1.008394
0.999863
1.000015

5
1
1
1
1
1
1
0.991676
1.001569
0.999985
1.000003

6
1
1
1
1
1
1
0.998434
1.000384
0.999997
1.000001

7
1
1
1
1
1
1
0.999616
1.000112
0.999999
1

8
1
1
1
1
1
1
0.999888
1.000037
1
1

9
1
1
1
1
1
1
0.999963
1.000014
1
1

10
1
1
1
1
1
1
0.999986
1.000005
1
1

11
1
1
1
1
1
1
0.999995
1.000002
1
1

12
1
1
1
1
1
1
0.999998
1.000001
1
1

13
1
1
1
1
1
1
0.999999
1
1
1

14
1
1
1
1
1
1
1
1
1
1

4.1. Decreasing Cum Sublinear Functions

The function defined by is a decreasing and sublinear function. By taking initial approximation , the comparison of convergence of the above-mentioned iterative schemes to the exact fixed point is listed in Table 1.

4.2. Increasing Functions

Let be defined by . Then, is an increasing function. By taking initial approximation , the comparison of convergence of the above-mentioned iterative schemes to the exact fixed point of is listed in Table 2.

4.3. Functions with Multiple Zeros

The function defined by is a function with multiple zeros. By taking initial approximation , the comparison of convergence of the above-mentioned iterative schemes to the exact fixed point is listed in Table 3.

4.4. Superlinear Functions with Multiple Roots

The function defined by is a superlinear function with multiple real roots. By taking initial approximation , the comparison of convergence of the above-mentioned iterative schemes to the exact fixed point is listed in Table 4.

For detailed study, these programs are again executed after changing the parameters and some observations are made as given below.

4.5. Oscillatory Functions

The function defined by is an oscillatory function. By taking initial approximation , the comparison of convergence of the above-mentioned iterative schemes to the exact fixed point is listed in Table 5.

5. Observations

5.1. Decreasing Functions

(1) Taking initial guess (away from the fixed point), Kirk-Mann iterative scheme converges in 9 iterations, Kirk-Ishikawa scheme converges in 9 iterations, Kirk-Noor iterative scheme converges in 6 iterations, Kirk-CR and the Kirk-SP iterative schemes converge in 5 iterations.

(2) Taking and , we observe that Kirk-Mann iterative scheme converges in 10 iterations, Kirk-Ishikawa iterative scheme converges in 12 iteration, Kirk-Noor scheme converges in 12 iterations, Kirk-CR iterative scheme converges in 8 iterations, and Kirk-SP iterative scheme converges in 6 iterations.

5.2. Increasing Functions

(1) Taking initial guess (away from the fixed point), Kirk-Mann iterative scheme converges in 19 iterations, Kirk-Ishikawa iterative scheme converges in 16 iterations, Kirk-Noor iterative scheme converges in 15 iterations, Kirk-CR iterative scheme converges in 5 iterations, and Kirk-SP iterative scheme converges in 3 iterations.

(2) Taking and , we observe that Kirk-Mann iterative scheme converges in 6 iterations, Kirk-Ishikawa iterative scheme converges in 11 iterations, Kirk-Noor iterative scheme converges in 13 iterations, Kirk-CR iterative scheme converges in 5 iterations, and Kirk-SP iterative scheme converges in 4 iterations.

5.3. Functions with Multiple Zeros

(1) Taking initial guess (near the fixed point), Kirk-Mann iterative scheme converges in 12 iterations, Kirk-Ishikawa iterative scheme converges in 10 iterations, Kirk-Noor iterative scheme converges in 8 iterations, Kirk-CR iterative scheme converges in 5 iterations and the Kirk-SP iterative scheme converges in 4 iterations.

(2) Taking and , we observe that Kirk-Mann iterative scheme converges in 9 iterations, Kirk-Ishikawa iterative scheme converges in 13 iterations, Kirk-Noor iterative scheme converges in 13 iterations, Kirk-CR iterative scheme converges in 8 iterations, and Kirk-SP iterative scheme converges in 6 iterations.

5.4. Superlinear Functions with Multiple Roots

(1) Taking initial guess (away from the fixed point), Kirk-Mann, Kirk-Ishikawa and Kirk-Noor iterative schemes converge in 5 iterations while Kirk-CR and the Kirk-SP schemes converge in 4 iterations.

(2) Taking and , we observe that Kirk-Mann, Kirk-Ishikawa, and Kirk-Noor schemes converge in 11 iterations while Kirk-CR iterative scheme converges in 4 iterations, and Kirk-SP iterative scheme converges in 3 iterations.

5.5. Oscillatory Functions

(1) Taking initial guess (near the fixed point), Kirk-Mann iterative scheme converges in 9 iterations, Kirk-Ishikawa, iterative scheme converges in 6 iterations while Kirk-Noor, Kirk-CR, and Kirk-SP iterative schemes converge in 5 iterations.

(2) Taking and , we observe that Kirk-Mann iterative scheme converges in 12 iterations, Kirk-Ishikawa iterative scheme converges in 15 iterations, Kirk-Noor iterative scheme converges in 13 iterations, Kirk-CR iterative scheme converges in 9 iterations, and Kirk-SP iterative scheme converges in 8 iterations.

6. Conclusions

The speed of iterative schemes depends on , , and . From Tables 1–5 and obsevations made in Section 4, we conclude the following.

6.1. Decreasing Cum Sublinear Functions

(1) Decreasing order of rate of convergence of Kirk-type iterative schemes is as follows:

 Kirk-SP, Kirk-CR, Kirk-Noor, Kirk-Ishikawa, and Kirk-Mann.

(2) For initial guess away from the fixed point, Kirk-SP and Kirk-Ishikawa iterative schemes show an increase while Kirk-CR, Kirk-Noor, and Kirk-Mann iterative schemes show no change in the number of iterations to converge.

6.2. Increasing Functions

(1) Decreasing order of rate of convergence of Kirk-type iterative schemes is as follows:

 Kirk-SP, Kirk-CR, Kirk-Mann, Kirk-Noor, and Kirk-Ishikawa.

(2) For initial guess away from the fixed point, the number of iterations increases in case of Kirk-Mann, Kirk-Noor, and Kirk-Ishikawa iterative schemes. However, Kirk-SP and Kirk-CR schemes show no change in the number of iterations.

6.3. Functions with Multiple Zeros

(1) Decreasing order of rate of convergence of Kirk-type iterative schemes is as follows:

 Kirk-SP, Kirk-CR, Kirk-Noor, Kirk-Ishikwa, and Kirk-Mann.

(2) For initial guess near the fixed point, Kirk-CR, Kirk-Ishikawa, and Kirk-Mann iterative schemes show a decrease while Kirk-Noor and Kirk-SP iterative schemes show no change in the number of iterations to converge.

6.4. Superlinear Functions

(1) Decreasing order of rate of convergence of Kirk-type iterative schemes is as follows:

 Kirk-CR, Kirk-SP, Kirk-Noor, and Kirk-Mann, while Kirk-Noor and Kirk-Ishikawa iterative schemes show equivalence.

(2) For initial guess near the fixed point, Kirk-CR iterative scheme show an increase, while Kirk-SP, Kirk-Ishikawa, Kirk-Mann, and Kirk-Noor iterative schemes show no change in the number of iterations to converge.

6.5. Oscillatory Functions

(1) Decreasing order of rate of convergence of Kirk type iterative schemes is as follows:

 Kirk-CR, Kirk-Ishikawa, and Kirk-Mann, while Kirk-CR, Kirk-SP, and Kirk-Noor iterative schemes show equivalence.

(2) For initial guess near the fixed point, Kirk-Mann and Kirk-Ishikawa iterative schemes show a decrease, while Kirk-CR, Kirk-SP, and Kirk-Noor iterative schemes show no change in the number of iterations to converge.

Remarks 3. (9) It is observed from experiments that, on taking , the convergence speed of each iterative scheme decreases for all type of the above-mentioned functions. Convergence speed is the highest for .

(10) In Section 4, we have shown comparison between Kirk-type iterative schemes for decreasing functions. However, for decreasing functions of the form , Kirk-type iterative schemes may not converge.

(11) Hence, Kirk-SP and Kirk-CR iterative schemes have a good potential for further applications.

Acknowledgments

The authors would like to thank the referees for valuable suggestions on the paper and N. Hussain gratefully acknowledges the support from the Deanship of Scientific Research (DSR) at King Abdulaziz University (KAU) during this research.

References

W. R. Mann, “Mean value methods in iteration,” Proceedings of the American Mathematical Society, vol. 4, pp. 506–510, 1953.

W. A. Kirk, “On successive approximations for nonexpansive mappings in Banach spaces,” Glasgow Mathematical Journal, vol. 12, pp. 6–9, 1971.

S. Ishikawa, “Fixed points by a new iteration method,” Proceedings of the American Mathematical Society, vol. 44, pp. 147–150, 1974.

M. A. Noor, “New approximation schemes for general variational inequalities,” Journal of Mathematical Analysis and Applications, vol. 251, no. 1, pp. 217–229, 2000.

M. O. Olatinwo, “Some stability results for two hybrid fixed point iterative algorithms in normed linear space,” Matematichki Vesnik, vol. 61, no. 4, pp. 247–256, 2009.

R. Chugh and V. Kumar, “Stability of hybrid fixed point iterative algorithms of Kirk-Noor type in normed linear space for self and nonself operators,” International Journal of Contemporary Mathematical sciences, vol. 7, no. 24, pp. 1165–1184, 2012.

W. Phuengrattana and S. Suantai, “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, vol. 235, no. 9, pp. 3006–3014, 2011.

R. Chugh, V. Kumar, and S. Kumar, “Strong Convergence of a new three step iterative scheme in Banach spaces,” (communicated)

T. Zamfirescu, “Fix point theorems in metric spaces,” Archiv der Mathematik, vol. 23, pp. 292–298, 1972.

V. Berinde, “On the convergence of the Ishikawa iteration in the class of quasi contractive operators,” Acta Mathematica Universitatis Comenianae, vol. 73, no. 1, pp. 119–126, 2004.

A. Rafiq, “On the convergence of the three-step iteration process in the class of quasi-contractive operators,” Acta Mathematica, vol. 22, no. 3, pp. 305–309, 2006.

V. Berinde, Iterative Approximation of Fixed Points, Lecture Notes in Mathematics, Springer, Berlin, Germany, 2007.

S. M. Şolutz, “The equivalence of Picard, Mann and Ishikawa iterations dealing with quasi-contractive operators,” Mathematical Communications, vol. 10, no. 1, pp. 81–88, 2005.

S. M. Şolutz, “The equivalence between Krasnoselskij, Mann, Ishikawa, Noor and multistep iterations,” Mathematical Communications, vol. 12, no. 1, pp. 53–61, 2007.

B. E. Rhoades and S. M. Şolutz, “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, vol. 289, no. 1, pp. 266–278, 2004.

B. E. Rhoades and S. M. Şoltuz, “The equivalence between Mann-Ishikawa iterations and multistep iteration,” Nonlinear Analysis, vol. 58, no. 1-2, pp. 219–228, 2004.

R. Chugh and V. Kumar, “Strong convergence of SP iterative scheme for quasi-contractive operators,” International Journal of Computer Applications, vol. 31, no. 5, pp. 21–27, 2011.

B. E. Rhoades, “Comments on two fixed point iteration methods,” Journal of Mathematical Analysis and Applications, vol. 56, no. 3, pp. 741–750, 1976.

S. L. Singh, “A new approach in numerical praxis,” Progress of Mathematics, vol. 32, no. 2, pp. 75–89, 1998.

V. Berinde, “Picard iteration converges faster than Mann iteration for a class of quasi-contractive operators,” Fixed Point Theory and Applications, no. 2, pp. 97–105, 2004.

Y. Qing and B. E. Rhoades, “Comments on the rate of convergence between Mann and Ishikawa iterations applied to Zamfirescu operators,” Fixed Point Theory and Applications, vol. 2008, Article ID 387504, 3 pages, 2008.

L. B. Ciric, B. S. Lee, and A. Rafiq, “Faster Noor iterations,” Indian Journal of Mathematics, vol. 52, no. 3, pp. 429–436, 2010.

N. Hussain, A. Rafiq, B. Damjanović, and R. Lazović, “On rate of convergence of various iterative schemes,” Fixed Point Theory and Applications, vol. 45, 6 pages, 2011.