1 Introduction

In the last few decades investigations of fixed points by some iterative schemes have attracted many mathematicians. With the recent rapid developments in fixed point theory, there has been a renewed interest in iterative schemes. The properties of iterations between the type of sequences and kind of operators have not been completely studied and are now under discussion. The theory of operators has occupied a central place in modern research using iterative schemes because of its promise of enormous utility in fixed point theory and its applications. There are a number of papers that have studied fixed points by some iterative schemes (see [1]). It is rather interesting to note that the type of operators play a crucial role in investigations of fixed points.

The Mann iterative scheme was invented in 1953 (see [13]), and it is used to obtain convergence to a fixed point for many classes of mappings (see [416] and others). The idea of considering fixed point iteration procedures with errors comes from practical numerical computations. This topic of research plays an important role in the stability problem of fixed point iterations. In 1995, Liu [17] initiated a study of fixed point iterations with errors. Several authors have proved some fixed point theorems for Mann-type iterations with errors using several classes of mappings (see [1828] and others).

Suppose that H is a real Hilbert space and A is a nonlinear mapping of H into itself. The map A is said to be accretive if x,yD(A), we have that

AxAy,xy0,
(1)

and it is said to be strongly accretive if AkI is accretive, where k(0,1) is a constant and I denotes the identity operator on H.

The map A is said to be ϕ-strongly accretive if x,yE, exists a strictly increasing function ϕ:[0,)[0,) with ϕ(0)=0 such that

AxAy,xyϕ ( x y ) xy,

and it is called uniformly accretive if there exists a strictly increasing function ψ:[0,)[0,) with ψ(0)=0 such that AxAy,xyψ(xy).

Let N(A)={ x H:A x =0} denote the null space (set of zero) of A. If N(A)ϕ and (1) holds for all xD(A) and yN(A), then A is said to be quasi-accretive. The notions of strongly, ϕ-strongly, uniformly quasi-accretive are similarly defined. A is said to be m-accretive if r>0 the operator (I+rA) is surjective. Closely related to the class of accretive maps is the class of pseudo-contractive maps.

A map T:HH is said to be pseudo-contractive if x,yD(T) we have that

( I T ) x ( I T ) y , x y 0,
(2)

observe that T is pseudo-contractive if and only if A=(IT) is accretive.

A mapping T:HH is called Lipschitzian (or L-Lipschitzian) if there exists L>0 such that

TxTyLxy,x,yH.

In the sequel we use L>1.

Definition 1.1 (see e.g. [24])

Let ℕ denote the set of all natural numbers, and let E be a normed linear space. By a double sequence in E we mean a function f:N×NE defined by f(n,m)= x n , m E.

The double sequence { x n , m } is said to converge strongly to x if for a given ϵ>0, there exist integers N,M>0 such that nN, mM, we have that

x n , m x <ϵ.

If n,rN, m,tM, we have that

x n , r x m , t <ϵ,

then the double sequence is said to be Cauchy. Furthermore, if for each fixed n, x n , m x n as m and then x n x as n, so x n , m x as n,m.

In 2002, Moore [24] introduced the following theorem.

Theorem A Let C be a bounded closed convex nonempty subset of a (real) Hilbert space H, and let T:CC be a continuous pseudo-contractive map. Let { α n } n 0 , { a k } k 0 (0,1) be real sequences satisfying the following conditions:

  1. (i)

    lim k a k =1 (monotonically);

  2. (ii)

    lim k , r a k a r 1 a k =0, 0<rk;

  3. (iii)

    lim n α n =0;

  4. (iv)

    n 0 α n =.

For an arbitrary but fixed wC, and for each k0, define T k :CC by

T k x:=(1 a k )w+ a k Tx,xC.

Then the double sequence { x k , n } k 0 , n 0 generated from an arbitrary x 0 , 0 C by

x k , n + 1 =(1 α n ) x k , n + α n T k x k , n ,k,n0,
(3)

converges strongly to a fixed point x of T in C.

The two most popular iteration procedures for obtaining fixed points of T, when the Banach principle fails, are doubly Mann iterations with errors [29] defined by

u k , n + 1 =(1 α n ) u k , n + α n T u k , n + α n u n ,

and doubly Ishikawa iterations with errors defined by

x k , n + 1 = ( 1 α n ) x k , n + α n T z k , n + α n v n , z k , n = ( 1 β n ) x k , n + β n T x k , n + β n w n .

The sequences { α n }(0,1), { β n }[0,1) satisfy

lim n α n = lim n β n =0, n = 1 α n =.

A reasonable conjecture is that the doubly Ishikawa iteration with error and the corresponding doubly Mann iteration with error are equivalent for all maps for which either method provides convergence to a fixed point.

In the present paper, we define the following iteration which will be called the general Mann iteration process with errors:

S u k , n + 1 =(1 α n )S u k , n + α n T u k , n + α n u n .
(4)

Using this general Mann iteration process, we give a strong convergence theorem in the double-sequence setting.

It should be remarked that in (4), if we put S=I, where I denotes the identity mapping, then we obtain the Mann iteration process with errors (see [30]).

The general doubly Ishikawa iteration with error is defined by

S x k , n + 1 =(1 α n )S x k , n + α n T z k , n + α n v n ,
(5)
S z k , n =(1 β n )S x k , n + β n T x k , n + β n w n .
(6)

The sequences { α n }(0,1), { β n }[0,1) satisfy

lim n α n = lim n β n =0, n = 1 α n =.
(7)

It should be remarked that in (5) and (6), if we put S=I, where I denotes the identity mapping, then we obtain the Ishikawa iteration process with errors (see [31, 32]).

2 A strong convergence theorem

In this section, it is proved that a general Mann-type double-sequence iteration process with error converges strongly to a coincidence point of the continuous pseudo-contractive mappings S and T both of them map C into C (where C is a bounded closed convex nonempty subset of a (real) Hilbert space). Now, we give the following theorem.

Theorem 2.1 Let C be a bounded closed convex nonempty subset of a (real) Hilbert space H, and let S,T:CC be continuous pseudo-contractive maps. Let { α n } n 0 , { a k } k 0 (0,1) be real sequences satisfying the following conditions:

  1. (i)

    lim k a k =1 (monotonically);

  2. (ii)

    lim k , r a k a r 1 a k =0, 0<rk;

  3. (iii)

    lim n α n =0;

  4. (iv)

    n 0 α n =.

For an arbitrary but fixed wC, and for each k0, define T k :CC by

T k x=(1 a k )w+ a k Tx+(1 a k ) u k ,xC.

Then the double sequence { x k , n } k 0 , n 0 generated from an arbitrary x 0 , 0 C by

S x k , n + 1 =(1 α n )S x k , n + α n T k x k , n +(1 α n ) u k , n ,k,n0,
(8)

converges strongly to a coincidence point x of S and TC.

Proof Clearly, CF(T) and CF(S) (see e.g. [33]), where the set of coincidence points of T is denoted by CF(T) and the set of coincidence points of S is denoted by CF(S).

Now, we have

T k x T k y,SxSy= a k TxTy,SxSy a k S x S y 2

so that for all k0, T k is continuous and strongly pseudo-contractive. Also, C is invariant under T k for all k by convexity. Hence, T k has a unique fixed point x k C, k0. It thus suffices to prove the following:

  1. (1)

    for each fixed k0, S x k , n S x k C as n;

  2. (2)

    S x k S x C as k;

  3. (3)

    x CF(S)CF(T).

The first is known, but for completeness we give the details.

Now, let d=diamC and b k =1 a k (0,1), ∀k. Then

S x k , n + 1 S x k 2 = ( 1 α n ) S x k , n + α n T k x k , n + ( 1 α n ) u k , n S x n 2 = S x k , n S x k α n ( S x k , n T k x k , n ) + ( 1 α n ) u k , n 2 = S x k , n S x k 2 2 α n S x k , n T k x k , n , S x k , n S x k 2 ( 1 α n ) u k , n , S x k , n S x k + α n 2 S x k , n T k x k , n 2 + 2 α n ( 1 α n ) x k , n T k x k , n , u n + ( 1 α n ) 2 u k , n 2 S x k , n S x k 2 2 α n a k S x k , n S x k 2 2 ( 1 α n ) u k , n S x k , n S x k α n 2 d 2 + 2 α n ( 1 α n ) S x k , n T k x k , n u k , n + ( 1 α n ) 2 u k , n 2 .
(9)

If we set

θ k , n = S x k , n S x k , δ k , n =2 a k α n ,

then from (5) we obtain

θ k , n + 1 2 ( 1 δ k , n ) θ k , n 2 + d 2 α n 2 + ( 2 α n ( 1 α n ) d 2 ( 1 α n ) θ k , n ) u k , n + ( 1 α n ) 2 u k , n 2 = ( 1 δ k , n ) θ k , n 2 + d 2 α n 2 + { ( 1 α n ) ( 2 α n d + ( 1 α n ) u k , n 2 θ k , n ) } u k , n .

Observing that

d 2 α n 2 =O( δ k , n ), lim n δ k , n =0and n 0 d 2 α n 2 =,

we obtain θ k , n 0 as n. So the first part is proved. Now, we have

S x k T x k = S x k a k 1 S x k a k 1 ( 1 a k ) w a k 1 ( 1 a k ) u k = ( 1 1 a k ) S x k ( 1 a k a k ) ( w + u k ) = ( 1 a k a k ) S x k ( 1 a k a k ) ( w + u k ) = ( 1 a k a k ) ( S x k + w + u k ) ( 1 a k a k ) ( S x k + w + u k ) ( 1 a k a k ) ( 2 d + u k ) ,

which implies that

lim k S x k T x k 0.

Then

lim k S x k T x k =0,

hence { x k } is a coincidence point sequence for S and T. Also, assuming that x is a coincidence point of S and T, then

S x T x lim k ( 2 d + u k ) ( 1 a k a k ) =0.

Now, for all 0<rk, we have

S x k S x r 2 = S x k S x r , S x k S x r = T k x k T r x r , S x k S x r = 7 w + a k T x k a r T x r + ( 1 a k ) u k ( 1 a r ) u r , S x k S x r = ( a r a k ) w , S x k S x r + a k T x k a r T x r , S x k S x r + ( 1 a k ) u k , S x k S x r ( 1 a r ) u r , S x k S x r = ( a r a k ) w , S x k S x r + ( a k a r ) T x r , S x k S x r + a k T x k T x r , S x k S x r + ( 1 a k ) u k , S x k S x r ( 1 a r ) u r , S x k S x r S x k S x r 2 ( a k a r ) w S x k S x r + ( a k a r ) T x r S x k S x r + a k S x k S x r 2 + ( 1 a k ) u k S x k S x r ( 1 a r ) u r S x k S x r ( a k a r ) S x k S x r ( w + T x r ) + a k S x k S x r 2 + ( ( 1 a k ) u k ( 1 a r ) u r ) S x k S x r .

Then we obtain

( 1 a k ) S x k S x r 2 ( a k a r ) ( w + T x r ) S x k S x r + ( ( 1 a k ) u k ( 1 a r ) u r ) S x k S x r .

Then

S x k S x r 2 a k a r 1 a k ( w + T x r ) S x k S x r + ( 1 a k 1 a k u k 1 a r 1 a k u r ) S x k S x r a k a r 1 a k ( 2 d ) S x k S x r + ( u k 1 a r 1 a k u r ) S x k S x r ,

which implies that

S x k S x r a k a r 1 a k (2d)+ u k 1 a r 1 a k u r .

Hence,

lim k , r S x k S x r 2d lim k , r ( a k a r 1 a k ) + lim k u k lim k , r ( 1 a r 1 a k u r ) =0.

Thus {S x k } is a Cauchy sequence, and hence there exists {S x }C such that S x k S x as k. Therefore, the second part is proved. By continuity, T x k T x as k. But S x k T x k 0 as k. Hence, x CF(S)CF(T). This completes the proof. □

Corollary 2.1 Let C be a bounded closed convex nonempty subset of a Hilbert space H with 0C. Let S, T, { a k }, { α n }, { x k , n } be as in Theorem  2.1 and k0 define T k = a k T+(1 a k )S u k . Then T k maps C into itself and { x k , n } converges strongly to a coincidence point of S and T.

Proof The proof follows from Theorem 2.1 by setting w=0C. □

Corollary 2.2 In Theorem  2.1, let S, T be two nonexpansive self-mappings. Then the same conclusion is obtained.

Proof The proof of this corollary can be followed directly by observing that every nonexpansive mapping is a continuous pseudo-contraction. □

Remark 2.1 If we put u k =0 in Theorem 2.1, we obtain the result of Moore in [24].

3 The equivalence between S,T-stabilities

In this section, we give the concept of S,T-stabilities, then we show that S,T-stabilities of general doubly Mann and general doubly Ishikawa iterations are equivalent.

Let {S x k , n } be the doubly general Ishikawa iteration with errors and {S u k , n } be the general doubly Mann iteration with errors. Let { q k , n },{ p k , n }E be such that q 0 , 0 = p 0 , 0 , and let ( α n ) n (0,1), ( β n ) n [0,1); nN satisfy (7) and

S y k , n =(1 β n )S q k , n + β n T q k , n .
(10)

We consider the following nonnegative sequences for all nN:

ϵ k , n := S q k , n + 1 ( 1 α n ) S q k , n α n T y k , n + α n v n
(11)

and

δ k , n := S p k , n + 1 ( 1 α n ) S p k , n α n T p k , n + α n v n .
(12)

Let E be a normed space and T be a self-map of E. Let x 0 , 0 be a point of E, and assume that x k , n + 1 =f(T, x k , n ) is an iteration procedure, involving T, which yields a sequence { x k , n } of points from E. Suppose that x k , n converges to a fixed point x of T. Let ξ k , n be an arbitrary sequence in E, and set

ϵ n = ξ k , n + 1 f ( T , ξ k , n ) ,nN.

Definition 3.1 If lim n ϵ=0 lim n ξ k , n =p, then the iteration procedure x k , n + 1 =f(T, x k , n ) is said to be T-stable with respect to T.

Remark 3.1 In practice, such a sequence { ξ k , n } could arise in the following way. Let x 0 , 0 be a point in E. Set x k , n + 1 =f(T, x k , n ). Let ξ 0 , 0 = x 0 , 0 . Now x 0 , 1 =f(T, x 0 , 0 ). Because of rounding in the function T, a new value ξ 0 , 1 approximately equal to x 0 , 1 might be computed to yield ξ 1 , 2 , an approximation of f(T, ξ 0 , 1 ). This computation is continued to obtain { ξ k , n } an approximate sequence of { x k , n }.

Definition 3.2 Let E be a normed space and S,T:EE.

  1. (i)

    If lim k , n ϵ k , n =0 implies that lim k , n S q k , n =S x , then the general Ishikawa iteration as defined in (5) and (6) is said to be S,T-stable.

  2. (ii)

    If lim k , n δ k , n =0 implies that lim k , n S p k , n =S x , then the general Mann iteration process as defined in (4) is said to be S,T-stable.

Remark 3.2 Let E be a normed space and S,T:EE. The following are equivalent:

  1. (a)

    for all { α n }(0,1), { β n }[0,1) satisfying (7), the Ishikawa iteration is S,T-stable,

  2. (b)

    for all { α n }(0,1), { β n }[0,1) satisfying (7), { q k , n }E,

    lim k , n ϵ k , n = lim k , n S q k , n + 1 ( 1 α n ) S q k , n α n T y k , n + α n v n = 0 lim k , n S q k , n = S x .
    (13)

Remark 3.3 Let E be a normed space and S,T:EE. Then the following are equivalent:

(a1) for all { α n }(0,1) satisfying (7), the general Mann iteration is S,T-stable,

(a2) for all { α n }(0,1) satisfying (7), { p k , n }E,

lim k , n δ k , n = lim k , n S p k , n + 1 ( 1 α n ) S p k , n α n T p k , n + α n v n = 0 lim k , n S p k , n = S x .
(14)

The next result states that these two methods of iterations with errors are equivalent from the S,T-stability point of view under certain restrictions.

Theorem 3.1 Let E be a normed space and S,T:EE. Then the following are equivalent:

  1. (I)

    For all { α n }(0,1), { β n }[0,1) satisfying (7), the general Ishikawa iteration process as defined by (5) and (6) is S,T-stable.

  2. (II)

    For all { α n }(0,1), satisfying (7), the general Mann iteration process as defined in (4) is S,T-stable.

Proof Let

M:=max { sup k , n N { T ( y k , n ) } , sup k , n N { T ( q k , n ) } , sup k , n N { T ( p k , n ) } , sup n N { u n } } .

Since the general Mann and general Ishikawa iterations converge and M<, Remarks 3.1 and 3.2 assure that (I) ⇔ (II) is equivalent to (b) ⇔ (a2). We shall prove that (b) ⇒ (a2).

In (b) and (13) set S q k , n :=S p k , n , we obtain

S p k , n + 1 ( 1 α n ) S p k , n α n T p k , n + α n u n S p k , n + 1 ( 1 α n ) S p k , n α n T y k , n + α n T y k , n α n T p n + α n u n S p k , n + 1 ( 1 α n ) S p k , n α n T y k , n + α n ( T y k , n + T p k , n + u n ) S p k , n + 1 ( 1 α n ) S p k , n α n T y k , n + 3 α n M 0 as  n .
(15)

Condition (b) assures that

lim k , n S p k , n + 1 ( 1 α n ) S p k , n α n T y k , n + α n u n =0 lim k , n S p k , n =S x .

Thus, for {S p k , n } satisfying

lim k , n S p k , n + 1 ( 1 α n ) S p k , n α n T y k , n + α n u n =0,

we have shown that

lim k , n S p k , n =S x .

Conversely, we prove (a2) ⇒ (b). In (a2) and (14) set S p k , n =S q k , n to obtain

S q k , n + 1 ( 1 α n ) S q k , n α n T y k , n + α n u n S q k , n + 1 ( 1 α n ) S q k , n α n T s k , n + α n T y k , n α n T s n + α n u n S q k , n + 1 ( 1 α n ) S q k , n α n T S q k , n + 3 α n M 0 as  n .
(16)

Condition (a2) assures that

lim k , n S q k , n + 1 ( 1 α n ) S q k , n α n T S q k , n + α n u n =0 lim k , n S q k , n =S x .

Thus, for {S q k , n } satisfying

lim k , n S q k , n + 1 ( 1 α n ) S q k , n α n T y k , n + α n u n =0,

we have shown that

lim k , n S q k , n =S x .

This completes the proof of the theorem. □

Corollary 3.1 Let E be a normed space and S,T:EE. Then the following are equivalent:

  1. (i)

    For all { α n }(0,1), { β n }[0,1) satisfying (7), the Ishikawa iteration process defined by

    x k , n + 1 = ( 1 α n ) x k , n + α n T z k , n + α n v n , z k , n = ( 1 β n ) x k , n + β n T x k , n + β n w n

    is T-stable.

  2. (ii)

    For all { α n }(0,1), satisfying (7), the Mann iteration process defined by

    u k , n + 1 =(1 α n ) u k , n + α n T u k , n + α n u n
    (17)

    is T-stable.

Proof The proof of this result can be obtained directly by setting S=I in Theorem 3.1, where I denotes the identity mapping. □

4 Application

In this section, we investigate the solvability of certain nonlinear functional equations in a Banach space X by the help of compatible mappings of type (B) in the double-sequence setting.

The concept of compatible mappings of type (B) was introduced by Pathak and Khan (see [34]).

Definition 4.1 (see [34] and [29])

Let S and T be mappings from a normed space E into itself. The mappings S and T are said to be compatible mappings of type (B) if

lim n ST x n TT x n 1 2 [ lim n S T x n S t + lim n S t S S x n ]

and

lim n TS x n SS x n 1 2 [ lim n T S x n T t + lim n T t T T x n ]

whenever { x n } is a sequence in E such that lim n S x n = lim n T x n =t for some tE.

Now, we extend the above definition to double-sequence setting as follows.

Definition 4.2 Let S and T be mappings from a normed space E into itself. The mappings S and T are said to be compatible mappings of type (B) if

lim n , m ST x n , m TT x n , m 1 2 [ lim n , m S T x n , m S t + lim n , m S t S S x n , m ]

and

lim n , m TS x n , m SS x n , m 1 2 [ lim n , m T S x n , m T t + lim n , m T t T T x n , m ]

whenever { x n , m } is a sequence in E such that lim n , m S x n , m = lim n , m T x n , m =t for some tE.

Now, we state and prove the following result.

Theorem 4.1 Let { f n , m }, { g n , m }, { t n , m } and { r n , m } be sequences of elements in a Banach space X. Let { ν n , m } be the unique solution of the system of equations

{ F ν A B ν = f n , m , F ν B B ν = g n , m , F ν S T ν = t n , m , F ν T T ν = r n , m ,

where F,A,B,S,T:XX satisfy the following conditions:

(d1) The pairs {A,S} and {B,T} are compatible of type (B),

(d2) A 2 = B 2 = S 2 = T 2 =I, where I denotes the identity mapping, and

(d3)

A x B y 2 q max { S x T y 2 , S x A x 2 , S x A x × T y B y , T y A x × S x B y , 1 2 [ T y A x 2 + S x B y 2 ] }

for all x,yX, where q(0,1). If Fν=ν and

lim n , m f n , m = lim n , m g n , m = lim n , m t n , m = lim n , m r n , m =0,

then the sequence { ν n , m } converges to the solution of the equation

ν=Fν=Aν=Bν=Sν=Tν.

Proof We will show that { ν n , m } is a Cauchy sequence. Since

ν n , m ν n 1 , m 1 2 = [ ν n , m S T ν n , m + S T ν n , m T T ν n , m + T T ν n , m A B ν n , m + A B ν n , m B B ν n 1 , m 1 + B B ν n 1 , m 1 ν n 1 , m 1 ] 2 [ ν n , m S T ν n , m + S T ν n , m T T ν n , m + T T ν n , m A B ν n , m + B B ν n 1 , m 1 ν n 1 , m 1 ] 2 + 2 [ ν n , m S T ν n , m + S T ν n , m T T ν n , m + T T ν n , m A B ν n , m + B B ν n 1 , m 1 ν n 1 , m 1 ] [ A B ν n , m ν n , m + ν n , m ν n 1 , m 1 + ν n 1 , m 1 B B ν n 1 , m 1 ] + A B ν n , m B B ν n 1 , m 1 2 [ ν n , m S T ν n , m + S T ν n , m T T ν n , m + T T ν n , m A B ν n , m + B B ν n 1 , m 1 ν n 1 , m 1 ] 2 + 2 [ ν n , m S T ν n , m + S T ν n , m T T ν n , m + T T ν n , m A B ν n , m + B B ν n 1 , m 1 ν n 1 , m 1 ] [ A B ν n , m ν n , m + ν n , m ν n 1 , m 1 + ν n 1 , m 1 B B ν n 1 , m 1 ] + q max { S B ν n , m T B ν n 1 , m 1 2 , S B ν n , m A B ν n , m 2 , S B ν n , m A B ν n , m × T B ν n 1 , m 1 B B ν n 1 , m 1 , T B ν n 1 , m 1 A B ν n , m × S B ν n , m B B ν n 1 , m 1 , 1 2 [ T B ν n 1 , m 1 A B ν n , m 2 + S B ν n , m B B ν n 1 , m 1 2 ] } .

Letting n, n 1 with m>n and m 1 > n 1 , we deduce

lim n , n 1 ν n , m ν n 1 , m 1 2 q lim n , n 1 ν n , m ν n 1 , m 1 2 ,

which implies that

lim n , n 1 ν n , m ν n 1 , m 1 2 =0.

Thus { ν n , m } is a Cauchy sequence and converges to a point ν in X. Further,

ν A B ν ν ν n , m + ν n B B ν n , m + B B ν n , m A B ν ν ν n , m + ν n , m B B ν n , m + q max { S B ν n , m T B ν 2 , S B ν A B ν 2 , S B ν A B ν × T B ν n , m B B ν n , m , T B ν n , m A B ν × S B ν B B ν n , m , 1 2 T B ν n A B ν 2 + S B ν B B ν n 2 } 1 2 ν ν n , m + ν n , m B B ν n , m + q max { [ S B ν n , m ν n , m + ν n , m ν ] 2 × [ S B ν ν + ν A B ν ] 2 , S B ν A B ν × T B ν n B B ν n , m , [ T B ν n , m ν n , m + ν n , m A B ν ] × [ S B ν ν + ν B B ν n , m ] , 1 2 [ T B ν n , m A B ν 2 + S B ν B B ν n , m 2 ] } 1 2 .

Letting n, we get ν=ABν, which from (d2) implies that Aν=Tν. Similarly, Tν=Sν. From (d1), we now have

ABν=BAν=ν=SBν=BSν=TBν=BTν.

Using (i) and (d2), we have

v B v 2 = A 2 v B v 2 q max { S A v T v 2 , S A v A 2 v 2 , S A v A 2 v × T v B v , T v A 2 v × S A v B v , 1 2 [ T v A 2 v 2 + S A v B v 2 ] } q max { v T v 2 , 0 , 0 , T v v × v B v , 1 2 T v v 2 + v B v } q max { v T v 2 , 0 , 0 , v T v 2 , T v v 2 } ,

which implies that ν=Tν. It follows that

Tν=TSν=STν=ν=ABν=BAν=BTν=TBν,

completing the proof of the theorem. □

As a consequence of Theorem 4.1, we have the following corollary.

Corollary 4.1 Let { f n , m }, { g n , m }, { t n , m } and { r n , m } be sequences of elements in a Banach space X. Let { ν n , m } be the unique solution of the system of equations

{ ν A B ν = f n , m , ν B B ν = g n , m , ν S T ν = t n , m , ν T T ν = r n , m ,

where A,B,S,T:XX satisfy the following conditions:

(d1) The pairs {A,S} and {B,T} are compatible of type (B),

(d2) A 2 = B 2 = S 2 = T 2 =I, where I denotes the identity mapping, and

(d3)

A x B y 2 q max { S x T y 2 , S x A x 2 , S x A x × T y B y , T y A x × S x B y , 1 2 [ T y A x 2 + S x B y 2 ] }

for all x,yX, where q(0,1). If

lim n , m f n , m = lim n , m g n , m = lim n , m t n , m = lim n , m r n , m =0,

then the sequence { ν n , m } converges to the solution of the equation

ν=Aν=Bν=Sν=Tν.

Proof The proof can be obtained by putting F=I in Theorem 4.1, where I denotes the identity mapping. □

Open problem It is still an open problem to extend some defined iterative schemes in the sense of double-sequence setting. For some recent studies on various iterative schemes, we refer to [1, 3539] and others.