Next Article in Journal
Area Properties of Strictly Convex Curves
Next Article in Special Issue
Prešić Type Nonself Operators and Related Best Proximity Results
Previous Article in Journal
Linguistic Neutrosophic Numbers Einstein Operator and Its Application in Decision Making
Previous Article in Special Issue
Generalized Viscosity Implicit Iterative Process for Asymptotically Non-Expansive Mappings in Banach Spaces
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Numerical Reckoning Fixed Points of (ρE)-Type Mappings in Modular Vector Spaces

1
Department of Mathematics and Informatics, University Politehnica of Bucharest, 060042 Bucharest, Romania
2
Department of Mathematics, International University of Beirut (BIU), 146404 Beirut, Lebanon
*
Author to whom correspondence should be addressed.
Mathematics 2019, 7(5), 390; https://doi.org/10.3390/math7050390
Submission received: 6 February 2019 / Revised: 15 April 2019 / Accepted: 25 April 2019 / Published: 29 April 2019
(This article belongs to the Special Issue Fixed Point, Optimization, and Applications)

Abstract

:
In this paper, we study an iteration process introduced by Thakur et al. for Suzuki mappings in Banach spaces, in the new context of modular vector spaces. We establish existence results for a more recent version of Suzuki generalized non-expansive mappings. The stability and data dependence of the scheme for ρ -contractions is studied as well.

1. Introduction

Iterative processes are very important tools for finding numerical solutions of certain classes of problems of nonlinear analysis, which can be formulated in the language of fixed point theory and which cannot be tackled with analytical methods. Notable examples include the problem of finding the roots of polynomials with complex coefficients, the study of variational inequalities and equilibrium problems, algorithms for signal and image processing, etc. Perhaps the best known, due to its key role in the proof of the Banach Contraction Principle, is the Picard iteration process.
Meanwhile, the study of non-expansive mappings stimulated the search of new iteration processes. This was motivated in part by the fact that, unlike the case of contraction mappings, the successive application of a non-expansive mapping does not necessarily lead to a fixed point. The earliest results in this direction were obtained by Krasnosel’skii [1], Mann [2], Halpern [3], Berinde [4], for one-step iterations; Ishikawa [5], etc., for two-step iterations; Noor [6], Agrawal et al. [7], Abbas and Nazir [8], Gürsoy and Karakaya [9], Sintunavarat and Pitea [10], Thakur et al. [11,12], for three-step iterations; and the search for new iteration schemes has remained active ever since.
The iterative processes studied in the above-mentioned works are defined for certain classes of mappings, mainly on Banach spaces with a suitable geometric structure, most often on uniformly convex spaces. While the literature on the subject is becoming quite vast, we believe that it is also important to study iterative processes on modular vector spaces. This is due to the fact that they provide a unified approach to many important spaces which appear in various branches of mathematics, such as Orlicz spaces or Lebesgue spaces. That is why our goal is to study a iterative scheme introduced by Thakur et al. [13] for Suzuki mappings [14] on Banach spaces, in the framework of modular vector spaces. The mappings under consideration are required to satisfy a modular counterpart of the condition (E) from Garcia-Falset et al. [15], which is weaker than Suzuki’s condition (C). Recent results in a similar direction have been obtained by Khan [16] and Mitrinović et al. [17].
Modular spaces have been extensively studied by Nakano in his classical monograph [18]. The first examples can be traced back to the early works of Orlicz [19], who introduced what is called now Orlicz spaces. These function spaces are generalizations of L p spaces where, instead of a p-norm, one works with N-functions (for example N 1 t = e t t 1 , N 2 ( t ) = e t 2 1 ) thus, allowing growth properties more general than power type growth (for details, see for instance [20,21]). These include notable examples such as variable exponent spaces and provide, as well.
The paper is organized as follows. In the first section, we recall the definition of modular vector spaces and their properties needed throughout the paper. In Section 2, we define the mappings satisfying the modular version of the condition (E), providing an example of such a mapping. In Section 3, we study convergence of the iterative scheme introduced by Takur et al. in [13]. The main results of the section are Lemma 3, Theorem 1 and Theorem 2, which give sufficient conditions of convergence and fixed point existence results for ρ E -type mappings. The fourth section is dedicated to the study of stability and data dependence with respect to ρ -contractive mappings. The main results are Theorem 3 and Theorem 4, respectively.

2. Modular Vector Spaces

Definition 1
([21]). Let X be a real (or complex) vector space. A function ρ : X [ 0 , ] is called a modular if it satisfies:
(1)
ρ ( x ) = 0 if and only if x = 0 ,
(2)
ρ ( α x ) = ρ ( x ) , for | α | = 1 ,
(3)
ρ α x + 1 α y ρ x + ρ y , where α 0 , 1 ,
for any x , y X . If we replace condition ( 3 ) with the following condition
ρ α x + 1 α y α ρ x + 1 α ρ y ,
for any α 0 , 1 and any x , y X , then ρ is called a convex modular.
Unless otherwise specified, throughout this paper, we shall assume that ρ is a convex modular.
Example 1.
Let ρ : R 2 0 , , ρ x 1 , x 2 = x 1 2 + | x 2 | . It is clear that ρ x 1 , x 2 = x 1 2 + | x 2 | = 0 if and only if x 1 , x 2 = 0 , 0 . The last two conditions of the definition are satisfied since both square function and absolute value function are even and convex. Thus, ρ is a convex modular. Notice that this modular does not satisfy the triangle axiom. Take for instance ρ 2 , 1 + 1 , 1 = 11 > 7 = ρ 2 , 1 + ρ 1 , 1 .
A convex modular ρ on a vector space X defines naturally a vector subspace as follows.
Definition 2
([21]). Let ρ be a convex modular function defined on a vector space X. The vector subspace
X ρ = { x X : lim α 0 ρ α x = 0 }
is called a modular space.
The modular vector space X ρ can be endowed with a topology associated with the modular ρ by analogy with the metric topology.
Definition 3
([22]). Let ρ be a modular function defined on a vector space X
(a) 
A sequence { x n } X ρ is called ρ-convergent to some x X ρ if and only if lim n ρ x n x = 0 .
(b) 
A sequence { x n } X ρ is called ρ-Cauchy if lim m , n ρ x m x n = 0 .
(c) 
We say that X ρ is ρ-complete if any ρ-Cauchy sequence in X ρ is ρ-convergent.
(d) 
A set C X ρ is called ρ-closed if for any sequence { x n } C which ρ-converges to some point x; it implies that x C .
(e) 
A set C X ρ is called ρ-bounded if δ ρ C = sup ρ x y ; x , y C < .
(f) 
A set K X ρ is called ρ-compact if any sequence { x n } in K has a subsequence which ρ-converges to a point in K.
(g) 
ρ is said to satisfy the Fatou property if ρ x y lim inf n ρ x y n whenever { y n } ρ-converges to y, for any x , y , y n in X ρ .
The property of uniform convexity plays a crucial role while proving results in the framework of normed spaces. The same is true in the context of modular spaces.
Definition 4
(Definition 3.1, [22]). The uniform convexity type properties of the modular ρ are defined for every r > 0 and every ε > 0 as follows:
(a) 
Define
D 1 r , ε = x , y : x , y X ρ , ρ x r , ρ y r , ρ x y ε r .
If D 1 r , ε , let
δ 1 r , ε = inf 1 1 r ρ x + y 2 : x , y D 1 r , ε .
If D 1 r , ε = , set δ 1 r , ε = 1 .
We say that ρ satisfies U U C 1 if for every s 0 and ε > 0 , there exists η 1 ( s , ε ) > 0 , depending on s and ε, such that
δ 1 r , ε > η 1 s , ε > 0 , for r > s .
(b) 
Define
D 2 r , ε = x , y : x , y X ρ , ρ x r , ρ y r , ρ x y 2 ε r .
If D 2 r , ε , let
δ 2 r , ε = inf 1 1 r ρ x + y 2 : x , y D 2 r , ε .
If D 1 r , ε = , set δ 1 r , ε = 1 .
We say that ρ satisfies U U C 2 if for every s 0 and ε > 0 , there exists η 2 s , ε > 0 depending on s and ε, such that
δ 2 r , ε > η 2 s , ε > 0 , for r > s .
The following technical result, whose proof is similar to its modular function spaces counterpart (Lemma 4.2, [23]), will play an important role in the sequel.
Lemma 1.
Let ρ be a convex modular which is U U C 1 and let { t n } 0 , 1 be a sequence bounded away from 0 and 1. If there exists r > 0 such that
lim sup n ρ x n r , lim sup n ρ y n r , lim n ρ t n x n + 1 t n y n = r ,
where { x n } and { y n } are sequences in X ρ , then lim n ρ x n y n = 0 .
Definition 5.
Let { x n } be a sequence in X ρ . Let C be a nonempty subset of X ρ . The function
τ : C [ 0 , ] , τ ( x ) = lim sup n ρ x x n
is called a ρ-type function. A sequence { c n } in C is called a minimizing sequence of τ if lim n τ c n = inf x C τ x .
For example, take the set of real numbers R as a modular space with the modular ρ x = | x | . Consider that C is the subset of the rational numbers Q R and the sequence x n = 1 n , n 1 . The ρ -type function in this case is
τ x = lim sup n | x 1 n | = | x | ,
which is obviously unbounded. As a corresponding minimizing sequence, take for instance the sequence c n , c n = 1 n , n 1 .
Lemma 2
(Proposition 3.7 [22]). Assume that the modular space X ρ is ρ-complete and ρ satisfies the Fatou property. Let C be a nonempty convex and ρ-closed subset of X ρ . Consider the ρ-type function τ : C [ 0 , ] generated by a sequence { x n } in X ρ . Assume that τ 0 = inf x C τ x < .
a)
If ρ is U U C 1 , then all minimizing sequences of τ are ρ-convergent to the same limit.
b)
If ρ is U U C 2 and { c n } is a minimizing sequence of τ, then the sequence { c n / 2 } ρ-converges to a point which is independent of { c n } .
We end this section by recalling a crucial property of the modular.
Definition 6.
Let X ρ be a modular space. It is said that the modular ρ satisfies the Δ 2 -condition if there exists a constant K 0 such that
ρ 2 x K ρ x ,
for any x X ρ . The smallest such constant K will be denoted by ω 2 .
For example, the modular ρ : R 0 , , ρ x = a | x | α , a > 0 , α > 1 , satisfies the Δ 2 -condition with K = 2 α . As a counterexample, one may consider the modular ρ : R 0 , , ρ x = e | x | | x | 1 , which does not satisfy the Δ 2 -condition (for details, see [20]).

3. Mappings Satisfying the ( ρ E ) -Condition

In 2008, Suzuki [14] introduced a new class of mappings, on normed spaces, which he called generalized non-expansive mappings. Soon after, García-Falset et al. [15] provided two kinds of generalizations, one of which is of interest in this paper. Below, we adapt the definition from [15] to the context of modular spaces.
Definition 7.
Let C be a nonempty subset of the modular space X ρ . A mapping T : C X ρ is said to satisfy the ρ E μ condition on C, if there exists μ 1 such that
ρ x T y μ ρ x T x + ρ x y ,
for all x , y X ρ . One says that T satisfies condition ρ E whenever T satisfies ρ E μ for some μ 1 .
Example 2.
The modular ρ introduced in Example 1 endows R 2 with a modular space structure. Take the subset 1 , 1 × 1 , 1 R 2 and define a mapping T : 1 , 1 × 1 , 1 1 , 1 × 1 , 1 by the rule
T x 1 , x 2 = x 1 , 1 3 | x 2 | , x 1 , x 2 1 , 1 × 1 , 1 x 1 , 1 3 , x 1 , x 2 1 , 1 × 1 .
Taking x 1 , x 2 = 1 , 3 4 and y 1 , y 2 = 1 , 1 , we see that
ρ T 1 , 3 4 T 1 , 1 = 7 12 > 1 4 = ρ 1 , 3 4 1 , 1 ,
meaning that T is not a ρ-non-expansive mapping (see Definition 4.1, [22]).
Let us now verify that T satisfies the ρ E condition.
Case I: Let x 1 , x 2 1 , 1 × 1 , 1 and y 1 , y 2 1 , 1 × 1 , 1 . We have
ρ x 1 , x 2 T x 1 , x 2 = | x 2 1 3 | x 2 | 2 3 | x 2 | , ρ x 1 , x 2 y 1 , y 2 = x 1 y 1 2 + | x 2 y 2 | , ρ x 1 , x 2 T y 1 , y 2 x 1 y 1 2 + | x 2 | + 1 3 | y 2 | .
To prove that Condition ρ E is satisfied in this case, it is enough to show that the inequality
| x 2 | + 1 3 | y 2 | μ 2 3 | x 2 | + | x 2 y 2 |
holds for some μ 1 . Indeed, taking μ = 2 and noticing that | y 2 | | x 2 | + | x 2 y 2 | , the conclusion follows.
Case II: Let now x 1 , x 2 1 , 1 × 1 and y 1 , y 2 1 , 1 × 1 , 1 . For this case, we see that
ρ x 1 , x 2 T x 1 , x 2 = 4 3 , ρ x 1 , x 2 y 1 , y 2 = x 1 y 1 2 + | 1 y 2 | , ρ x 1 , x 2 T y 1 , y 2 x 1 y 1 2 + 1 + 1 3 | y 2 | .
Similarly as above, it is enough that the inequality
1 + 1 3 | y 2 | μ 4 3 + | 1 y 2 |
holds for some μ 1 , which is true since | y 2 | 1 .
In conclusion, the mapping T satisfies the ρ E condition for μ = 3 .

4. Convergence Analysis

As before, let C be a subset of a modular space X ρ . Consider the iterative scheme [13], which we shall call the TTP scheme, defined as follows:
x 1 C , x n + 1 = T y n , y n = T 1 α n x n + α n z n , z n = 1 β n x n + β n T x n ,
for all n 1 , where { α n } and { β n } are sequences in 0 , 1 .
The following results are useful for our purpose.
Lemma 3.
Let C be a nonempty ρ-closed convex subset of X ρ and let T : C C be a mapping satisfying ρ E with F ( T ) . For arbitrary chosen x 1 C , let the sequence { x n } be generated by the iterative process (3) and suppose ρ x k p < for some k 1 . Then, lim n ρ x n p exists for any p F ( T ) .
Proof. 
Let p F ( T ) . As T satisfies condition ( ρ E ) , we have
ρ T x p = ρ p T x μ ρ p T p + ρ x p = ρ x p , for any x C .
By (4) it follows that ρ T x p ρ x p , for any x C , and using this one and the convexity of ρ , one has
ρ z n p = ρ 1 β n x n + β n T x n p 1 β n ρ x n p + β n ρ T x n p 1 β n ρ x n p + β n ρ x n p = ρ x n p .
Similarly, taking into account relation (5), we get
ρ y n p = ρ T 1 α n x n + α n z n p ρ 1 α n x n + α n z n p 1 α n ρ x n p + α n ρ z n p 1 α n ρ x n p + α n ρ x n p = ρ x n p .
Now, using (4) and (6) it follows
ρ x n + 1 p = ρ T y n p ρ y n p ρ x n p ,
implying that the sequence { ρ x n p } n k is bounded and nonincreasing for any p F ( T ) . Thus, the limit lim n ρ x n p exists. □
Lemma 4.
Let C be a nonempty subset of X ρ and let T : C C be a mapping which satisfies condition ( ρ E ) . Suppose there exists a bounded sequence { x n } in C such that lim n ρ x n T x n = 0 and let τ be the ρ-type generated by { x n } . Then, T leaves the minimizing sequences invariant, i.e., if { c n } is a minimizing sequence for τ, then so is { T c n } .
Proof. 
Let { x n } be such that lim n ρ x n T x n = 0 . For arbitrary x C , we have
ρ x n T x μ ρ x n T x n + ρ x n x ,
which implies that
τ T x = lim sup n ρ x n T x lim sup n ρ x n x = τ x .
Let now { c n } be a minimizing sequence. Applying (9), we get
inf x C τ x lim n τ T c n lim n τ c n = inf x C τ x ,
which implies that lim n τ T c n = inf x C τ x , i.e., { T c n } is a minimizing sequence for τ . □
Proposition 1.
Let C be a nonempty, convex and ρ-closed subset of X ρ , where X ρ is ρ-complete and ρ satisfies the Δ 2 -condition, is (UUC1), and satisfies the Fatou property. Consider the ρ-type function τ : C [ 0 , ] generated by a sequence { x n } in X ρ and suppose τ 0 = inf x C τ x < . Let { c n } and { d n } be two minimizing sequences for τ. Then,
(i) 
any convex combination of { c n } and { d n } is a minimizing sequence for τ as well;
(ii) 
lim n ρ c n d n = 0 .
Proof. 
(i) Let e n = λ c n + 1 λ d n , λ 0 , 1 , n 1 . For any x C , we have
ρ e n x λ ρ c n x + 1 λ ρ d n x , n 1 ,
which implies
lim sup m ρ e n x m λ lim sup m ρ c n x m + 1 λ lim sup m ρ d n x m , n 1 ,
i.e.,
τ e n λ τ c n + 1 λ τ d n .
Passing to the limit and keeping in mind that { c n } and { d n } are minimizing sequences, we obtain
τ 0 = inf x C τ x lim n τ e n λ τ 0 + 1 λ τ 0 = τ 0 ,
which gives the conclusion.
(ii) Let us notice that, since e n = 1 2 c n + 1 2 d n , n 1 , we have c n d n = 2 e n d n , n 1 . According to (i), { e n } is a minimizing sequence and, according to Lemma 2, all minimizing sequences ρ -converge to the same point, which we denote by z. Thus,
ρ e n d n = ρ c n d n 2 1 2 ρ c n z + 1 2 ρ d n z , n 1 .
Thus, on account of (i), we get lim n ρ e n d n = 0 . Similarly, lim n ρ e n c n = 0 . The Δ 2 -condition implies the inequality
ρ c n d n ω 2 2 ρ e n c n + ρ e n d n ,
which gives the conclusion of (ii) by taking n . □
Theorem 1.
Let X ρ be a ρ-complete modular space and C be a nonempty convex ρ-closed and ρ-bounded subset X ρ . Suppose ρ satisfies the Fatou property, is U U C 1 and satisfies the Δ 2 -condition. Let T : C C be a mapping satisfying condition ρ E and let the sequence { x n } be generated by the iterative process (3) with { α n } and { β n } bounded away from 0 and 1. Then, F T if and only if lim n ρ x n T x n = 0
Proof. 
Suppose F T and take p F T . According to Lemma 3, the limit
r : = lim n ρ x n p
exists. Using the relations (5) and (4) respectively, we have
lim n ρ z n p lim n ρ x n p = r ,
lim sup n ρ T x n p lim n ρ x n p = r .
On the other hand, using the inequalities (4) and (7), together with the convexity of ρ , we obtain
ρ x n + 1 p ρ y n p = ρ T 1 α n x n + α n z n p ρ 1 α n x n + α n z n p 1 α n ρ x n p + α n ρ z n p = ρ x n p α n ρ x n p + α n ρ z n p ,
which implies
ρ x n + 1 p ρ x n p α n ρ z n p ρ x n p .
Thus,
ρ x n + 1 p ρ x n p ρ z n p ρ x n p ,
i.e.,
ρ x n + 1 p ρ z n p .
We also have, from condition (4), that ρ z n p ρ x n p , which implies that
r = lim n ρ z n p .
It follows
lim n ρ β n T x n p + 1 β n x n p = lim n ρ z n p = r .
Thus, the conditions of Lemma 1 are satisfied yielding lim n ρ T x n x n = 0 .
Conversely, assume that { x n } is bounded and lim n ρ T x n x n = 0 . Let τ : C [ 0 , ] be the ρ -type function generated by { x n } and let { c n } be a minimizing sequence for τ converging to a point z C . By Lemma 4, { T c n } is a minimizing sequence as well and by Proposition 1 lim n ρ c n T c n = 0 . On the other hand, condition ( ρ E ) gives
ρ c n T z μ ρ c n T c n + ρ c n z , n 1 .
Taking n , one obtains lim n ρ c n T z = 0 , i.e., c n ρ -converges to T z . By the uniqueness of the limit, we have T z = z . □
Theorem 2.
Let C be a nonempty ρ-compact and convex subset of X ρ and let ρ, T and { x n } be as in Theorem 1. Suppose that lim n ρ T x n x n = 0 . Then, the sequence { x n } ρ-converges to a fixed point of T.
Proof. 
The ρ -compactness of C implies the existence of a subsequence { x n k } of { x n } which ρ -converges to a point z in C. On the other hand, since T satisfies condition ρ E , we have
ρ x n k T z μ ρ x n k T x n k + ρ x n k z , μ 1 .
Noticing that subsequence { x n k } is an a.f.p.s. In addition, we get lim k ρ x n k T z = 0 and, by the uniqueness of the limit, we have T z = z , i.e., z F T . According to Lemma 3, the limit lim n ρ x n z exists and thus { x n } ρ -converges to z. □

5. Stability and Data Dependence

In this section, our goal is to study the stability and data dependence of the TTP scheme (3) for ρ -contractions on modular spaces.
Definition 8.
Let C be a nonempty set of a modular space X ρ . A mapping T : C C is called ρ-contraction if there exists a constant 0 θ < 1 such that
ρ T x T y θ ρ x y , for all x , y C .
The Banach Contraction Principle is valid for ρ -contractions on modular spaces (see [22], Theorem 4.2). Thus, the existence of fixed points for ρ -contractions is guaranteed. It is also straightforward to see that the iteration scheme (3), applied to ρ -contractions, yields the inequality ρ x n + 1 p θ ρ x n p , where p F T , which implies its convergence to a fixed point.
The following two lemmas will be instrumental in the proofs of the following theorems.
Lemma 5
([24]). Let ψ n n = 0 and φ n n = 0 be nonnegative real sequences satisfying
ψ n + 1 1 τ n ψ n + φ n ,
where τ n 0 , 1 for all n N , n = 0 τ n = and φ n τ n 0 as n , then lim n ψ n = 0 .
Lemma 6
([25]). Let ψ n n = 0 be a nonnegative real sequence for which one supposes there exists n 0 N , such that, for all n n 0 , the following inequality is satisfied:
ψ n + 1 1 τ n ψ n + τ n φ n ,
where τ n 0 , 1 , φ n 0 n N , n = 1 τ n = . Then,
0 lim sup n ψ n lim sup n φ n .
The notion of stability of an iteration process is usually defined for metric spaces (see, for instance, [26,27]). A natural analogue, in the context of modular spaces, is defined as follows.
Definition 9.
Let C be a nonempty set of a modular space X ρ and let t n n = 0 an arbitrary sequence in C. We say that an iteration process x n + 1 = f T , x n , which converges to a fixed point p, is T-stable if
lim n ε n = 0 if and only if lim n ρ t n p = 0 ,
where ε n = ρ t n + 1 f T , t n , n = 0 , 1 , 2 , .
Theorem 3.
Let C be a nonempty ρ-closed set of a modular space X ρ which is ρ-complete and let T : C C be a ρ-contraction with a ρ-bounded orbit. Consider the iterative process (3) with { α n } and { β n } bounded away from 0 and 1 and satisfying δ α n β n for some δ > 0 . Suppose the modular ρ satisfies the Δ 2 condition. If ω 2 θ 2 2 , then the iterative process (3) is T-stable.
Proof. 
Let p C be a fixed point for the mapping T and let t n n = 0 be a sequence in C. Consider the sequence generated by the iterative process (3) x n + 1 = f T , x n , converging to p. Denote ε n = ρ t n + 1 f T , t n and suppose lim n ε n = 0 . Using the Δ 2 property, the convexity of the modular, as well as the assumption that ω 2 θ 2 2 , we have
ρ t n + 1 p = ρ 2 1 2 t n + 1 f T , t n + 1 2 f T , t n p ω 2 2 ρ t n + 1 f T , t n + ρ f T , t n p ω 2 2 ε n + ρ T T 1 α n t n + α n 1 β n t n + β n T t n p ω 2 2 ε n + θ ρ T 1 α n t n + α n 1 β n t n + β n T t n p ω 2 2 ε n + θ 2 ρ 1 α n t n + α n 1 β n t n + β n T t n p ω 2 2 ε n + θ 2 1 α n β n + α n β n θ ρ t n p = ω 2 2 ε n + ω 2 2 θ 2 1 α n β n 1 θ ρ t n p 1 α n β n 1 θ ρ t n p + ω 2 2 ε n .
Applying Lemma 5 for ψ n = ρ t n p , τ n = α n β n 1 θ and φ n = ω 2 2 ε n , we conclude that lim n ρ t n p = 0 .
Conversely, suppose lim n = ρ t n p . We have
ε n = ρ t n + 1 f T , t n ω 2 2 ρ t n + 1 p + ρ f T , t n p ω 2 2 ρ t n + 1 p + θ 2 1 α n β n 1 θ ρ t n p ,
implying that lim n ε n = 0 , which completes the proof. □
Definition 10.
Let T , T ˜ : X ρ X ρ two operators. We say that T ˜ approximates the operator T if, for some ε > 0 , we have
T x T ˜ x ε ,
for all x X ρ .
Theorem 4.
Let T ˜ be an approximate operator of a ρ-contraction T such that ω 2 θ < 2 . Let x n n = 1 be an iterative sequence generated by (3), corresponding to T, and let x ˜ n n = 1 be a iterative sequence generated by the iterative scheme
x ˜ 1 C , x ˜ n + 1 = T ˜ y ˜ n , y ˜ n = T ˜ 1 α n x ˜ n + α n z ˜ n , z ˜ n = 1 β n x ˜ n + β n T ˜ x ˜ n ,
for all n 1 , where { α n } and { β n } are sequences in 0 , 1 satisfying 1 2 α n β n n N . If T p = p and T ˜ p ˜ = p ˜ such that lim n x ˜ n = p ˜ , then
ρ p p ˜ 7 ω 2 2 ε 2 2 ω 2 θ .
Proof. 
Using the convexity and the Δ 2 property of the modular, we have
ρ z n z ˜ n = ρ 1 β n x n + β n T x n 1 β n x ˜ n β n T ˜ x ˜ n 1 β n ρ x n x ˜ n + β n ρ T x n T ˜ x ˜ n 1 β n ρ x n x ˜ n + β n ω 2 2 ρ T x n T x ˜ n + ρ T x ˜ n T ˜ x ˜ n 1 β n 1 ω 2 2 θ ρ x n x ˜ n + β n ω 2 2 ε .
Similarly, one gets
ρ y n y ˜ n = ρ T 1 α n T x n + α n T z n T ˜ 1 α n T ˜ x ˜ n + α n T ˜ z ˜ n ω 2 2 ρ T 1 α n T x n + α n T z n T 1 α n T ˜ x ˜ n + α n T ˜ z ˜ n + ω 2 2 ρ T 1 α n T ˜ x ˜ n + α n T ˜ z ˜ n T ˜ 1 α n T ˜ x ˜ n + α n T ˜ z ˜ n ω 2 2 θ 1 α n ρ T x n T ˜ x ˜ n + α n ρ T z n T ˜ z ˜ n + ω 2 2 ε ω 2 2 2 θ 1 α n ρ T x n T x ˜ n + ρ T x ˜ n T ˜ x ˜ n + ω 2 2 2 θ α n ρ T z n T z ˜ n + ρ T z ˜ n T ˜ z ˜ n + ω 2 2 ε ω 2 2 2 θ 1 α n θ ρ x n x ˜ n + ε + α n θ ρ z n z ˜ n + ε + ω 2 2 ε ω 2 2 2 θ 2 1 α n ρ x n x ˜ n + α n ρ z n z ˜ n + ω 2 2 2 θ ε + ω 2 2 ε ω 2 2 2 θ 2 1 α n β n 1 ω 2 2 θ ρ x n x ˜ n + ε α n β n ω 2 2 3 θ 2 + ω 2 2 2 θ + ω 2 2 .
Thus, we obtain
ρ x n + 1 x ˜ n + 1 = ρ T y n T ˜ y ˜ n ω 2 2 ρ T y n T y ˜ n + ρ T y ˜ n T ˜ y ˜ n ω 2 2 θ ρ y n y ˜ n + ε ω 2 2 3 θ 3 1 α n β n 1 ω 2 2 θ ρ x n x ˜ n + α n β n ω 2 2 4 θ 3 + ω 2 2 3 θ 2 + ω 2 2 2 θ + ω 2 2 ε 1 α n β n 1 ω 2 2 θ ρ x n x ˜ n + 7 ω 2 2 α n β n ε .
Applying now Lemma 6 with ψ n = ρ x n x ˜ n , τ n = α n β n 1 ω 2 2 θ and φ n = 7 ω 2 ε 2 ω 2 θ , respectively, we get
0 lim sup n ρ x n x ˜ n lim sup n 7 ω 2 ε 2 ω 2 θ .
On the other hand, we have the inequality
ρ p p ˜ ω 2 2 ρ x n x ˜ n + ω 2 2 2 ρ x n p + ρ x ˜ n p ˜ ,
in which passing to the limit and using the inequality (18) yields
ρ p p ˜ 7 ω 2 2 ε 2 2 ω 2 θ ,
which completes the proof. □

6. Conclusions

In this paper, we have studied the iterative process introduced by Thakur et. al. in [13], in the framework of modular spaces. Sufficient conditions of convergence of the iterative process to fixed points of ρ E -type mappings were established in Lemma 3, Theorem 1 and Theorem 2, respectively. We have also established conditions for stability and studied the data dependence of the new iterative process with respect to ρ -contractive mappings in Theorem 3 and Theorem 4, respectively.

Author Contributions

Both authors participated equally to the conceptualization, writing, and editing.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Krasnosel’skii, M.A. Two remarks on the method of succesive approximations (in Russian). Uspekhi Math. Nauk. 1955, 10, 123–127. [Google Scholar]
  2. Mann, W.R. Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 4, 506–510. [Google Scholar] [CrossRef]
  3. Halpern, B. Fixed points of non-expansive maps. Bull. Am. Math. Soc. 1967, 73, 957–961. [Google Scholar] [CrossRef]
  4. Berinde, V. Picard iteration converges faster than Mann iteration for a class of quasi-contractive operators. Fixed Point Theory Appl. 2004, 2, 97–105. [Google Scholar] [CrossRef]
  5. Ishikawa, S. Fixed points by a new iteration method. Proc. Am. Math. Soc. 1974, 44, 147–150. [Google Scholar] [CrossRef]
  6. Noor, M.A. New approximation schemes for general variational inequalities. J. Math. Anal. Appl. 2000, 251, 217–229. [Google Scholar] [CrossRef]
  7. Agarwal, R.P.; O’Regan, D.; Sahu, D.R. Iterative construction of fixed points of nearly asymptotically non-expansive mappings in Banach spaces. Fixed Point Theory Appl. 2010, 457935. [Google Scholar]
  8. Abbas, M.; Nazir, T. A new faster iteration process applied to constrained minimization and feasibility problems. Mat. Vesn. 2014, 66, 223–234. [Google Scholar]
  9. Gürsoy, F.; Karakaya, V. A Picard-S hybrid type iteration method for solving a differential equation with retarded argument. arXiv 2014, arXiv:1403.2546v2. [Google Scholar]
  10. Sintunavarat, W.; Pitea, A. On a new iteration scheme for numerical reckoning fixed points of Berinde mappings with convergence analysis. J. Nonlinear Sci. Appl. 2016, 9, 2553–2562. [Google Scholar] [CrossRef]
  11. Thakur, B.S.; Thakur, D.; Postolache, M. A new iteration scheme for approximating fixed points of non-expansive mappings. Filomat 2016, 30, 2711–2720. [Google Scholar] [CrossRef]
  12. Thakur, D.; Thakur, B.S.; Postolache, M. New iteration scheme for numerical reckoning fixed points of non-expansive mappings. J. Inequal. Appl. 2014, 328. [Google Scholar] [CrossRef]
  13. Thakur, B.S.; Thakur, D.; Postolache, M. A new iterative scheme for numerical reckoning fixed points of Suzuki’s generalized non-expansive mappings. Appl. Math. Comput. 2016, 275, 147–155. [Google Scholar]
  14. Suzuki, T. Fixed point theorems and convergence theorems for some generalized non-expansive mappings. J. Math. Anal. Appl. 2008, 340, 1088–1095. [Google Scholar] [CrossRef]
  15. García-Falset, J.; Llorens-Fuster, E.; Suzuki, T. Fixed point theory for a class of generalized non-expansive mappings. J. Math. Anal. Appl. 2011, 375, 185–195. [Google Scholar] [CrossRef]
  16. Khan, S.H. Approximating fixed points of λ,ρ-firmly non-expansive mappings in modular function spaces. Arab. J. Math. 2018, 7, 281–287. [Google Scholar] [CrossRef]
  17. Mitrović, Z.; Radenović, S.; Aydi, H. On a two new approach in modular space. Italian J. Pure Appl. Math 2019. to appear. [Google Scholar]
  18. Nakano, H. Modular Semi-Ordered Linear Spaces; Maruzen Co. Ltd.: Tokyo, Japan, 1950. [Google Scholar]
  19. Orlicz, W. Über konjugierte exponentenfolgen. Studia Math. 1931, 3, 200–211. [Google Scholar] [CrossRef]
  20. Krasnosel’skii, M.A.; Rutickii, Y.B. Convex Spaces and Orlicz Spaces; P. Noordhoff Ltd.: Groningen, The Netherlands, 1961. [Google Scholar]
  21. Musielak, J. Orlicz Spaces and Modular Spaces; Springer-Verlag: Berlin, Germany, 1983. [Google Scholar]
  22. Abdou, A.A.N.; Khamsi, M.A. Fixed point theorems in modular vector spaces. J. Nonlinear. Sci. Appl. 2017, 10, 4046–4057. [Google Scholar] [CrossRef]
  23. Khamsi, M.A.; Kozlowski, W.M. Fixed Point Theory in Modular Function Spaces; Birkhäuser: Basel, Switzerland, 2015. [Google Scholar]
  24. Weng, X. Fixed point iteration for local strictly pseudo-contractive mapping. Proc. Am. Math. Soc. 1991, 113, 727–731. [Google Scholar] [CrossRef]
  25. Şoltuz, Ş.M.; Grosan, T. Data dependence for Ishikawa iteration when dealing with contractive-like operators. Fixed Point Theory Appl. 2008, 242916. [Google Scholar] [CrossRef]
  26. Harder, A.M.; Hicks, T.L. A stable iteration procedure for non-expansive mappings. Math. Japon. 1988, 33, 687–692. [Google Scholar]
  27. Harder, A.M.; Hicks, T.L. Stability results for fixed point iteration procedures. Math. Jpn. 1988, 33, 693–706. [Google Scholar]

Share and Cite

MDPI and ACS Style

Kassab, W.; Ţurcanu, T. Numerical Reckoning Fixed Points of (ρE)-Type Mappings in Modular Vector Spaces. Mathematics 2019, 7, 390. https://doi.org/10.3390/math7050390

AMA Style

Kassab W, Ţurcanu T. Numerical Reckoning Fixed Points of (ρE)-Type Mappings in Modular Vector Spaces. Mathematics. 2019; 7(5):390. https://doi.org/10.3390/math7050390

Chicago/Turabian Style

Kassab, Wissam, and Teodor Ţurcanu. 2019. "Numerical Reckoning Fixed Points of (ρE)-Type Mappings in Modular Vector Spaces" Mathematics 7, no. 5: 390. https://doi.org/10.3390/math7050390

APA Style

Kassab, W., & Ţurcanu, T. (2019). Numerical Reckoning Fixed Points of (ρE)-Type Mappings in Modular Vector Spaces. Mathematics, 7(5), 390. https://doi.org/10.3390/math7050390

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop