Skip to main content

On the convergence of an iteration method for continuous mappings on an arbitrary interval

Abstract

In this paper, we consider an iterative method for finding a fixed point of continuous mappings on an arbitrary interval. Then, we give the necessary and sufficient conditions for the convergence of the proposed iterative methods for continuous mappings on an arbitrary interval. We also compare the rate of convergence between iteration methods. Finally, we provide a numerical example which supports our theoretical results.

MSC:26A18, 47H10, 54C05.

1 Introduction

Let E be a closed interval on the real line and let f:EE be a continuous mapping. A point pE is a fixed point of f if f(p)=p. We denote by F(f) the set of fixed points of f. It is known that if E is also bounded, then F(f) is nonempty.

There are many iterative methods for finding a fixed point of f. For example, the Mann iteration (see [1]) is defined by u 1 E and

u n + 1 =(1 α n ) u n + α n f( u n )
(1.1)

for all n1, where { α n } n = 1 is a sequence in [0,1]. The Ishikawa iteration (see [2]) is defined by s 1 E and

{ t n = ( 1 b n ) s n + b n f ( s n ) , s n + 1 = ( 1 α n ) s n + α n f ( t n )
(1.2)

for all n1, where { α n } n = 1 , { b n } n = 1 are sequences in [0,1]. The Noor iteration (see [3]) is defined by w 1 E and

{ r n = ( 1 a n ) w n + a n f ( w n ) , q n = ( 1 b n ) w n + b n f ( r n ) , w n + 1 = ( 1 α n ) w n + α n f ( q n )
(1.3)

for all n1, where { α n } n = 1 , { b n } n = 1 and { a n } n = 1 are sequences in [0,1]. Clearly, Mann and Ishikawa iterations are special cases of the Noor iteration.

In 1974, Roades proved the convergence of the Mann iteration for the class of continuous and nondecreasing functions on a closed unit interval, and then he [4] extended convergence results to Ishikawa iterations. He also proved that the Ishikawa iteration converges faster than the Mann iteration for the class of continuous and nondecreasing mappings. Later, in 1991, Borwein and Borwein [5] proved the convergence of the Mann iteration of continuous mappings on a bounded closed interval. Recently, Qing and Qihou [6] extended their results to an arbitrary interval and to the Ishikawa iteration and a gave necessary and sufficient condition for the convergence of Ishikawa iteration on an arbitrary interval. Recently, Phuengrattana and Suantai [7] proved that the Mann, Ishikawa and Noor iterations are equivalent for the class of continuous and nondecreasing mappings.

In this paper, we are interested in employing the iteration method (1.4) for a continuous mapping on an arbitrary interval. The iteration method was first introduced by Thianwan and Suantai [8] as follows. Let E be a subset of a normed space X and let f:EE be a mapping

{ z n = ( 1 a n ) x n + a n f ( x n ) , y n = ( 1 b n c n ) x n + b n f ( z n ) + c n f ( x n ) , x n + 1 = ( 1 α n β n ) x n + α n f ( y n ) + β n f ( z n )
(1.4)

for all n1, where { α n } n = 1 , { β n } n = 1 , { a n } n = 1 , { b n } n = 1 and { c n } n = 1 are sequences in [0,1].

Note that (1.4) reduces to (1.1) when a n = b n = c n = β n =0. Similarly, the process (1.4) reduces to (1.2) when a n = c n = β n =0. Moreover, for c n = β n =0, the process (1.4) reduces to (1.3).

The purpose of this article is to give a necessary and sufficient condition for the strong convergence of the iteration method (1.4) of continuous mappings on an arbitrary interval. Our results extend and improve the corresponding results of Rhoades [4], Borwein and Borwein [5], Qing and Qihou [6], Phuengrattana and Suantai [7], and many others.

2 Convergence theorems

We first give a convergence theorem for the iteration method (1.4) for continuous mappings on an arbitrary interval.

Theorem 1 Let E be a closed interval on the real line and let f:EE be a continuous mapping. For x 1 E, let the iteration { x n } n = 1 be defined by (1.4), and let { a n } n = 1 , { b n } n = 1 , { c n } n = 1 , { α n } n = 1 and { β n } n = 1 be sequences in [0,1] satisfying the following conditions:

  1. (i)

    lim n a n =0, lim n b n =0, lim n c n =0 and n = 1 β n <,

  2. (ii)

    lim n α n =0 and n = 1 α n =.

Then { x n } n = 1 is bounded if and only if { x n } n = 1 converges to a fixed point of f.

Proof It is obvious that { x n } n = 1 converges to a fixed point of f. Now, assume that { x n } n = 1 is bounded. We shall show that { x n } n = 1 is convergent. To show this, suppose not. Then there exist a,bR, a=lim inf n x n , b=lim sup n x n and a<b. First, we show that if a<m<b, then f(m)=m. Suppose that f(m)m. Without loss of generality, we suppose that f(m)m>0. Because f(x) is a continuous mapping, there exists δ(0,ba) such that

f(x)x>0for |xm|δ.
(2.1)

By the boundedness of { x n } n = 1 , we have { x n } n = 1 belongs to a bounded closed interval. The continuity of f implies that { f ( x n ) } n = 1 belongs to another bounded closed interval, so { f ( x n ) } n = 1 is bounded, and since z n =(1 a n ) x n + a n f( x n ), so { z n } n = 1 is bounded, and thus { f ( z n ) } n = 1 is bounded. Similarly, since y n =(1 b n c n ) x n + b n f( z n )+ c n f( x n ), we have { y n } n = 1 and { f ( y n ) } n = 1 are bounded. It follows by (1.4) that x n + 1 x n = α n (f( y n ) x n )+ β n (f( z n ) x n ), y n x n = b n (f( z n ) x n )+ c n (f( x n ) x n ) and z n x n = a n (f( x n ) x n ). By conditions (i) and (ii), we get | x n + 1 x n |0, | y n x n |0 and | z n x n |0. Thus, there exists N such that

| x n + 1 x n |< δ 3 ,| y n x n |< δ 3 ,| z n x n |< δ 3
(2.2)

for all n>N. Since b=lim sup n x n >m, there exists k 1 >N such that x n k 1 >m. Let k= n k 1 , then x k >m. For x k , there exist only two cases:

Case 1: x k m+ δ 3 , then by (2.2), we have x k + 1 x k > δ 3 , then x k + 1 > x k δ 3 m, so x k + 1 >m.

Case 2: m< x k <m+ δ 3 , then by (2.2), we have m δ 3 < y k <m+ 2 δ 3 and m δ 3 < z k <m+ 2 δ 3 . So, we have | x k m|< δ 3 <δ, | y k m|< 2 δ 3 <δ and | z k m|< 2 δ 3 <δ. Using (2.1), we get

f( x k ) x k >0,f( y k ) y k >0,f( z k ) z k >0.

By (1.4), we have

x k + 1 = ( 1 α k β k ) x k + α k f ( y k ) + β k f ( z k ) = x k + α k ( f ( y k ) x k ) + β k ( f ( z k ) x k ) = x k + α k ( f ( y k ) y k ) + α k ( y k x k ) + β k ( f ( z k ) z k ) + β k ( z k x k ) = x k + α k [ b k ( f ( z k ) x k ) + c k ( f ( x k ) x k ) ] + β k a k ( f ( x k ) x k ) + α k ( f ( y k ) y k ) + β k ( f ( z k ) z k ) = x k + a k b k ( f ( z k ) z k ) + a k b k ( z k x k ) + α k c k ( f ( x k ) x k ) + β k a k ( f ( x k ) x k ) + α k ( f ( y k ) y k ) + β k ( f ( z k ) z k ) = x k + a k 2 b k ( f ( x k ) x k ) + a k b k ( f ( z k ) z k ) + α k c k ( f ( x k ) x k ) + β k a k ( f ( x k ) x k ) + α k ( f ( y k ) y k ) + β k ( f ( z k ) z k ) .

By Case 1 and Case 2, we can conclude that x k + 1 >m. By using the above argument, we obtain x k + 2 >m, x k + 3 >m, x k + 4 >m, . Thus we get x n >m for all n>k= n k 1 . So, a=lim inf n x n m, which is a contradiction with a<m. Thus f(m)=m.

For the sequence { x n } n = 1 , we consider the following two cases.

Case 1 : There exists x m such that a< x m <b.

Then f( x m )= x m . Thus

By induction, we obtain x m = x m + 1 = x m + 2 = x m + 3 = , so, x n x m . This implies that x m =a and x n a, which contradicts our assumption.

Case 2 : For all n, x n a or x n b.

Because ba>0 and | x n + 1 x n |0, so there exists N 0 such that | x n + 1 x n |< b a 3 for all n> N 0 . It implies that either x n a for all n> N 0 or x n b for all n> N 0 . If x n a for n> N 0 , then b=lim sup n x n a, which is a contradiction with a<b. If x n b for n> N 0 , so we have a=lim inf n x n b, which is a contradiction with a<b.

Hence, we have { x n } n = 1 is convergent.

Finally, we show that { x n } n = 1 converges to a fixed point of f. Let x n p and suppose that f(p)p. By the continuity of f, we have { f ( x n ) } n = 1 is bounded. From z n =(1 a n ) x n + a n f( x n ) and a n 0, we obtain z n p. Similarly, by y n =(1 b n c n ) x n + b n f( z n )+ c n f( x n ) and b n 0 and c n 0, it follows that y n p. Let r k =f( y k ) x k and s k =f( z k ) x k . By the continuity of f, we have lim k r k = lim k (f( y k ) x k )=f(p)p0 and lim k s k = lim k (f( z k ) x k )=f(p)p0. Put w=f(p)p. Then w0. By (1.4), we get x n + 1 = x n + α n (f( y n ) x n )+ β n (f( z n ) x n ). It follows that

x n = x 1 + k = 1 n 1 ( α k r k + β k s k ).
(2.3)

By r k w0 and n = 1 α n =, we have that k = 1 α k r k is divergent, k = 1 β k s k is convergent. It follows by (2.3) that { x n } n = 1 is divergent, which is a contradiction with x n p. Thus f(p)=p, that is, { x n } n = 1 converges to a fixed point of f. □

The following corollaries are obtained directly by Theorem 1.

Corollary 1 [7]

Let E be a closed interval on the real line and let f:EE be a continuous mapping. For x 1 E, let the Noor iteration { x n } n = 1 be defined by (1.3), where { α n } n = 1 , { β n } n = 1 , { γ n } n = 1 are sequences in [0,1] satisfying the following conditions:

  1. (i)

    n = 1 α n = and lim n α n =0;

  2. (ii)

    lim n β n =0 and lim n γ n =0.

Then { x n } n = 1 is bounded if and only if { x n } n = 1 converges to a fixed point of f.

Proof By putting c n = β n =0 for all n1 in Theorem 1, we obtain the required result directly from Theorem 1. □

Corollary 2 [6]

Let E be a closed interval on the real line and let f:EE be a continuous mapping. For x 1 E, let the Ishikawa iteration { x n } n = 1 be defined by (1.2), where { α n } n = 1 , { β n } n = 1 are sequences in [0,1] satisfying the following conditions:

  1. (i)

    n = 1 α n = and lim n α n =0;

  2. (ii)

    lim n β n =0.

Then { x n } n = 1 is bounded if and only if { x n } n = 1 converges to a fixed point of f.

Proof By putting a n = c n =0 and β n =0 for all n1 in Theorem 1, we obtain the desired result. □

Corollary 3 [5]

Let E be a closed interval on the real line and let f:EE be a continuous mapping. For x 1 E, let the Mann iteration { x n } n = 1 be defined by (1.1), where { α n } n = 1 is a sequence in [0,1] satisfying the following conditions:

  1. (i)

    lim n α n =0 and

  2. (ii)

    n = 1 α n =.

Then { x n } n = 1 is bounded if and only if { x n } n = 1 converges to a fixed point of f.

Proof It is the special case a n = b n = c n = β n =0 in Theorem 1. □

3 Rate of convergence

In this section, we compare the rate of convergence of the iteration (1.4) with the Mann, Ishikawa and Noor iterations. We show that the iteration (1.4) converges faster than the others.

In order to compare the rate of convergence of continuous self-mappings defined on a closed interval, we use the following definition introduced by Rhoades [4].

Definition 1 Let E be a closed interval on the real line and let f:EE be a continuous mapping. Suppose that { x n } n = 1 and { u n } n = 1 are two iterations which converge to the fixed point p of f. We say that { x n } n = 1 is better than { u n } n = 1 if

| x n p|| u n p|for all n1.

Lemma 1 [7]

Let E be a closed interval on the real line and let f:EE be a continuous and nondecreasing mapping. Let { α n } n = 1 , { β n } n = 1 , { a n } n = 1 be sequences in [0,1). Let { u n } n = 1 , { s n } n = 1 and { w n } n = 1 be defined by (1.1)-(1.3), respectively. Then the following hold:

  1. (i)

    If f( u 1 )< u 1 , then f( u n )< u n for all n1 and { u n } n = 1 is nonincreasing.

  2. (ii)

    If f( u 1 )> u 1 , then f( u n )> u n for all n1 and { u n } n = 1 is nondecreasing.

  3. (iii)

    If f( s 1 )< s 1 , then f( s n )< s n for all n1 and { s n } n = 1 is nonincreasing.

  4. (iv)

    If f( s 1 )> s 1 , then f( s n )> s n for all n1 and { s n } n = 1 is nondecreasing.

  5. (v)

    If f( w 1 )< w 1 , then f( w n )< w n for all n1 and { w n } n = 1 is nonincreasing.

  6. (vi)

    If f( w 1 )> w 1 , then f( w n )> w n for all n1 and { w n } n = 1 is nondecreasing.

Lemma 2 Let E be a closed interval on the real line and let f:EE be a continuous and nondecreasing mapping. Let { a n } n = 1 , { b n } n = 1 , { c n } n = 1 , { α n } n = 1 and { β n } n = 1 be sequences in [0,1). Let { x n } n = 1 be defined by (1.4). Then the following hold:

  1. (i)

    If f( x 1 )< x 1 , then f( x n )< x n for all n1 and { x n } n = 1 is nonincreasing.

  2. (ii)

    If f( x 1 )> x 1 , then f( x n )> x n for all n1 and { x n } n = 1 is nondecreasing.

Proof (i) Let f( x 1 )< x 1 . Then f( x 1 )< z 1 x 1 . Since f is nondecreasing, we have f( z 1 ) f( x 1 )< z 1 x 1 . This implies f( z 1 )< y 1 z 1 . Thus f( y 1 )f( x 1 )< z 1 x 1 . For y 1 , we consider the following cases.

Case 1: f( z 1 )< y 1 z 1 . Then f( y 1 )f( z 1 )< z 1 < x 1 . It follows that if f( y 1 )< x 2 y 1 , then f( x 2 )f( y 1 )< x 2 , if y 1 < x 2 z 1 , then f( x 2 )f( z 1 )< y 1 < x 2 and if z 1 < x 2 x 1 , then f( x 2 )f( x 1 )< z 1 < x 2 . Thus, we have f( x 2 )< x 2 .

Case 2: z 1 < y 1 x 1 . Then f( y 1 )f( x 1 )< z 1 x 1 . This implies f( y 1 )< x 2 x 1 . Thus f( x 2 )f( x 1 )< z 1 < y 1 x 1 . It follows that if f( y 1 )< x 2 y 1 , then f( x 2 )f( y 1 )< x 2 and if y 1 < x 2 x 1 , then f( x 2 )f( x 1 )< y 1 < x 2 . Hence, we have f( x 2 )< x 2 .

From Cases 1 and 2, we have f( x 2 )< x 2 . By induction, we conclude that f( x n )< x n for all n1. This implies z n x n for all n1. Since f is nondecreasing, we have f( z n )f( x n )< x n for all n1. Thus y n x n for all n1, then f( y n )f( x n )< x n for all n1. Hence, we have x n + 1 x n for all n1, that is, { x n } n = 1 is nonincreasing.

(ii) Following the line of (i), we can show the desired result. □

Lemma 3 Let E be a closed interval on the real line and let f:EE be a continuous and nondecreasing mapping. Let { a n } n = 1 , { b n } n = 1 , { c n } n = 1 , { α n } n = 1 and { β n } n = 1 be sequences in [0,1). For w 1 = x 1 E, let { w n } n = 1 and { x n } n = 1 be the sequences defined by (1.3) and (1.4), respectively. Then the following are satisfied:

  1. (i)

    If f( w 1 )< w 1 , then x n w n for all n1.

  2. (ii)

    If f( w 1 )> w 1 , then x n w n for all n1.

Proof (i) Let f( w 1 )< w 1 . Since w 1 = x 1 , we get f( x 1 )< x 1 . From (1.4), we have f( x 1 )< z 1 x 1 . Since f is nondecreasing, we obtain f( z 1 )f( x 1 )< z 1 x 1 . This implies f( z 1 )< y 1 z 1 . Using (1.3) and (1.4), we have

z 1 r 1 =(1 c 1 )( x 1 w 1 )+ c 1 [ f ( x 1 ) f ( w 1 ) ] =0,

that is, z 1 = r 1 , and we get

y 1 q 1 =(1 b 1 )( x 1 w 1 )+ b 1 ( f ( z 1 ) f ( r 1 ) ) + c 1 ( f ( x 1 ) x 1 ) 0.

Since f is nondecreasing, we have f( y 1 )f( q 1 ). This implies

x 2 w 2 = ( 1 α 1 β 1 ) x 1 + α 1 f ( y 1 ) + β 1 f ( z 1 ) ( 1 α 1 ) w 1 α 1 f ( q 1 ) = ( 1 α 1 ) ( x 1 w 1 ) + α 1 ( f ( y 1 ) f ( q 1 ) ) + β 1 ( f ( z 1 ) x 1 ) 0 ,

that is, x 2 w 2 . Assume that x k w k . Thus f( x k )f( w k ).

By Lemma 1(v) and Lemma 1(i), we have f( w k )<f( w k ) and f( x k )<f( w k ). This implies f( x k )< z k x k and f( z k )f( x k )< z k . Thus

z k r k =(1 γ k )( x k w k )+ γ k ( f ( x k ) f ( w k ) ) 0.

That is, z k r k . Since f( z k )f( r k ), we have

y k q k =(1 b k )( x k w k )+ b k ( f ( z k ) f ( r k ) ) + c k 1 ( f ( x k ) x k ) 0,

so y k q k , which implies f( y k )f( q k ). It follows that

x k + 1 w k + 1 = ( 1 α k ) ( x k w k ) + α k ( f ( y k ) f ( q k ) ) + β k ( f ( z k ) x k ) 0 ,

that is, x k + 1 w k + 1 . By mathematical induction, we obtain x n w n for all n1.

By using Lemma 1(vi) and Lemma 1(ii) and the same argument as in (i), we can show that x n w n for all n1. □

Theorem 2 Let E be a closed interval on the real line and let f:EE be a continuous and nondecreasing mapping such that F(f) is nonempty and bounded. Let { a n } n = 1 , { b n } n = 1 , { c n } n = 1 , { α n } n = 1 and { β n } n = 1 be sequences in [0,1). For w 1 = x 1 E, let { w n } n = 1 and { x n } n = 1 be the sequences defined by (1.3) and (1.4), respectively. Let { a n } n = 1 , { b n } n = 1 , { c n } n = 1 , { α n } n = 1 and { β n } n = 1 be sequences in [0,1). Then the following is satisfied:

The iteration (1.4) { x n } n = 1 converges to pF(f) if and only if the Noor iteration { w n } n = 1 converges to p. Moreover, the iteration (1.4) { x n } n = 1 is better than the Noor iteration.

Proof Put L=inf{pE:p=f(p)} and U=sup{pE:p=f(p)}.

() If the iteration (1.4) { x n } n = 1 converges to pF(f), then setting c n = β n =0 for all n1 in (1.4), we can get the convergence of the Noor iteration.

() Suppose that the Noor iteration { w n } n = 1 converges to pF(f). We divide our proof into the following three cases:

Case 1: w 1 = x 1 >U, Case 2: w 1 = x 1 <L, Case 3: L w 1 = x 1 U.

Case 1: w 1 = x 1 >U. By Proposition 3.5 in [7], we get f( w 1 )< w 1 and f( x 1 )< x 1 . Using Lemma 3(i), we get that x n w n for all n1. Following the line of the proof of Theorem 3.7 in [7], we have U x n for all n1. Then we have 0 x n p w n p, so

| x n p|| w n p|for all n1.

We can see that the iteration (1.4) { x n } n = 1 is better than the Noor iteration.

Case 2: w 1 = x 1 <L. By Proposition 3.5 in [7], we get f( w 1 )> w 1 and f( x 1 )> x 1 . Using Lemma 3(ii), we get x n w n for all n1. Following the line of the proof of Theorem 3.7 in [7], we get x n L for all n1. So,

| x n p|| w n p|for all n1.

We can see that the iteration (1.4) { x n } n = 1 is better than the Noor iteration.

Case 3: L w 1 = x 1 U. Suppose that f( w 1 ) w 1 . If f( w 1 )< w 1 , we have by Lemma 1(v) that { w n } n = 1 is nondecreasing with limit p. By Lemma 3(i), we have p x n w n for all n1. It follows that | x n p|| w n p| for all n1. Hence we have that the iteration (1.4) { x n } n = 1 is better than the Noor iteration { w n } n = 1 . If f( w 1 )> w 1 , we have by Lemma 1(vi) that { w n } n = 1 in nondecreasing with limit p. By Lemma 3(ii), we have p x n w n for all n1. It follows that | x n p|| w n p| for all n1. Hence, we have that the iteration (1.4) { x n } n = 1 is better than the Noor iteration { w n } n = 1 . □

Next, we present a numerical example for comparing the rate of convergence between the Mann (1.1), Ishikawa (1.2), Noor (1.3) iterations and the iteration (1.4).

Example 1 Let f:[0,4][0,4] be defined by f(x)= x 2 + 5 6 . Then f is a continuous and nondecreasing mapping with a fixed point p=1. Use the initial point x 1 =4 and control condition a n = b n = c n = β n = 1 n 2 + 1 and α n = 1 n 0.5 + 1 .

Remark 1 From the example above, we see that the iteration (1.4) is better than the Mann, Ishikawa and Noor iterations under the same control conditions (see Table 1).

Table 1 Comparison of rate of convergence of the Mann, Ishikawa, Noor and iteration ( 1.4 ) for the given function in Example 1

4 Convergence theorems for modified iteration methods

Now, we give a convergence theorem for continuous mappings on an arbitrary interval by using the following modified iteration method defined by Suantai [9].

{ z n = ( 1 a n ) x n + a n f n ( x n ) , y n = ( 1 b n c n ) x n + b n f n ( z n ) + c n f n ( x n ) , x n + 1 = ( 1 α n β n ) x n + α n f n ( y n ) + β n f n ( z n )
(4.1)

for all n1, where { α n } n = 1 , { β n } n = 1 , { a n } n = 1 , { b n } n = 1 and { c n } n = 1 are sequences in [0,1] and f n =fff. Also, it is an open problem whether it is possible to prove the convergence theorem of a finite family of continuous mappings on an arbitrary interval by using the iteration methods in this paper.

Theorem 3 Let E be a closed interval on the real line and let f:EE be an injective and continuous mapping. If the sequence { x n } n = 1 satisfying the conditions of Theorem  1 is bounded, then it converges to a fixed point of f.

Proof Suppose that { x n } n = 1 is not convergent. Let a=lim inf n x n and b=lim sup n x n . Then a<b. Next, we show that

if m(a,b), then f(m)=m.

To show this, suppose that f(m)m for some m(a,b). Because f is an injective mapping,

f n (m)mfor f(m)m.

Without loss of generality, we suppose that f n (m)m>0. From the continuity of f, we know that f n is a continuous function. So, there exists δ, 0<δ<ba, such that

f n (x)x>0for |xm|δ.

If we use a similar method as the proof of Theorem 1, the proof of this theorem follows. That is, { x n } n = 1 converges to a fixed point of f. □

The following three corollaries follow from Theorem 3.

Corollary 4 Let E be a closed interval on the real line and let f:EE be an injective and continuous mapping. For x 1 E, let { x n } n = 1 be the sequence defined by

{ z n = ( 1 a n ) x n + a n f n ( x n ) , y n = ( 1 b n ) x n + b n f n ( z n ) , x n + 1 = ( 1 α n ) x n + α n f n ( y n ) .

If the sequence { x n } n = 1 satisfying the conditions of Corollary  1 is bounded, then it converges to a fixed point of f.

Proof If we take c n = β n =0 for all n1 in Theorem 3, we obtain the desired result. □

Corollary 5 Let E be a closed interval on the real line and let f:EE be an injective and continuous mapping. For x 1 E, let { x n } n = 1 be a sequence defined by

{ y n = ( 1 b n ) x n + b n f n ( x n ) , x n + 1 = ( 1 α n ) x n + α n f n ( y n ) .

If the sequence { x n } n = 1 satisfying the conditions of Corollary  2 is bounded, then it converges to a fixed point of f.

Proof It follows directly from Theorem 3 by setting a n = c n = β n =0 for all n1. □

Corollary 6 Let E be a closed interval on the real line and let f:EE be an injective and continuous mapping. For x 1 E, let { x n } n = 1 be a sequence defined by

x n + 1 =(1 α n ) x n + α n f n ( x n ).

If the sequence { x n } n = 1 satisfying the conditions of Corollary  3 is bounded, then it converges to a fixed point of f.

Proof By putting a n = b n = c n = β n =0 for all n1 in Theorem 3, we obtain the desired result. □

References

  1. Mann WR: Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 4: 506–510. 10.1090/S0002-9939-1953-0054846-3

    MATH  Article  Google Scholar 

  2. Ishikawa S: Fixed points by a new iteration method. Proc. Am. Math. Soc. 1974, 44: 147–150. 10.1090/S0002-9939-1974-0336469-5

    MATH  MathSciNet  Article  Google Scholar 

  3. Noor MA: New approximation schemes for general variational inequalities. J. Math. Anal. Appl. 2000, 251: 217–229. 10.1006/jmaa.2000.7042

    MATH  MathSciNet  Article  Google Scholar 

  4. Rhoades BE: Comments on two fixed point iteration methods. J. Math. Anal. Appl. 1976, 56: 741–750. 10.1016/0022-247X(76)90038-X

    MATH  MathSciNet  Article  Google Scholar 

  5. Borwein D, Borwein J: Fixed point iterations for real functions. J. Math. Anal. Appl. 1991, 157: 112–126. 10.1016/0022-247X(91)90139-Q

    MATH  MathSciNet  Article  Google Scholar 

  6. Qing Y, Qihou L: The necessary and sufficient condition for the convergence of Ishikawa iteration on an arbitrary interval. J. Math. Anal. Appl. 2006, 323: 1383–1386. 10.1016/j.jmaa.2005.11.058

    MATH  MathSciNet  Article  Google Scholar 

  7. Phuengrattana W, Suantai S: On the rate of convergence of Mann, Ishikawa, Noor and SP-iterations for continuous functions on an arbitrary interval. J. Comput. Appl. Math. 2011, 235: 3006–3014. 10.1016/j.cam.2010.12.022

    MATH  MathSciNet  Article  Google Scholar 

  8. Thianwan S, Suantai S: Convergence criteria of a new three-step iteration with errors for nonexpansive nonself-mappings. Comput. Math. Appl. 2006, 52: 1107–1118. 10.1016/j.camwa.2006.02.012

    MATH  MathSciNet  Article  Google Scholar 

  9. Suantai S: Weak and strong convergence criteria of Noor iterations for asymptotically nonexpansive mappings. J. Math. Anal. Appl. 2005, 311: 506–517. 10.1016/j.jmaa.2005.03.002

    MATH  MathSciNet  Article  Google Scholar 

Download references

Acknowledgements

Dedicated to Professor Hari M Srivastava.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nazli Kadioglu.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

All authors read and approved the final manuscript.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and Permissions

About this article

Cite this article

Kadioglu, N., Yildirim, I. On the convergence of an iteration method for continuous mappings on an arbitrary interval. Fixed Point Theory Appl 2013, 124 (2013). https://doi.org/10.1186/1687-1812-2013-124

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1687-1812-2013-124

Keywords

  • continuous mapping
  • fixed point
  • convergence theorem