Skip to content

Advertisement

  • Research
  • Open Access

Vector-valued metrics, fixed points and coupled fixed points for nonlinear operators

Fixed Point Theory and Applications20132013:218

https://doi.org/10.1186/1687-1812-2013-218

  • Received: 10 December 2012
  • Accepted: 29 July 2013
  • Published:

Abstract

In this paper, we will present fixed point theorems for singlevalued and multivalued operators in spaces endowed with vector-valued metrics, as well as a Gnana Bhaskar-Lakshmikantham-type theorem for the coupled fixed point problem, associated to a pair of singlevalued operators (satisfying a generalized mixed monotone property) in ordered metric spaces. The approach is based on Perov-type fixed point theorems in spaces endowed with vector-valued metrics. The Ulam-Hyers stability and the limit shadowing property of the fixed point problems are also discussed.

MSC:47H10, 54H25.

Keywords

  • singlevalued operator
  • multivalued operator
  • vector-valued metric
  • fixed point
  • ordered metric space
  • coupled fixed point
  • Ulam-Hyers stability
  • limit shadowing property

1 Introduction

The classical Banach contraction principle is a very useful tool in nonlinear analysis with many applications to operatorial equations, fractal theory, optimization theory and other topics. Banach contraction principle was extended for singlevalued contraction on spaces endowed with vector-valued metrics by Perov [1] and Perov and Kibenko [2]. For some other contributions to this topic, we also refer to [39], etc. The case of multivalued contractions on spaces endowed with vector-valued metrics is treated in [1012], etc.

In the study of the fixed points for an operator, it is sometimes useful to consider a more general concept, namely coupled fixed points. The concept of coupled fixed point for nonlinear operators was introduced and studied by Opoitsev (see [1315]) and then, in 1987, by Guo and Lakshmikantham (see [16]) in connection with coupled quasisolutions of an initial value problem for ordinary differential equations. Later, a new research direction for the theory of coupled fixed points in ordered metric spaces was initiated by Gnana Bhaskar and Lakshmikantham in [17] and by Lakshmikantham and Ćirić in [18]. Their approach is based on some contractive type conditions on the operator. For other results on coupled fixed point theory, see [1722], etc.

Let us recall first some important preliminary concepts and results.

Let X be a nonempty set. A mapping d : X × X R m is called a vector-valued metric on X if the following properties are satisfied:
  1. (a)

    d ( x , y ) O for all x , y X ; if d ( x , y ) = O , then x = y (where );

     
  2. (b)

    d ( x , y ) = d ( y , x ) for all x , y X ;

     
  3. (c)

    d ( x , y ) d ( x , z ) + d ( z , y ) for all x , y X .

     

A nonempty set X endowed with a vector-valued metric d is called a generalized metric space in the sense of Perov (in short, a generalized metric space), and it will be denoted by ( X , d ) . The notions of convergent sequence, Cauchy sequence, completeness, open and closed subset, open and closed ball, … are similar to those for usual metric spaces.

Notice that the generalized metric space in the sense of Perov is a particular case of Riesz spaces (see [23, 24]) and of so-called cone metric spaces (or K-metric space) (see [25, 26]).

We denote by M m m ( R + ) the set of all m × m matrices with positive elements and by I the identity m × m matrix. If x , y R m , x = ( x 1 , , x m ) and y = ( y 1 , , y m ) , then, by definition
x y if and only if x i y i for  i { 1 , 2 , , m } .

Notice that through this paper, we will make an identification between row and column vectors in R m .

Definition 1.1 A square matrix of real numbers is said to be convergent to zero if and only if its spectral radius ρ ( A ) is strictly less than 1. In other words, this means that all the eigenvalues of A are in the open unit disc, i.e., | λ | < 1 , for every λ C with det ( A λ I ) = 0 , where I denotes the unit matrix of M m , m ( R ) (see [27]).

A classical result in matrix analysis is the following theorem (see [27, 28]).

Theorem 1.2 Let A M m m ( R + ) . The following assertions are equivalent
  1. (i)

    A is convergent towards zero;

     
  2. (ii)

    A n O as n ;

     
  3. (iii)
    The matrix ( I A ) is nonsingular and
    ( I A ) 1 = I + A + + A n + ;
    (1)
     
  4. (iv)

    The matrix ( I A ) is nonsingular and ( I A ) 1 has nonnegative elements;

     
  5. (v)

    A n q O and q A n O as n , for each q R m ;

     
  6. (vi)

    The matrices qA and Aq converge to O for each q ( 1 , Q ) , where Q : = 1 ρ ( A ) .

     
If X is a nonempty set and f : X X is an operator, then
Fix ( f ) : = { x X ; x = f ( x ) } .

We recall now Perov’s fixed point theorem (see [1], see also [2]).

Theorem 1.3 (Perov)

Let ( X , d ) be a complete generalized metric space, and let the operator f : X X be with the property that there exists a matrix A M m m ( R + ) convergent towards zero such that
d ( f ( x ) , f ( y ) ) A d ( x , y ) , for all  x , y X .
Then
  1. (1)

    Fix ( f ) = { x } ;

     
  2. (2)

    the sequence of successive approximations ( x n ) n N , x n : = f n ( x 0 ) is convergent in X to x , for all x 0 X ;

     
  3. (3)
    one has the following estimation
    d ( x n , x ) A n ( I A ) 1 d ( x 0 , x 1 ) ;
    (2)
     
  4. (4)
    if g : X X is an operator such that there exists y Fix ( g ) , and there exists η : = ( η 1 , , η m ) R + m with η i > 0 for each i { 1 , 2 , , m } such that
    d ( f ( x ) , g ( x ) ) η , for each  x X ,
     
then
d ( x , y ) ( I A ) 1 η ;
  1. (5)
    if g : X X is an operator, y n : = g n ( x 0 ) , and there exists η : = ( η 1 , , η m ) R + m with η i > 0 for each i { 1 , 2 , , m } such that
    d ( f ( x ) , g ( x ) ) η , for all  x X ,
     
we have the following estimation
d ( y n , x ) ( I A ) 1 η + A n ( I A ) 1 d ( x o , x 1 ) .
(3)

Notice that in Precup [9], as well as in [3, 5] and [7] are pointed out the advantages of working with vector-valued norm with respect to the usual scalar norms.

There is a vast literature concerning this approach, see also, for example, [4, 6, 8, 9, 29], etc.

We will focus our attention to the following system of operatorial equations
{ x = T 1 ( x , y ) , y = T 2 ( x , y ) ,

where T 1 , T 2 : X × X X are two given operators.

By definition, a solution ( x , y ) X × X of the above system is called a coupled fixed point for the operators T 1 and T 2 . Notice that if S : X × X X is an operator and we define
T 1 ( x , y ) : = S ( x , y ) and T 2 ( x , y ) : = S ( y , x ) ,

then we get the classical concept of a coupled fixed point for the operator S introduced by Opoitsev and then intensively studied in some papers by Guo and Lakshmikantham, Gnana Bhaskar and Lakshmikantham, Lakshmikantham and Ćirić, etc.

The case of an operatorial inclusion is defined in a similar way, namely, by using the symbol instead of =. The concept of a coupled fixed point for a multivalued operator S is accordingly defined.

First aim of this work is to present some existence and stability results for fixed point equations and inclusions in generalized metric spaces in the sense of Perov. Our second purpose is to present, in the setting of an ordered metric space, a Gnana Bhaskar-Lakshmikantham-type theorem for the coupled fixed point problem associated to a pair of singlevalued operators satisfying a generalized mixed monotone assumption. The approach is based on an abstract fixed point theorem in ordered complete metric spaces. Our results are related with other existence and stability results for the a coupled fixed point problem for singlevalued operators proved in [30] by the support of Perov’s fixed point theorem.

2 Existence, uniqueness and stability for fixed point equations and inclusions

We start this section by an extension of Perov’s theorem. At the same time, the result is a generalization to vector-valued metric spaces of the main theorem in [31].

Theorem 2.1 Let ( X , d ) be a generalized complete metric space, and let f : X X be an almost contraction with matrices A, B and C, i.e., the matrix A + C M m m ( R + ) converges to zero, B M m m ( R + ) and
d ( f ( x ) , f ( y ) ) A d ( x , y ) + B d ( y , f ( x ) ) + C d ( x , f ( x ) ) , for all  x , y X .
Then, the following conclusions hold
  1. 1.

    f has at least one fixed point in X and, for each x 0 X , the sequence x n : = f n ( x 0 ) of successive approximations of f starting from x 0 converges to x ( x 0 ) Fix ( f ) as n ;

     
  2. 2.
    For each x 0 X , we have
    d ( x n , x ( x 0 ) ) A n ( I A ) 1 d ( x 0 , f ( x 0 ) ) , for all  n N
    and
    d ( x 0 , x ( x 0 ) ) ( I A ) 1 d ( x 0 , f ( x 0 ) ) ;
     
  3. 3.

    If, additionally, the matrix A + B converges to zero, then f has a unique fixed point in X.

     
Proof Let x 0 X be arbitrary, and consider ( x n ) n N the sequence of successive approximations for f starting from x 0 , i.e.,
x n + 1 = f ( x n ) , for all  n N .

We have that d ( x 1 , x 2 ) = d ( f ( x 0 ) , f ( x 1 ) ) A d ( x 0 , x 1 ) + B d ( x 1 , f ( x 0 ) ) + C d ( x 0 , f ( x 0 ) ) = ( A + C ) d ( x 0 , x 1 ) .

Inductively, we get that the sequence ( x n ) n N satisfies, for all n N , the following estimation
d ( x n , x n + 1 ) ( A + C ) n d ( x 0 , x 1 ) .
Hence, for all n N and p N , p 1 , we get that
d ( x n , x n + p ) d ( x n , x n + 1 ) + d ( x n + 1 , x n + 2 ) + + d ( x n + p 1 , x n + p ) ( A + C ) n d ( x 0 , x 1 ) + ( A + C ) n + 1 d ( x 0 , x 1 ) + + ( A + C ) n + p 1 d ( x 0 , x 1 ) ( A + C ) n [ I + ( A + C ) + ( A + C ) 2 + + ( A + C ) p 1 + ] d ( x 0 , x 1 ) ( A + C ) n [ I ( A + C ) ] 1 d ( x 0 , x 1 ) .

Thus, d ( x n , x n + p ) O , as n . Hence ( x n ) n N is a Cauchy sequence in the complete metric space ( X , d ) . Thus, ( x n ) n N converges to a certain element x ( x 0 ) X .

Next, we show that x : = x ( x 0 ) Fix ( f ) . Indeed, we have the following estimation
d ( x , f ( x ) ) d ( x , x n ) + d ( x n , f ( x ) ) = d ( x , x n ) + d ( f ( x n 1 ) , f ( x ) ) d ( x , x n ) + A d ( x n 1 , x ) + B d ( x , x n ) + C d ( x n 1 , x n ) O , as  n .
Hence x Fix ( f ) . In addition, letting p in the estimation of d ( x n , x n + p ) , we get
d ( x n , x ( x 0 ) ) ( A + C ) n [ I ( A + C ) ] 1 d ( x 0 , f ( x 0 ) ) , for all  n N .
For n = 0 , we obtain
d ( x 0 , x ( x 0 ) ) ( A + C ) n [ I ( A + C ) ] 1 d ( x 0 , f ( x 0 ) ) .

We show now the uniqueness of the fixed point.

Let x , y Fix ( f ) with x y . Then
d ( x , y ) = d ( f ( x ) , f ( y ) ) A d ( x , y ) + B d ( y , f ( x ) ) + C d ( x , f ( x ) ) = ( A + B ) d ( x , y ) .

Thus ( I A B ) d ( x , y ) O R m . Since A + B converges to zero, we get that I A B is non-singular and ( I A B ) 1 M m , m ( R + ) . Hence d ( x , y ) O and so x = y . □

Remark 2.2 The result above extends Corollary 2.3 in [5], where the case of almost contractions with matric C = O is treated.

Two important abstract concepts are given now.

Definition 2.3 (see [32, 33])

If ( X , d ) is a generalized metric space, then f : X X is called a weakly Picard operator if and only if the sequence ( f n ( x ) ) n N of successive approximations of f converges for all x X and the limit (which may depend on x) is a fixed point of f.

If f is weakly Picard operator, then we define the operator f : X X by
f ( x ) : = lim n f n ( x ) .

Notice that, in this case, f ( X ) = Fix ( f ) . Moreover, f is a set retraction of X to Fix ( f ) .

If f is weakly Picard operator and Fix ( f ) = { x } , then by definition f is a Picard operator. In this case, f is the constant operator, i.e., f ( x ) = x for all x X .

Definition 2.4 (see [33])

Let ( X , d ) be a generalized metric space, and let f : X X be an operator. Then, f is said to be a ψ-weakly Picard operator if and only if f is a weakly Picard operator and ψ : R + m R + m is an increasing operator, continuous in O with ψ ( O ) = O such that
d ( x , f ( x ) ) ψ ( d ( x , f ( x ) ) , for all  x X .

Moreover, a ψ-weakly Picard operator f : X X with a unique fixed point is said to be a ψ-Picard operator. In particular, if ψ : R + m R + m is given by ψ ( t ) = M t (with C M m m ( R + ) ), then we say that f is M-weakly Picard operator (respectively a M-Picard operator).

From Theorem 2.1, we get the following example.

Example 2.5 If ( X , d ) is a generalized complete metric space and f : X X is an almost contraction with matrices A, B, and C, then f is a ψ-weakly Picard operator with the function ψ ( t ) : = [ I ( A + C ) ] 1 t . In particular, if f : X X is a contraction with matrix A, then f is a ψ-Picard operator with ψ ( t ) : = ( I A ) 1 t .

For the proof of our next theorems we need the following notion.

Definition 2.6 Let ( X , d ) be a generalized metric space, and let f : X X be an operator. Then, the fixed point equation
x = f ( x )
(4)
is said to be generalized Ulam-Hyers stable if there exists an increasing function ψ : R + m R + m , continuous in O with ψ ( O ) = O such that for any ε : = ( ε 1 , , ε m ) with ε i > 0 for i { 1 , , m } and any ε-solution y X of (4), i.e.,
d ( y , f ( y ) ) ε ,
(5)
there exists a solution x of (4) such that
d ( x , y ) ψ ( ε ) .
(6)

In particular, if ψ ( t ) = C t , t R + m (where C M m m ( R + ) ), then the fixed point equation (4) is called Ulam-Hyers stable.

We can prove now the following abstract result (see also Rus [33]) concerning the Ulam-Hyers stability of the fixed point equation (4).

Theorem 2.7 Let ( X , d ) be a generalized metric space, and let f : X X be a ψ-weakly Picard operator. Then, the fixed point equation (4) is generalized Ulam-Hyers stable.

Proof Let ε : = ( ε 1 , , ε m ) (with ε i > 0 for i { 1 , , m } ), and let y X be a ε-solution of (5), i.e., d ( y , f ( y ) ) ε . Since f is a ψ-Picard operator, we have that
d ( x , f ( x ) ) ψ ( d ( x , f ( x ) ) , for each  x X .
Hence, there exists x : = f ( y ) Fix ( f ) such that
d ( y , f ( y ) ) ψ ( d ( y , f ( y ) ) ψ ( ε ) .

 □

Remark 2.8 In particular, if ( X , d ) is a generalized complete metric space, and f : X X is an almost contraction with matrices A, B and C, then, by Example 2.5 and Theorem 2.7, we get that the fixed point equation (4) is Ulam-Hyers stable.

We now move our attention to the multivalued case. If ( X , ρ ) is a metric space, and we denote by P ( X ) the space of all nonempty subsets of X, then the gap functional (generated by ρ) on P ( X ) is defined as
D ρ : P ( X ) × P ( X ) R + , D ρ ( A , B ) : = inf { ρ ( a , b ) | a A , b B } .

In particular, if x 0 X , we put D ρ ( x 0 , B ) in place of D ρ ( { x 0 } , B ) .

We will denote by H ρ the Pompeiu-Hausdorff functional on P ( X ) , defined as
H ρ : P ( X ) × P ( X ) R + { + } , H ρ ( A , B ) = max { sup a A D ρ ( a , B ) , sup b B D ρ ( b , A ) } .

Let ( X , d ) be a generalized metric space with d ( x , y ) : = ( d 1 ( x , y ) d m ( x , y ) ) .

Notice that d is a generalized metric on X if and only if d i are metrics on X for each i { 1 , 2 , , m } .

We denote by
D ( A , B ) : = ( D d 1 ( A , B ) D d m ( A , B ) ) , the generalized gap functional on  P ( X )
and by
H ( A , B ) : = ( H d 1 ( A , B ) H d m ( A , B ) ) , the generalized Pompeiu-Hausdorff functional on  P ( X ) .
It is well known that if d i is a metric on X, x X and Y P ( X ) , then D d i ( x , Y ) = 0 if and only if x Y ¯ d i , where Y ¯ d i denotes the closure of Y in ( X , d i ) . As a consequence,
Y ¯ d i = { x X : D d i ( x , Y ) = 0 } .

Hence, x Y ¯ d i for each i { 1 , 2 , , m } is equivalent with D d i ( x , Y ) = 0 for each i { 1 , 2 , , m } , which is also equivalent with D ( x , Y ) = O .

Since Y ¯ d = { x X : D ( x , Y ) = O } , we have:
  1. (a)

    x Y ¯ d x Y ¯ d i for each i { 1 , 2 , , m } .

     
  2. (b)

    Y is closed with respect to d Y is closed with respect to each d i for i { 1 , 2 , , m } .

     

We denote by P cl ( X ) the set of all nonempty closed (with respect to d) subsets of X.

We have the following two auxiliary results.

Lemma 2.9 Let ( X , d ) be a generalized metric space, let x X , and let Y P cl ( X ) . Then,
x Y if and only if D ( x , Y ) = O .
Lemma 2.10 Let ( X , d ) be a generalized metric space, Y , Z P ( X ) , q > 1 . Then, for any y Y , there exists z Z such that
d ( y , z ) q H ( Y , Z ) .
If ( X , d ) is a nonempty set, and F : X P ( X ) is a multivalued operator, then the graph of the operator F is denoted by
Graph ( F ) : = { ( x , y ) X × X : y F ( x ) } ,
while the fixed point set and, respectively, the strict fixed point set of F are denoted by the symbols
Fix ( F ) : = { x X : x F ( x ) } , respectively SFix ( F ) : = { x X : F ( x ) = { x } } .

We will present now an extension of the Nadler fixed point theorem in a space endowed with a vector-valued metric, which is also a multivalued version of Perov’s theorem.

Theorem 2.11 Let ( X , d ) be a generalized complete metric space, and let F : X P cl ( X ) be a multivalued almost contraction with matrices A and B, i.e., there exists two matrices A , B M m m ( R + ) such that A converges to zero and
H ( F ( x ) , F ( y ) ) A d ( x , y ) + B D ( y , F ( x ) ) , for all  x , y X .
Then
  1. (i)

    Fix ( F ) ;

     
  2. (ii)
    for each ( x , y ) Graph ( F ) , there exists a sequence ( x n ) n N (with x 0 = x , x 1 = y and x n + 1 F ( x n ) for each n N ) such that ( x n ) n N is convergent to a fixed point x : = x ( x , y ) of F, and the following relations hold
    d ( x n , x ) A n ( I A ) 1 d ( x 0 , x 1 ) , for each  n N
     
and
d ( x , x ) ( I A ) 1 d ( x , y ) .
Proof Let x 0 X and x 1 F ( x 0 ) be arbitrarily chosen. Let q ( 1 , Q ) , where Q is defined by Theorem 1.2. Then, by Lemma 2.10, there exists x 2 F ( x 1 ) such that
d ( x 1 , x 2 ) q H ( F ( x 0 ) , F ( x 1 ) ) q ( A d ( x 0 , x 1 ) + B D ( x 1 , F ( x 0 ) ) ) = q A d ( x 0 , x 1 ) .
Inductively, there exists x n + 1 F ( x n ) such that
d ( x n , x n + 1 ) ( q A ) n d ( x 0 , x 1 ) , for any  n N .
We have
d ( x n , x n + p ) d ( x n , x n + 1 ) + + d ( x n + p 1 , x n + p ) ( q A ) n d ( x 0 , x 1 ) + + ( q A ) n + p 1 d ( x 0 , x 1 ) ( q A ) n [ I + q A + + ( q A ) p 1 + ] d ( x 0 , x 1 ) = ( q A ) n ( I q A ) 1 d ( x 0 , x 1 ) .
Thus
d ( x n , x n + p ) ( q A ) n ( I q A ) 1 d ( x 0 , x 1 ) , for  n N  and  p N .
(7)
Letting n , we get that ( x n ) is a Cauchy sequence in X. Since ( X , d ) is complete, it follows that there exists x X such that x n d x , n . Thus,
D ( x , F ( x ) ) = ( D 1 ( x , F ( x ) ) D m ( x , F ( x ) ) ) ( d 1 ( x , x n + 1 ) + D 1 ( x n + 1 , F ( x ) ) d m ( x , x n + 1 ) + D m ( x n + 1 , F ( x ) ) ) ( d 1 ( x , x n + 1 ) + H 1 ( F ( x n ) , F ( x ) ) d m ( x , x n + 1 ) + H m ( F ( x n ) , F ( x ) ) ) = d ( x , x n + 1 ) + H ( F ( x n ) , F ( x ) ) d ( x , x n + 1 ) + A d ( x n , x ) + B D ( x , F ( x n ) ) d ( x , x n + 1 ) + A d ( x n , x ) + B ( d ( x , x n + 1 ) + D ( x n + 1 , F ( x n ) ) ) = d ( x , x n + 1 ) + A d ( x n , x ) + B d ( x , x n + 1 ) .
Letting n , we get that D ( x , F ( x ) ) = O . By Lemma 2.9, we get that x F ( x ) . Moreover, letting p in (7), we obtain
d ( x n , x ) ( q A ) n ( I q A ) 1 d ( x 0 , x 1 ) , for any  n N .
Thus,
d ( x 0 , x ) d ( x 0 , x 1 ) + d ( x 1 , x ) d ( x 0 , x 1 ) + q A ( I q A ) 1 d ( x 0 , x 1 ) = [ I + q A ( I q A ) 1 ] d ( x 0 , x 1 ) = [ I + q A ( I + q A + + ( q A ) n + ) ] d ( x 0 , x 1 ) = ( I q A ) 1 d ( x 0 , x 1 ) .

Letting q 1 , we get that d ( x 0 , x ) ( I A ) 1 d ( x 0 , x 1 ) . □

For the following notions see Rus et al. [34] and A. Petruşel [10].

Definition 2.12 Let ( X , d ) be a generalized metric space, and let F : X P cl ( X ) be a multivalued operator. By definition, F is a multivalued weakly Picard (briefly MWP) operator if for each ( x , y ) Graph ( F ) , there exists a sequence ( x n ) n N such that
  1. (i)

    x 0 = x , x 1 = y ;

     
  2. (ii)

    x n + 1 F ( x n ) , for each n N ;

     
  3. (iii)

    the sequence ( x n ) n N is convergent, and its limit is a fixed point of F.

     

Remark 2.13 A sequence ( x n ) n N satisfying the condition (i) and (ii) in the definition above is called a sequence of successive approximations of F starting from ( x , y ) Graph ( F ) .

If F : X P ( X ) is an MWP operator, then we define F : Graph ( F ) P ( Fix ( F ) ) by the formula F ( x , y ) := { z Fix ( F ) | there exists a sequence of successive approximations of F starting from ( x , y ) that converges to z}.

Definition 2.14 Let ( X , d ) be a generalized metric space, and let F : X P ( X ) be an MWP operator. Then, F is called a ψ-multivalued weakly Picard operator (briefly ψ-MWP operator) if and only if ψ : R + m R + m is an increasing operator, continuous in O with ψ ( O ) = O , and there exists a selection f of F such that
d ( x , f ( x , y ) ) ψ ( d ( x , y ) ) , for all  ( x , y ) Graph ( F ) .

Example 2.15 Let ( X , d ) be a generalized complete metric space, and let F : X P cl ( X ) be a multivalued almost contraction with matrices A and B. Then, by Theorem 2.11 (see (i) and (ii)), we get that F is a ( I A ) 1 -MWP operator.

Two important stability concepts are given now.

Definition 2.16 Let ( X , d ) be a generalized metric space, and let F : X P ( X ) be a multivalued operator. The fixed point inclusion
x F ( x ) , x X
(8)
is called generalized Ulam-Hyers stable if and only if there exists ψ : R + m R + m increasing, continuous in O with ψ ( O ) = O such that for each ε : = ( ε 1 , , ε m ) (with ε i > 0 for i { 1 , , m } ) and for each ε-solution y X of (8), i.e.,
D ( y , F ( y ) ) ε ,
(9)
there exists a solution x of the fixed point inclusion (8) such that
d ( y , x ) ψ ( ε ) .

In particular, if ψ ( t ) = C t for each t R + m (where C M m m ( R + ) ), then the fixed point inclusion (8) is said to be Ulam-Hyers stable.

Definition 2.17 Let ( X , d ) be a generalized metric space, and let F : X P ( X ) be a multivalued operator. Then, the multivalued operator F is said to have the limit shadowing property if for each sequence ( y n ) n N in X such that D ( y n + 1 , F ( y n ) ) O as n + , there exists a sequence ( x n ) n N of successive approximations of F such that d ( x n , y n ) O as n + .

An auxiliary result is as follows.

Cauchy-type lemma Let A M m m ( R + ) be a matrix convergent toward zero and ( B n ) n N R + m be a sequence such that lim n + B n = O . Then
lim n + ( k = 0 n A n k B k ) = O .

We can prove now the Ulam-Hyers stability of the fixed point inclusion (8) for the case of a multivalued contraction, which has at least one strict fixed point. The limit shadowing property is also established.

Theorem 2.18 Let ( X , d ) be a generalized complete metric space, and let F : X P cl ( X ) be a multivalued A-contraction, i.e., there exists a matrix A M m m ( R + ) such that A converges to zero and
H ( F ( x ) , F ( y ) ) A d ( x , y ) , for all  x , y X .
Suppose also that S F i x ( F ) , i.e., there exists x X such that { x } = F ( x ) . Then
  1. (a)

    the fixed point inclusion (8) is Ulam-Hyers stable;

     
  2. (b)

    the multivalued operator F has the limit shadowing property.

     
Proof (a) Let ε : = ( ε 1 , , ε m ) (with ε i > 0 for i { 1 , , m } ), and let y X be an ε-solution of (8), i.e., D ( y , F ( y ) ) ε . Let x X be such that { x } = F ( x ) . Then
d ( y , x ) D ( y , F ( y ) ) + H ( F ( y ) , F ( x ) ) ε + A d ( y , x ) .

Thus d ( y , x ) ( I A ) 1 ε .

(b) Let ( y n ) n N be a sequence in X such that D ( y n + 1 , F ( y n ) ) O as n . We shall prove first that d ( y n , x ) O as n + . We successively have
d ( x , y n + 1 ) H ( x , F ( y n ) ) + D ( y n + 1 , F ( y n ) ) A d ( x , y n ) + D ( y n + 1 , F ( y n ) ) A [ A d ( x , y n 1 ) + D ( y n , F ( y n 1 ) ) ] + D ( y n + 1 , F ( y n ) ) A n + 1 d ( x , y 0 ) + A n D ( y 1 , F ( y 0 ) ) + + A D ( y n , F ( y n 1 ) ) + D ( y n + 1 , F ( y n ) ) .

By Cauchy’s lemma, the right hand side tends to O as n + . Thus d ( x , y n + 1 ) O as n + .

On the other hand, by Theorem 2.11(i)-(ii), we know that there exists a sequence ( x n ) n N of successive approximations for F starting from arbitrary ( x 0 , x 1 ) Graph ( F ) , which converge to a fixed point x X of the operator F. Since, the fixed point is unique, we get that d ( x n , x ) O as n + . Hence, for such a sequence ( x n ) n N , we have
d ( y n , x n ) d ( y n , x ) + d ( x , x n ) O as  n + .

 □

We also have the following abstract results concerning the Ulam-Hyers stability of the fixed point inclusion (8) for multivalued operators.

Theorem 2.19 Let ( X , d ) be a generalized metric space, and let F : X P cl ( X ) be a multivalued ψ-weakly Picard operator. Suppose also that there exists a matrix C M m m ( R + ) such that for any ε : = ( ε 1 , , ε m ) (with ε i > 0 for i { 1 , , m } ) and any z X with D ( z , F ( z ) ) ε there exists u F ( z ) such that d ( z , u ) C ε . Then, the fixed point inclusion (8) is generalized Ulam-Hyers stable.

Proof Let ε : = ( ε 1 , , ε m ) (with ε i > 0 for i { 1 , , m } ) and y X be a ε-solution of (8), i.e., D ( y , F ( y ) ) ε . Since F is a multivalued ψ-weakly Picard operator, for each ( x , y ) Graph ( F ) , we have
d ( x , f ( x , y ) ) ψ ( d ( x , y ) ) .
Now, by our additional assumption, for y X there exists u F ( y ) such that d ( y , u ) C ε . Thus, define x : = f ( y , u ) Fix ( F ) , and we get
d ( y , x ) ψ ( d ( y , u ) ) ψ ( C ε ) .

 □

As an exemplification of the previous theorem, we have the following result.

Let us recall first an important notion. A subset U of a (generalized) metric space ( X , d ) is called proximinal if for each x X there exists u U such that d ( x , y ) = D ( x , U ) .

As a consequence of Theorem 2.11 and of the abstract result above, we obtain the following theorem.

Corollary 2.20 Let ( X , d ) be a generalized complete metric space, and let F : X P cl ( X ) be a multivalued A-contraction with proximinal values. Then the fixed point inclusion (8) is Ulam-Hyers stable.

Proof Let ε : = ( ε 1 , , ε m ) (with ε i > 0 for i { 1 , , m } ), and let y X be a ε-solution of (8), i.e., D ( y , F ( y ) ) ε . Since F is an ( I A ) 1 -MWP operator, for each ( x , y ) Graph ( F ) , we have
d ( x , f ( x , y ) ) ( I A ) 1 d ( x , y ) .
Since F ( y ) is a proximinal set, there exists u F ( y ) such that d ( y , u ) = D ( y , F ( y ) ) . Thus, if we consider x : = f ( y , u ) Fix ( F ) , we get
d ( y , x ) ( I A ) 1 d ( y , u ) ( I A ) 1 ε .

 □

Remark 2.21 It is an open question to give other examples of how Theorem 2.19 can be applied. A more general open question is to give similar results for multivalued almost contractions with matrices A and B.

For other examples and results regarding the Ulam-Hyers stability and the limit shadowing property of the operatorial equations and inclusions, see Bota-Petruşel [35], Petru-Petruşel-Yao [36], Petruşel-Rus [29] and Rus [32, 33].

3 An application to coupled fixed point results for singlevalued operators without mixed monotone property

Let X be a nonempty set endowed with a partial order relation denoted by ≤. Then we denote
X : = { ( x 1 , x 2 ) X × X : x 1 x 2  or  x 2 x 1 } .
If f : X X is an operator, then we denote the Cartesian product of f with itself as follows
f × f : X × X X × X , given by  ( f × f ) ( x 1 , x 2 ) : = ( f ( x 1 ) , f ( x 2 ) ) .
Definition 3.1 Let X be a nonempty set. Then ( X , d , ) is called an ordered generalized metric space if
  1. (i)

    ( X , d ) is a generalized metric space in the sense of Perov;

     
  2. (ii)

    ( X , ) is a partially ordered set.

     

The following result will be an important tool in our approach.

Theorem 3.2 Let ( X , d , ) be an ordered generalized metric space, and let f : X X be an operator. We suppose that
  1. (1)

    for each ( x , y ) X there exists z ( x , y ) : = z X such that ( x , z ) , ( y , z ) X ;

     
  2. (2)

    X I ( f × f ) ;

     
  3. (3)

    f : ( X , d ) ( X , d ) is continuous;

     
  4. (4)

    the metric d is complete;

     
  5. (5)

    there exists x 0 X such that ( x 0 , f ( x 0 ) ) X ;

     
  6. (6)
    there exists a matrix A M m m ( R + ) , which converges to zero such that
    d ( f ( x ) , f ( y ) ) A d ( x , y ) for each  ( x , y ) X .
     

Then f : ( X , d ) ( X , d ) is a Picard operator.

Proof Let x X be arbitrary. Since ( x 0 , f ( x 0 ) ) X , by (6) and (4), we get that there exists x X such that ( f n ( x 0 ) ) n N x as n + . By (3), we get that x Fix ( f ) .

If ( x , x 0 ) X , then by (2), we have that ( f n ( x ) , f n ( x 0 ) ) X for each n N . Thus, by (6), we get that ( f n ( x ) ) n N x as n + .

If ( x , x 0 ) X , then by (1), it follows that there exists z ( x , x 0 ) : = z X such that ( x , z ) , ( x 0 , z ) X . By the fact that ( x 0 , z ) X , as before, we get that ( f n ( z ) ) n N x as n + . This together with the fact that ( x , z ) X implies that ( f n ( x ) ) n N x as n + .

Finally, the uniqueness of the fixed point follows by the contraction condition (6) using again the assumption (1). □

Remark 3.3 The conclusion of the theorem above holds if instead of hypothesis (2) we put

(2′) f : ( X , ) ( X , ) is monotone increasing

or

(2″) f : ( X , ) ( X , ) is monotone decreasing.

Of course, it is easy to remark that assertion (2) in Theorem 3.2 is more general. For example, if we consider the ordered metric space ( R 2 , d , ) , then f : R 2 R 2 , f ( x 1 , x 2 ) : = ( g ( x 1 , x 2 ) , g ( x 1 , x 2 ) ) satisfies (2) for any g : R 2 R .

Remark 3.4 Condition (5) from the theorem above is equivalent with

(5′) f has a lower or an upper fixed point in X.

Remark 3.5 For some similar results, see Theorem 4.2 and Theorem 4.7 in [37].

We will apply the above result for the coupled fixed point problem generated by two operators.

Let X be a nonempty set endowed with a partial order relation denoted by ≤. If we consider z : = ( x , y ) , w : = ( u , v ) two arbitrary elements of Z : = X × X , then, by definition,
z w if and only if ( x u  and  y v ) .

Notice that is a partial order relation on Z.

We denote
Z = { ( z , w ) : = ( ( x , y ) , ( u , v ) ) Z × Z : z w  or  w z } .
Let T : Z Z be an operator defined by
T ( x , y ) : = ( T 1 ( x , y ) T 2 ( x , y ) ) = ( T 1 ( x , y ) , T 2 ( x , y ) ) .
(10)
The Cartesian product of T and T will be denoted by T × T , and it is defined in the following way
T × T : Z × Z Z × Z , ( T × T ) ( z , w ) : = ( T ( z ) , T ( w ) ) .

The first main result of this section is the following theorem.

Theorem 3.6 Let ( X , d , ) be an ordered and complete metric space, and let T 1 , T 2 : X × X X be two operators. We suppose that
  1. (i)
    for each z = ( x , y ) , w = ( u , v ) X × X , which are not comparable with respect to the partial ordering on X × X , there exists t : = ( t 1 , t 2 ) X × X (which may depend on ( x , y ) and ( u , v ) ) such that t is comparable (with respect to the partial ordering ) with both z and w, i.e.,
    ( ( x t 1 and y t 2 ) or ( x t 1 and y t 2 ) ) and ( ( u t 1 and v t 2 ) or ( u t 1 and v t 2 ) ) ;
     
  2. (ii)
    for all ( x u and y v ) or ( u x and v y ), we have
    { T 1 ( x , y ) T 1 ( u , v ) , T 2 ( x , y ) T 2 ( u , v ) or { T 1 ( u , v ) T 1 ( x , y ) , T 2 ( u , v ) T 2 ( x , y ) ;
     
  3. (iii)

    T 1 , T 2 : X × X X are continuous;

     
  4. (iv)
    there exists z 0 : = ( z 0 1 , z 0 2 ) X × X such that
    { z 0 1 T 1 ( z 0 1 , z 0 2 ) , z 0 2 T 2 ( z 0 1 , z 0 2 ) or { T 1 ( z 0 1 , z 0 2 ) z 0 1 , T 2 ( z 0 1 , z 0 2 ) z 0 2 ;
     
  5. (v)
    there exists a matrix A = ( k 1 k 2 k 3 k 4 ) M 2 ( R + ) convergent toward zero such that
    d ( T 1 ( x , y ) , T 1 ( u , v ) ) k 1 d ( x , u ) + k 2 d ( y , v ) , d ( T 2 ( x , y ) , T 2 ( u , v ) ) k 3 d ( x , u ) + k 4 d ( y , v )

    for all ( x u and y v ) or ( u x and v y ).

     
Then there exists a unique element ( x , y ) X × X such that
x = T 1 ( x , y ) and y = T 2 ( x , y ) ,

and the sequence of the successive approximations ( T 1 n ( w 0 1 , w 0 2 ) , T 2 n ( w 0 1 , w 0 2 ) ) converges to ( x , y ) as n for all w 0 = ( w 0 1 , w 0 2 ) X × X .

Proof Denote Z : = X × X . We show that Theorem 3.2 is applicable for the operator T : Z Z defined by
T ( x , y ) : = ( T 1 ( x , y ) , T 2 ( x , y ) ) .

Notice first that by (i), we get that if ( z : = ( x , y ) , w : = ( u , v ) ) Z , there exists t Z such that ( z , t ) , ( w , t ) Z . Thus, the first assumption of Theorem 3.2 holds.

In order to prove (2) from Theorem 3.2, let z = ( x , y ) , w = ( u , v ) be arbitrary elements of Z (where ( x u and y v ) or ( u x and v y )) such that
{ T 1 ( x , y ) T 1 ( u , v ) , T 2 ( x , y ) T 2 ( u , v ) or { T 1 ( u , v ) T 1 ( x , y ) , T 2 ( u , v ) T 2 ( x , y ) .
From { T 1 ( x , y ) T 1 ( u , v ) , T 2 ( x , y ) T 2 ( u , v ) , we get that ( T 1 ( x , y ) , T 2 ( x , y ) ) ( T 1 ( u , v ) , T 2 ( u , v ) ) , that is
T ( z ) T ( w ) .
(11)
By a similar approach, we alternatively have that
T ( w ) T ( z ) .
(12)
Using (11) and (12), we get that
( T ( z ) , T ( w ) ) Z for all  ( z , w ) Z .
Thus, we get ( T × T ) ( Z ) Z , which implies that
Z I ( T × T ) .
(13)
In order to obtain (5) from Theorem 3.2, notice first that since there exists ( z 0 1 , z 0 2 ) X × X such that
{ z 0 1 T 1 ( z 0 1 , z 0 2 ) , z 0 2 T 2 ( z 0 1 , z 0 2 ) or { T 1 ( z 0 1 , z 0 2 ) z 0 1 , T 2 ( z 0 1 , z 0 2 ) z 0 2 ,
(14)
we obtain that
( z 0 1 , z 0 2 ) ( T 1 ( z 0 1 , z 0 2 ) , T 2 ( z 0 1 , z 0 2 ) ) .
(15)

Thus, we have z 0 T ( z 0 ) . By a similar approach, we alternatively obtain that T ( z 0 ) z 0 . Thus, ( z 0 , T ( z 0 ) ) Z .

Finally, in order to prove hypotheses (3) and (6) from Theorem 3.2, we define the mapping d ˜ : Z × Z R + 2 by
d ˜ ( ( x , y ) , ( u , v ) ) : = ( d ( x , u ) d ( y , v ) ) .
Notice now that if ( X , d , ) is an ordered metric space, then ( Z , d ˜ , ) is an ordered generalized metric space. The completeness of d ˜ follows from the completeness of d. Notice also that the continuity of T follows by (iii). For hypothesis (6), we successively have
d ˜ ( T ( x , y ) , T ( u , v ) ) = d ˜ ( ( T 1 ( x , y ) , T 2 ( x , y ) ) , ( T 1 ( u , v ) , T 2 ( u , v ) ) ) = ( d ( T 1 ( x , y ) , T 1 ( u , v ) ) d ( T 2 ( x , y ) , T 2 ( u , v ) ) ) ( k 1 d ( x , u ) + k 2 d ( y , v ) k 3 d ( x , u ) + k 4 d ( y , v ) ) = ( k 1 k 2 k 3 k 4 ) ( d ( x , u ) d ( y , v ) ) = A d ˜ ( ( x , y ) , ( u , v ) ) .
Hence
d ˜ ( T ( z ) , T ( w ) ) A d ˜ ( z , w ) for all  z , w Z .
(16)
Thus, the triple ( Z , d ˜ , ) and the operator T : Z Z satisfy all the hypothesis of Theorem 3.2. Hence, T is a Picard operator, and so, the equation z = T ( z ) has a unique solution z X × X , and the sequence of successive approximations of the operator T, starting from any w 0 X × X converges to z . Thus, the unique element z = ( x , y ) satisfies the system
{ x = T 1 ( x , y ) , y = T 2 ( x , y )
and T n ( w 0 ) z as n , where T n ( w 0 ) = ( T 1 n ( w 0 ) , T 2 n ( w 0 ) ) and
T 1 n ( w 0 ) = T 1 n 1 ( T 1 ( w 0 ) , T 2 ( w 0 ) ) , T 2 n ( w 0 ) = T 2 n 1 ( T 1 ( w 0 ) , T 2 ( w 0 ) )
(17)

for all n N , n 2 . □

For the particular case of classical coupled fixed point problems (i.e., T 1 ( x , y ) : = S ( x , y ) and T 1 ( x , y ) : = S ( y , x ) , where S : X × X X is a given operator) we get (by Theorem 3.6) the following generalization of the Gnana Bhaskar-Lakshmikantham theorem in [17].

Theorem 3.7 Let ( X , d , ) be an ordered and complete metric space, and let S : X × X X be an operator. We suppose that
  1. (i)

    for each z = ( x , y ) , w = ( u , v ) X × X , which are not comparable with respect to the partial ordering on X × X , there exists t : = ( t 1 , t 2 ) X × X (which may depend on ( x , y ) and ( u , v ) ) such that t is comparable (with respect to the partial ordering ) with both z and w;

     
  2. (ii)
    for all ( x u and y v ) or ( u x and v y ), we have
    { S ( x , y ) S ( u , v ) , S ( y , x ) S ( v , u ) or { S ( u , v ) S ( x , y ) , S ( v , u ) S ( y , x ) ;
     
  3. (iii)

    S : X × X X is continuous;

     
  4. (iv)
    there exists z 0 : = ( z 0 1 , z 0 2 ) X × X such that
    { z 0 1 S ( z 0 1 , z 0 2 ) , z 0 2 S ( z 0 2 , z 0 1 ) or { S ( z 0 1 , z 0 2 ) z 0 1 , S ( z 0 2 , z 0 1 ) z 0 2 ;
     
  5. (v)
    there exist k 1 , k 2 R + with k 1 + k 2 < 1 such that
    d ( S ( x , y ) , S ( u , v ) ) k 1 d ( x , u ) + k 2 d ( y , v )

    for all ( x u and y v ) or ( u x and v y ).

     
Then there exists a unique element ( x , y ) X × X such that
x = S ( x , y ) and y = S ( y , x )

and the sequence of the successive approximations ( S n ( w 0 1 , w 0 2 ) , S n ( w 0 2 , w 0 1 ) ) converges to ( x , y ) as n for all w 0 = ( w 0 1 , w 0 2 ) X × X .

As an application of the previous theorem, we get now an existence and uniqueness result for a system of functional-integral equations, which appears in some traffic flow models.
{ x ( t ) = f ( t , x ( t ) , 0 T k ( t , s , x ( s ) , y ( s ) ) d s ) , y ( t ) = f ( t , y ( t ) , 0 T k ( t , s , x ( s ) , y ( s ) ) d s ) .
(18)

By a solution of the previous system, we understand a couple ( x , y ) C [ 0 , T ] × C [ 0 , T ] , which satisfies the system for all t [ 0 , T ] .

As before, we consider on X : = C [ 0 , T ] the following partial ordering relation
x C y if and only if x ( t ) y ( t ) for all  t [ 0 , T ]
and the supremum norm
x C : = max t [ 0 , T ] | x ( t ) | .

Notice that, as before, the partial ordering relation C generates on X × X a partial ordering C .

If we define
S : X × X X , ( x , y ) S ( x , y ) , where  S ( x , y ) ( t ) : = f ( t , x ( t ) , 0 T k ( t , s , x ( s ) , y ( s ) ) d s ) ,
then, the above system can be represented as a coupled fixed point problem
{ x = S ( x , y ) , y = S ( y , x ) .

An existence and uniqueness result for the system (18) is the following theorem.

Theorem 3.8 Let k : [ 0 , T ] × [ 0 , T ] × R 2 R and f : [ 0 , T ] × R × R R be two continuous mappings. We suppose that
  1. (i)
    there exists z 0 : = ( z 0 1 , z 0 2 ) C [ 0 , T ] × C [ 0 , T ] such that
    { z 0 1 ( t ) f ( t , z 0 1 ( t ) , 0 t k ( t , s , z 0 1 ( t ) , z 0 2 ( t ) ) d s ) , z 0 2 ( t ) f ( t , z 0 2 ( t ) , 0 t k ( t , s , z 0 2 ( t ) , z 0 1 ( t ) ) d s ) or { z 0 1 ( t ) f ( t , z 0 1 ( t ) , 0 t k ( t , s , z 0 1 ( t ) , z 0 2 ( t ) ) d s ) , z 0 2 ( t ) f ( t , z 0 2 ( t ) , 0 t k ( t , s , z 0 2 ( t ) , z 0 1 ( t ) ) d s ) ;
     
  2. (ii)
    1. (a)

      f ( t , , z ) is increasing for all t [ 0 , T ] , z R and k ( t , s , , z ) is increasing, k ( t , s , w , ) is decreasing and f ( t , w , ) is increasing for all t , s [ 0 , T ] , w , z R

       
    or
    1. (b)

      f ( t , , z ) is decreasing for all t [ 0 , T ] , z R and k ( t , s , , z ) is decreasing, k ( t , s , w , ) is increasing and f ( t , w , ) is decreasing for all t , s [ 0 , T ] , w , z R ;

       
     
  3. (iii)
    there exist k 1 , k 2 R + such that
    | f ( t , w 1 , z 1 ) f ( t , w 2 , z 2 ) | k 1 | w 1 w 2 | + k 2 | z 1 z 2 |

    for all t [ 0 , T ] and w 1 , w 2 , z 1 , z 2 R ;

     
  4. (iv)
    there exist α , β R + such that for all t , s [ 0 , T ] and w 1 , w 2 , z 1 , z 2 R , we have
    | k ( t , s , w 1 , z 1 ) k ( t , s , w 2 , z 2 ) | α | w 1 w 2 | + β | z 1 z 2 | ;
     
  5. (v)

    k 1 + k 2 T ( α + β ) < 1 .

     

Then, there exists a unique solution ( x , y ) of system (18).

Proof From the hypotheses, we get that all the assumptions of Theorem 3.7 are satisfied for the operator
S : X × X X , ( x , y ) S ( x , y ) , S ( x , y ) ( t ) : = f ( t , x ( t ) , 0 T k ( t , s , x ( s ) , y ( s ) ) d s ) ,

where X : = ( C [ 0 , T ] , C , C ) . □

We introduce now the concept of Ulam-Hyers stability for coupled fixed point problems.

Definition 3.9 Let ( X , d ) be a metric space, and let T 1 , T 2 : X × X X be two operators. Then the operatorial equations system
{ x = T 1 ( x , y ) , y = T 2 ( x , y )
(19)
is said to be Ulam-Hyers stable if there exist c 1 , c 2 , c 3 , c 4 > 0 such that for each ε 1 , ε 2 > 0 and each pair ( u , v ) X × X such that
d ( u , T 1 ( u , v ) ) ε 1 , d ( v , T 2 ( u , v ) ) ε 2
(20)
there exists a solution ( x , y ) X × X of (19) such that
d ( u , x ) c 1 ε 1 + c 2 ε 2 , d ( v , y ) c 3 ε 1 + c 4 ε 2 .
(21)

It is an open problem to obtain Ulam-Hyers stability results for the coupled fixed point problem in the context of ordered metric spaces. For several results on this subject, see [35, 36].

Remark 3.10 The case of a system of operatorial inclusions of the form
{ x T 1 ( x , y ) , y T 2 ( x , y )

(where T 1 , T 2 : X × X P ( X ) are two given multivalued operators) can be treated in a similar way.

Declarations

Acknowledgements

(1) For the first author, this paper was supported by a grant of the Romanian National Authority for Scientific Research, CNCS-UEFISCDI, project number PN-II-ID-PCE-2011-3-0094, while for the third author, this work was possible with the financial support of the Sectoral Operational Programme for Human Resources Development 2007-2013, co-financed by the European Social Fund, under the project number POSDRU/107/1.5/S/76841 with the title Modern Doctoral Studies: Internationalization and Interdisciplinarity. (2) The authors are thankful to the reviewers for the careful reading of the paper and fruitful comments which improved the quality of the paper in a significant way.

Authors’ Affiliations

(1)
Babeş-Bolyai University Cluj-Napoca, Kogălniceanu Street no. 1, Cluj-Napoca, 400084, Romania

References

  1. Perov AI: On the Cauchy problem for a system of ordinary differential equations. Pviblizhen. Met. Reshen, Differ. Uravn. 1964, 2: 115–134.MathSciNetGoogle Scholar
  2. Perov AI, Kibenko AV: On a certain general method for investigation of boundary value problems. Izv. Akad. Nauk SSSR, Ser. Mat. 1966, 30: 249–264. (in Russian)MathSciNetGoogle Scholar
  3. Bucur A, Guran L, Petruşel A: Fixed points for multivalued operators on a set endowed with vector-valued metrics and applications. Fixed Point Theory 2009, 10(1):19–34.MathSciNetGoogle Scholar
  4. Agarwal RP: Contraction and approximate contraction with an application to multi-point boundary value problems. J. Comput. Appl. Math. 1983, 9: 315–325. 10.1016/0377-0427(83)90003-1MathSciNetView ArticleGoogle Scholar
  5. Filip AD, Petruşel A: Fixed point theorems on spaces endowed with vector-valued metrics. Fixed Point Theory Appl. 2009., 2010: Article ID 281381Google Scholar
  6. O’Regan D, Shahzad N, Agarwal RP Fixed Point Theory and Applications. In Fixed Point Theory for Generalized Contractive Maps on Spaces with Vector-Valued Metrics. Nova Science Publishers, New York; 2007:143–149.Google Scholar
  7. Precup R, Viorel A: Existence results for systems of nonlinear evolution equations. Int. J. Pure Appl. Math. 2008, 47(2):199–206.MathSciNetGoogle Scholar
  8. Precup R, Viorel A: Existence results for systems of nonlinear evolution inclusions. Fixed Point Theory 2010, 11(2):337–346.MathSciNetGoogle Scholar
  9. Precup R: The role of matrices that are convergent to zero in the study of semilinear operator systems. Math. Comput. Model. 2009, 49: 703–708. 10.1016/j.mcm.2008.04.006MathSciNetView ArticleGoogle Scholar
  10. Petruşel A: Multivalued weakly Picard operators and applications. Sci. Math. Jpn. 2004, 59: 169–202.MathSciNetGoogle Scholar
  11. Petre IR, Petruşel A: Krasnoselskii’s theorem in generalized Banach spaces and applications. Electron. J. Qual. Theory Differ. Equ. 2012, 85: 1–20.View ArticleGoogle Scholar
  12. Rezapour S, Amiri P: Some fixed point results for multivalued operators in generalized metric spaces. Comput. Math. Appl. 2011, 61: 2661–2666.MathSciNetView ArticleGoogle Scholar
  13. Opoitsev VI: Heterogenic and combined-concave operators. Syber. Math. J. 1975, 16: 781–792. (in Russian)Google Scholar
  14. Opoitsev VI: Dynamics of collective behavior. III. Heterogenic systems. Avtom. Telemeh. 1975, 36: 124–138. (in Russian)MathSciNetGoogle Scholar
  15. Opoitsev VI, Khurodze TA: Nonlinear Operators in Spaces with a Cone. Tbilis. Gos. Univ., Tbilisi; 1984:271. (in Russian)Google Scholar
  16. Guo D, Lakshmikantham V: Coupled fixed points of nonlinear operators with applications. Nonlinear Anal. 1987, 11: 623–632. 10.1016/0362-546X(87)90077-0MathSciNetView ArticleGoogle Scholar
  17. Gnana Bhaskar T, Lakshmikantham V: Fixed point theorems in partially ordered metric spaces and applications. Nonlinear Anal. 2006, 65: 1379–1393. 10.1016/j.na.2005.10.017MathSciNetView ArticleGoogle Scholar
  18. Lakshmikantham V, Ćirić L: Coupled fixed point theorems for nonlinear contractions in partially ordered metric spaces. Nonlinear Anal. 2009, 70: 4341–4349. 10.1016/j.na.2008.09.020MathSciNetView ArticleGoogle Scholar
  19. Guo D, Cho YJ, Zhu J: Partial Ordering Methods in Nonlinear Problems. Nova Science Publishers, Hauppauge; 2004.Google Scholar
  20. Hong S: Fixed points for mixed monotone multivalued operators in Banach spaces with applications. J. Math. Anal. Appl. 2008, 337: 333–342. 10.1016/j.jmaa.2007.03.091MathSciNetView ArticleGoogle Scholar
  21. Rus, MD: The method of monotone iterations for mixed monotone operators. PhD thesis, Babeş-Bolyai University Cluj-Napocaac (2010)Google Scholar
  22. Berinde V: Generalized coupled fixed point theorems for mixed monotone mappings in partially ordered metric spaces. Nonlinear Anal. 2011, 74: 7347–7355. 10.1016/j.na.2011.07.053MathSciNetView ArticleGoogle Scholar
  23. Luxemburg WAJ, Zaanen AC 1. In Riesz Spaces I. North-Holland, Amsterdam; 1971.Google Scholar
  24. Luxemburg WAJ, Zaanen AC: Riesz Spaces II. North-Holland, Amsterdam; 1983.Google Scholar
  25. Zabrejko PP: K -metric and K -normed linear spaces: survey. Collect. Math. 1997, 48(4–6):825–859.MathSciNetGoogle Scholar
  26. Huang L-G, Zhang X: Cone metric spaces and fixed point theorems of contractive mappings. J. Math. Anal. Appl. 2007, 332: 1468–1476. 10.1016/j.jmaa.2005.03.087MathSciNetView ArticleGoogle Scholar
  27. Varga RS Springer Series in Computational Mathematics 27. In Matrix Iterative Analysis. Springer, Berlin; 2000.View ArticleGoogle Scholar
  28. Allaire G, Kaber SM: Numerical Linear Algebra. Springer, New York; 2008.View ArticleGoogle Scholar
  29. Petruşel A, Rus IA: The theory of a metric fixed point theorem for multivalued operators. In Fixed Point Theory and Its Applications. Edited by: Lin LJ, Petrusel A, Xu HK. Yokohama Publ., Yokohama; 2010:167–176.Google Scholar
  30. Urs C: Coupled fixed point theorems and applications. Miskolc Math. Notes 2013, 14(1):323–333.MathSciNetGoogle Scholar
  31. Berinde M, Berinde V: On a general class of multi-valued weakly Picard mappings. J. Math. Anal. Appl. 2007, 326: 772–782. 10.1016/j.jmaa.2006.03.016MathSciNetView ArticleGoogle Scholar
  32. Rus IA: The theory of a metrical fixed point theorem: theoretical and applicative relevances. Fixed Point Theory 2008, 9(2):541–559.MathSciNetGoogle Scholar
  33. Rus IA: Remarks on Ulam stability of the operatorial equations. Fixed Point Theory 2009, 10(2):305–320.MathSciNetGoogle Scholar
  34. Rus IA, Petruşel A, Sîntămărian A: Data dependence of the fixed points set of some multivalued weakly Picard operators. Nonlinear Anal. 2003, 52: 1947–1959. 10.1016/S0362-546X(02)00288-2MathSciNetView ArticleGoogle Scholar
  35. Bota M, Petruşel A: Ulam-Hyers stability for operatorial equations. An. Stiint. Univ. Al. I. Cuza Iasi. Mat. (N.S.) 2011, 57: 65–74.MathSciNetGoogle Scholar
  36. Petru PT, Petruşel A, Yao JC: Ulam-Hyers stability for operatorial equations and inclusions via nonself operators. Taiwan. J. Math. 2011, 15(5):2195–2212.Google Scholar
  37. Petruşel A, Rus IA: Fixed point theorems in ordered L -spaces. Proc. Am. Math. Soc. 2005, 134(2):411–418. 10.1090/S0002-9939-05-07982-7View ArticleGoogle Scholar

Copyright

Advertisement