Next Article in Journal
Controllability Results for First Order Impulsive Fuzzy Differential Systems
Previous Article in Journal
PTG-PLM: Predicting Post-Translational Glycosylation and Glycation Sites Using Protein Language Models and Deep Learning
Previous Article in Special Issue
Multiplicity of Positive Solutions to Nonlocal Boundary Value Problems with Strong Singularity
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Solving Fractional Volterra–Fredholm Integro-Differential Equations via A** Iteration Method

1
Department of Mathematics, University of Uyo, Uyo P.M. Box 1017, Nigeria
2
Department of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, Durban 4041, South Africa
3
Department of Mathematics, King Abdulaziz University, Jeddah P.O. Box 80203, Saudi Arabia
4
Department of Mathematics, University of Calabar, Calabar P.M. Box 1115, Nigeria
5
Department of Mathematics, Akwa Ibom State University, Ikot Akpaden, Mkpat Enin P.M. Box 1167, Nigeria
6
Office of Research, Innovation and Commercialization, University of Management and Technology, Lahore 54770, Pakistan
*
Author to whom correspondence should be addressed.
Axioms 2022, 11(9), 470; https://doi.org/10.3390/axioms11090470
Submission received: 1 August 2022 / Revised: 26 August 2022 / Accepted: 5 September 2022 / Published: 14 September 2022
(This article belongs to the Special Issue Advances in Nonlinear Analysis and Related Fixed Point Problems)

Abstract

:
In this article, we develop a faster iteration method, called the A iteration method, for approximating the fixed points of almost contraction mappings and generalized α -nonexpansive mappings. We establish some weak and strong convergence results of the A iteration method for fixed points of generalized α -nonexpansive mappings in uniformly convex Banach spaces. We provide a numerical example to illustrate the efficiency of our new iteration method. The weak w 2 -stability result of the new iteration method is also studied. As an application of our main results, we approximate the solution of a fractional Volterra–Fredholm integro-differential equation. Our results improve and generalize several well-known results in the current literature.

1. Introduction

The fixed-point theory is important to many applied and theoretical fields, such as linear and variational inequality, nonlinear analysis, approximation theory, dynamic system theory, mathematical modelling, mathematics of fractals, mathematical economics (equilibrium problems, game theory and optimization problems), differential and integral equations. Let J be a nonempty subset of a Banach space M , N the set of all positive integers and R the set of all real numbers. The fixed point of a self-mapping H defined on J is a point g J satisfying g = H g . The set of all fixed point of H is denoted by F H = { g J : g = H g } . The mapping H is said to be nonexpansive if H g H t g t , for all g , t J and it is said to be quasi-nonexpansive if H g m g m , for all g J and m F H .
In the past few years, the fixed-point theory for nonexpansive mappings has attracted several authors as a results of their vast applications in integral equations, differential equations, convex optimization, control theory, signal processing, game theory, and many more. The first result concerning the existence of fixed points of nonexpansive mappings was given in Hilbert spaces by Browder [1]. In [2,3], Browder and Göhde independently extended the result of Browder [1] to uniformly convex Banach spaces. In [4,5], Goebel and Kirk further extended the result of Browder [1] to reflexive Banach spaces. Several extensions and generalizations of the class of nonexpansive mappings have been studied in the past two decades. One of these important generalizations of the class of nonexpansive mappings, known as Suzuki generalized nonexpansive mappings, was provided by Suzuki [6]. This class of mappings is also known as mappings satisfying the condition ( C ) . In [7], Aoyama and Kohsaka introduced the class nonexpansive-type mappings known as α -nonexpansive mappings. In [8], Pant and Shukla considered another generalized nonexpansive-type mapping called generalized α -nonexpansive mappings. The authors showed that this class of mappings is more general than the class of mappings satisfying the condition ( C ) . In [9], Pant and Pandey developed the class of Reich–Suzuki nonexpansive mappings and proved that this class of mappings is more general than the class of mappings satisfying the condition ( C ) . Furthermore, they proved some existence and fixed-point results for such mappings.
Recently, Pandy et al. [10] combined the classes of generalized α -nonexpansive mappings and Reich–Suzuki nonexpansive mappings and defined a new class of mappings as follows:
Definition 1
([10]). Let H be a self-mapping defined on a nonempty subset J of a Banach space M . Then, H is said to be a generalized α-Reich–Suzuki nonexpansive mapping if for all g , t J , there exists α [ 0 , 1 ) such that
1 2 g H g g t implies H g H t max { W ( g , t ) , T ( g , t ) } ,
where
W ( g , t ) = α g H g + α t H t + ( 1 2 α ) g t ,
and
T ( g , h ) = α g H t + α t H g + ( 1 2 α ) g t .
The Banach contraction theorem, also known contraction principle, is one of the fundamental results in metric spaces. This theorem was established in 1922 by Banach [11] and it works with the Picard iteration method for contraction mappings in a complete metric space. The Banach contraction principle guarantees the existence and uniqueness of fixed point of a given contraction mapping. It has been shown that the Picard iteration method always converges to the fixed points of some higher classes of mappings than contraction mappings even when there exist fixed points of such mappings. Thus, the Banach contraction principle has some drawbacks. Based on simplicity and better rate of convergence, many iteration methods have recently been developed by many authors to overcome the drawback in the Banach contraction principle (see [12,13,14,15,16,17,18,19,20] and the references therein).
For control sequences { a m } , { b m } and { c m } in ( 0 , 1 ) , the following iteration methods are called Mann [21], Ishikawa [14], Noor [16], S [22], Abbas [23], Thakur [20], M [24] and F [25].
g 1 J , g m + 1 = ( 1 a m ) g m + a m H g m , m N .
g 1 J , t m = ( 1 b m ) g m + b m H g m , g m + 1 = ( 1 a m ) g m + a m H t m , m N .
g 1 J , p m = ( 1 c m ) g m + c m H g m t m = ( 1 b m ) g m + b m H p m , g m + 1 = ( 1 a m ) g m + a m H t m , m N .
g 1 J , t m = ( 1 b m ) g m + b m H g m , g m + 1 = ( 1 a m ) H g m + a m H t m , m N .
g 1 J , p m = ( 1 c m ) g m + c m H g m , t m = ( 1 b m ) H g m + b m H p m , g m + 1 = ( 1 a m ) H t m + a m H p m , m N .
g 1 J , p m = ( 1 b m ) g m + c m H g m , t m = H ( ( 1 a m ) g m + a m p m ) , g m + 1 = H t m , m N .
g 1 J , p m = ( 1 a m ) g m + a m H g m , t m = H p m , g m + 1 = H t m , m N .
g 1 J , p m = H ( ( 1 a m ) g m + a m H g m ) , t m = H p m , g m + 1 = H t m , m N .
In [25], Ali et al. showed that the F iterative method (8) converges faster than some of the above-mentioned iteration methods and several others in the literature.
Motivated by the ongoing research in this direction, we introduce a faster iteration method, called the A iteration method, as follows:
g 1 J , p m = H ( ( 1 a m ) g m + a m H g m ) , t m = H 2 p m , g m + 1 = H 2 t m , m N ,
where { a m } is a sequence in ( 0 , 1 ) . In this paper, we prove the weak and strong convergence theorems of the A iteration method for approximation of the fixed points of almost contraction mappings and generalized α -Reich–Suzuki nonexpansive mappings in Banach spaces. We provide a numerical example to show that our new iteration method (9) converges faster than the iteration methods (1)–(8). The stability results of (9) are also studied. As an application, we find the solution of a fractional Volterra–Fredholm integro-differential equation via A iteration method.

2. Preliminaries

We give some basic definitions and lemmas that will be useful in this article.
Definition 2
([9]). A Banach space M is said to be uniformly convex if for each ϵ ( 0 , 2 ] , there exists δ > 0 such that for g , t M with g 1 , t 1 and g t > ϵ , implies g + t 2 < 1 δ .
Definition 3
([24]). We say Banach M enjoys Opial’s condition if for any sequence { g m } in M which converges weakly to g M implies
lim sup m g m g < lim sup m g m t , t M with t g .
Definition 4
([19]). Let J be a nonempty closed convex subset of a Banach space M and { g m } be a bounded sequence in M . For g M , we set
r ( g , { g m } ) = lim sup m g m g .
The asymptotic radius of { g m } relative to J is defined by
r ( J , { g m } ) = inf { r ( g , { g m } ) : g J } .
The asymptotic center of { g m } relative to J is given as:
A ( J , { g m } ) = { g J : r ( g , { g m } ) = r ( J , { g m } ) } .
It is known generally that in a uniformly convex Banach A ( J , { g m } ) consists of only one element.
Definition 5
([10]). Let J be a nonempty closed convex subset of a Banach space M . A mapping H : J J is said to be demiclosed with respect to g M if for each sequence { g m } which is weakly convergent to g J and { H g m } converges strongly to t implies that H g = t .
Definition 6
([26]). A mapping H : J J is said to satisfy condition ( I ) if a nondecreasing function h : [ 0 , ) [ 0 , ) exists with h ( 0 ) = 0 and for all c > 0 , then h ( c ) > 0 with g H g h ( d ( g , F H ) ) for all g J , where d ( g , F H ) = inf g F H g g .
Lemma 1
([27]). Let M be a uniformly convex Banach space and { k m } be any sequence satisfying 0 < g k m t < 1 for all m 1 . Assume that { g m } and { t m } are any sequences of M such that
lim sup m g m y , lim sup m t m y and lim sup m k m g m + ( 1 k m ) t m = y
hold for some y 0 . Then, lim m g m t m = 0 .
Lemma 2
([10]). Let M be a Banach space and J be a nonempty subset of M . Suppose the mapping H : J J is a generalized α-Reich–Suzuki nonexpansive. Then, for all g , t J , the following condition holds:
g M t 3 + α 1 α g H g + g t .

3. Convergence Analysis

In this section, we study weak and strong convergence results for fixed points of generalized α -Reich–Suzuki nonexpansive mappings in the setting of uniformly convex Banach spaces.
Theorem 1.
Let J be a nonempty, closed and convex subset of a uniformly convex Banach space M . If H : J J is a generalized α-Reich–Suzuki nonexpansive mapping with F H and { g m } is the A iterative method defined by (9), then lim m g m g exists for each g F H .
Proof. 
Assume g F H and g J . Since H is a α -Reich–Suzuki nonexpansive mapping with F H , we have
H g H m g g .
By (9), we have
p m m = H ( ( 1 a m ) g m + a m H g m ) g ( 1 a m ) g m + a m H g m g ( 1 a m ) g m g + a m H g m g ( 1 a m ) g m g + a m g m g = g m g .
Using (9) and (11), we have
t m g = H 2 p m g = H ( H p m ) g H p m g p m g g m g .
Finally, from (9) and (12), we have
g m + 1 g = H 2 t m g = H ( H t m ) g H t m g t m g g m g .
This implies that the sequence { g m g } is nonincreasing and bounded below. Thus, lim m g m g exists for each g F H . □
Theorem 2.
Let M , J , H and { g m } be as defined in Theorem 1. Then, F H if and only if { g m } is bounded and lim m g m H g m .
Proof. 
From Theorem 1, we know that { g m } is bounded and lim m exists for any g F H .
Assume that
lim m g m m = y .
From (11) and (14), we have
lim sup m p m g lim sup m g m g = y .
Using (10) and (14), we have
lim sup m H g m g lim sup m g m g = y .
By (9), we have
g m + 1 g = H 2 t m g = H ( H t m ) g H t m g t m g = H 2 p m g = H ( H p m ) g H p m g p m g .
Therefore,
y lim inf m p m g .
By (15) and (18), we have
y = lim m p m g = lim m H ( ( 1 a m ) g m + a m H g m ) g lim m ( 1 a m ) g m + a m H g m g = lim m ( 1 a m ) ( g m g ) + a m ( H g m g ) = lim m ( ( 1 a m ) g m g + a m H g m g ) lim m ( ( 1 a m ) g m g + a m g m g ) y .
Hence,
lim m ( 1 a m ) ( g m g ) + a m ( H g m g ) = y .
Using (14), (16), (20) and Lemma 1, we obtain
lim m g m H g m = 0 .
Conversely, if { g m } is bounded and lim m g m H g m = 0 . Let g A ( J , { g m } ) , then, by Lemma 2, we have
r ( H g , { g m } ) = lim sup m g m H g 3 + ϖ 1 ϖ lim sup m g m H g m + lim sup m H g m g = lim sup m g m g = r ( g , { g m } ) .
This shows that H g A ( J , { g m } ) . Since the Banach space M is uniformly convex, we know that A ( J , { g m } ) is a set with one element and it follows that H g = g . Hence, F H . □
Theorem 3.
Let M , J , H and { g m } be as defined in Theorem 1 such that F H . Suppose that M posses the Opial’s condition, then the A iteration method { g m } converges weakly to a point in F H .
Proof. 
For F H , we have established in Theorems 1 and 2 that lim m g m g exists and lim m g m H g m = 0 . Now, we will prove that it is not possible for { g m } to have two weak subsequential limits in F H . Suppose that q and w are two weak subsequential limits of { g m i } and { g m j } , respectively. Then, by Theorem 2, we know that ( I H ) is demiclosed at 0—this implies that ( I H ) q = 0 . Thus, H q = q . By a similar argument, we can show that H w = w . Next, we show uniqueness. Assume q w , then, from Opial’s property,
lim m g m q = lim m i g m i q < lim m i g m i w = lim m g m w = lim m j g m j w < lim m j g m j q = lim m g m q ,
which is a contradiction, so q = w . Hence, { g m } converges weakly to q F H . □
We now prove some convergence theorems.
Theorem 4.
Let M , J , H and { g m } be as defined in Theorem 1 such that F H . Then, the iteration method { g m } converges to a point in F H if and only if lim inf m d ( g m , F H ) = 0 , where d ( g m , F H ) = inf { g m g : g F H } .
Proof. 
The necessity is trivial.
Now, we prove the converse. Suppose lim inf m d ( g m , F H ) = 0 and g F H . From Theorem 1, lim m g m g exists, for each g F H . It suffices to show that { g m } is Cauchy in J . Since lim m d ( g m , F H ) = 0 , then for ϵ > 0 , there exists l 0 N such that for all m l 0 ,
d ( g m , F H ) < ϵ 2 inf { g m g : g F H } < ϵ 2 .
Particularly, inf { g l 0 g : g F H } < ϵ 2 . Thus, there exists g F H such that
g l 0 g < ϵ 2 .
Let l , m l 0 —we obtain
g m + l g m g m + l g + g m g g l 0 g + g l 0 g = 2 g l 0 g < ϵ .
This shows that { g m } is Cauchy in J . By the closeness J , there must be a point v J satisfying lim m g m = v . Now, lim m d ( g m , F H ) = 0 implies that d ( v , F H ) = 0 , that is v F H . □
Theorem 5.
Let M , H and { g m } be as defined in Theorem 1 such that F H . If J is a nonempty convex compact subset of M , then the A iteration method { g m } converges strongly to a point in F H .
Proof. 
By Theorem 2, we have lim m g m H g m = 0 . Since J is compact, then we know that { g m } has a strong convergent subsequence { g m i } with a strong limit k. Using Lemma 2, we have
g m i H k 3 + α 1 α g m i H g m i + g m i k .
As i , we have g m i H k . Therefore, H k = k , i.e., k F H . By Theorem 1, lim m g m k exists. This shows that k is a strong limit for { g m } . □
Theorem 6.
Let M , H and { g m } be as defined in Theorem 1 such that F H . If J is a nonempty convex compact subset of M , then the A iteration method { g m } converges strongly to a fixed point in F H .
Proof. 
By Theorem 2, it is established that
lim m g m H g m = 0 .
From Definition 6 and (22), we obtain
0 lim m f ( d ( g m , F H ) ) lim m g m H g m = 0 f ( d ( g m , F H ) ) = 0 .
Since h : [ 0 , ) [ 0 , ) is a nondecreasing function with h ( 0 ) = 0 and h ( c ) > 0 , for all c > 0 , we obtain
lim m d ( g m , F H ) = 0 .
By the application of Theorem 4, the conclusion follows. □
In this section, we provide an example of a mapping which is generalized α -Reich–Suzuki nonexpnsive, but does not satisfy condition ( C ) . With the provided example, we will conduct an experiment to demonstrate the efficiency of our new iterative method (2) over some existing iterative methods.
Example 1.
Let M = R with the usual norm and J = [ 7 , 10 ] . Define H : J J by
H g = g + 56 8 , if g < 10 , 7 , if g = 10 ,
for all g J .
(1). 
Let g = 9 and t = 10 , then we have
1 2 g H g = 7 8 < 1 = g t .
However,
H g H h = 9 8 > 1 = g h .
Therefore, H does not satisfy condition ( C ) .
(2). 
We will now show that H is a generalized α-Reich–Suzuki nonexpansive mappings with α = 1 3 . We consider the following cases:
Case I:Let g , h < 10 , then
W ( g , t ) = α g H g + α t H t + ( 1 2 α ) g t = 1 3 g g + 56 8 + 1 3 t t + 56 8 + 1 3 | g t | = 1 3 7 g 56 8 + 1 3 7 t 56 8 + 1 3 | g t | 1 8 g t = H g H t .
Moreover,
T ( g , t ) = α g H t + α t H g + ( 1 2 α ) g t = 1 3 g t + 56 8 + 1 3 t g + 56 8 + 1 3 | g h | 1 8 g t = H g H t .
Case II:Let g < 10 and t = 10 , we have
W ( g , t ) = α g H g + α t H t + ( 1 2 α ) g t = 1 3 g g + 56 8 + 1 3 10 7 + 1 3 | g 10 | = 1 3 7 g 56 8 + 1 + 1 3 | g 10 | 1 8 g = H g H t .
Also,
T ( g , t ) = α g H t + α t H g + ( 1 2 α ) g t = 1 3 g 7 + 1 3 10 g + 56 8 + 1 3 | g 10 | = 1 3 g 7 + 1 3 24 g 8 + 1 3 | g 10 | 1 + 1 3 24 g 8 1 8 g = H g H t .
Case III:Let g = 10 and h < 10 —we obtain
W ( g , t ) = α g H g + α t H t + ( 1 2 α ) g t = 1 3 10 7 + 1 3 t t + 56 8 + 1 3 | 10 t | = 1 + 7 t 56 7 + 1 3 | 10 t | 1 8 t = H g H t .
Additionally,
T ( g , t ) = α g H t + α t H g + ( 1 2 α ) g t = 1 3 10 t + 56 8 + 1 3 t 7 + 1 3 | 10 t | = 1 3 24 t 8 + 1 3 t 7 + 1 3 | 10 t | 1 3 24 t 8 + 1 1 8 t = H g H t .
Case IV:Let g = t = 10 , we obtain
W ( g , t ) = α g H g + α t H t + ( 1 2 α ) g t 0 = H g H t .
Also,
T ( g , t ) = α g H t + α t H g + ( 1 2 α ) g t 0 = H g H t .
In all the cases above, it clear that H g H t max { W ( g , h ) , T ( g , h ) } for α = 1 3 . Hence, H is a generalized α-Reich–Suzuki nonexpansive mapping with fixed point g = 8 .
If we choose starting g 1 = 7 and control sequences a m = b m = c m = 10 11 , then the following Table 1 and Table 2 and Figure 1 and Figure 2 show that the A iteration method (9) converges faster to 8 than the Mann (1), Ishikiwa (2), Noor (3), Abbas (4), S (5), Thakur (6), M (7) and F (8) iteration methods.

4. w 2 -Stability Result

In this section, we prove the convergence and weak w 2 -stability results of A iteration method (9) with respect to almost contraction mappings. Before that, we will recall the following definitions that will serve as an important tool in achieving our results.
Definition 7
([28]). A mapping H : J J is said to be an almost contraction if there exists γ [ 0 , 1 ) and some constant L 0 , such that
H g H t γ g t + L g H g , g , t J .
Definition 8
([29]). Two sequences { g m } and { t m } are said to be equivalent if
g m t m 0 , as m .
Definition 9
([30]). Let H : J J be a self-map and for arbitrary g 1 J , let { g m } be the iterative algorithm defined by
g m + 1 = f ( H , g m ) , m 1 .
Assume that g m g as m , for all g F H and for any sequence { w m } J which is equivalent to { g m } , we have
lim m ϵ m = lim m w m + 1 f ( H , w m ) = 0 lim m w m = g ,
then we say that the iterative algorithm (10) is weak w 2 -stable with respect to H .
Now, we present our main results in this section as follows:
Theorem 7.
Let J be a nonempty closed convex subset of a Banach space M and H : J J be an almost contraction mapping. If { g m } is the sequence defined by (2), then { g m } converges to a unique fixed point of H . Moreover, { g m } is weakly w 2 -stable with respect to H .
Proof. 
First, we show that lim m g m = g F H . Using (9), we obtain
p m m = H ( ( 1 a m ) g m + a m H g m ) g γ ( 1 a m ) g m + a m H g m g γ ( ( 1 a m ) g m g + a m H g m g ) γ ( ( 1 a m ) g m g + a m γ g m g ) = γ ( 1 ( 1 γ ) a m ) g m g .
Using (9) and (25), we obtain
t m g = H 2 p m g = H ( H p m ) g γ H p m g γ 2 p m g γ 3 ( 1 ( 1 γ ) a m ) g m g .
Finally, by (9) and (26), we obtain
g m + 1 g = H 2 t m g = H ( H t m ) g γ H t m g γ 2 t m g γ 5 ( 1 ( 1 γ ) a m ) g m g .
Since 0 γ < 1 and 0 < a m < 1 , we have 1 ( 1 γ ) a m < 1 . Therefore, (27) becomes
g m + 1 g γ 5 g m g .
Inductively, we obtain
g m + 1 g γ 5 ( m + 1 ) g 0 g .
Since 0 γ < 1 , it follows that lim γ u γ = g .
Now, we will prove that { g m } is weak w 2 -stable with respect to H .
We assume that the sequence { w m } J is equivalent to sequence { g m } defined by (9). Let the sequence ϵ m R + be defined by
w 1 J , q m = H ( ( 1 a m ) w m + a m H w m ) , h m = H 2 q m , ϵ m = w m + 1 H 2 h m , m N ,
where { a m } is a sequences in (0,1).
Suppose lim m ϵ m = 0 . From (9) and (29), we set u m = ( 1 a m ) g m + a m H g m and v m = ( 1 a m ) w m + a m H w m . Noting that 0 γ < 1 and 0 < a m < 1 , implies 1 ( 1 γ ) a m < 1 , then we have
u m v m = ( 1 a m ) g m + a m H g m ( ( 1 a m ) w m + a m H w m ) ( 1 a m ) g m w m + a m H g m H w m ( 1 a m ) g m w m + a m γ g m w m + a m L g m H g m = ( 1 ( 1 γ ) a m ) g m w m + a m L g m H g m g m w m + a m L g m H g m .
Using (9), (29) and (30), we obtain
p m q m = H u m H v m γ u m v m + L u m H u m γ [ g m w m + a m L g m H g m ] + L u m H u m g m w m + a m L g m H g m + L u m H u m .
By (9), (29) and (31), we have
t m h m = H 2 p m H 2 q m = H ( H p m ) H ( H q m ) γ H p m H q m + L H p m H ( H p m ) H p m H q m + L H p m H ( H p m ) γ p m q m + L p m H p m + L H p m H ( H p m ) p m q m + L p m H p m + L H p m H ( H p m ) g m w m + a m L g m H g m + L u m H u m + L p m H p m + L H p m H ( H p m ) .
Using (9), (29) and (32), we have
w m + 1 g w m + 1 g m + 1 + g m + 1 g w m + 1 H 2 h m + H 2 h m g m + 1 + g m + 1 g = ϵ m + H ( H t m ) H ( H h m ) + g m + 1 g = ϵ m + γ H t m H h m + L H t m H ( H t m ) + g m + 1 g ϵ m + H t m H h m + L H t m H ( H t m ) + g m + 1 g ϵ m + γ t m h m + L t m H t m + L H t m H ( H t m ) + g m + 1 g ϵ m + t m h m + L t m H t m + L H t m H ( H t m ) + g m + 1 g ϵ m + g m w m + a m L g m H g m + L u m H u m + L p m H p m + L H p m H ( H p m ) + L t m H t m + L H t m H ( H t m ) + g m + 1 g .
As shown above, lim m g m g = 0 . Thus, observe that
u m H u m u m g + g H u m u m g + γ g u m = ( 1 + γ ) u m g = ( 1 + γ ) ( 1 a m ) g m + a m H g m g ( 1 + γ ) [ ( 1 a m ) g m g + a m H g m g ] ( 1 + γ ) [ ( 1 a m ) g m g + a m γ g m g ] = ( 1 + γ ) ( 1 ( 1 γ ) a m ) g m g ( 1 + γ ) g m g 0 as m .
Again, by (11), we have
H p m H ( H p m ) H p m g + g H ( H p m ) γ p m g + γ g H p m γ p m g + γ 2 g p m = γ ( 1 + γ ) p m g 0 , as m .
Similarly, we can use same approach as above to show that
H t m H ( H t m ) 0 as m .
Additionally, observe that
g m H g m g m g + g H g m g m g + γ g g m = ( 1 + γ ) g m g 0 as m .
Using the same argument above, we can show that
p m H p m = t m H t m 0 as m .
Since lim m g m g = 0 , then we know that lim m g m + 1 g = 0 . Now, from the equivalence of { g m } and { w m } , we also know that lim m g m w m = 0 .
Thus, taking the limit of both sides of (33), we have
lim m w m g = 0 .
This implies that A iterative method (9) is weakly w 2 -stable with respect to H . □

5. Application to Fractional Volterra–Fredholm Integro-Differential Equations

Fractional differential equations remain a significant tool for modeling several problems in various field of engineering and applied sciences. It is well known that fraction models are more reliable than the classical models. In fact, fractional differential equations can be applied in certain fields such as economics, physics, blood flow phenomena, image processing, aerodynamics, and so on (see [31] and the references therein). Many applications of the fractional calculus can be found in the literature [32]. Different analytical and numerical methods have been used for solving nonlinear fractional differential equations [33]. Most of the physical processes are modeled by nonlinear fractional order differential equations. Solving nonlinear fractional differential equations by analytical methods is very difficult [34]. In this article, we will use our iterative method (9) to solve a nonlinear fractional order differential equation.
Definition 10.
The fractional derivative of f ( u ) in the sense of Caputo is defined by
C D u k f ( u ) = 1 Γ ( k m ) b u f ( m ) ( ν ) ( u ν ) n k 1 d ν , ( m 1 < k < m ) ,
where k is the order of the derivation which could be real or complex number with k > 0 .
In this article, we consider the following nonlinear fractional Volterra–Fredholm integro-differential equation:
C D k g ( u ) = c ( u ) g ( u ) + r ( u ) + 0 u M 1 ( u , s ) K 1 ( g ( s ) ) d s + 0 1 M 2 ( u , s ) K 2 ( g ( s ) ) d s ,
with initial condition
z ( i ) ( 0 ) = η i , i = 0 , 1 , 2 , , m 1 .
where C D k is the Caputo fractional derivative, m 1 < k m and m N , g : G R , where G = [ 0 , 1 ] is the unknown continuous function, d : G R and M i : G × G R , are continuous functions. K i : R R , i = 1 , 2 are Lipschitz continuous functions.
Suppose the following hypotheses are performed:
(H1)
Two constants L K 1 and L K 2 exist such that for any g 1 , g 2 C ( G , R ) we have
| K 1 ( g 1 ( u ) ) K 1 ( g 1 ( u ) ) | L K 1 | g 1 g 2 |
and
| K 2 ( g 1 ( u ) ) K 2 ( g 1 ( u ) ) | L K 2 | g 1 g 2 | .
(H2)
Two functions M 1 , M 2 C ( D , R + ) exist, the set of all positive functions is continuous on D = { ( u , s ) R × R : 0 s u 1 } such that
M 1 = sup u , s [ 0 , 1 ] 0 u | M 1 ( u , s ) | d s < , M 2 = sup u , s [ 0 , 1 ] 0 u | M 2 ( u , s ) | d s < .
(H3)
The functions c , r : G R are continuous.
(H4)
c + M 1 L K 1 + M 2 L K 2 Γ ( k + 1 ) < 1 .
A function g ( G , R ) is said to be a solution of the initial value problem if it satisfies (34) and (35). For g 0 ( u ) ( G , R ) , finding the solution of (34) and (35) is equivalent to finding the solution of the following integral equation [35]:
g ( u ) = g 0 + 1 Γ ( k ) 0 u ( u t ) k 1 c ( t ) g ( t ) d t + 1 Γ ( k ) 0 u ( u t ) k 1 r ( t ) d t + 0 t M 1 ( t , τ ) K 1 ( g ( τ ) ) d τ + 0 1 M 2 ( t , τ ) K 2 ( g ( τ ) ) d τ d t ,
for each u J , and g 0 = n = 0 m 1 g n ( 0 + ) u n n ! . Under the Hypotheses ( H 1 ) ( H 4 ) , Hamoud et al. [35] prove that the problem (34) and (35) has a unique solution.
In the following Theorem, we approximate the solution of (34) and (35) via A iteration method (9).
Theorem 8.
Let M = ( G , R ) be a Banach space with the Chebyshev norm f h = max y G | f ( y ) h ( y ) | . Let { g m } be the iteration method (9) for the operator H : M M which is define by
H g ( u ) = g 0 + 1 Γ ( k ) 0 u ( u t ) k 1 c ( t ) g ( t ) d t + 1 Γ ( k ) 0 u ( u t ) k 1 r ( t ) d t + 0 t M 1 ( t , τ ) K 1 ( g ( τ ) ) d τ + 0 1 M 2 ( t , τ ) K 2 ( g ( τ ) ) d τ d t .
If Hypotheses ( H 1 ) ( H 4 ) are fulfilled, then the problem (34) and (35) has a unique solution g ( G , R ) and the A iteration method converges to g .
Proof. 
The existence of the unique solution g follows from [35]. If g ( G , R ) is a fixed point of H , then g is a solution of (34) and (35). Now, we show that the A iteration method converges to g . First, we will prove that the operator H , which is defined by (37), is an almost contraction.
Using the Hypotheses ( H 1 ) ( H 4 ) , we have
| H g ( u ) H g ( u ) | 1 Γ ( k ) 0 u ( u t ) k 1 | c ( t ) | | g ( t ) g ( t ) | + 1 Γ ( k ) 0 u ( u t ) k 1 0 t | M 1 ( t , τ ) | K 1 ( g ( τ ) ) K 1 ( g ( τ ) ) | d τ + 0 t | M 2 ( t , τ ) | K 2 ( g ( τ ) ) K 2 ( g ( τ ) ) | d τ d t c Γ ( k + 1 ) + M 1 L K 1 Γ ( k + 1 ) + + M 2 L K 2 Γ ( k + 1 ) | g ( u ) g ( u ) | = c + M 1 L K 1 + M 2 L K 2 Γ ( k + 1 ) | g ( u ) g ( u ) | .
Therefore,
H g H g c + M 1 L K 1 + M 2 L K 2 Γ ( k + 1 ) g g .
By Hypothesis ( H 4 ) , we have c + M 1 L K 1 + M 2 L K 2 Γ ( k + 1 ) < 1 . If we take γ = c + M 1 L K 1 + M 2 L K 2 Γ ( k + 1 ) . Then, for any L 0 , (38) can be written as
H g H g γ g g + L g H g .
This implies that H is an almost contraction mapping. Therefore, by Theorem 7, the A iteration method { g m } defined by (9) converges strongly to the unique solution of the problem (34) and (35). □

6. Conclusions

In this article, we have introduced a new iteration method called the A iteration method (9). We have proven several weak and strong convergence results of our new method involving the fixed points of generalized α -nonexpansive mappings. A novel numerical example has been used to show that our new iteration method enjoys a better speed of convergence than several existing iteration methods. Additionally, the convergence results of the A iteration method are also established for almost contraction mappings. We have shown that the A iteration method is weak w 2 -stable with respect to almost contraction mappings. As an application of our main results, we approximated the solution of fractional Volterra–Fredholm integro-differential equation.

Author Contributions

All the authors contributed equally in writing the paper. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The data used to support the findings of this study are included within the article.

Conflicts of Interest

The authors declare no conflict of interests.

References

  1. Browder, F.E. Fixed-point theorems for noncompact mappings in Hilbert space. Proc. Natl. Acad. Sci. USA 1965, 53, 1272–1276. [Google Scholar] [CrossRef] [PubMed]
  2. Browder, F.E. Nonexpansive nonlinear operators in Banach spaces. Proc. Natl. Acad. Sci. USA 1965, 54, 1041–1044. [Google Scholar] [CrossRef] [PubMed]
  3. Göhde, D. Zum Prinzip def Kontraktiven Abbilding. Math. Nachr. 1965, 30, 251–258. [Google Scholar] [CrossRef]
  4. Goebel, K.; Kirk, W.A. Iteration processes for nonexpansive mappings. In Topological Methods in Nonlinear Functional Analysis; Singh, S.P., Thomeier, S., Watson, B., Eds.; Contemporary Mathematics; American Mathematical Society: Providence, RI, USA, 1983; Volume 21, pp. 115–123. [Google Scholar]
  5. Goebel, K.; Kirk, W.A. Topics in Metric Fixed Point Theory; Cambridge University Press: Cambridge, UK, 1990. [Google Scholar]
  6. Suzuki, T. Fixed point theorems and convergence theorems for some generalized nonexpansive mappings. J. Math. Anal. Appl. 2008, 340, 1088–1095. [Google Scholar] [CrossRef]
  7. Aoyama, K.; Kohsaka, F. Fixed point theorem for α-nonexpansive mappings in Banach spaces. Nonlinear Anal. 2011, 74, 4387–4391. [Google Scholar] [CrossRef]
  8. Pant, D.; Shukla, R. Approximating fixed points of generalized α-nonexpansive mappings in Banach spaces. Numer. Funct. Anal. Optim. 2017, 38, 248–266. [Google Scholar] [CrossRef]
  9. Pant, R.; Pandey, R. Existence and convergence results for a class of non-expansive type mappings in hyperbolic spaces. Appl. Gen. Topol. 2019, 20, 281–295. [Google Scholar] [CrossRef]
  10. Pandey, R.; Pant, R.; Rakocevic, V.; Shukla, R. Approximating Fixed Points of a General Class of Nonexpansive Mappings in Banach Spaces with Applications. Results Math. 2019, 74, 7. [Google Scholar] [CrossRef]
  11. Banach, S. Sur les opérations dans les ensembles abstraits et leurs application aux équations intégrales. Fund. Math. 1922, 3, 133–181. [Google Scholar] [CrossRef]
  12. Hussain, A.; Hussain, N.; Ali, D. Estimation of Newly Established Iterative Scheme for Generalized Nonexpansive Mappings. J. Funct. Space 2021, 2021, 6675979. [Google Scholar] [CrossRef]
  13. Hussain, A.; Ali, D.; Karapinar, E. Stability data dependency and errors estimation for a general iteration method. Alex. Eng. J. 2021, 60, 703–710. [Google Scholar] [CrossRef]
  14. Ishikawa, S. Fixed points and iteration of a nonexpansive mapping in a Banach space. Proc. Am. Math. Soc. 1976, 59, 65–71. [Google Scholar] [CrossRef]
  15. Khan, H.S. A Picard-Man hybrid iterative process. Fixed Point Theory Appl. 2013, 2013, 1–10. [Google Scholar] [CrossRef]
  16. Noor, M.A. New approximation schemes for general variational inequalities. J. Math. Anal. Appl. 2000, 251, 217–229. [Google Scholar] [CrossRef]
  17. Ofem, A.E.; Igbokwe, D.I. A new faster four step iterative algorithm for Suzuki generalized nonexpansive mappings with an application. Adv. Theory Nonlinear Anal. Its Appl. 2021, 5, 482–506. [Google Scholar] [CrossRef]
  18. Ofem, A.E.; Işik, H.; Ali, F.; Ahmad, J. A new iterative approximation scheme for Reich–Suzuki type nonexpansive operators with an application. J. Inequal. Appl. 2022, 2022, 28. [Google Scholar] [CrossRef]
  19. Ofem, A.E.; Udofia, U.E.; Igbokwe, D.I. A robust iterative approach for solving nonlinear Volterra Delay integro-differential equations. Ural. Math. J. 2021, 7, 59–85. [Google Scholar] [CrossRef]
  20. Güsoy, F. A Picard-S iterative Scheme for Approximating Fixed Point of Weak-Contraction Mappings. Filomat 2021, 30. [Google Scholar] [CrossRef]
  21. Mann, W.R. Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 4, 506–510. [Google Scholar] [CrossRef]
  22. Agarwal, R.P.; O’Regan, D.; Sahu, D.R. Iterative construction of fixed points of nearly asymptotically nonexpansive mappings. J. Nonlinear Convex Anal. 2007, 8, 61–79. [Google Scholar]
  23. Abbas, M.; Nazir, T. A new faster iteration process applied to constrained minimization and feasibility problems. Mat. Vesnik. 2014, 66, 223–234. [Google Scholar]
  24. Ullah, K.; Arshad, M. Numerical Reckoning Fixed Points for Suzuki’s Generalized Nonexpansive Mappings via New Iteration Process. Filomat 2018, 32, 187–196. [Google Scholar] [CrossRef] [Green Version]
  25. Ali, J.; Ali, F. A new iterative scheme to approximating fixed points and the solution of a delay differential equation. J. Nonlinear Convex Anal. 2020, 21, 2151–2163. [Google Scholar]
  26. Senter, H.F.; Dotson, W.G. Approximating fixed points of nonexpansive mappings. Proc. Am. Math. Soc. 1974, 44, 375–380. [Google Scholar] [CrossRef]
  27. Schu, J. Weak and strong convergence to fixed points of asymptotically nonexpansive mappings. B. Aust. Math. Soc. 1991, 43, 153–159. [Google Scholar] [CrossRef]
  28. Berinde, V. On the approximation of fixed points of weak contractive mapping. Carpath. J. Math. 2003, 19, 7–22. [Google Scholar]
  29. Cardinali, T.; Rubbioni, P. A generalization of the Caristi fixed point theorem in metric spaces. Fixed Point Theory 2010, 11, 3–10. [Google Scholar]
  30. Timis, I. On the weak stability of Picard iteration for some contractive type mappings. Ann. Univ. Craiova Math. Comput. Sci. Ser. 2010, 37, 106–114. [Google Scholar]
  31. Marcdanov, M.J.; Sharifov, Y.A.; Aliyev, H.N. Existence and Uniqueness of Solution for Nonlinear Fractional Integro-Differential Equations with Nonlocal Boundary Conditions. Eur. J. Pure Appl. Math. 2022, 15, 726–735. [Google Scholar]
  32. Ahmad, S.; Ullah, A.; Partohaghighi, M.; Saifullah, S.; Akgul, A.; Jarad, F. Oscillatory and complex behaviour of Caputo-Fabrizio fractional order HIV-1 infection mode. Aims Math. 2022, 7, 4778–4792. [Google Scholar] [CrossRef]
  33. Rahman, M.; Arfan, M.; Shah, Z.; Alzahran, E. Evolution of fractional mathematical model for drinking under Atangana-Baleanu Caputo derivatives. Phys. Scr. 2021, 96, 115203. [Google Scholar] [CrossRef]
  34. Rahman, M.; Ahmad, S.; Arfan, M.; Akgul, A.; Jarad, F. Fractional Order Mathematical Model of Serial Killing with Different Choices of Control Strategy. Fractal Fract. 2022, 6, 162. [Google Scholar] [CrossRef]
  35. Mamoud, A.; Ghadle, K.P.; Isa, M.S.B.; Giniswamy, G. Existence and Uniqueness Theorems for Fractional Volterra-Fredholm Integro-Differential Equations. Int. J. Appl. Math. 2018, 31, 33–348. [Google Scholar]
Figure 1. Graph corresponding to Table 1.
Figure 1. Graph corresponding to Table 1.
Axioms 11 00470 g001
Figure 2. Graph corresponding to Table 2.
Figure 2. Graph corresponding to Table 2.
Axioms 11 00470 g002
Table 1. Comparison of speed of convergence of the A iteration method with some known iteration methods.
Table 1. Comparison of speed of convergence of the A iteration method with some known iteration methods.
g m MannIshikawaSM A
g 1 7.00000000007.00000000007.00000000007.00000000007.0000000000
g 2 7.79545454557.88584710747.96539256207.99680397737.9999937578
g 3 7.95816115707.98696911717.99880232527.99998978548.0000000000
g 4 7.99144205487.99851248707.99995855157.99999996748.0000000000
g 5 7.99824951127.99983019617.99999856567.99999999998.0000000000
g 6 7.99964194557.99998061647.99999995048.00000000008.0000000000
g 7 7.99992676167.99999778737.99999999838.00000000008.0000000000
g 8 7.99998501947.99999974747.99999999998.00000000008.0000000000
g 9 7.99999693587.99999997128.00000000008.00000000008.0000000000
g 10 7.99999937327.99999999678.00000000008.00000000008.0000000000
g 11 7.99999987187.99999999968.00000000008.00000000008.0000000000
g 12 7.99999997388.00000000008.00000000008.00000000008.0000000000
g 13 7.99999999468.00000000008.00000000008.00000000008.0000000000
g 14 7.99999999898.00000000008.00000000008.00000000008.0000000000
g 15 7.99999999988.00000000008.00000000008.00000000008.0000000000
g 16 8.00000000008.00000000008.00000000008.00000000008.0000000000
Table 2. Comparison of speed of convergence of the A iteration method with some known iteration methods.
Table 2. Comparison of speed of convergence of the A iteration method with some known iteration methods.
g m NoorAbbasThakurF A
g 1 7.00000000007.00000000007.00000000007.00000000007.0000000000
g 2 7.89611898957.97636293207.99567407027.99960049727.9999937578
g 3 7.98920873577.99944128907.99998128637.99999984048.0000000000
g 4 7.99887899267.99998679377.99999991907.99999999998.0000000000
g 5 7.99988354867.99999968787.99999999968.00000000008.0000000000
g 6 7.99998790297.99999999268.00000000008.00000000008.0000000000
g 7 7.99999874337.99999999988.00000000008.00000000008.0000000000
g 8 7.99999986958.00000000008.00000000008.00000000008.0000000000
g 9 7.99999998648.00000000008.00000000008.00000000008.0000000000
g 10 7.99999999868.00000000008.00000000008.00000000008.0000000000
g 11 7.99999999998.00000000008.00000000008.00000000008.0000000000
g 12 8.00000000008.00000000008.00000000008.00000000008.0000000000
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Ofem, A.E.; Hussain, A.; Joseph, O.; Udo, M.O.; Ishtiaq, U.; Al Sulami, H.; Chikwe, C.F. Solving Fractional Volterra–Fredholm Integro-Differential Equations via A** Iteration Method. Axioms 2022, 11, 470. https://doi.org/10.3390/axioms11090470

AMA Style

Ofem AE, Hussain A, Joseph O, Udo MO, Ishtiaq U, Al Sulami H, Chikwe CF. Solving Fractional Volterra–Fredholm Integro-Differential Equations via A** Iteration Method. Axioms. 2022; 11(9):470. https://doi.org/10.3390/axioms11090470

Chicago/Turabian Style

Ofem, Austine Efut, Aftab Hussain, Oboyi Joseph, Mfon Okon Udo, Umar Ishtiaq, Hamed Al Sulami, and Chukwuka Fernando Chikwe. 2022. "Solving Fractional Volterra–Fredholm Integro-Differential Equations via A** Iteration Method" Axioms 11, no. 9: 470. https://doi.org/10.3390/axioms11090470

APA Style

Ofem, A. E., Hussain, A., Joseph, O., Udo, M. O., Ishtiaq, U., Al Sulami, H., & Chikwe, C. F. (2022). Solving Fractional Volterra–Fredholm Integro-Differential Equations via A** Iteration Method. Axioms, 11(9), 470. https://doi.org/10.3390/axioms11090470

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