Next Article in Journal
Fractal Dimensional Analysis of Building Facades: The Case of Office Buildings in Erbil City
Next Article in Special Issue
An Effective Iterative Process Utilizing Transcendental Sine Functions for the Generation of Julia and Mandelbrot Sets
Previous Article in Journal
Bifurcation Analysis and Chaos Control of a Discrete Fractional-Order Modified Leslie–Gower Model with Nonlinear Harvesting Effects
Previous Article in Special Issue
Topological Degree for Operators of Class (S)+ with Set-Valued Perturbations and Its New Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Iterative Method for the Approximation of Common Fixed Points of Two Mappings: Application to Fractal Functions

by
María A. Navascués
Department of Applied Mathematics, Universidad de Zaragoza, 50018 Zaragoza, Spain
Fractal Fract. 2024, 8(12), 745; https://doi.org/10.3390/fractalfract8120745
Submission received: 4 December 2024 / Revised: 13 December 2024 / Accepted: 15 December 2024 / Published: 17 December 2024
(This article belongs to the Special Issue Fixed Point Theory and Fractals)

Abstract

:
This paper proposes an iterative algorithm for the search for common fixed points of two mappings. The properties of approximation and convergence of the method are analyzed in the context of Banach spaces. In particular, this article provides sufficient conditions for the strong convergence of the sequence generated by the iterative scheme to a common fixed point of two operators. The method is illustrated with some examples of application. The procedure is used to approach a common solution of two Fredholm integral equations of the second kind. In the second part of the article, the existence of a fractal function coming from two different Read–Bajraktarević operators is proved. Afterwards, a study of the approximation of fixed points of a fractal convolution of operators is performed, in the framework of Lebesgue or Bochner spaces.
Key Contribution: Conceptualization, M.A.N.; methodology, M.A.N.;  validation, M.A.N.; formal analysis, M.A.N.; writing---original draft preparation, M.A.N.; writing---review and editing, M.A.N.

1. Introduction

In this paper, we address the approximation of a common fixed point of a finite number of mappings through an iterative method, and its applications to the study of fractal functions involving two different operators. From a practical point of view, the problem of finding common fixed points of two mappings appears in mathematical applications such as convex optimization (see, for instance, [1]).
Das and Debata [2] extended the classical iteration proposed by Ishikawa [3] to find a critical point of a single operator, acting on a normed space, to the case of the approximation of a common fixed point of two maps S and T. The iterative scheme is the following:
y n = ( 1 α n ) x n + α n S x n ,
x n + 1 = ( 1 β n ) x n + β n T y n ,
for α n , β n [ 0 , 1 ] . They considered quasi-nonexpansive maps defined on uniformly convex Banach spaces. Takahashi and Tamura [4] studied the same method in the nonexpansive case on a strictly convex Banach space. Khan and Takahashi [5] generalized the procedure to deal with asymptotically nonexpansive operators.
In reference [6], Yadav proposed a variant of the iteration considered by Sahu [7] for a single map, in order to include two different mappings. The recurrence is given by the following steps:
y n = ( 1 β n ) T x n + β n S x n ,
x n + 1 = T y n ,
for β n [ 0 , 1 ] . This method was called Y-iteration by the author. He gave sufficient conditions on the space and the maps S and T in order to obtain weak and strong convergences of the sequence ( x n ) to a common fixed point of both mappings, and presented some examples of the application of the algorithm.
The single operator case proves that not all the fixed point approximation methods are useful for all kind of mappings. The convergence of each procedure depends on the underlying space and the properties of the map involved. Thus, it is desirable to have a variety of algorithms to focus a given problem. We propose a different iterative method for the search for common fixed points of a finite family of quasi-nonexpansive mappings, based on an algorithm defined in [8].
One of the first results of common fixed point existence of a family of operators is due to Browder [9]:
Theorem 1.
Let X be a uniformly convex Banach space, and C X be nonempty, bounded, closed and convex. If { U λ } is a commuting family of nonexpansive mappings U λ : C C , then the set { U λ } has a common fixed point.
The proof of this theorem is based on the well-known fixed point result of the same author for nonexpansive mappings on uniformly convex Banach spaces [9]. Theorem 1 is an extension of of the Markov–Kakutani Theorem [10,11]. It is also a generalization of the Theorem of De Marr [12], where C is assumed to be compact.
Afterwards, a great number of researchers expanded this result. For instance, R.E. Bruck [13] considered this problem in a Banach space X and C X satisfying some fixed point conditions, given in the following definition.
Definition 1.
Let X be a Banach space; a subset C X has the fixed point property for nonexpansive mappings if every nonexpansive map f : C C has a fixed point. C has the conditional fixed point property for nonexpansive mappings if every nonexpansive mapping f : C C satisfies either that f has no fixed points or that f has a fixed point in every nonempty bounded, closed and convex f-invariant subset ofC.
Example 1.
If X is a uniformly convex Banach space, any subset C that is nonempty, bounded, closed and convex has the fixed point property for nonexpansive mappings.
C = X , where X is a uniformly convex Banach space, has the conditional fixed point property for nonexpansive mappings.
Both are consequences of Browder’s Theorem on the existence of fixed points (Theorem 1 of reference [9]).
Bruck’s Theorem [13] states that if X is a real or complex Banach space and C X has the fixed point property and the conditional fixed point property for nonexpansive mappings, and C is either weakly compact or bounded and separable, then any commuting family of nonexpansive self-mappings of C has a common fixed point. This is a generalization of Browder’s common fixed point Theorem 1.
The existence of common fixed points of two maps was then historically linked to their commutativity. There was a conjecture stating that if two maps f , g : [ 0 , 1 ] [ 0 , 1 ] are continuous and commute, they need to have a common fixed point. This hypothesis was refuted by Boyce [14] and Huneke [15]. However, the fact is true if some additional conditions are added on the underlying space X and the maps, as seen in Browder’s Thereom.
It is clear that commutativity and continuity are not necessary conditions for the existence of common fixed points, and current research on the topic tries to remove both conditions (see, for instance, [16,17]). A discussion and bibliography on this subject can be found in reference [18].
We avoid in this article the problem of the existence of common fixed points (except in the definition of fractal functions of Section 5), and focus on their search in case of existence. We give sufficient conditions on the space and the maps for the strong convergence of a new procedure to approximate a common fixed point of the mappings S and T (Section 2 and Section 3). Through two examples, the algorithm is illustrated in the cases of the approximation of a commom fixed point of two real maps and the search for a common solution of two integral equations of Fredholm type (Section 4).
In a subsequent section we give conditions for the existence of a common fractal function coming from two different Read–Bajraktarević operators (Section 5). Finally, we consider an application to the approximation of fixed points of the fractal convolution of two operators by means of the algorithm proposed (Section 6).

2. An Algorithm for the Approximation of Common Fixed Points of Quasi-Nonexpansive Operators

In this section, we propose an algorithm for the approximation of a common fixed point of two mappings. We start with a normed space X and two operators S , T : C C , where C X is nonempty, closed and convex. The algorithm to find a simultaneous critical point of S and T is given by the following iterative scheme:
z n = ( 1 γ n ) x n + γ n S x n ,
y n = ( 1 β n ) x n + β n z n ,
x n + 1 = ( 1 α n ) y n + α n T y n ,
where α n , β n , γ n [ 0 , 1 ] for n N , and x 0 C . This method will be called common N-iteration, and it generalizes the N-iteration proposed in [8] for a single map. Throughout the paper, F S and F T will denote the set of fixed points of S and T, respectively. We propose the following definitions.
Definition 2.
A sequence ( x n ) C has the common limit existence property (CLE) with respect to S and T if lim n | | x n x * | | = l R for any x * F S F T , provided that F S F T .
Remark 1.
This definition can be generalized to a finite number of mappings ( T 1 , T 2 , , T m ).
Definition 3.
A sequence ( x n ) C has the approximate fixed point property (AF) with respect to S if lim n | | x n S x n | | = 0 .
Definition 4.
Let X be a normed space. A map U : C X X is quasi-nonexpansive if F U and
| | U x x * | | | | x x * | | ,
for any x C and x * F U .
Proposition 1.
Let X be a normed space and C X be nonempty, closed and convex. Let S , T : C C be two quasi-nonexpansive operators such that F S F T . The common N-iteration has the CLE property; that is to say, for ( x n ) defined as in (5), (6) and (7), lim n | | x n x * | | = l R for any x * F S F T and any x 0 C .
Proof. 
Let x * F S F T and x 0 C . According to (5),
| | z n x * | | ( 1 γ n ) | | x n x * | | + γ n | | S x n x * | | | | x n x * | | .
In the same way, using (6),
| | y n x * | | ( 1 β n ) | | y n x * | | + β n | | z n x * | | | | x n x * | | .
Finally,
| | x n + 1 x * | | ( 1 α n ) | | y n x * | | + α n | | T y n x * | | | | y n x * | | | | x n x * | | .
Consequently, the sequence ( | | x n x * | | ) is non-increasing and bounded and thus lim n | | x n x * | | = l exists and it is real. □
The next lemma can be consulted in reference [19].
Lemma 1.
Let X be a uniformly convex Banach space, and let a sequence ( λ n ) X 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 X 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 .
Theorem 2.
Let X be a uniformly convex Banach space and C X be nonempty, closed and convex. If S , T : C C are two quasi-nonexpansive operators such that F S F T and 0 < inf γ n sup γ n < 1 , 0 < inf α n sup α n < 1 , then
  • The sequences ( x n ) , ( y n ) and ( z n ) defined in (5), (6) and (7) have the CLE property.
  • ( x n ) has the AF property with respect to S and ( y n ) has the AF property with respect to T.
Proof. 
Let x * F S F T . By the previous proposition, l : = lim n | | x n x * | | exists and it is real. According to (10),
lim sup n | | y n x * | | l ,
and
lim sup n | | T y n x * | | lim sup n | | y n x * | | l .
Using Lemma 1 and the following equality
l = lim n | | x n + 1 x * | | = lim n | | ( 1 α n ) ( y n x * ) + α n ( T y n x * ) | |
we have that
lim n | | y n T y n | | = 0 .
Hence, ( y n ) has the AF property with respect to T. Again, by the third step of the algorithm,
| | x n + 1 x * | | | | y n x * | | + α n | | T y n y n | | .
Then,
l lim inf n | | y n x * | | .
By (12) and (14), l = lim n | | y n x * | | . Let us consider now that
| | y n x * | | ( 1 β n ) | | x n x * | | + β n | | z n x * | | ,
| | y n x * | | | | x n x * | | β n ( | | z n x * | | | | x n x * | | ) | | z n x * | | | | x n x * | | .
Then,
| | y n x * | | | | z n x * | | .
Consequently,
l = lim n | | y n x * | | lim inf n | | z n x * | | .
By (9), lim sup n | | z n x * | | l and hence l = lim n | | z n x * | | . Consequently, the sequences ( x n ) , ( y n ) and ( z n ) have the CLE property, with the same limit:
lim n | | x n x * | | = lim n | | y n x * | | = lim n | | z n x * | | ,
for x * F S F T . The quasi-nonexpansiveness of S implies that
lim sup n | | S x n x * | | l .
The equality
l = lim n | | z n x * | | = lim n | | ( 1 γ n ) ( x n x * ) + γ n ( S x n x * ) | | ,
along with the inequality lim sup n | | S x n x * | | l imply, by Lemma 1, that
lim n | | x n S x n | | = 0 ,
and ( x n ) has the AF property with respect to S .
According to Proposition 1 and Theorem 2, the approximation properties of the common N-iteration are true also for the two-step common N-iteration, given by the following recurrence:
y n = ( 1 γ n ) x n + γ n S x n ,
x n + 1 = ( 1 α n ) y n + α n T y n .
where 0 < inf γ n sup γ n < 1 and 0 < inf α n sup α n < 1 (taking β n = 1 for all n in (6)).
This iterative scheme can be generalized to a finite number of operators with common fixed points, in order to provide the following m-step common fixed point N-algorithm for the mappings T 1 , T 2 , , T m : C C such that i = 1 m F T i :
x n 1 = ( 1 c n 1 ) x n + c n 1 T 1 x n ,
x n 2 = ( 1 c n 2 ) x n 1 + c n 2 T 2 x n 1 ,
               
x n i = ( 1 c n i ) x n i 1 + c n i T i x n i 1 ,
               
x n + 1 = x n m = ( 1 c n m ) x n m 1 + c n m T m x n m 1 ,
where 0 < inf n c n i sup n c n i < 1 for all n 1 , i = 1 , , m , and x 0 C .

3. Convergence Theorems for the Common N-Iteration

Throughout this section, we will assume a normed space X, C X , C , and S , T : C C , such that F S F T . We will consider the common N-iteration given by (5), (6) and (7) with the conditions for α n and γ n given in Theorem 2.
Remark 2.
The notation I d will represent the identity operator.
Theorem 3.
Let X be a uniformly convex Banach space and C X be compact and convex. If S , T : C C are quasi-nonexpansive and closed, then the common N-iteration described converges strongly to a common fixed point of S and T .
Proof. 
Since C is compact, the sequence ( y n ) of the iteration has a convergent subsequence. Let lim j y n j = x ¯ C . Since ( y n ) has the AF property with respect to T, then | | y n j T y n j | | tends to zero. Since I d T is closed, then 0 = ( I d T ) x ¯ , and x ¯ F T .
According to the third step of the algorithm,
| | x n j + 1 x ¯ | | = | | ( 1 α n j ) ( y n j x ¯ ) + α n j ( T y n j x ¯ ) | | | | y n j x ¯ | | 0 .
Consequently, lim j x n j + 1 = x ¯ .
Since I d S is closed and ( x n ) has the AF property with respect to S, then 0 = ( I d S ) x ¯ , and x ¯ F S F T . The CLE property of ( x n ) implies that lim n | | x n x ¯ | | = 0 .
Corollary 1.
Let X be a uniformly convex Banach space, and let C X be compact andconvex. If S , T : C C are nonexpansive, then the common N-iteration described converges strongly to a common fixed point of S and T .
Proof. 
A nonexpansive mapping with a fixed point is quasi-nonexpansive and continuous, and we have the hypotheses of Theorem 3. □
Definition 5.
Let X be a normed space. A mapping T : X X , such that there exists B 0 satisfying for any f , g X the following inequality
| | T f T g | | | | f g | | + B min { | | f T f | | , | | g T g | | } ,
is a nonexpansive partial contractivity.
For B = 0 , we have a nonexpansive mapping.
Corollary 2.
Let X be a uniformly convex Banach space, and let C X be compact andconvex. If S , T : C C are closed nonexpansive partial contractivities, then the common N-iteration described converges strongly to a common fixed point of S and T .
Proof. 
A nonexpansive partial contractivity with a fixed point is quasi-nonexpansive, and we are in the conditions of Theorem 3. □
Definition 6.
Let X be a normed space, and C X . A map T : C X is demicompact if a bounded sequence ( x n ) C , such that ( T x n x n ) is convergent, has a convergent subsequence. If a sequence ( x n ) C , such that ( T x n x n ) is convergent to zero, has a convergent subsequence ( x n j ) , then T is demicompact at zero.
Remark 3.
According to this definition, if T is demicompact at zero, ( x n ) is bounded and it has the AF property with respect to T, then there exists a convergent subsequence ( x n j ) .
Proposition 2.
Let X be a uniformly convex Banach space, and let C X be closed andconvex. If S , T : C C are quasi-nonexpansive and closed, and T is demicompact at zero, then the common N-iteration described converges strongly to a common fixed point of S and T .
Proof. 
The CLE property of ( y n ) implies that the sequence ( y n ) is bounded. The AF property of ( y n ) with respect to T implies that | | y n T y n | | tends to zero. As T is demicompact, there is a convergent subsequence ( y m k ) . Let x * : = lim n y m k . Then, ( I d T ) y m k 0 . Since T is closed, then 0 = ( I d T ) x * , and x * F T .
Regarding ( x n ) , according to the last step of the algorithm,
| | x m k + 1 x * | | = | | ( 1 α m k ) ( y m k x * ) + α m k ( T y m k x * ) | | | | y m k x * | | 0 .
As ( I d S ) x m k + 1 tends to zero due to the AF property of ( x n ) and I d S is closed, then 0 = ( I d S ) x * and x * F S F T .
The CLE property of ( x n ) implies that the common N-iteration converges strongly to x * for any x 0 C .
Corollary 3.
Let X be a uniformly convex Banach space, and let C X be closed and convex. If S , T : C C are nonexpansive and T is demicompact at zero, then the common N-iteration described converges strongly to a common fixed point of S and T .
Corollary 4.
Let X be a uniformly convex Banach space, and let C X be closed andconvex. If S , T : C C are closed nonexpansive partial contractivities and T is demicompact at zero, then the common N-iteration described converges strongly to a common fixed point of S and T .
Definition 7.
Let X , Y be Banach spaces. Then, S : X Y is demiclosed (at z Y ) if y n y and S y n z imply that S y = z .
Remark 4.
The symbol ⇀ denotes the weak convergence of a sequence.
The following demiclosedness principle for nonexpansive mappings can be consulted in reference [20], Theorem 10.4:
Theorem 4.
Let X be a uniformly convex Banach space, C a nonempty, closed and convex subset of X and T : C X a nonexpansive mapping. Then, I d T is demiclosed on C.
Definition 8.
Let X , Y be Banach spaces. Then, S : X Y is completely continuous if x n x implies that S x n S x .
Remark 5.
A completely continuous mapping is demiclosed.
Proposition 3.
Let X be a uniformly convex Banach space, and let C X be bounded, closed and convex. If S , T : C C are nonexpansive and T is completely continuous, then the common N-iteration described converges strongly to a common fixed point of S and T .
Proof. 
Since C is bounded, closed and convex in a uniformly convex space, there exists a weakly convergent subsequence ( y n j ) of ( y n ) . That is to say, y n j x ¯ . The AF property of ( y n ) with respect to T implies that | | y n j T y n j | | tends to zero. According to Theorem 4, I d T is demiclosed and this implies that 0 = ( I d T ) x ¯ , that is to say, x ¯ F T .
Since T is completely continuous, lim j T y n j = T x ¯ = x ¯ . Then,
y n j = ( y n j T y n j ) + T y n j x ¯ .
| | x n j + 1 x ¯ | | | | ( 1 α n j ) ( y n j x ¯ ) + α n j ( S y n j x ¯ ) | | | | y n j x ¯ | | 0 .
Since ( ( I d S ) x n j + 1 ) tends to zero due to the AF property of ( x n ) with respect to S, and I d S is continuous, then 0 = ( I d S ) x ¯ and x ¯ F S F T .
The CLE property of ( x n ) implies its convergence to x ¯ .
Remark 6.
All the results obtained in this section are applicable to the case S = T , and the usual N-algorithm for a single map defined in reference [8].

4. Some Applications of the Common N-Iteration

In this section, we present two examples of the application of the common N-iteration.

4.1. Approximation of a Common Fixed Point of Two Mappings

The maps S , T : [ 0 , 1 ] [ 0 , 1 ] given by S ( x ) = ( 1 x 2 / 3 ) 3 and T ( x ) = x have a common fixed point at x * 0.353553 . The common N-iteration with all the scalars equal to 1 / 2 has been used to approach this point. Namely, we have computed the successive values of x n by means of the iterative scheme:
z n = x n + S x n 2 ,
y n = x n + z n 2 ,
x n + 1 = y n + T y n 2 .
The abscissas x 0 = 0.1 and x 0 = 1 have been chosen as starting points of two performances of the algorithm. The subsequent errors, computed as | x n x * | , are collected in Table 1. The left part gathers the errors for x 0 = 0.1 and the right part displays the case x 0 = 1 .

4.2. Search for a Common Solution of Two Fredholm Integral Equations of the Second Kind

Let us consider the following integral equations of Fredholm type:
f ( x ) = h ( x ) + a b K ( x , y ) f ( y ) d y ,
g ( x ) = h ( x ) + a b K ( x , y ) g ( y ) d y ,
where we look for a common solution in L 2 ( [ a , b ] ) . This problem is equivalent to the search for a common fixed point of the operators S , T : L 2 ( [ a , b ] ) L 2 ( [ a , b ] ) defined as
S u ( x ) = h ( x ) + a b K ( x , y ) u ( y ) d y ,
T u ( x ) = h ( x ) + a b K ( x , y ) u ( y ) d y .
It is well known that if K and K are such that K , K L 2 ( I × I ) , where I = [ a , b ] , then the operators S and T are linear and compact and consequently demicompact. They are nonexpansive if
I × I | K ( x , y ) | d x d y 1 ,
I × I | K ( x , y ) | d x d y 1 .
The following integral equations:
f ( x ) = ( e x 1 ) + 0 1 y f ( y ) d y ,
f ( x ) = ( e x + 1 e ) + 0 1 f ( y ) d y .
have a common exact solution at f ( x ) = e x . Let us apply the two-step common N-algorithm ( β n = 0 ), and let us choose α n = γ n = 1 / 2 for all n 1 . Thus, the N-iteration is given by the following scheme:
g n ( x ) = f n ( x ) + ( e x 1 ) + 0 1 y f n ( y ) d y / 2 ,
f n + 1 ( x ) = g n ( x ) + ( e x + 1 e ) + 0 1 g n ( y ) d y / 2 .
Let the starting function be f 0 ( x ) = x . The error of every approximation is computed as
E r r n = 0 1 | f n ( x ) f ( x ) | 2 d x 1 / 2 ,
where f ( x ) is the exact solution. Table 2 collects the errors from the first to the twentieth iteration. Figure 1 represents the exact common solution (in yellow) along with the first, fourth, seventh and tenth approximations, respectively (in blue).

5. Fractal Functions as Common Fixed Points of Two Different Operators

In this section, we find a fractal function as a common fixed point of two different Read–Bajraktarević operators.
According to the formalism of these mappings, we consider a compact real interval I = [ a , b ] , and a partition of it Δ : a = t 0 < t 1 < t 2 < t M = b . Let us consider I m = [ t m 1 , t m ) , for m = 1 , 2 , M 1 and I M = [ t M 1 , t M ] and define L m : I I m such that L m ( t ) = a m t + b m and
L m ( t 0 ) = t m 1 , L m ( t M ) = t m .
Let S m , T m be mappings on the space L p ( I ) , that is to say, S m , T m : L p ( I ) L p ( I ) , , and let us assume that 1 < p < . Let us define the operators of Read–Bajraktarević type S , T : L p ( I ) L p ( I ) given by
S f ( t ) = S m ( f ) L m 1 ( t ) ,
T f ( t ) = T m ( f ) L m 1 ( t ) ,
for t I m . The next result gives sufficient conditions for the existence of a fractal function as a common fixed point of S and T. Let | | · | | p denote the norm of the space L p ( I ) for 1 < p < .
Theorem 5.
Let the operators S m , T m meet the following conditions for m = 1 , 2 , , M :
1. 
There exists R > 0 satisfying | | S m f | | p R and | | T m f | | p R for any f L p ( I ) such that | | f | | p R .
2. 
S m and T m are nonexpansive.
3. 
T m i = 1 M κ I i ( · ) S i ( f ) L i 1 ( · ) = S m i = 1 M κ I i ( · ) T i ( f ) L i 1 ( · ) , where κ I i is the indicator map of I i or, equivalently, S m T j f L j 1 ( · ) = T m S j f L j 1 ( · ) where L j 1 : I j I , for j = 1 , , M .
Then, the operators S and T defined in (25) and (26) commute, they are nonexpansive and there exists a fractal function f ¯ L p ( I ) such that f ¯ is a common fixed point of S and T. This function can be approached using the common N-iteration of the maps S and T whenever 0 < inf α n sup α n < 1 and 0 < inf γ n sup γ n < 1 .
Proof. 
The Hypothesis (1) of the theorem enables the restriction of the domain and codomain of the operators S and T to the closed ball with a center in the null function f 0 and radius R , B ¯ ( f 0 , R ) L p ( I ) since
| | S f | | p R ,
| | T f | | p R ,
for f B ¯ ( f 0 , R ) . Thus, S and T can be defined from and onto the bounded, closed and convex subset B ¯ ( f 0 , R ) of the uniformly convex Banach space L p ( I ) . It is easy to check that S and T are nonexpansive, since
| | S f S f | | p m = 1 M a m 1 / p | | S m f S m f | | p | | f f | | p ,
| | T f T f | | p m = 1 M a m 1 / p | | T m f T m f | | p | | f f | | p ,
and m = 1 M a m = 1 due to conditions (24). Moreover,
( T S ) f ( L m t ) = T ( S f ) ( L m t ) = T m ( S f ) ( t ) ,
and
( S T ) f ( L m t ) = S ( T f ) ( L m t ) = S m ( T f ) ( t ) ,
where
T m ( S f ) = T m i = 1 M κ I i ( · ) S i ( f ) L i 1 ( · ) = T m S j f L j 1 ( · )
and
S m ( T f ) = S m i = 1 M κ I i ( · ) T i ( f ) L i 1 ( · ) = S m T j f L j 1 ( · )
where L j 1 : I j I . The last two equations are equal due to the Hypothesis (3) of the theorem, and, consequently, S T = T S . Then, we have the hypotheses of Browder’s Theorem 1 for C = B ¯ ( f 0 , R ) , and S and T have a common fixed point f ¯ B ¯ ( f 0 , R ) L p ( I ) .
Example 2.
The operators defined as S m f = c m f , T m f = c m f for c m , c m R , | c m | , | c m | 1 , and c m c j = c m c j for m , j = 1 , 2 , , M , satisfy the hypotheses required.

6. Fixed Points of the Fractal Convolution of Several Types of Operators

In this section, we consider a special type of operators defined in (26),
T f ( t ) = T m ( f ) L m 1 ( t ) ,
for t I m and
T m f ( t ) = u L m ( t ) + k m ( f ( t ) v ( t ) ) ,
where u , v L p ( I ) and k m R are constant and such that | k m | < 1 for m = 1 , 2 , , M . In this case, the operator T is a contraction since
| | T f T f | | p k | | f f | | p ,
for any f , f L p ( I ) and k = max { | k m | } < 1 . Then, T has a fixed point, usually denoted as u α , called α -fractal function in previous papers (see, for instance, [21] for the two-dimensional case). In other articles (see, for instance, [22]), u α has been considered as the result of a binary internal operation in L p ( I ) , , that is to say,
u α = u v .
The operation ∗ has been called “fractal convolution”. This operation has useful properties such as idempotency, namely, u u = u for any u L p ( I ) . Other features of the fractal convolution can be consulted in reference [22]. From this background, we have also defined a fractal convolution between operators on the same space defined, for V , W : L p ( I ) L p ( I ) , as
( V W ) f = ( V f ) ( W f ) ,
for f L p ( I ) .
The fractal convolution of operators also has the property of idempotency, that is to say,
V V = V .
A straightforward consequence of this characteristic is that, if F V and F W are the sets of fixed points of V and W , respectively, then
( F V F W ) F V W .
Namely, a common fixed point of V and W is a fixed point of V W .
In the following, we assume that V and W are such that F V F W , and V , W : C C , where C L p ( I ) or C B p ( I ) , where B p ( I ) denotes the Bochner space of p-integrable maps f : I B , with B being a uniformly convex Banach space.
Let us consider C and 1 < p < . For the common N-iteration algorithm, we will assume the following conditions on the scalars: 0 < inf α n sup α n < 1 and 0 < inf γ n sup γ n < 1 .
The results obtained in previous sections for the common fixed points of two mappings and their approximation are applicable to the search for fixed points of V W . A summary of these results, applied to V W , is the following:
  • If C is compact and convex and V , W are quasi-nonexpansive and closed, then the common N-iteration converges strongly to a fixed point of V W .
  • If C is compact and convex and V , W are nonexpansive, then the common N-iteration converges strongly to a fixed point of V W .
  • If C is compact and convex and V , W are closed nonexpansive partial contractivities, then the common N-iteration converges strongly to a fixed point of V W .
  • If C is closed and convex, V , W are quasi-nonexpansive and closed and W is demicompact at zero, then the common N-iteration converges strongly to a fixed point of V W .
  • If C is closed and convex, V , W are nonexpansive and W is demicompact at zero, then the common N-iteration converges strongly to a fixed point of V W .
  • If C is closed and convex, V , W are closed nonexpansive partial contractivities and W is demicompact at zero, then the common N-iteration converges strongly to a fixed point of V W .
  • If C is bounded, closed and convex, V , W are nonexpansive and W is completely continuous, then the common N-iteration converges strongly to a fixed point of V W .

7. Conclusions

This article presents an iterative method to find common fixed points of two maps S , T : C C , where C is a nonempty, closed and convex subset of a normed space X. The recurrence is called common N-iteration, and it is given by the recurrence:
z n = ( 1 γ n ) x n + γ n S x n ,
y n = ( 1 β n ) x n + β n z n ,
x n + 1 = ( 1 α n ) y n + α n T y n .
for α n , β n , γ n [ 0 , 1 ] and x 0 C .
It has been proved that ( x n ) , ( y n ) and ( z n ) have the CLE property, ( x n ) has the AF property with respect to S, and ( y n ) has the AF property with respect to T. This article provides sufficient conditions on X, C and the maps S and T for the strong convergence of the algorithm to a common fixed point of S and T, in case of existence.
The procedure has been applied to the approximation of a common fixed point of two maps defined in the interval [ 0 , 1 ] and a common solution of two Fredholm integral equations of the second kind.
This paper has proved the existence of a fractal function that is a common fixed point of two different nonexpansive Read–Bajraktarević operators defined on L p ( I ) or B p ( I ) . In the last section, the article gives sufficient conditions for the convergence of the algorithm to a fixed point of a fractal convolution of operators V W , where V , W : L p ( I ) L p ( I ) or V , W : B p ( I ) B p ( I ) . In both cases, the range of values of p is 1 < p < .

Funding

This research received no external funding.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Takahashi, W. Iterative methods for approximation of fixed points and their applications. J. Oper. Res. Soc. Jpn. 2000, 43, 87–108. [Google Scholar] [CrossRef]
  2. Das, G.; Debata, J.P. Fixed points of quasi-nonexpansive mappings. Indian J. Pure Appl. Math. 1986, 17, 1263–1269. [Google Scholar]
  3. Ishikawa, S. Fixed points by a new iteration method. Proc. AMS 1974, 44, 147–150. [Google Scholar] [CrossRef]
  4. Takahashi, W.; Tamura, T. Convergence theorems for a pair of nonexpansive mappings. J. Convex Anal. 1998, 5, 45–56. [Google Scholar]
  5. Khan, S.H.; Takahashi, W. Approximating common fixed points of two asymptotically nonexpansive mappings. Sci. Math. Jpn. 2001, 53, 143–148. [Google Scholar]
  6. Yadav, M.R. Two-step iteration scheme for nonexpansive mappings in Banach space. Math. Moravica 2015, 19, 95–105. [Google Scholar] [CrossRef]
  7. 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]
  8. Navascués, M.A. Approximation sequences for fixed points of non contractive operators. J. Nonlinear Funct. Anal. 2024, 20, 1–13. [Google Scholar]
  9. Browder, F.E. Nonexpansive nonlinear operators in a Banach space. Proc. Nat. Acad. Sci. USA 1965, 54, 1041–1044. [Google Scholar] [CrossRef]
  10. Markov, A. Quelques théorèmes sur les ensembles Abeliens. Dokl. Akad. Nauk SSSR 1936, 10, 311–314. [Google Scholar]
  11. Kakutani, S. Two fixed point theorems concerning bicompact convex sets. Proc. Imp. Acad. 1938, 14, 242–245. [Google Scholar] [CrossRef]
  12. De Marr, R. Common fixed points for commuting contraction mappings. Pac. J. Math. 1963, 13, 1139–1141. [Google Scholar] [CrossRef]
  13. Bruck, R.E., Jr. A common fixed point theorem of a counting family of nonexpansive mappings. Pac. J. Math. 1974, 53, 59–71. [Google Scholar] [CrossRef]
  14. Boyce, W.M. Commuting functions with no common fixed points. Trans. AMS 1969, 137, 77–92. [Google Scholar] [CrossRef]
  15. Huneke, J.P. On common fixed points of commuting continuous function on an interval. Trans. AMS 1969, 139, 371–381. [Google Scholar] [CrossRef]
  16. Pant, R.P. Common fixed points of noncommuting maps. J. Math. Anal. Appl. 1994, 188, 436–440. [Google Scholar] [CrossRef]
  17. Pant, R.P. Discontinuity and fixed points. J. Math. Anal. Appl. 1999, 240, 284–289. [Google Scholar] [CrossRef]
  18. Patel, D.K.; Kumam, P.; Gopal, D. Some discussion on the existence of common fixed points for a pair of maps. Fixed Point Theory Appl. 2013, 187, 187. [Google Scholar] [CrossRef]
  19. Schu, J. Weak and strong convergence of fixed points of asymptotically nonexpansive mappings. Bull. Aust. Math. Soc. 1991, 43, 153–159. [Google Scholar] [CrossRef]
  20. Goebel, K.; Kirk, W.A. Topics in Metric Fixed Point Theory; Cambridge University Press: Cambridge, UK, 1990. [Google Scholar]
  21. Navascués, M.A.; Mohapatra, R.N.; Akhtar, M.N. Construction of fractal surfaces. Fractals 2019, 28, 2050033. [Google Scholar] [CrossRef]
  22. Navascués, M.A.; Massopust, P. Fractal convolution: A new operation between functions. Fract. Calc. Appl. Anal. 2019, 22, 619–643. [Google Scholar] [CrossRef]
Figure 1. From upper left to bottom right, exact solution (yellow) along with the first, fourth, seventh and tenth approximations ( f 1 , f 4 , f 7 , f 10 ) (blue).
Figure 1. From upper left to bottom right, exact solution (yellow) along with the first, fourth, seventh and tenth approximations ( f 1 , f 4 , f 7 , f 10 ) (blue).
Fractalfract 08 00745 g001
Table 1. Approximation errors of the first values given by the N-algorithm for a common fixed point of two maps starting at x 0 = 0.1 (left) and x 0 = 1 (right).
Table 1. Approximation errors of the first values given by the N-algorithm for a common fixed point of two maps starting at x 0 = 0.1 (left) and x 0 = 1 (right).
IterationErrorIterationError
00.2535500.64645
10.1048210.39645
20.0495120.22717
30.0241530.12388
40.0119340.06521
50.0059350.03355
60.0029660.01703
70.0014870.00858
80.0007480.00431
90.0003790.00216
100.00018100.00108
Table 2. Errors of the first twenty approximations given by the two-step N-algorithm for a common solution of two Fredholm integral equations.
Table 2. Errors of the first twenty approximations given by the two-step N-algorithm for a common solution of two Fredholm integral equations.
IterationErrorIterationError
10.94392110.05539
20.71417120.04041
30.53734130.03031
40.40345140.02273
50.30270150.01705
60.22705160.01279
70.17030170.00960
80.12772180.00719
90.09579190.00539
100.07184200.00405
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. An Iterative Method for the Approximation of Common Fixed Points of Two Mappings: Application to Fractal Functions. Fractal Fract. 2024, 8, 745. https://doi.org/10.3390/fractalfract8120745

AMA Style

Navascués MA. An Iterative Method for the Approximation of Common Fixed Points of Two Mappings: Application to Fractal Functions. Fractal and Fractional. 2024; 8(12):745. https://doi.org/10.3390/fractalfract8120745

Chicago/Turabian Style

Navascués, María A. 2024. "An Iterative Method for the Approximation of Common Fixed Points of Two Mappings: Application to Fractal Functions" Fractal and Fractional 8, no. 12: 745. https://doi.org/10.3390/fractalfract8120745

APA Style

Navascués, M. A. (2024). An Iterative Method for the Approximation of Common Fixed Points of Two Mappings: Application to Fractal Functions. Fractal and Fractional, 8(12), 745. https://doi.org/10.3390/fractalfract8120745

Article Metrics

Back to TopTop