Next Article in Journal
Entire Functions of Several Variables: Analogs of Wiman’s Theorem
Previous Article in Journal
Local Equivalence of the Black–Scholes and Merton–Garman Equations
Previous Article in Special Issue
Characterization Results of Extremization Models with Interval Values
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Hammerstein Nonlinear Integral Equations and Iterative Methods for the Computation of Common Fixed Points

by
María A. Navascués
Department of Applied Mathematics, Universidad de Zaragoza, 50018 Zaragoza, Spain
Axioms 2025, 14(3), 214; https://doi.org/10.3390/axioms14030214
Submission received: 21 February 2025 / Revised: 11 March 2025 / Accepted: 13 March 2025 / Published: 15 March 2025
(This article belongs to the Special Issue New Perspectives in Operator Theory and Functional Analysis)

Abstract

:
In the first part of this article, a special type of Hammerstein nonlinear integral equation is studied. A theorem of the existence of solutions is given in the framework of L 2 -spaces. Afterwards, an iterative method for the resolution of this kind of equations is considered, and the convergence of this algorithm towards a solution of the equation is proved. The rest of the paper considers two modifications of the algorithm. The first one is devoted to the sought of common fixed points of a family of nearly asymptotically nonexpansive mappings. The second variant focuses on the search of common fixed points of a finite number of nonexpansive operators. The characteristics of convergence of these methods are studied in the context of uniformly convex Banach spaces. The iterative scheme is applied to approach the common solution of three nonlinear integral equations of Hammerstein type.

1. Introduction

A. Hammerstein introduced, in the reference [1], a new type of nonlinear integral equation, given by the expression:
f ( x ) + a b k ( x , y ) ψ ( y , f ( y ) ) d y = 0 ,
for x [ a , b ] and k ( x , y ) and ψ ( x , y ) given functions. Equations of this kind appear in a great number of fields of physics, especially in electro-magnetic fluid dynamics. Similar to almost every integral equation, it can be reformulated in terms of a problem of ordinary or partial differential equations.
Hammerstein considered as hypotheses that the operator associated to k is symmetric and positive, and ψ is such that
| ψ ( x , y ) | C 1 | y | + C 2 ,
where C 1 , C 2 0 . He proved that, if C 1 < λ , where λ is the first eigenvalue of the kernel, and k and ψ are continuous functions, then the equation has a continuous solution. If, in addition, the mapping ψ ( x , · ) is non-decreasing for any x ( a , b ) , the solution is unique. Brézis and Browder gave in the reference [2] sufficient conditions for the existence and uniqueness of solution of Hammerstein equations in L p -spaces. For instance, they proved that, if k ( x , y ) and ψ ( x , y ) are such that
  • ψ ( x , y ) is continuous in y for almost all x, and measurable in x for any fixed y,
  • ψ ( x , · ) is nondecreasing for any fixed x,
  • ψ ( · , y ) L 1 ( Ω ) for any fixed y, and
  • the linear integral operator associated with k ( x , y ) is bounded from L 1 ( Ω ) into L ( Ω ) and positive,
then the equation
f ( x ) + a b k ( x , y ) ψ ( y , f ( y ) ) d y = h ( x )
has a unique solution f L ( Ω ) for each h L ( Ω ) , and f varies continuously with h.
The numerical resolution of integral equations can be approached in very different ways [3]. A standard procedure is the collocation method (see, for instance, [4]). More recent articles about Hammerstein equations are, among many others, the references [5,6].
In the first part of this article, a special type of Hammerstein nonlinear equation is studied. A theorem of existence of solutions is given, in the framework of L 2 -spaces. The solution may not be unique. Afterwards, an iterative method for the resolution of this kind of equations is considered. The procedure was introduced in the reference [7]. The convergence of this algorithm towards a solution of the equation is proved in the same theorem. The method is illustrated with an example, giving a table of mean-square successive distances between iterations. A figure displays the first approximate solutions provided by the algorithm.
In Section 3, a modification of the algorithm is studied, for the sought of common fixed points of a family of nearly asymptotically nonexpansive mappings (see, for instance, [8]). The approximations properties of this iterative method are studied, and sufficient conditions on the underlying space and the mappings to ensure its convergence are given.
In a previous paper [9], the problem of approximating a common fixed point of two mappings was treated, and an algorithm for the search of common critical points of a finite number m of nonexpansive maps was suggested. However, the properties of approximation and convergence were only studied for m = 2 . In Section 4, the case where m > 2 is analyzed, generalizing the results given for two maps. The iterative method is applied to find the common solution of three nonlinear integral equations of the Hammerstein type. Since the system has an exact solution, a table of approximation errors with respect to the real solution is given.

2. Solution of a Type of Nonlinear Hammerstein Integral Equation

We consider in this section the approximation of a solution of an integral equation of the Hammerstein type [1]. This kind of nonlinear equations are given, in general, by
f ( x ) = g ( x ) + Ω k ( x , y ) ψ ( y , f ( y ) ) d y ,
where Ω is a closed subset of R n and g , k, and ψ are given functions. In the particular case where ψ ( y , f ( y ) ) = f ( y ) , we obtain an integral equation of the Fredholm type. Thus, Hammerstein equations are nonlinear generalizations of the Fredholm integral equations of the second kind. The following result can be consulted in the reference ([10], Lemma 4.2.8).
Lemma 1.
Let J be a compact real interval, let k : J × J C and ψ : J × C C be continuous functions, and assume that there are real numbers p 1 , α , β 0 such that
| ψ ( x , z ) | α + β | z | p ,
for x J and z C . Then the Hammerstein operator
A f ( x ) : = J k ( x , y ) ψ ( y , f ( y ) ) d y ,
is a continuous operator mapping L p ( J ) into itself.
Let us consider the space L 2 ( Ω ) . Equation (1) can be written as f = g + K Ψ f , where K is the linear operator given by K h ( x ) = Ω k ( x , y ) h ( y ) d y , and Ψ is defined by Ψ ( f ) ( y ) = ψ ( y , f ( y ) ) . The solution of the Hammerstein equation is a fixed point of the operator of L 2 ( Ω ) :
H f : = g + K Ψ f .
Let us assume that Ψ is nonexpansive with respect to the 2-norm, and | | K | | = | | k | | 2 1 . Then H is nonexpansive, since
| | H f H f | | 2 | | K Ψ f K Ψ f | | 2 | | f f | | 2 .
In the reference [7], we proposed an iterative method, called the N-algorithm, to approach a fixed point of an operator A : C C , where C is a nonempty, closed, and convex subset of a normed space V. It is given by the following iterative scheme:
w n = ( 1 c n ) u n + c n A u n ,
v n = ( 1 b n ) u n + b n w n ,
u n + 1 = ( 1 a n ) v n + a n A v n ,
for a n , b n , c n [ 0 , 1 ] , n 0 , and u 0 C . For a n = 0 and b n = 1 for all n, one obtains the Krasnoselskii–Mann iteration ([11,12]):
u n + 1 = ( 1 c n ) u n + c n A u n .
Hence the N-algorithm can be considered a generalization of this classical method.
We proved that the sequence ( u n ) generated by the procedure is such that the sequence ( | | u n u * | | ) is convergent for any fixed point u * of A (see Proposition 4.1 of [7]).
If V is a uniformly convex Banach space and the coefficients of iterative scheme are such that 0 < inf a n sup a n < 1 and 0 < inf c n sup c n < 1 , then the sequence ( | | u n A u n | | ) tends to zero (see Theorem 4.3 of [7]).
In the following, we give some sufficient conditions for the existence of solution of Equation (1), as well as the convergence of the N-algorithm to a fixed point of the operator A defined in (2). We recall two previous definitions (see, for instance, the reference [13]).
Definition 1.
Let V be a normed space. A linear mapping A : V V is compact if for any bounded sequence ( v ¯ n ) A there is a subsequence ( v ¯ n j ) such that ( A v ¯ n j ) is convergent.
Definition 2.
Let V be a normed space. A map A : C V V is demicompact if any bounded sequence ( v ¯ n ) such that ( A v ¯ n v ¯ n ) is convergent has a convergent subsequence ( v ¯ n j ).
Theorem 1.
Consider Ω = [ 0 , 1 ] and the operator A : L 2 ( Ω ) L 2 ( Ω ) defined in (2). Let us assume that k : Ω × Ω R and ψ : Ω × R R are continuous functions such that 0 k ( x , y ) 1 ,   0 ψ ( y , z ) min { α + β | z | 2 , 1 } , and α , β 0 , and consider that ψ is nonexpansive in the second variable, which is to say,
| ψ ( y , z ) ψ ( y , z ) | | z z | ,
for any y Ω and z , z R . Then the equation
f ( x ) = Ω k ( x , y ) ψ ( y , f ( y ) ) d y ,
has at least one solution f L 2 ( Ω ) , such that | | f | | 2 1 .
For any u 0 B ¯ ( f 0 , 1 ) , where B ¯ ( f 0 , 1 ) is the closed ball in L 2 ( Ω ) with the center in the null function f 0 and the radius 1, the N-algorithm converges to a solution of the Equation (7) considering coefficients such that 0 < inf n a n sup n a n < 1 and 0 < inf n c n sup n c n < 1 .
Proof. 
Let us consider the operator A defined in (2). Then A = K Ψ . The inequality (6) implies that Ψ is nonexpansive. As | | k | | 2 1 , we have seen that A is also nonexpansive. Since
| | A f | | 2 2 = Ω ( Ω k ( x , y ) ψ ( y , f ( y ) ) d y ) 2 d x 1 ,
A can be restricted to be A : B ¯ ( f 0 , 1 ) B ¯ ( f 0 , 1 ) . Then A is nonexpansive on a bounded, closed, and convex set, and by Browder’s Theorem ([14]) it has a fixed point. Consequently the equation
f ( x ) = Ω k ( x , y ) ψ ( y , f ( y ) ) d y
has at least one solution.
Let us see now the convergence of the N-algorithm: It is well known that the operator K defined as K h ( x ) = Ω k ( x , y ) h ( y ) d y , is nonexpansive and compact if | | k | | 2 1 . Let us check that the restriction of A = K Ψ to B ¯ ( f 0 , 1 ) is demicompact:
Let ( v ¯ n ) B ¯ ( f 0 , 1 ) be such that ( A v ¯ n v ¯ n ) is convergent. Then
| | Ψ ( v ¯ n ) | | 2 2 = Ω ψ ( y , v ¯ n ( y ) ) 2 d y 1
and ( Ψ v ¯ n ) is also bounded. Since K is compact, there is a convergent subsequence ( A v ¯ n j ) = ( ( K Ψ ) v ¯ n j ). Then
v ¯ n j = ( v ¯ n j A v ¯ n j ) + A v ¯ n j
is convergent and consequently A is demicompact.
The sequence ( u n ) generated by the N-algorithm, with the scalars described, to find a fixed point of A is such that ( A u n u n ) tends to zero (see Theorem 4.3 of [7]) and ( u n ) is bounded. The demicompactness of A implies that there is a convergent subsequence ( u m k ). Let f = lim k u m k .
The hypotheses on ψ and Lemma 1 imply that A is continuous. On the other hand, ( ( I d A ) u m k ) tends to zero, and f is a fixed point of A , which is to say, a solution of the Equation (7). Since ( | | u n v * | | ) is convergent for any fixed point v * of A (Proposition 4.1 of [7]), the sequence ( u n ) tends to f, and the N-method converges strongly to a solution f .
Example 1.
Let us consider the Hammerstein equation
f ( x ) = 0 1 k ( x , y ) ( α + β sin 2 ( f ( y ) ) ) d y ,
where k : [ 0 , 1 ] × [ 0 , 1 ] R is continuous and 0 k ( x , y ) 1 . Here ψ ( z ) = α + β sin 2 ( z ) α + β z 2 , where α , β 0 and α + β 1 . It is easy to see that Ψ is nonexpansive since | sin 2 ( z ) sin 2 ( z ) | | z z | . According to Theorem 1, Equation (8) has a solution.
To perform the algorithm, we chose k ( x , y ) = ( x 2 + y 2 ) / 2 , and α = β = 1 / 2 . The scheme used to approach a solution of this equation according to the N-method has been
w n ( x ) = ( u n ( x ) + 1 4 0 1 ( x 2 + y 2 ) ( 1 + sin 2 ( u n ( y ) ) d y ) / 2 ,
v n ( x ) = ( u n ( x ) + w n ( x ) ) / 2 ,
u n + 1 = ( v n ( x ) + 1 4 0 1 ( x 2 + y 2 ) ( 1 + sin 2 ( v n ( y ) ) d y ) / 2 .
Table 1 collects the distances between 10 successive approximations of the solution: E n = | | u n u n 1 | | 2 , n = 1 , 2 , , 10 , starting from the function u 0 ( x ) = x .
Figure 1 represents the graphs of the approximations of a solution given by the N-iteration, from u 0 ( x ) to u 5 ( x ) .

3. A Modified Algorithm for the Search of Common Fixed Points of Nearly Asymptotically Nonexpansive Mappings

In this section, we analyze an algorithm to find iteratively common fixed points of nearly asymptotically nonexpansive mappings, in case of their existence.
All throughout this section, we assume a normed space ( V , | | · | | ) and a nonempty subset C V .
Definition 3.
A mapping U : C V is nearly asymptotically nonexpansive if there are positive sequences ( k n ) , where k n 1 , lim n k n = 1 , and ( d n ) , where lim n d n = 0 fulfills the inequality
| | U n u U n v | | k n | | u v | | + d n ,
for any u , v V and n N . For d n = 0 , for all n, we obtain an asymptotically nonexpansive map. If additionally k n = 1 for all n, then U is nonexpansive.
The structure of the set of fixed points of a nearly asymptotically nonexpansive map was studied in the reference [8].
The objective of the iterative scheme to find a common fixed point of a family { T i } i = 1 m , T i : C C , where C is convex and closed, is to define an approximation sequence ( u n ) through the following process: u n 1 = u n and
u n 2 = ( 1 c n 1 ) u n 1 + c n 1 T 1 n u n 1 ,
u n 3 = ( 1 c n 2 ) u n 2 + c n 2 T 2 n u n 2 ,
u n i = ( 1 c n i 1 ) u n i 1 + c n i 1 T i 1 n u n i 1 ,
u n + 1 = u n m + 1 = ( 1 c n m ) u n m + c n m T m n u n m ,
for u 0 C and 0 c n i 1 , for n 0 and i = 1 , 2 , , m . The iteration will be called modified common m-steps N-iteration.
All throughout this section, we consider a family of nearly asymptotically nonexpansive mappings { T i } i = 1 m defined on a nonempty, closed, and convex set C , T i : C C such that
| | T i n u T i n v | | k n i | | u v | | + d n i ,
where k n i and d n i are positive and satisfy the properties described in Definition 3. The superindex i is not a power but a counter.
F T i will denote the set of fixed points of T i .
We will consider that the sets of fixed points are such that i = 1 m F T i .
Definition 4.
The sequence ( v n ) C has the common limit existence property (CLE property) if lim n | | v n u * | | = p R for any u * i = 1 m F T i .
The sequence ( v n ) C has the approximation fixed point property (AF property) with respect to T i if lim n | | v n T i v n | | = 0 (in this case, the existence of a fixed point of T i is not required).
The next result can be consulted in the reference [15], Lemma 2.5.
Lemma 2.
Let ( α n ) , ( β n ) and ( γ n ) be sequences such that β n 1 and
α n + 1 β n α n + γ n
for n N . If n = 1 ( β n 1 ) < and n = 1 γ n < , then the sequence ( α n ) is convergent.
Theorem 2.
Let V be a Banach space, and let C V be nonempty, closed, and convex. Let us consider a family of nearly asymptotically nonexpansive maps { T i } i = 1 m such that i = 1 m F T i with constants k n i and d n i satisfying Definition 3 for i = 1 , , m . Let us consider
β n = j = 1 m k n j
and
γ n = ( j = 2 m k n j ) d n 1 + ( j = 3 m k n j ) d n 2 + + ( j = m 1 m k n j ) d n m 2 + k n m d n m 1 + d n m ,
and assume that n = 1 ( β n 1 ) < and n = 1 γ n < , then ( u n ) has the CLE property.
Proof. 
Let u * = i = 1 m F T i . Then, applying the first step of the algorithm and the bounds of c n 1 , we have
| | u n 2 u * | | ( 1 + c n 1 ( k n 1 1 ) ) | | u n 1 u * | | + c n 1 d n 1 k n 1 | | u n 1 u * | | + d n 1 .
For the second step of the algorithm, we have
| | u n 3 u * | | k n 2 | | u n 2 u * | | + d n 2 k n 2 k n 1 | | u n 1 u * | | + k n 2 d n 1 + d n 2 .
Similarly,
| | u n 4 u * | | ( j = 1 3 k n j ) | | u n 1 u * | | + ( j = 2 3 k n j ) d n 1 + k n 3 d n 2 + d n 3 .
In general,
| | u n i u * | | β n i | | u n 1 u * | | + γ n i ,
for i = 3 , m , where
β n i : = j = 1 i 1 k n j ,
γ n i : = ( j = 2 i 1 k n j ) d n 1 + ( j = 3 i 1 k n j ) d n 2 + + ( j = i 2 i 1 k n j ) d n i 3 + k n i 1 d n i 2 + d n i 1 .
The last step of the procedure provides
| | u n + 1 u * | | = | | u n + 1 1 u * | | = | | u n m + 1 u * | | β n | | u n u * | | + γ n ,
where
β n : = j = 1 m k n j
and
γ n : = ( j = 2 m k n j ) d n 1 + ( j = 3 m k n j ) d n 2 + + ( j = m 1 m k n j ) d n m 2 + k n m d n m 1 + d n m .
If n = 1 ( β n 1 ) < and n = 1 γ n < , according to Lemma 2, the sequence ( | | u n u * | | ) is convergent, and ( u n ) has the CLE property. □
Definition 5.
Let V be a normed space and C X . A mapping N : C X is asymptotically regular if
lim n | | N n + 1 u N n u | | = 0 ,
for any u C .
The next result can be consulted in the reference [16].
Lemma 3.
Let V be a uniformly convex Banach space, and a sequence ( γ n ) V be such that there is an a , b R satisfying the condition 0 < a inf { γ n } sup { γ n } b < 1 . Let ( u n ) , ( v n ) be sequences in V such that lim sup n | | u n | | p , lim sup n | | v n | | p , and lim sup n | | γ n u n + ( 1 γ n ) v n | | = p for some p 0 . Then lim n | | u n v n | | = 0 .
Theorem 3.
Let V be a uniformly convex Banach space, and let C be a subset of V that is convex and closed. Let { T i } i = 1 m be a family of nearly asymptotically nonexpansive operators, and let T i : C C be such that i = 1 m F T i . Let us assume that β n and γ n defined in (24) and (25), respectively, are such that n = 1 ( β n 1 ) < and n = 1 γ n < . Let ( u n ) be the modified common m-steps N-iteration for u 0 C , where the scalars are chosen such that
0 < inf n c n i sup n c n i < 1 ,
for i = 1 , 2 , , m . Then
1.
the map N defined as N u n = u n + 1 is asymptotically regular, and,
2.
if additionally T 1 is uniformly continuous, the sequence ( u n ) has the AF property with respect to T 1 .
Proof. 
We first note that β n i and γ n i defined in (22) and (23), respectively, are such that lim n β n i = 1 and lim n γ n i = 0 , due to the conditions on k n i and d n i . These limits hold for i = 1 , 2 , , m .
Theorem 2 implies that, for u * i = 1 m F T i ,
p = lim n | | u n + 1 u * | | = lim n | | ( 1 c n m ) ( u n m u * ) + c n m ( T m n u n m u * ) | | .
Since, by (21),
lim sup n | | u n m u * | | lim sup n β n m | | u n u * | | + γ n m = p
and, due to the nearly asymptotic nonexpansiveness of T m ,
lim sup n | | T m n u n m u * | | lim sup n k n m | | u n m u * | | + d n m p ,
applying Lemma 3, we obtain the following:
lim n | | u n m T m n u n m | | = 0 .
Moreover,
| | u n + 1 u * | | | | u n m u * | | + c n m | | T m n u n m u n m | |
Therefore,
p lim inf n | | u n m u * | | ,
and lim n | | u n m u * | | = p . Now
p = lim n | | u n m u * | | = lim n | | ( 1 c n m 1 ) ( u n m 1 u * ) + c n m 1 ( T m 1 n u n m 1 u * ) | | .
lim sup n | | u n m 1 u * | | lim sup n ( β n m 1 | | u n u * | | + γ n m 1 ) = p
and
lim sup n | | T m 1 n u n m 1 u * | | lim sup n ( k n m 1 | | u n m 1 u * | | + d n m 1 ) p .
Applying Lemma 3, we obtain the following:
lim n | | u n m 1 T m 1 n u n m 1 | | = 0 .
Iteratively, we obtain that
lim n | | u n i T i n u n i | | = 0 ,
for i = 1 , 2 , , m .
Let us check now the asymptotical regularity of N defined as N u n = u n + 1 .
| | N n + 1 u 0 N n u 0 | | = | | u n + 1 u n | | | | u n + 1 u n m | | + | | u n m u n m 1 | | + + | | u n 2 u n 1 | | .
According to the algorithm and (29),
| | u n + 1 u n m | | = c n m | | u n m T m n u n m | | 0 ,
| | u n m u n m 1 | | = c n m 1 | | u n m 1 T m 1 n u n m 1 | | 0 ,
etc. Consequently,
| | N n + 1 u 0 N n u 0 | | 0 ,
and N is asymptotically regular. We see now that ( u n 1 ) = ( u n ) has the AF property with respect to T 1 .
| | u n 1 T 1 u n 1 | |
| | u n 1 u n + 1 1 | | + | | u n + 1 1 T 1 n + 1 u n + 1 1 | | + | | T 1 n + 1 u n + 1 1 T 1 n + 1 u n 1 | | + | | T 1 n + 1 u n 1 T 1 u n 1 | | .
The first term tends to zero due to the asymptotic regularity of N. The limit of the second term is also null due to (29). The definition of nearly asymptotic nonexpansiveness of T 1 implies that
| | T 1 n + 1 u n + 1 1 T 1 n + 1 u n 1 | | k n + 1 1 | | u n 1 u n + 1 1 | | + d n + 1 1 0 .
The last term converges to zero due to the uniform continuity of T 1 and (29) for i = 1 . Consequently,
lim n | | u n T 1 u n | | = lim n | | u n 1 T 1 u n 1 | | = 0 ,
and ( u n ) has the AF property with respect to T 1 .
In the following, we give some results of convergence of the modified common algorithm for nearly asymptotically nonexpansive mappings. They are based on the approximation properties given by Theorems 2 and 3. We will assume a family of nearly asymptotically nonexpansive mappings ( T i ) i = 1 m such that T i : C C and i = 1 m F T i .
Theorem 4.
Let V be a uniformly convex Banach space, and C V , C , be compact and convex. Let { T i } i = 1 m be a set of uniformly continuous nearly asymptotically nonexpansive mappings with constants k n i and d n i such that
β n = j = 1 m k n j
and
γ n = ( j = 2 m k n j ) d n 1 + ( j = 3 m k n j ) d n 2 + + ( j = m 1 m k n j ) d n m 2 + k n m d n m 1 + d n m .
are such that n = 1 ( β n 1 ) < and n = 1 γ n < . Then the modified common algorithm with the scalars chosen such that 0 < inf n c n i sup n c n i < 1 converges strongly to a common fixed point of { T i } i = 1 m .
Proof. 
The sequence ( u n ) is obviously bounded. Since C is compact, there is a convergent subsequence ( u m i ) . Let lim i u m i = u * . The AF property of ( u n ) with respect to T 1 (Theorem 3) implies that lim i | | u m i T 1 u m i | | = 0 . Since T 1 is continuous, ( I d T 1 ) u m i ( u * T 1 u * ) = 0 , and u * F T 1 . The CLE property of ( u n ) implies that lim n u n = u * . Let us see now that u * is a common fixed point.
Using the first step of the algorithm and the properties of T 1 ,
| | u n 2 u * | | = | | ( 1 c n 1 ) ( u n 1 u * ) + c n 1 ( T 1 n u n 1 u * ) | | ,
so
| | u n 2 u * | | ( 1 c n 1 ) | | u n u * | | + c n 1 ( k n 1 | | u n u * | | + d n 1 ) ,
and | | u n 2 u * | | 0 . Iteratively we find that
| | u n i u * | | 0 ,
for all i = 1 , 2 , , m . Using the arguments given at the end of the last theorem, the uniform continuity of T i implies that | | u n i T i u n i | | tends to zero and consequently ( u n i ) has the AF property with respect to T i . Since lim n u n i = u * and T i is continuous, ( I d T i ) u * = 0 for all i and thus u * i = 1 m F T i . Therefore, the iteration ( u n ) converges strongly to a common fixed point. □
Corollary 1.
Let V be a uniformly convex Banach space, and let C V ,   C , be compact and convex. Let { T i } i = 1 m be a set of asymptotically nonexpansive mappings where β n = i = 1 m k n i is such that n = 1 ( β n 1 ) < . Then the modified common algorithm with the scalars chosen such that 0 < inf n c n i sup n c n i < 1 converges to a common fixed point of { T i } i = 1 m .
Proof. 
Asymptotically nonexpansive mappings are nearly asymptotically nonexpansive mappings with d n i = 0 , and they are uniformly continuous. Therefore, the result is a consequence of the last theorem. □

4. An Iterative Method for the Search of Common Fixed Points of a Finite Number of Quasi-Nonexpansive Operators

For nonexpansive maps, the algorithm studied in the last section may be applicable, since these mappings are nearly asymptotically nonexpansive. However, its implementation is expensive due to the great number of evaluations of the maps required. In the reference [9], we analyzed the properties of an algorithm for the search of common fixed points of two nonexpansive mappings and its application to the approximation of fixed points of fractal convolutions of operators (for the latter concept, see the reference [17]). We proposed also an iterative scheme for finding a common fixed point of a finite collection of mappings T 1 , T 2 , , T m . However, the approximation and convergence properties of the algorithm were only studied for m = 2 . In this section, we consider the general case m 2 .
The algorithm requires the structure of a normed space V. We will assume that i = 1 m F T i and the maps T i are quasi-nonexpansive for i = 1 , 2 , m , which is to say, satisfying the inequality
| | T i u u * | | | | u u * | | ,
for any u in the domain of T i and u * F T i , where F T i denotes the set of fixed points of T i as usual. We will assume T i : C V C , where C is a convex and closed subset.
The algorithm defines a sequence of approximations u n : = u n 1 , for n = 1 , 2 , beginning from u 0 : = u 0 1 C . The scheme proposed is the following:
u n 2 = ( 1 c n 1 ) u n 1 + c n 1 T 1 u n 1 ,
u n 3 = ( 1 c n 2 ) u n 2 + c n 2 T 2 u n 2 ,
u n i = ( 1 c n i 1 ) u n i 1 + c n i 1 T i 1 u n i 1 ,
u n m = ( 1 c n m 1 ) u n m 1 + c n m 1 T m 1 u n m 1 ,
u n + 1 1 = u n m + 1 = ( 1 c n m ) u n m + c n m T m u n m ,
where 0 c n i 1 for i = 1 , 2 , , m and n 0 .
Proposition 1.
The sequence ( u n ) generated by the m-steps common fixed point algorithm has the CLE property and, for any u * i = 1 m F T i ,
| | u n m u * | | | | u n m 1 u * | | | | u n 1 u * | | = | | u n u * | | ,
for n N .
Proof. 
Let u * i = 1 m F T i . The quasi-nonexpansiveness of T 1 implies that
| | u n 2 u * | | ( 1 c n 1 ) | | u n 1 u * | | + c n 1 | | u n 1 u * | | | | u n 1 u * | | .
In the same way, we obtain
| | u n 3 u * | | | | u n 2 u * | | | | u n 1 u * | |
and, in general,
| | u n m u * | | | | u n m 1 u * | | | | u n 1 u * | | = | | u n u * | | .
Using the last step of the algorithm,
| | u n + 1 u * | | = | | u n + 1 1 u * | | | | u n m u * | | | | u n u * | | .
Consequently, ( | | u n u * | | ) is bounded and decreasing, and it has a limit. □
Theorem 5.
If V is a uniformly convex Banach space and 0 < inf n c n i sup n c n i < 1 for all i = 1 , 2 , m , then the following holds:
1.
The sequence ( u n i ) has the CLE property for any i = 1 , 2 , m .
2.
The sequence ( u n i ) has the AF property with respect to T i for any i = 1 , 2 , m .
Proof. 
In Proposition 1, we have proved that ( u n ) has the CLE property, which is to say, there is a p = lim n | | u n u * | | . Then
p = lim n | | u n + 1 u * | | = lim n | | ( 1 c n m ) ( u n m u * ) + c n m ( T m u n m u * ) | | .
Bearing in mind (40),
lim sup n | | u n m u * | | lim sup n | | u n u * | | = p .
The quasi-nonexpansiveness of T m implies that
lim sup n | | T m u n m u * | | lim sup n | | u n m u * | | p .
As a consequence, Lemma 3 implies that
lim n | | u n m T m u n m | | = 0 ,
and ( u n m ) has the AF property with respect to T m . Moreover,
| | u n + 1 u * | | | | u n m u * | | + c n m | | T m u n m u n m | | .
Then, by (45),
p lim inf n | | u n m u * | | .
The inequalities (43) and (46) imply that
p = lim n | | u n m u * | | ,
and ( u n m ) has the CLE property. Then
p = lim n | | u n m u * | | = lim n | | ( 1 c n m 1 ) ( u n m 1 u * ) + c n m 1 ( T m 1 u n m 1 u * ) | | ,
and thus, by (40),
lim sup n | | T m 1 u n m 1 u * | | lim sup n | | u n m 1 u * | | lim n | | u n u * | | = p .
Using the Lemma 3,
lim n | | u n m 1 T m 1 u n m 1 | | = 0 ,
and ( u n m 1 ) has the AF property with respect to T m 1 . Considering that
| | u n m u * | | | | u n m 1 u * | | + c n m 1 | | T m 1 u n m 1 u n m 1 | | ,
by (49),
p = lim inf n | | u n m u * | | lim inf n | | u n m 1 u * | | ,
and thus p = lim n | | u n m 1 u * | | . Repeating the same argument m-times, it follows that
lim n | | u n T 1 u n | | = lim n | | u n 1 T 1 u n 1 | | = 0 .
Then ( u n i ) has the AF property with respect to T i and it has the CLE property for any i = 1 , 2 , , m .

Strong Convergence of the m-Steps Common N-Iteration

In this section, we establish some results on the convergence of the m-steps common N-iteration to a common fixed point of a collection of mappings T 1 , T 2 , , T m . We will assume that V is a uniformly convex Banach space, the maps T i : C C , where C V is nonempty, closed, and convex, are quasi-nonexpansive, and i = 1 m F T i . The symbol I d will denote the identity mapping as before.
Theorem 6.
If C is compact and T i is continuous for any i, then the m-steps common fixed point algorithm converges strongly to u * i = 1 m F T i .
Proof. 
The fact that C is compact implies that there is a convergent subsequence ( u n j 2 ) of ( u n 2 ) . Let u * = lim j u n j 2 . Since I d T 2 is continuous and ( ( I d T 2 ) u n j 2 ) tends to zero, due to the AF property of ( u n 2 ) with respect to T 2 ,   ( I d T 2 ) u * = 0 and consequently u * F T 2 . Bearing in mind that
| | u n j 3 u * | | = | | ( 1 c n j 2 ) ( u n j 2 u * ) + c n j 2 ( T 2 u n j 2 u * ) | | | | u n j 2 u * | | 0 ,
it follows that lim j u n j 3 = u * . Repeating the same argument for i = 4 , m , we find that lim j u n j m = u * and u * F T m . Now, by the last step of the algorithm,
| | u n j + 1 1 u * | | = | | ( 1 c n j m ) ( u n j m u * ) + c n j m ( T m u n j m u * ) | | | | u n j m u * | | 0 ,
and lim j u n j + 1 1 = u * . Since I d T 1 is continuous and ( ( I d T 1 ) u n j + 1 1 ) tends to zero, then u * F T 1 . Consequently, u * is a common fixed point of T i for i = 1 , 2 , , m .
The CLE property of ( u n ) implies that lim n u n = u * , and the common N-iteration converges strongly to u * .
The next type of mapping was introduced in the reference [7], Definition 3.1.
Definition 6.
Let V be a normed space. T : C V V is a nonexpansive partial contractivity if there is a ψ : R + R + with ψ ( 0 ) = 0 , such that, for any u , v C ,
| | T u T v | | | | u v | | + ψ ( min { | | u T u | | , | | v T v | | } ) .
Remark 1.
A nonexpansive map is a nonexpansive partial contractivity (taking ψ as the null function).
Corollary 2.
If C is compact and T i are continuous nonexpansive partial contractivities for i = 1 , 2 , m , the m-steps common N-iteration converges to a common fixed point.
Proof. 
If a nonexpansive partial contractivity has fixed points, then it is quasi-nonexpansive, and the result is a straightforward consequence of the previous theorem. □
Corollary 3.
If C is compact and T i are nonexpansive for i = 1 , 2 , m , the m-steps common N-iteration converges to a common fixed point.
Proof. 
A nonexpansive map with some fixed point is continuous and quasi-nonexpansive, and the result is a consequence of Theorem 6. □
The following concept may be consulted, for instance, in the reference [18].
Definition 7.
A map T : C V V is demicompact at zero if a bounded sequence ( u n ) C satisfying lim n T u n u n = 0 has a convergent subsequence.
Theorem 7.
If T i : C C , where C is nonempty, closed, and convex, is quasi-nonexpansive and continuous for i = 1 , 2 , , m , and there is a j { 1 , 2 , , m } such that T j is demicompact at zero, then the common m-steps algorithm converges strongly to a common fixed point of { T i } i = 1 m .
Proof. 
Let us rearrange the steps of the algorithm so that the demicompact at zero map T j is the new T 2 . By Theorem 5, the sequence ( | | u n 2 v * | | ) is convergent for any v * i = 1 m F T i , so ( u n 2 ) is bounded and, by the same Theorem, lim n T 2 u n 2 u n 2 = 0 . Since T 2 is demicompact, there is a convergent subsequence ( u n j 2 ) . Let lim j u n j 2 = u * .
The continuity of T 2 , along with the AF property of ( u n 2 ), implies that ( I d T 2 ) u * = 0 , and u * F T 2 . Now, by Proposition 1,
| | u n 3 u * | | | | u n 2 u * | | 0 ,
and consequently lim j u n j 3 = u * . The continuity of T 3 implies that u * F T 3 . Repeating the same argument, we have that lim j u n j m + 1 = lim j u n j + 1 1 = u * , and u * i = 1 m F T i . The CLE property of ( u n ) implies that lim n u n = lim n u n 1 = u * .
Corollary 4.
If T i : C C , where C is nonempty, closed, and convex, is a continuous nonexpansive partial contractivity for any i = 1 , 2 , , m and there is a j such that T j is demicompact at zero, then the common m-steps algorithm converges strongly to a common fixed point of { T i } i = 1 m .
Proof. 
A continuous nonexpansive partial contractivity with fixed points is quasi-nonexpansive, and the hypotheses of the previous theorem are satisfied. □
Corollary 5.
If T i : C C , where C is nonempty, closed, and convex, is a nonexpansive for any i = 1 , 2 , , m and there is a j such that T j is demicompact at zero, then the common m-steps algorithm converges strongly to a common fixed point of { T i } i = 1 m .
Proof. 
A nonexpansive map is a continuous nonexpansive partial contractivity, and this is a particular case of the previous corollary. □
Definition 8.
A map U : C V V is demiclosed if u n u (the sequence ( u n ) converges weakly to u) and U u n v imply that v = U u .
The following is a statement of demiclosedness for nonexpansive mappings. The reference [19], Theorem 10.4, may be consulted.
Theorem 8.
If V is a uniformly convex Banach space and T : C V , where C V is nonempty, closed, and convex, is nonexpansive, then I d T is demiclosed.
Definition 9.
A map U : C V V is completely continuous if u n u implies that U u n U u .
Recall that, all throughout this subsection, V is a uniformly convex Banach space, T i : C C , and i = 1 m F T i .
Proposition 2.
Let C V be nonempty, bounded, closed, and convex. If T i is nonexpansive for any i = 1 , 2 , m and there is a j { 1 , 2 , , m } such that T j is completely continuous, then the common m-steps algorithm converges strongly to a common fixed point of { T i } i = 1 m .
Proof. 
Let us rearrange the collection of maps so that T j is the new T 2 . The properties of boundedness, closedness, and convexity imply that ( u n 2 ) has a weakly convergent subsequence ( u n j 2 ) . Let u n j 2 u * . The AF property of ( u n 2 ) with respect to T 2 implies that ( | | u n j 2 T 2 u n j 2 | | ) tends to zero. Since I d T 2 is demiclosed (Theorem 8), then ( I d T 2 ) u * = 0 and u * F T 2 .
The complete continuity of T 2 implies that lim j T 2 u n j 2 = T 2 u * = u * . Then
u n j 2 = u n j 2 T 2 u n j 2 + T 2 u n j 2 u * .
The fact that
| | u n j 3 u * | | | | u n j 2 u * | | 0 ,
along with the AF property of ( u n j 3 ) and the continuity of T 3 imply that u * F T 3 .
Iteratively, we find that u n j m u * and u * F T m . Applying the last step of the algorithm, we find that
| | u n j + 1 1 u * | | | | u n j m u * | | 0 .
We know also that ( I d T 1 ) u n j + 1 1 0 and I d T 1 is demiclosed, so u * F T 1 . Consequently, u * i = 1 m F T i . The CLE property of u n = u n 1 implies that lim n u n = u * .
In the following, we give an example of an application of the common m-steps N-algorithm.
Example 2.
The next three integral equations of the Hammerstein type have a common solution at f ( x ) = x (see the references [20,21]).
f ( x ) = x 1 40 ( e 1 ) e x 4 + 1 10 0 1 e x 4 + y 4 f 3 ( y ) d y .
f ( x ) = x + 1 20 cos ( e + t ) 1 20 cos ( 1 + t ) + 1 20 0 1 sin ( x + e y ) e f ( y ) d y .
f ( x ) = x + 0.2 0.4 0 1 f ( y ) d y .
The common solution is a common fixed point of the Hammerstein operators:
T 1 u ( t ) = g 1 ( t ) + 0 1 k 1 ( s , t ) ψ 1 ( s , u ( s ) ) d s ,
T 2 u ( t ) = g 2 ( t ) + 0 1 k 2 ( s , t ) ψ 2 ( s , u ( s ) ) d s ,
T 3 u ( t ) = g 3 ( t ) + 0 1 k 3 ( s , t ) ψ 3 ( s , u ( s ) ) d s ,
where
g 1 ( t ) = t ( e 1 ) e t 4 / 40 , k 1 ( s , t ) = e s 4 + t 4 / 10 , ψ 1 ( s , u ( s ) ) = u 3 ( s ) ,
g 2 ( t ) = t + ( cos ( e + t ) cos ( 1 + t ) ) / 20 , k 2 ( s , t ) = sin ( t + e s ) / 20 , ψ 2 ( s , u ( s ) ) = e u ( s ) ,
g 3 ( t ) = t + 0.2 , k 3 ( s , t ) = 0.4 , ψ 3 ( s , u ( s ) ) = u ( s ) .
The common three steps N-iteration has been implemented, using the coefficients c n 1 = c n 2 = c n 3 = 1 / 2 . Thus, the scheme for u n = u n 1 is the following:
u n 2 = ( u n 1 + T 1 u n 1 ) / 2 ,
u n 3 = ( u n 2 + T 2 u n 2 ) / 2 ,
u n 4 = ( u n 3 + T 3 u n 3 ) / 2 .
Table 2 gathers the distances between six successive approximations of the algorithm and the solution f ( x ) = x , ( E n = | | u n f | | 2 , n = 0 , 1 , 2 , , 5 ) starting from u 0 ( x ) = 0 for any x [ 0 , 1 ] .

5. Conclusions

A particular case of Hammerstein nonlinear integral equation was studied first. Sufficient conditions for the existence of solutions in the space of square-integrable functions on an interval were given. In the reference [7], an iterative method to solve equations of any kind was proposed. This procedure was proved to be convergent, and hence suitable for the solution of the integral equation considered.
Afterwards, two different variants of the algorithm were proposed. The first one was an iterative method designed to find common fixed points of a set of nearly asymptotically nonexpansive mappings, and the second one had the same purpose, but the target was a system of nonexpansive mappings. In both cases, some theorems of strong convergence of the successive approximations provided by the algorithm to a common fixed point were proved.

Funding

This work has not received external funds.

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. Hammerstein, A. Nichtlineare integralgleichungen nebst anwendungen. Acta Math. 1930, 54, 117–176. [Google Scholar] [CrossRef]
  2. Brézis, H.; Browder, F.E. Nonlinear integral equations and systems of Hammerstein type. Adv. Math. 1975, 18, 115–147. [Google Scholar] [CrossRef]
  3. Baker, C.T.H. The Numerical Treatment of Integral Equations; Clarendon Press: Oxford, UK, 1977. [Google Scholar]
  4. Kumar, S.; Sloan, I.H. A new collocation type method for Hammerstein equations. Math. Comp. 1987, 48, 585–593. [Google Scholar] [CrossRef]
  5. Banaś, J.; Madej, J. Asymptotically stable solutions of infinite systems of quadratic Hammerstein integral equations. Symmetry 2024, 16, 107. [Google Scholar] [CrossRef]
  6. Micula, S. Iterative numerical methods for a Fredholm–Hammerstein integral equation with modified argument. Symmetry 2023, 15, 66. [Google Scholar] [CrossRef]
  7. Navascués, M.A. Approximation sequences for fixed points of non contractive operators. J. Nonl. Funct. Anal. 2024, 20, 1–13. [Google Scholar]
  8. Sahu, D.R. Fixed points of demicontinuous nearly Lipschitzian mappings in Banach spaces. Comment. Math. Univ. Carolin. 2005, 46, 652–666. [Google Scholar]
  9. 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. [Google Scholar] [CrossRef]
  10. Hutson, V.; Pym, J.S. Applications of Functional Analysis and Operator Theory; Mathematics in Science and Engineering; Academic Press: Cambridge, MA, USA, 1980; Volume 146. [Google Scholar]
  11. Krasnoselskii, M.A. Two remarks on the method of successive approximations. (Russian) Uspehi Mat. Nauk. 1955, 10-1, 123–127. [Google Scholar]
  12. Mann, W.R. Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 44, 506–510. [Google Scholar] [CrossRef]
  13. Petryshyn, W.V. Construction of fixed points of demicompact mappings in Hilbert space. J. Math. Analysis Appl. 1966, 14, 276–284. [Google Scholar] [CrossRef]
  14. 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]
  15. Osilike, M.O.; Aniagsbosor, S.C. Weak and strong convergence theorems for fixed points of asymptotically nonexpansive mappings. Math. Comput. Model. 2000, 32, 1181–1191. [Google Scholar] [CrossRef]
  16. Schu, J. Weak and strong convergence of fixed points of asymptotically nonexpansive mappings. Bull. Aust. Math. Soc. 1991, 43, 153–159. [Google Scholar] [CrossRef]
  17. Navascués, M.A.; Massopust, P. Fractal convolution: A new operation between functions. Fract. Calc. Appl. Anal. 2019, 22, 619–643. [Google Scholar] [CrossRef]
  18. Combettes, P.L.; Pennanen, T. Generalized Mann iterates for constructing fixed points in Hilbert spaces. J. Math. Anal. Appl. 2002, 275, 521–536. [Google Scholar] [CrossRef]
  19. Goebel, K.; Kirk, W.A. Topics in Metric Fixed Point Theory; Cambridge University Press: Cambridge, UK, 1990. [Google Scholar]
  20. Jerri, A.J. Introduction to Integral Equations with Applications, 2nd ed.; Wiley & Sons: Hoboken, NJ, USA, 1999. [Google Scholar]
  21. Bakoda, H.O.; Darwish, M.A. Solving Hammerstein type integral equations by new discrete Adomian decomposition methods. Math. Probl. Eng. 2013, 760515. [Google Scholar] [CrossRef]
Figure 1. Zero-th (blue), first (yellow), second (green), third (red), fourth (purple), and fifth (brown) approximation of the solution.
Figure 1. Zero-th (blue), first (yellow), second (green), third (red), fourth (purple), and fifth (brown) approximation of the solution.
Axioms 14 00214 g001
Table 1. Distances between 10 successive approximations given by the N-algorithm to find a solution of the Hammerstein integral equation.
Table 1. Distances between 10 successive approximations given by the N-algorithm to find a solution of the Hammerstein integral equation.
Iteration (n) E n = | | u n u n 1 | | 2
10.216882
20.098364
30.043072
40.018419
50.007786
60.003275
70.001375
80.000577
90.000242
100.000103
Table 2. Distances between the successive approximations (from zeroth to fifth) and the exact solution given by the common three-steps N- algorithm.
Table 2. Distances between the successive approximations (from zeroth to fifth) and the exact solution given by the common three-steps N- algorithm.
Iteration (n) E n = | | u n f | | 2
00.57735
10.056664
20.006714
30.000841
40.000108
50.000014
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. Hammerstein Nonlinear Integral Equations and Iterative Methods for the Computation of Common Fixed Points. Axioms 2025, 14, 214. https://doi.org/10.3390/axioms14030214

AMA Style

Navascués MA. Hammerstein Nonlinear Integral Equations and Iterative Methods for the Computation of Common Fixed Points. Axioms. 2025; 14(3):214. https://doi.org/10.3390/axioms14030214

Chicago/Turabian Style

Navascués, María A. 2025. "Hammerstein Nonlinear Integral Equations and Iterative Methods for the Computation of Common Fixed Points" Axioms 14, no. 3: 214. https://doi.org/10.3390/axioms14030214

APA Style

Navascués, M. A. (2025). Hammerstein Nonlinear Integral Equations and Iterative Methods for the Computation of Common Fixed Points. Axioms, 14(3), 214. https://doi.org/10.3390/axioms14030214

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