Next Article in Journal
A Unified Approach and Related Fixed-Point Theorems for Suzuki Contractions
Next Article in Special Issue
On Quasi-Subordination for Bi-Univalency Involving Generalized Distribution Series
Previous Article in Journal
On the Inverse of the Linearization Coefficients of Bessel Polynomials
Previous Article in Special Issue
Results for Analytic Function Associated with Briot–Bouquet Differential Subordinations and Linear Fractional Integral Operators
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Nonexpansiveness and Fractal Maps in Hilbert Spaces

by
María A. Navascués
Department of Applied Mathematics, Universidad de Zaragoza, 50018 Zaragoza, Spain
Symmetry 2024, 16(6), 738; https://doi.org/10.3390/sym16060738
Submission received: 23 May 2024 / Revised: 6 June 2024 / Accepted: 11 June 2024 / Published: 13 June 2024
(This article belongs to the Special Issue Symmetry in Geometric Theory of Analytic Functions)

Abstract

:
Picard iteration is on the basis of a great number of numerical methods and applications of mathematics. However, it has been known since the 1950s that this method of fixed-point approximation may not converge in the case of nonexpansive mappings. In this paper, an extension of the concept of nonexpansiveness is presented in the first place. Unlike the classical case, the new maps may be discontinuous, adding an element of generality to the model. Some properties of the set of fixed points of the new maps are studied. Afterwards, two iterative methods of fixed-point approximation are analyzed, in the frameworks of b-metric and Hilbert spaces. In the latter case, it is proved that the symmetrically averaged iterative procedures perform well in the sense of convergence with the least number of operations at each step. As an application, the second part of the article is devoted to the study of fractal mappings on Hilbert spaces defined by means of nonexpansive operators. The paper considers fractal mappings coming from φ -contractions as well. In particular, the new operators are useful for the definition of an extension of the concept of α -fractal function, enlarging its scope to more abstract spaces and procedures. The fractal maps studied here have quasi-symmetry, in the sense that their graphs are composed of transformed copies of itself.

1. Introduction

Mean values methods were investigated by important mathematicians like Cesàro or Fejér for the summation of divergent series (see, for instance, the references [1,2,3]). W.R. Mann proposed in 1953 the use of averaged values for the treatment of nonconvergent iteration processes [4]. The main purpose of their work was the resolution of differential and integral equations modeling several physical problems, by means of the method of successive approximations.
A bit later, Krasnoselskii [5] proved that the Picard iterations of a nonexpansive mapping T defined on certain normed space X may not converge, even if the map has a unique fixed point. However, the sequence defined recursively as:
f n + 1 : = f n + T f n 2
for n 0 and f 0 X does converge to it. This finding confirmed that averages method is very useful in the cases where the typical map iteration fails to approach a fixed point. Since then, more sophisticated iterative methods based on means have appeared, as that proposed by Ishikawa [6].
The first aim of this article is the presentation of a new concept of nonexpansiveness, presenting maps that include the usual nonexpansive mappings like a particular case. This will be done in the context of b-metric spaces.
Definition 1.
A b-metric space X is a set endowed with a mapping d : X × X R + with the following properties:
1. 
d ( x , y ) 0 ,   d ( x , y ) = 0 if and only if x = y .
2. 
d ( x , y ) = d ( y , x ) for any x , y X .
3. 
There exists s 1 such that d ( x , y ) s ( d ( x , z ) + d ( z , y ) ) for any x , y , z X .
The constant s is the index of the b-metric space, and d is called a b-metric.
Example 1.
Let X = R m be the m-dimensional Euclidean space, and u = ( u 1 , u 2 , , u m ) , v = ( v 1 , v 2 , , v m ) . The map d : X × X R + defined as:
d ( u , v ) = j = 1 m | u j v j | 2 ,
is a b-metric with index 2 (see for instance [7]).
Nowadays, a large number of papers are devoted to the study of several types of single and multivalued contractions defined on b-metric spaces. The reader can consult the references [8,9,10,11] as a small and far from representative sample of articles on this topic.
The self-maps to be studied here are given by the following definition.
Definition 2.
Let E be a b-metric space, and T : E E be a self-map such that for any f , g E :
d ( T f , T g ) a d ( f , g ) + B min { d ( f , T f ) , d ( g , T g ) } .
If a 1 and B 0 , T is a nonexpansive partial contractivity.
For B = 0 , we have a nonexpansive mapping.
Section 2 collects some properties of the new operators. In particular, it studies the main characteristics of the set of fixed points, whenever the space of definition owns some specific structure. Section 3 is devoted to the study of the convergence of the Mann iterations (called also Krasnoselskii–Mann iterations) of a nonexpansive partial contractivity, given by the following recursive scheme:
f n + 1 = ( 1 a n ) f n + a n T f n .
for n N 0 , 0 a n 1 (see for instance [4]). When a n is a constant, the algorithm is usually called Krasnoselskii iteration [5]. We first prove the convergence of the Mann’s method in a b-metric space in the case a s < 1 , where s is the index of the b-metric, whenever the scalars are suitably chosen. Afterwards, the case a = 1 is considered in the framework of a Hilbert space. The properties of the sequence of iterates are described and the weak convergence to a fixed point is proved for a wide range of values of the sequence ( a n ) .
In particular, it is proved that the symmetrically weighted average:
f n + 1 = f n + T f n 2 ,
corresponding to the case where a n = 1 / 2 for all n , converges strongly to a fixed point with asymptotic stability when a s < 1 . If the underlying space is Hilbert and a = 1 , the average (3) converges weakly to a fixed point. In the latter case, this symmetric pattern is optimum in the sense of performing the least number of operations at each step.
Section 4 is similar to Section 3, but the method studied is a three-steps algorithm called SP-iteration [12]. This is given by the following recursion:
f n + 1 = ( 1 a n ) g n + a n T g n ,
g n = ( 1 b n ) h n + b n T h n ,
h n = ( 1 c n ) f n + c n T f n ,
for a n , b n , c n [ 0 , 1 ] . In particular, the convergence of the symmetric averaged iterations, corresponding to the case where a n = b n = c n = 1 / 2 is proved. This choice is optimum in the sense of minimum number of operations at each step in the case a = 1 . Section 5 applies the results obtained to the definition of fractal maps F * : I V , where I is a real compact interval and V is a Hilbert space. The mappings constructed are called in this paper nonattracting fractal maps, due to the fact that they cannot be approached by means of the usual Picard iterations, in general. This topic was initiated in the reference [13] in the context of Banach spaces and algebras. Section 6 is devoted to the definition of fractal mappings valued on Hilbert spaces through φ -contractions on the Bochner space of square-integrable mappings. The methods of their successive approximations are also considered. Section 7 constructs mappings of α -fractal type, but in a wider and more abstract setting. These maps generalize the so called α -fractal functions, thoroughly studied in recent mathematical literature (see for instance [13,14,15,16] and references therein). Roughly speaking, a geometric object is symmetric if it is composed of similar pieces. The fractal maps studied here own a quasi-symmetry, in the sense that their graphs are composed of transformed copies of itself, that is to say, if G is the graph of a fractal map, it satisfies the set equation:
G = m = 1 M W m ( G ) ,
where W m are set-valued operators to be defined later in this text (see for instance Theorem 5 of [13]).
Remark 1.
In this paper, T f and T ( f ) will be used indistinctly to denote the image of an element f by the map T .

2. Nonexpansive Partial Contractivities

For a basic introduction to b-metric spaces the reader can consult the references [7,17,18,19], for instance. We extend the definition of partial contractivity presented in the reference [20].
Definition 3.
Let E be a b-metric space, and T : E E be a self-map such that for any f , g E :
d ( T f , T g ) a d ( f , g ) + B min { d ( f , T f ) , d ( g , T g ) } .
1. 
If a < 1 and B 0 , T is a partial contractivity.
2. 
If a 1 and B 0 , T is a nonexpansive partial contractivity.
For B = 0 we obtain the classical contractive/nonexpansive mappings.
Example 2.
Let E = [ 0 , 1 ] be endowed with the usual metric, and T : E E be defined as T x = 0 for x [ 0 , 1 / 2 ) and T x = x / 4 for x [ 1 / 2 , 1 ] . It is an easy exercise to check that T is a nonexpansive partial contractivity, where a = 1 / 4 and B = 1 / 2 .
Other examples can be found in [19]. In previous works, we proved that several well known types of contractions are partial contractivities whenever the constants satisfy certain conditions. This is true for Zamfirescu and quasi-contractions in particular.
Definition 4.
Let X be a b-metric space and T : X X be a map such that there exist constants α , b , k with 0 < α < 1 , 0 < b , k < 1 / 2 and for any x , y X one of the following conditions is satisfied:
1. 
d ( T x , T y ) α d ( x , y ) ;
2. 
d ( T x , T y ) b ( d ( x , T x ) + d ( y , T y ) ) ;
3. 
d ( T x , T y ) k ( d ( x , T y ) + d ( y , T x ) ) .
Then, T is called a Zamfirescu contraction [21].
Proposition 1.
Let X be a b-metric space and T be a Zamfirescu contraction with constants α , b , k . If b < s 1 ( s + 1 ) 1 and k < s 1 / 2 , then T is a partial contractivity with constants:
a = max { α , b s 1 b s 2 , k s 1 k s } < 1
and
B = max { b ( 1 + s 2 ) 1 b s 2 , 2 k s 1 k s } .
Proof. 
See reference [20]. □
Remark 2.
For a metric space, the index s is one, and all the Zamfirescu maps are partial contractivities, according to the last result.
Something similar happens with quasi-contractions. Let us begin with the definition.
Definition 5.
For a b-metric space ( X , d ) , a self-map T : X X is a quasi-contraction if there exists a real constant λ ,   0 < λ < 1 , such that for all x , y X :
d ( T x , T y ) λ max { d ( x , y ) , d ( x , T x ) , d ( y , T y ) , d ( x , T y ) , d ( y , T x ) } .
Proposition 2.
If ( X , d ) is a b-metric space and T : X X is a quasi-contraction with ratio λ > 0 such that λ < s 1 ( s + 1 ) 1 , then T is a partial contractivity with:
a = λ s 1 λ s 2
and
B = λ s 2 1 λ s 2 .
Proof. 
See reference [19]. □
Remark 3.
For a metric space, a quasi-contraction is a partial contractivity whenever λ < 1 / 2 , according to the last result.
Unlike the classical nonexpansive mappings, a nonexpansive partial contractivity need not be continuous (see for instance Example 2). This fact adds an element of generality to partial contractivities. However, if B = 0 , then it is Lipschitz continuous.
In the following, we give some properties of the set of fixed points of a nonexpansive partial contractivity.
Proposition 3.
Let E be a b-metric space, and T be a continuous nonexpansive partial contractivity. Then, the set of fixed points F i x ( T ) is a closed set.
Proof. 
It is a consequence of the continuity of T and the definition of fixed point. □
In the case of specific normed spaces, we can add some important properties to the set of fixed points of a nonexpansive partial contractivity, where the continuity of T is not needed. Let us start with a definition.
Definition 6.
Let E be a b-metric space and T : E E . The map T is quasi-nonexpansive if F i x ( T ) , and f E , f * F i x ( T ) .
d ( T f , f * ) d ( f , f * ) .
Example 3.
Let E = [ 0 , 1 ] , and T : E E defined as: T x = 0 for x [ 0 , 1 / 2 ] and T x = k x , where k < 1 , for x ( 1 / 2 , 1 ] . The only fixed point of T is zero, and T is quasi-nonexpansive and discontinuous in the interval [ 0 , 1 ] .
Example 4.
Let E = [ 0 , 1 ] , and T : E E defined as: T x = k x cos ( 1 / x ) where k < 1 , for x 0 and T 0 = 0 . T is quasi-nonexpansive and continuous in the interval [ 0 , 1 ] .
Proposition 4.
Let E be a b-metric space and T : E E be a nonexpansive partial contractivity. If F i x ( T ) , then T is quasi-nonexpansive and T is continuous on F i x ( T ) .
Proof. 
It is a consequence of the definitions of nonexpansive partial contractivity and quasi-nonexpansive maps. □
The next result can be read in the reference [22], Theorem 1.
Theorem 1.
Let E be a strictly convex Banach space, and C E , such that C is nonempty, closed, and convex. Let T : C C be a quasi-nonexpansive self-map. Then, the set F i x ( T ) is closed and convex.
Corollary 1.
Let E be a strictly convex Banach space, and C E , such that C is nonempty, closed, and convex. Let T : C C be a nonexpansive partial contractivity. If F i x ( T ) , then F i x ( T ) is a closed and convex set, and T is continuous on it.
Proof. 
It is a consequence of Proposition 4 and Theorem 1. □
Corollary 2.
Let E be a strictly convex Banach space, C E , such that C is nonempty, closed, and convex. Let T : C C be a nonexpansive partial contractivity. If F i x ( T ) , then F i x ( T ) is a singleton or it is infinite. If a + B < 1 then F i x ( T ) = { f * } .
Proof. 
The first part is a consequence of Corollary 1. The second statement was proved in Theorem 2.1 of reference [20]. □
Corollary 3.
If E = L P ( I ) , for 1 < p < , C E satisfies the conditions described previously, and T : C C is a nonexpansive partial contractivity such that F i x ( T ) , then F i x ( T ) is closed and convex.
Proof. 
The Lebesgue spaces where 1 < p < are strictly convex, and we have the hypotheses of Corollary 1. □
Let us inquire about the existence of a fixed point with minimal distance to any g E . The next result can be read in [23], for instance.
Theorem 2.
Let E be a reflexive Banach space, if F E is nonempty, closed, and convex, then F is proximal, that is to say, for any g E there exists f * F such that | | g f * | | = d ( g , F ) : = inf { | | g f | | : f F } . If additionally E is strictly convex then the “best approximation” f * F to g is unique.
Corollary 4.
Let E be a uniformly convex Banach space, C E , such that C is nonempty, closed, and convex. Let T : C C be a nonexpansive partial contractivity. If F i x ( T ) , then for any g E there exists a unique f * F i x ( T ) such that | | g f * | | = d ( g , F i x ( T ) ) .
Proof. 
Uniformly convex Banach spaces are strictly convex. According to Theorem of Milman–Pettis they are reflexive spaces as well (see for instance [24]). By Corollary 1, F i x ( T ) is closed and convex, and the result is a consequence of Theorem 2. □
In particular, this result holds for nonexpansive partial contractivities defined on Lebesgue spaces E = L p ( I ) with 1 < p < .

3. Mann Iterations for Nonexpansive Partial Contractivities

As noticed in the introduction, for a nonexpansive self-map, the Picard iterations may not converge, even if the fixed point exists and is unique [5]. In this case, some other approximation methods may be necessary. In the following, we consider one of the simplest iteration procedures for fixed point approaching, in the context of quasi-normed and normed spaces.
Definition 7.
If E is a real linear space, the mapping | · | s : E × E R + is a quasi-norm of index s if:
1. 
| f | s 0 ; f = 0 if and only if | f | s = 0 .
2. 
| λ f | s = | λ | | f | s .
3. 
There exists s 1 such that | f + g | s s ( | f | s + | g | s ) for any f , g E .
The space ( E , | · | s ) is a quasi-normed space. If E is complete with respect to the b-metric induced by the quasi-norm, then E is a quasi-Banach space. Obviously, if s = 1 , then E is a normed space.
Example 5.
Let L p ( I ) be a Lebesgue space with 0 < p < 1 , and let the map d : X × X R + be defined as:
d ( f , g ) = ( I | f g | p d μ ) 1 / p .
L p ( I ) is a quasi-Banach space with index s = 2 1 / p 1 .
Let E be a quasi-normed space, C E be nonempty, closed, and convex, and T : C C be a nonexpansive partial contractivity. Let us assume that F i x ( T ) . The Mann iterative scheme [4] is given by:
f n + 1 = ( 1 a n ) f n + a n T f n .
for n N 0 , 0 a n 1 . When a n = 1 for all n we obtain the Picard iteration, as a particular case. If a n = λ for any n we have the Krasnoselskii [5] iteration:
f n + 1 = ( 1 λ ) f n + λ T f n ,
In the following, we prove that for some values of a n the Mann iterations associated with a partial contractivity T converge to a fixed point if F i x ( T ) . In reference [20], it was proved that if the ratio a is lower than one and there exists a fixed point, it is unique.
Let ( f n ) be the sequence of Mann iterates (9) of an element f : = f 0 C and f * F i x ( T ) . Then:
| f n + 1 f * | s = | ( 1 a n ) ( f n f * ) + a n ( T ( f n ) f * ) | s s ( 1 a n ) | f n f * | s + s a n | T ( f n ) f * | s .
Due to the contractivity condition (7):
| T ( f n ) f * | s a | f n f * | s ,
and hence:
| f n + 1 f * | s ( s ( 1 a n ) + s a n a ) | f n f * | s = s ( 1 a n ( 1 a ) ) | f n f * | s .
Repeating the argument for consecutive values of n, we obtain:
| f n + 1 f * | s s n + 1 ( j = 0 n ( 1 a j ( 1 a ) ) | f 0 f * | s .
Let us assume in the first place that a s < 1 . Let us choose a number k such that s ( 1 a j ( 1 a ) ) < k for any j. Then:
1 k s 1 1 a < a j 1 .
In order to satisfy the condition:
1 k s 1 1 a < 1
it is necessary that a s < k . Then, let us take k R such that a s < k < 1 .
We have that:
| f n + 1 f * | s k n + 1 | f 0 f * | s ,
Consequently, the Mann iterations ( f n ) converge to the fixed point f * with global asymptotical stability for values ( a n ) satisfying the condition (12) for j 0 . Additionally, any ball B ( f * , r ) centered at the fixed point f * is an invariant set for the Mann iterations (see reference [25]). In the normed case ( s = 1 ), it suffices that the sequence ( a n ) be such that inf a n > 0 .

Case a = 1

Let us consider now that s = 1 , that is to say, E is a normed space, and assume that T is a nonexpansive partial contractivity where a = 1 . We will denote the norm on E with the usual notation | | · | | . Let us consider the following definition about a sequence in E and a self-map T (see for instance the references [26,27]).
Definition 8.
Let E be a normed space, C E and T : C C be such that F i x ( T ) and a sequence ( f n ) C . We say that ( f n ) has:
1. 
The limit existence property (LE property for short) if lim n | | f n f * | | exists and is finite for any f * F i x ( T ) .
2. 
The approximate fixed point property (AF for short) if lim n | | f n T f n | | = 0 .
Proposition 5.
Let E be a normed space, C E nonempty, closed, and convex, and T : C C be a nonexpansive partial contractivity such that F i x ( T ) . For any f 0 C , the Mann iteration ( f n ) has the LE property for any choice of the scalars ( a n ) .
Proof. 
If ( f n ) is the sequence of Mann iterates for any ( a n ) , according to (11) for a = s = 1 :
| | f n + 1 f * | | | | f n f * | | .
The sequence of real numbers | | f n f * | | is decreasing and bounded, and consequently, it is convergent for any f 0 C . Hence, the sequence has the LE property. □
Let use see that choosing the scalars ( a n ) suitably, the Mann iteration has the AF property as well. For it, we need a previous Lemma, that can be read in the reference [28].
Lemma 1.
Let E be a uniformly convex Banach space, and a sequence ( λ n ) E be such that there exist p , q R satisfying the condition 0 < p λ n q < 1 for all n N . Let ( x n ) , ( y n ) be sequences of E such that lim sup n | | x n | | r , lim sup n | | y n | | r , and lim sup n | | λ n x n + ( 1 λ n ) y n | | = r for some r 0 . Then, lim n | | x n y n | | = 0 .
Proposition 6.
Let E be a uniformly convex Banach space, C E nonempty, closed, and convex, and T : C C a nonexpansive partial contractivity such that F i x ( T ) . If the scalars a n are chosen such that 0 < inf a n sup a n < 1 , the Mann iteration has the AF property for any f 0 C .
Proof. 
For f 0 C , let ( f n ) be the Mann iteration with scalars chosen as described in the statement of this proposition. Let f * F i x ( T ) , by Proposition 5 lim | | f n f * | | = l R . The definition of nonexpansive partial contractivity (7) implies that:
| | T f n f * | | | | f n f * | |
and
lim sup n | | f n f * | | = l ,
lim sup n | | T f n f * | | l .
Moreover:
lim sup n | | ( 1 a n ) ( f n f * ) + a n ( T f n f * ) | | = lim sup n | | f n + 1 f * | | = l .
According to the previous lemma, lim n | | f n T f n | | = 0 , and ( f n ) has the AF property. □
For the next definition the reader can consult the reference [29].
Definition 9.
A normed space E satisfies the Opial’s condition if for any sequence ( f n ) E such that ( f n ) converges weakly to f E :
lim inf n | | f n f | | < lim inf n | | f n g | | .
for any g f .
Proposition 7.
Let E be a Hilbert space, C E be nonempty, closed, and convex, and T : C C be a nonexpansive partial contractivity. If a sequence ( f n ) C converges weakly to f C and it satisfies the AF property with respect to T, then f F i x ( T ) .
Proof. 
Let ( f n ) be a sequence satisfying the condition AF (Definition 8), and f be the weak limit of ( f n ) . Since E is a Hilbert space, it satisfies the Opial condition (see for instance Lemma 1 of reference [29]). If T f f :
lim inf n | | f n f | | < lim inf n | | f n T f | | lim inf n ( | | f n T f n | | + | | T f n T f | | ) .
The AF property implies that lim inf n | | f n T f n | | = 0 . Applying the contractivity condition in the second sunmmand, we have:
lim inf n | | f n f | | < lim inf n ( | | f n f | | + B | | T f n f n | | ) = lim inf n | | f n f | | .
This is a contradiction, and consequently, f = T f F i x ( T ) .
Theorem 3.
Let E be a Hilbert space, C E be nonempty, closed, bounded, and convex, and T : C C be a nonexpansive partial contractivity such that F i x ( T ) . Then, the Mann iterates such that 0 < inf a n sup a n < 1 converge weakly to a fixed point f * of T for any f 0 C .
If additionally ( | | f n | | ) converges to | | f * | | , or f * is a cluster point of ( f n ) , then ( f n ) converges strongly to f * .
Proof. 
According to Propositions 5 and 6, the Mann iterates satisfy the LE and AF properties. Since C is nonempty, closed, bounded, and convex in a Hilbert space, then it is weakly compact [30]. For f 0 C , let us consider the Mann iterates with scalars satisfying the condition described, ( f n ) C . Since C is weakly compact, there exists a weakly convergent subsequence ( f n j ) . This subsequence satisfies the LE and AF properties as well. Let f * be the weak limit of ( f n j ) . Since C is weakly closed, f * C .
Arguing as in the previous proposition for the sequence ( f n j ) ,   f * F i x ( T ) .
If there exists another subsequence ( f n k ) converging weakly to g * and f * g * , using similar arguments we have that g * F i x ( T ) . Using Opial and LE conditions:
lim n | | f n f * | | = lim n | | f n j f * | | < lim n | | f n j g * | | = lim n | | f n g * | | ,
and
lim n | | f n g * | | = lim n | | f n k g * | | < lim n | | f n k f * | | = lim n | | f n f * | | .
This is a contradiction, consequently, f * = g * and ( f n ) converges weakly to f * . If ( | | f n | | ) converges to | | f * | | , let us consider that:
| | f n f * | | 2 = < ( f n f * ) , ( f n f * ) > = | | f n | | 2 2 < f n , f * > + | | f * | | 2 .
The last quantity converges to:
| | f * | | 2 2 < f * , f * > + | | f * | | 2 = 0 ,
and consequently, lim n | | f n f * | | = 0 .
If f * is a cluster point of ( f n ) , due to the LE property, the convergence is also strong. □
Corollary 5.
With the hypotheses of the previous theorem, if ( f n ) is the sequence of Mann iterates and f * is its weak limit, then:
< f n , g > < f * , g > ,
for any g E .
If E is the real Lebesgue space L 2 ( I ) , where I is a compact interval:
I f n g d μ I f * g d μ ,
for any g L 2 ( I ) and, in particular:
I f n d μ I f * d μ .
This fact makes the Mann method suitable to approximate the integral of a fixed point mapping in L 2 ( I ) .
Remark 4.
The results given in this section are true in particular for Krasnoselskii iteration (10) whenever 0 < λ < 1 .
Remark 5.
The reader may note that the Picard iteration (particular case of Mann iteration when a n = 1 for all n) does not lie in the range of convergence given in Theorem 3. The choice a n = 1 / 2 for all n is optimum in the sense of performing the least number of operations at each step.
Corollary 6.
Let E be a Hilbert space, and T : C C , where C is nonempty, bounded, closed, and convex, be a nonexpansive mapping. Then, F i x ( T ) and the Mann iterates such that 0 < inf a n sup a n < 1 converge weakly to a fixed point of T for any f 0 C .
Proof. 
A nonexpansive mapping is a nonexpansive partial contractivity with B = 0 . With the conditions given on E, C, and T, Browder’s Theorem implies that F i x ( T ) (see reference [31]). Applying Theorem 3 we obtain the weak convergence of the Mann iterates to a fixed point of T. □

4. SP-Algorithm for Nonexpansive Partial Contractivities

We study now the SP-algorithm (see, for instance, [12]) for nonexpansive partial contractivities. This is a three-step iterative procedure given for n 0 by:
f n + 1 = ( 1 a n ) g n + a n T g n ,
g n = ( 1 b n ) h n + b n T h n ,
h n = ( 1 c n ) f n + c n T f n ,
for a n , b n , c n [ 0 , 1 ] .
For a n = c n = 1 for all n , we have the Karakaya algorithm (see, for instance, [20,32]). In reference [19], we studied the convergence of this method for a quasi-normed space with index s under the hypothesis a s < 1 . We obtained that, if f * F i x ( T ) , for values of the scalars such that:
1 s 1 1 a < 1 k 1 a < a n , b n , c n 1 ,
where the SP-iterates satisfy the following inequality:
| f n + 1 f * | s ( k s ) 3 | f n f * | s .
where k is a constant such that a < k < s 1 . Thus, the algorithm is convergent and the order is O ( ( k s ) 3 n ) .

Case a = 1

In the next theorem, we consider f * F i x ( T ) in the case a = s = 1 .
Theorem 4.
Let E be a uniformly convex Banach space, C E nonempty, closed, and convex, and T : C C be a nonexpansive partial contractivity such that F i x ( T ) . The SP-algorithm has the LE and AF properties whenever the scalars a n , b n , c n are chosen such that:
0 < inf a n sup a n < 1 ,
0 < inf b n sup b n < 1 ,
0 < inf c n sup c n < 1 .
Proof. 
By (33) of [19], the SP-iterates of any f 0 C satisfy the inequality:
| | f n + 1 f * | | | | f n f * | | .
Then, the sequence ( f n ) is decreasing and bounded and consequently convergent. Thus, the SP-iterates of a nonexpansive partial contractivity have the LE property (see Definition 8). Let us define:
l : = lim n | | f n f * | | .
Additionally, for the definition of nonexpansive partial contractivity:
| | T f n f * | | | | f n f * | | ,
and consequently:
lim sup n | | T f n f * | | l .
Applying the expression (32) of reference [19]:
| | T g n f * | | | | g n f * | | | | f n f * | | .
Consequently:
lim sup n | | T g n f * | | lim sup n | | g n f * | | l .
Moreover:
l = lim n | | f n + 1 f * | | = | | ( 1 a n ) ( g n f * ) + a n ( T g n f * ) | | .
Lemma 1 implies that the sequence ( g n ) has the AF property:
lim n | | g n T g n | | = 0 .
Let us check now that ( g n ) has the LE property as well.:
| | f n + 1 f * | | = | | ( 1 a n ) ( g n f * ) + a n ( T g n f * ) | | | | g n f * | | + a n | | T g n g n | | ,
then:
l lim inf n | | g n f * | | ,
and thus, by (25):
lim n | | g n f * | | = l .
Consequently, ( g n ) has the LE property. Let us check now the properties of the sequence ( h n ) :
l = lim n | | g n f * | | = lim n | | ( 1 b n ) ( h n f * ) + b n ( T h n f * ) | | .
Using the definitions of nonexpansive partial contractivity, h n and the expression (31) of reference [19]:
| | T h n f * | | | | h n f * | | = | | ( 1 c n ) ( f n f * ) + c n ( T f n f * ) | | | | f n f * | | ,
and thus:
lim sup n | | T h n f * | | lim sup n | | h n f * | | l .
By (28):
l = lim n | | g n f * | | = lim n | | ( 1 b n ) ( h n f * ) + b n ( T h n f * ) | | .
This equality along (30) implies that:
lim n | | h n T h n | | = 0 ,
and ( h n ) has the AF property. Then:
| | g n f * | | = | | ( 1 b n ) ( h n f * ) + b n ( T h n f * ) | | | | h n f * | | + b n | | T h n h n | | ,
and thus:
l = lim inf n | | g n f * | | lim inf n | | h n f * | | .
By (30) and (32), ( h n ) has the LE property and:
l = lim n | | h n f * | | = lim n | | ( 1 c n ) ( f n f * ) + c n ( T f n f * ) | | .
According to Lemma 1, the last equality along with (21) and (23) provide the AF property of ( f n ) :   lim n | | f n T f n | | = 0 .
Thus, we have proved that the SP-iterates have the LE and AF properties for any f 0 C . □
As a consequence, we have the following results.
Theorem 5.
Let E be a Hilbert space, and T : C C , where C is nonempty, closed, bounded, and convex, be a nonexpansive partial contractivity such that F i x ( T ) . Then, the SP-algorithm with 0 < inf a n sup a n < 1 ,   0 < inf b n sup b n < 1 ,   0 < inf c n sup c n < 1 , converges weakly to a fixed point of T for any f 0 C .
Corollary 7.
Let E be a Hilbert space, and T : C C , where C is nonempty, bounded, closed, and convex, be a nonexpansive mapping. Then, F i x ( T ) and the SP-algorithm with 0 < inf a n sup a n < 1 ,   0 < inf b n sup b n < 1 ,   0 < inf c n sup c n < 1 , converges weakly to a fixed point of T for any f 0 C .
The proofs are similar to the given for the Mann iteration. If additionally f * is a cluster point of ( f n ) or ( | | f n | | ) converges to | | f * | | , then ( f n ) converges strongly to f * , for the reasons given in Theorem 3.
Corollary 5 is true for SP-iterations as well. The choice a n = b n = c n = 1 / 2 for all n is optimum in the sense of performing the least number of operations at each step.

5. Nonattracting Fractal Mappings on a Hilbert Space

In this section, we define fractal maps through an operator on the Hilbert space of square-integrable Hilbert-valued maps B 2 ( I , V ) , where I = [ 0 , 1 ] and V is a real Hilbert space, associated with an Iterated Function System. B 2 ( I , V ) is endowed with an inner product defined for F , G B 2 ( I , V ) , as:
< F , G > = I < F ( t ) , G ( t ) > d t ,
and norm:
| | F | | 2 = ( I | | F ( t ) | | 2 d t ) 1 / 2 ,
where | | · | | is the norm associated with the inner product in V. B 2 ( I , V ) is a Hilbert space. It agrees with the Lebesgue space L 2 ( I , V ) , when V = R .
Since the operator to be defined is nonexpansive, the fractal mappings cannot be approached, in general, by the Picard iterations of the operator, and in this sense we call them nonattracting fractal functions.
Let us consider a natural number N > 1 and a partition of the interval I = [ 0 , 1 ] , 0 = t 0 < t 1 < < t N = 1 . Let us define subintervals I m = [ t m 1 , t m ) for m = 1 , N 1 , and I N = [ t N 1 , t N ] . Consider affine maps L m ( t ) = c m t + d m , satisfying the so-called join-up conditions:
L m 1 ( t 0 ) = t m 1 , L m ( t N ) = t m .
Let F m : I × V V , where V is a Hilbert space with associated norm | | · | | , be defined as:
F m ( t , v ) = R m ( t , v ) + Q m ( t ) ,
where R m : I × V V and Q m : I V . Let us assume that:
| | F m ( t , v ) | | K , | | Q m ( t ) | | K ,
for t I , v V ,   m = 1 , , N and K + K 1 . Let us assume that R m , Q m are Bochner square-integrable maps. Let us assume that R m are uniformly nonexpansive in the second variable, that is to say:
| | R m ( t , v ) R m ( t , v ) | | | | v s . v | | ,
for any t I ,   m = 1 , N and v , v V . The mappings W m ( t , v ) = ( L m ( t ) , F m ( t , v ) , ) for m = 1 , 2 , , N , compose an iterated function system whose attractor is the graph of an integrable map (see for instance [13]).
Let C B 2 ( I , V ) be nonempty, closed, and convex and let us define T : C C as:
T G ( t ) = F m ( L m 1 ( t ) , G L m 1 ( t ) ) ,
for t I m . The conditions given on F m imply that T : C C , where C = B ¯ ( 0 , 1 ) is the closed unit ball (see reference [13] for details). The operator T is nonexpansive, due to condition (36).
The next result, due to F.E. Browder in an article of 1965, gives sufficient conditions for the existence of fixed points of nonexpansive mappings on subsets of Hilbert spaces [31].
Theorem 6.
Let C be a nonempty closed bounded convex subset of a Hilbert space H, and T : C C be a nonexpansive map, then T has a fixed point in C.
According to this result, the operator T defined by the expression (37) satisfies the conditions of Browder’s Theorem and it has some fixed point F * B ¯ ( 0 , 1 ) B 2 ( I , V ) . The graph of F * : I V has a fractal structure (see Theorem 5 of the reference [13]). The map F * need not be unique, and the Picard iterations of T may fail to converge to it, and in this sense, we call F * a nonattracting Hilbert-valued fractal mapping.
The results obtained in the second section provide the following theorems, which collect several properties of the set of fixed points of T and the convergence of the iterations studied.
Theorem 7.
Let C = B ¯ ( 0 , 1 ) B 2 ( I , V ) and T : C C , defined as in (37). Let N T : = F i x ( T ) be the set on nonattracting fractal maps associated with T. Then:
1. 
N T is nonempty, closed, and convex.
2. 
N T is either a singleton or is infinite.
3. 
For any G C , there exists a unique F * N T with minimal distance to G, that is to say, | | G F * | | 2 = inf { | | G F | | 2 : F N T } .
4. 
If a sequence ( F n ) C converges weakly to F C and it satisfies the AF property, then F N T , that is to say, F is a nonattracting fractal function associated with T.
Theorem 8.
Let C = B ¯ ( 0 , 1 ) B 2 ( I , V ) and T : C C , defined as in (37).
1. 
The Mann iterates chosen such that 0 < inf a n sup a n < 1 , converge weakly to a nonattracting fractal function F * for any G 0 C . If additionally, | | G n | | 2 converges to | | F * | | 2 either F * is a cluster point of ( G n ) , the convergence is strong.
2. 
If ( G n ) is the quoted Mann iterates and F * is its weak limit, then:
< G n , G > < F * , G > ,
for any G C .
3. 
For V = R , that is to say, E is the real Lebesgue space L 2 ( I ) then:
I G n G d μ I F * G d μ ,
and in particular:
I G n d μ I F * d μ .
4. 
Krasnoselskii iterations with 0 < λ < 1 satisty the properties (1)–(3).
5. 
SP-iterations with scalars such that 0 < inf a n sup a n < 1 ,   0 < inf b n sup b n < 1 ,   0 < inf c n sup c n < 1 , satisfy the properties (1)–(3).

6. Fractal Mappings Defined through φ -Contractions

In this section, we consider fractal functions defined by an operator T satisfying an inequality of φ -contractive type. That is to say:
| | T G T G | | 2 φ ( | | T G T G | | 2 ) ,
where φ : R + R + satisfies certain conditions, and G , G B 2 ( I , V ) . In reference [19], a ( φ ψ ) partial contractivity was defined in a b-metric space X, through the inequality:
d ( T x , T y ) φ ( d ( x , y ) ) + ψ ( d ( x , T x ) ) ,
for any x , y X , whenever φ and ψ meet specific conditions. A mapping T fulfilling (38) is a ( φ ψ ) partial contractivity for ψ = 0 .
There is a great number of results about the existence of fixed points of mappings satisfying (38). We recall important results from Matkowski [33] and Boyd and Wong [34] as a couple of examples. The next theorem can be read in reference [33].
Theorem 9.
Let ( X , d ) be a complete metric space, and T : X X satisfying:
d ( T x , T y ) φ ( d ( x , y ) ) ,
for any x , y X , where φ : R + R + is nondecreasing and such that lim n φ n ( δ ) = 0 for any δ > 0 . Then, T has a unique fixed point x * X and the Picard iterations of any point converge to it.
Remark 6.
The order of convergence of the Picard iterations is obviously d ( T n x , x * ) φ n ( d ( x 0 , x * ) ) .
Definition 10.
A self-map T satisfying the conditions given in Theorem 9 is a φ-contraction, and φ is a comparison function.
Example 6.
The map φ ( δ ) = δ / ( 1 + δ ) for δ 0 is a comparison function.
Proposition 8.
If T is a φ-contraction on a complete metric space, then T is nonexpansive, and consequently, it is quasi-nonexpansive and Lipschitz continuous.
Proof. 
The conditions imposed to a comparison function imply that φ ( δ ) < δ for any δ > 0 . By Matkowski’s Theorem, T has a fixed point x * . Then, for any x X :
d ( T x , x * ) φ ( d ( x , x * ) ) d ( x , x * ) ,
and T is quasi-nonexpansive. For all x , y X :
d ( T x , T y ) φ ( d ( x , y ) ) d ( x , y ) ,
and consequently, T is nonexpansive and Lipschitz continuous. □
Definition 11.
A comparison function φ that satisfies the condition δ φ ( δ ) when δ tends to infinity is called a strict comparison function, and T is a strict φ-contraction.
For a strict comparison function we have a different way to evaluate the order of convergence of the Picard iterations of a φ -contraction. This result is due to Russ in the reference [35].
Theorem 10.
If T is a strict φ-contraction and x * X is its fixed point then, for any x X :
d ( T n x , x * ) φ n ( δ 0 ) ,
where δ 0 : = sup { δ R + : δ φ ( δ ) d ( x , T x ) } .
We recall another important result of fixed point existence due to Boyd and Wong [34]. Let us denote, for a metric d , the range of d as P, that is to say: P : = { d ( x , y ) : x , y X } , and let P ¯ be its closure.
Theorem 11.
Let ( X , d ) be a complete metric space, and T : X X satisfying:
d ( T x , T y ) φ ( d ( x , y ) ) ,
for any x , y X , where φ : P ¯ R + is upper semicontinuous from the right and such that φ ( δ ) < δ for any δ > 0 . Then, T has a unique fixed point and the Picard iterations of any point converge to it.
Turning to the fractal mappings, we consider now the interval, partition, and maps L m as in Section 5, and F m ( t , v ) = R m ( t , v ) + Q m ( t ) , where R m is such that the operator H m : B 2 ( I , V ) B 2 ( I , V ) , defined as H m ( G ) ( t ) = R m ( t , G ( t ) ) , is a φ -contraction for m = 1 , N , that is to say:
| | H m ( G ) H m ( G ) | | 2 φ ( | | G G | | 2 ) ,
for any G , G B 2 ( I , V ) . Then, the operator defined by T G ( t ) = F m ( L m 1 ( t ) , G L m 1 ( t ) ) for t I m is also a φ -contraction since:
| | T G T G | | 2 2 = m = 1 N I m | | R m ( L m 1 ( t ) , G L m 1 ( t ) ) R m ( L m 1 ( t ) , G L m 1 ( t ) ) | | 2 d t ,
| | T G T G | | 2 2 = m = 1 N c m I | | R m ( t , G ( t ) ) R m ( t , G ( t ) ) | | 2 d t ,
| | T G T G | | 2 2 = m = 1 N c m I | | H m ( G ) ( t ) H m ( G ) ( t ) | | 2 d t = m = 1 N c m | | H m ( G ) H m ( G ) | | 2 2
and thus:
| | T G T G | | 2 2 ( φ ( | | G G | | 2 ) ) 2 ,
since m = 1 N c m = 1 due to conditions (33). Consequently, T is a φ -contraction, it has a unique fixed point F * B ( I , V ) and the Picard iterations are convergent (Theorem 9).
As said previously, the conditions given for the function φ imply that φ ( δ ) < δ for δ > 0 , and consequently, T is nonexpansive and continuous (Proposition 8). The results given in Section 5 are applicable to it. In this case we have a result of strong convergence for Krasnoselskii algorithm specific for Hilbert spaces.
Theorem 12.
Let us assume that the comparison function φ is such that φ ( t ) a t for any t > 0 and a < 1 . Then, the Krasnoselskii iterations of the operator T are strongly convergent to the fixed point for 0 < λ < 1 with order of convergence O ( k n ) , where:
k : = ( ( 1 λ ) 2 + 2 a λ ( 1 λ ) + λ 2 ) 1 2 .
Proof. 
Let us consider the Krasnoselskii operator:
T ¯ ( G ) = ( 1 λ ) G + λ T G ,
for G B 2 ( I , V ) . Then, for any G , G B 2 ( I , V ) ,
| | T ¯ G T ¯ G | | 2 2 = ( 1 λ ) 2 | | G G | | 2 2 + 2 λ ( 1 λ ) < T G T G , G G > + λ 2 | | T G T G | | 2 2 ,
Applying the Cauchy–Schwartz inequality in the second summand, and the conditions on T and φ :
| | T ¯ G T ¯ G | | 2 2 ( ( 1 λ ) 2 + 2 a λ ( 1 λ ) + λ 2 ) | | G G | | 2 2 .
It is an easy exercise to prove that:
k : = ( ( 1 λ ) 2 + 2 a λ ( 1 λ ) + λ 2 ) 1 2 < 1 .
Consequently, T ¯ is a Banach contraction with ratio k, and its iterations are convergent. □

7. Mappings of α -Fractal Type

Let us consider the maps L m , defined as in Section 5 and F m ( t , v ) = R m ( t , v ) + Q m ( t ) . Given two mappings F , F B 2 ( I , V ) , we now define Q m as:
Q m ( t ) = F L m ( t ) R m ( t , F ( t ) ) ,
for m = 1 , N . Let us assume that R m are as in the previous section, that is to say, the operators H m defined as H m ( G ) ( t ) = R m ( t , G ( t ) ) are φ contractions on B 2 ( I , V ) :
| | H m ( G ) H m ( G ) | | 2 φ ( | | G G | | 2 ) ,
where φ is a comparison function. As seen before, T is a φ -contraction as well. This iterated function system defines a map F φ : I V as the unique fixed point of the operator T . In previous papers, F φ : I V has been called the fractal convolution of F and F when R m are linear contractions, and denoted as F φ = F F (see for instance [13]).
Figure 1 and Figure 2 illustrate the action of the system { ( L m ( t ) , R m ( t , v ) ) } on the real function F ( t ) = e t sin ( 4 π t ) in the interval I = [ 0 , 1 ] . In this example, V = R ,   F ( t ) = cos ( π ( 1 2 t ) 2 ) , the number of evenly sampled subintervals is N = 10 , and R m ( t , v ) = t cos ( N v ) / ( N + 1 ) .
For a linear contraction R m ( t , v ) = α m ( t ) v (where α m is a real function such that 1 < | α m ( t ) | < 1 ), H m ( G ) ( t ) = α m ( t ) G ( t ) is a φ -contraction for φ ( t ) = A t , and A = sup { | α m ( t ) | : m = 1 , N ; t I } , assuming that A exists. For this kind of fractal maps, it is easy to establish the distance between F and its fractal counterpart, usually denoted as F α . We have (see for instance [13,14]):
| | F α F | | 2 A 1 A | | F F | | 2 .
However, in the general case, this bound is not that easy. We will approach this problem with the help of approximate operators. We begin with a definition.
Definition 12.
Let be given a metric space ( X , d ) , two self-maps T , U : X X are approximate operators if there exists k 0 such that d ( T x , U x ) k for any x X .
The bound k determines the distance between the fixed points of T and U, according to the next result, which can be read in the reference [30], Theorems 7.5 and 7.6.
Theorem 13.
Let be given a metric space ( X , d ) , and two approximate operators T , U : X X be such that d ( T x , U x ) k for any x X .
If T is a strict φ-contraction whose fixed point if x T X and x U F i x ( U ) , then:
d ( x T , x U ) δ k ,
where δ k = sup { δ R + : δ φ ( δ ) k } .
If T is a φ-contraction, where φ is subadditive and n = 0 φ n ( δ ) < for any δ > 0 , then:
d ( x T , x U ) s ( k ) ,
where s ( k ) = n = 0 φ n ( k ) .
Let us consider the operator of fractal interpolation, for the maps F m described at the beginning of this section. Then:
T G ( t ) = F ( t ) + R m ( L m 1 ( t ) , G L m 1 ( t ) ) R m ( L m 1 ( t ) , F L m 1 ( t ) ) ,
for t I m . Let us define U ( G ) = F for all G B 2 ( I , V ) . Then, T and U are approximate operators in the case where k : = sup δ φ ( δ ) < since, arguing as in Section 6:
| | T G U G | | 2 = | | T G F | | 2 φ ( | | G F | | 2 ) k .
Let F φ be the fixed point of T. According to Theorem 13:
  • If T is a strict φ -contraction, then:
    | | F φ F | | 2 δ k = sup { δ R + : δ φ ( δ ) k } .
  • If T is a φ -contraction, where φ is subadditive and n = 0 φ n ( δ ) < for any δ > 0 , then:
    | | F φ F | | 2 s ( k ) = n = 0 φ n ( k ) .
If φ is unbounded, but T : C C where C is bounded and closed, we can consider k : = φ ( d i a m ( C ) ) where d i a m ( C ) : = sup { | | G G | | 2 : G , G C } .
A different approach for real continuous functions can be read in the reference [14].

8. Conclusions

The first aim of this article was the presentation of a new type of nonexpansiveness, which includes the usual nonexpansive mappings like a particular case. The new self-maps T : E E so defined have been called nonexpansive partial contractivities. Some poperties of the set of their fixed points F i x ( T ) have been studied. For instance, F i x ( T ) is convex and closed if the space E is a strictly convex Banach space. Consequently, the set of fixed point is empty, a singleton, or infinite. If additionally E is uniformly convex, then F i x ( T ) is a Chebyshev set, that is to say, for every element of the space, there is a fixed point of minimal distance.
Afterwards, two iterative procedures for the approximation of fixed points in the context of normed spaces have been studied: Mann and SP-algorithms. For every method, two different cases have been considered. The fist one concerns quasi-normed spaces, and a ratio a of the self-map linked to the partial contractivity. It has been proved that if a s < 1 , where s is the index of the quasi-norm, and the scalars are suitably chosen, the algorithms converge strongly to a fixed point, with asymptotic statiblity. In a second instance, the nonexpansive case has been studied ( a = 1 ). It has been proved that the sequence of iterates satisfy the LE and AF properties, whenever the space E is a uniformly convex Banach space, and the scalars associated with the algorithms take intermediate values. If E is a Hilbert space, the algorithms converge weakly to a fixed point. In particular, it is proved that the symmetrically averaged iterative procedures perform well in the sense of convergence with the least number of operations at each step, in the case where a = 1 and E is Hilbert.
These findings have been used for the definition of fractal mappings of type F * : I V , where I is a real compact interval and V is a Hilbert space. These maps are fixed points of a nonexpansive operator defined on the space of square-integrable Bochner mappings, which contain the space L 2 ( I ) as a particular case (for V = R ). In this text, they are called nonattracting fractal mappings, in the sense that they cannot be approximated by the typical Picard iterations of the operator in general.
In a very different approach, other fractal mappings on Hilbert spaces have been defined through φ -contractions. Apart of their existence, the strong convergence of the Picard and Krasnoselskii iterations has been proved.
Finally, mappings of α -fractal type have been considered, in a framework much more general than the usual real case. The maps here defined are not linked to a scale factor, and they are defined by means of φ -contractions. The new maps F φ are fractal perturbations of mappings F : I V , where I is a real compact interval and V is a Hilbert space. The distance between F φ and F has been bounded with the use of approximate operators. The fractal maps studied here own a quasi-symmetry, in the sense that their graphs are composed of transformed copies of itself.

Funding

This work has not received external funds.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Fejér, L. Sur les fonctions bornées et intégrables. Comptes Rendus Acad. Sci. 1900, 131, 984–987. [Google Scholar]
  2. Kahane, J.P. Leopold Fejér et l’analyse mathématique au début du XXe siècle. Cah. SéMinaire D’Histoire Des MathéMatiques 1981, 2, 67–84. [Google Scholar]
  3. De la Vallée Poussin, C.J. Leçons sur l’Approximation des Fonctions d’une Variable Réelle; Gauthier-Villars: Paris, France, 1919. [Google Scholar]
  4. Mann, W.R. Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 44, 506–510. [Google Scholar] [CrossRef]
  5. Krasnoselskij, M.A. Two remarks on the method of successive approximations (Russian). Uspehi Mat. Nauk. 1955, 10, 123–127. [Google Scholar]
  6. Ishikawa, S. Fixed points by a new iteration method. Proc. Am. Math. Soc. 1974, 44, 147–150. [Google Scholar] [CrossRef]
  7. Rano, G.; Bag, T. Quasi-metric space and fixed point theorems. Int. J. Math. Sci. Comp. 2013, 3, 27–31. [Google Scholar]
  8. Dung, N.V.; Sintunavarat, W. Fixed point theory in b-metric spaces. In Metric Structures and Fixed Point Theory; Chapman and Hall/CRC: London, UK, 2021; pp. 33–66. [Google Scholar]
  9. Aydi, H.; Bota, M.F.; Karapinar, E.; Mitrovic, S. A fixed point theorem for set valued quasi-contractions in b-metric spaces. Fixed Point Theory Appl. 2012, 2012, 88. [Google Scholar] [CrossRef]
  10. Khan, A.A.; Ali, B. Completeness of b-metric spaces and best proximity points of nonself quasi-contractions. Symmetry 2021, 13, 2206. [Google Scholar] [CrossRef]
  11. Alolaiyan, H.; Ali, B.; Abbas, M. Characterization of a b-metric space completeness via the existence of a fixed point of Ciric-Suzuki type quasi-contractive multivalued operators and applications. An. St. Univ. Ovidius Constanta 2019, 27, 5–33. [Google Scholar] [CrossRef]
  12. Pheungrattana, W.; Suantai, S. On the rate of convergence of Mann, Ishikawa, Noor and SP iterations for continuous functions on an arbitrary interval. J. Comput. Appl. Math. 2011, 235, 3006–3014. [Google Scholar] [CrossRef]
  13. Navascués, M.A. Fractal curves in Banach algebras. Fractal Fract. 2022, 6, 722. [Google Scholar] [CrossRef]
  14. Navascués, M.A.; Pacurar, C. Scale-free fractal interpolation. Fractal Fract. 2022, 6, 602. [Google Scholar] [CrossRef]
  15. Viswanathan, P.E.; Navascués, M.A. A fractal operator on some standard spaces of functions. Proc. Edinburgh Math. Soc. 2017, 60, 771–786. [Google Scholar] [CrossRef]
  16. Navascués, M.A.; Verma, S. Non-stationary α-fractal surfaces. Mediterr. J. Math. 2023, 20, 48. [Google Scholar] [CrossRef]
  17. Cobzas, S.; Czerwik, S. The completion of generalized b-metric spaces and fixed points. Fixed Point Theory 2020, 21, 133–150. [Google Scholar] [CrossRef]
  18. Kirk, W.; Shahzad, N. Fixed Point Theory in Distance Spaces; Springer: Cham, Switzerland, 2014. [Google Scholar]
  19. Navascués, M.A.; Mohapatra, R.N. Fixed point dynamics in a new type of contraction in b-metric spaces. Symmetry 2024, 16, 506. [Google Scholar] [CrossRef]
  20. Navascués, M.A. Approximation of fixed points and fractal functions by means of different iterative algorithms. Chaos Solitons Fractals 2024, 180, 114535. [Google Scholar] [CrossRef]
  21. Zamfirescu, T. Fixed point theorems in metric spaces. Arch. Math. 1972, 23, 292–298. [Google Scholar] [CrossRef]
  22. Dotson, W.G. Fixed points of quasi-nonexpansive mappings. J. Aust. Math. Soc. 1972, 13, 167–170. [Google Scholar] [CrossRef]
  23. Li, J. The metric projection and its applications to solving variational inequalities in Banach spaces. Fixed Point Theory 2004, 5, 285–298. [Google Scholar] [CrossRef]
  24. Pettis, B.J. A proof that every uniformly convex space is reflexive. Duke Math. J. 1939, 5, 249–253. [Google Scholar] [CrossRef]
  25. Mohapatra, R.N.; Navascués, M.A.; Jha, S.; Chand, A.K.B. Iteration of operators with mutual relations of Kannan type. Mathematics 2022, 10, 2632. [Google Scholar] [CrossRef]
  26. Agarwal, R.P.; O’Regan, D.; Sahu, D.R. Fixed Point Theory for Lipschitzian-Type Mappings with Applications; Springer: New York, NY, USA, 2009. [Google Scholar]
  27. Sahu, D.R. Applications of the S-iteration process to constrained minimization problems and split feasibility problems. Fixed Point Theory 2011, 12, 187–204. [Google Scholar]
  28. Schu, J. Weak and strong convergence of fixed points of asymptotically nonexpansive mappings. Bull. Aust. Math. Soc. 1991, 43, 153–159. [Google Scholar] [CrossRef]
  29. Opial, Z. Weak convergence theorems for nonexpansive mappings. Bull. AMS 1967, 73, 591–597. [Google Scholar] [CrossRef]
  30. Berinde, V. Iterative Approximation of Fixed Points. Lecture Notes in Mathematics; Springer: Berlin/Heidelberg, Germany, 2007. [Google Scholar]
  31. Browder, F.E. Fixed-points theorems for non-compact mappings in Hilbert spaces. Proc. Natl. Acad. Sci. USA 1965, 53, 1272–1276. [Google Scholar] [CrossRef] [PubMed]
  32. Karakaya, V.; Atalan, Y.; Dogan, K.; Bouzara, N.E.H. Some fixed point results for a new three steps iteration process in Banach spaces. Fixed Point Theory Appl. 2017, 18, 625–640. [Google Scholar] [CrossRef]
  33. Matkowski, J. Integrable solutions of functional equations. Diss. Math. 1975, 127, 68. [Google Scholar]
  34. Boyd, D.W.; Wong, J.S. On nonlinear contractions. Proc. Am. Math. Soc. 1969, 20, 458–464. [Google Scholar] [CrossRef]
  35. Russ, I.A. Generalized Contractions. Semin. Fixed Point Theory 1983, 3, 1–130. [Google Scholar]
Figure 1. Graph of the function F ( t ) = e t sin ( 4 π t ) in the interval I = [ 0 , 1 ] .
Figure 1. Graph of the function F ( t ) = e t sin ( 4 π t ) in the interval I = [ 0 , 1 ] .
Symmetry 16 00738 g001
Figure 2. Graph of the fractal version of the function F ( t ) = e t sin ( 4 π t ) in I = [ 0 , 1 ] .
Figure 2. Graph of the fractal version of the function F ( t ) = e t sin ( 4 π t ) in I = [ 0 , 1 ] .
Symmetry 16 00738 g002
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Navascués, M.A. Nonexpansiveness and Fractal Maps in Hilbert Spaces. Symmetry 2024, 16, 738. https://doi.org/10.3390/sym16060738

AMA Style

Navascués MA. Nonexpansiveness and Fractal Maps in Hilbert Spaces. Symmetry. 2024; 16(6):738. https://doi.org/10.3390/sym16060738

Chicago/Turabian Style

Navascués, María A. 2024. "Nonexpansiveness and Fractal Maps in Hilbert Spaces" Symmetry 16, no. 6: 738. https://doi.org/10.3390/sym16060738

APA Style

Navascués, M. A. (2024). Nonexpansiveness and Fractal Maps in Hilbert Spaces. Symmetry, 16(6), 738. https://doi.org/10.3390/sym16060738

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