Next Article in Journal
The Classification and Evaluation of an Interlayer Shale Oil Reservoir Based on the Fractal Characteristics of Pore Systems: A Case Study in the HSN Area, China
Next Article in Special Issue
Monotone Positive Radial Solution of Double Index Logarithm Parabolic Equations
Previous Article in Journal
New Results on (r,k,μ)-Riemann–Liouville Fractional Operators in Complex Domain with Applications
Previous Article in Special Issue
Proposal for Use of the Fractional Derivative of Radial Functions in Interpolation Problems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On a Faster Iterative Method for Solving Fractional Delay Differential Equations in Banach Spaces

1
Department of Mathematics, University of Calabar, Calabar P.O. Box 1115, Nigeria
2
Department of Mathematics, Akwa Ibom State University, Ikot Akpaden, Mkpat Enin P.O. Box 1167, Nigeria
3
Department of Mathematics, College of Science and Humanities in Al-Kharj, Prince Sattam Bin Abdulaziz University, Al-Kharj 11942, Saudi Arabia
4
Department of Basic Engineering, Faculty of Engineering, Menoufia University, Shibin El Kom 32511, Egypt
5
School of Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, Durban 4041, South Africa
*
Authors to whom correspondence should be addressed.
Fractal Fract. 2024, 8(3), 166; https://doi.org/10.3390/fractalfract8030166
Submission received: 7 November 2023 / Revised: 19 February 2024 / Accepted: 9 March 2024 / Published: 14 March 2024

Abstract

:
In this paper, we consider a faster iterative method for approximating the fixed points of generalized α -nonexpansive mappings. We prove several weak and strong convergence theorems of the considered method in mild conditions within the control parameters. In order to validate our findings, we present some nontrivial examples of the considered mappings. Furthermore, we show that the class of mappings considered is more general than some nonexpansive-type mappings. Also, we show numerically that the method studied in our article is more efficient than several existing methods. Lastly, we use our main results to approximate the solution of a delay fractional differential equation in the Caputo sense. Our results generalize and improve many well-known existing results.
MSC:
05C07; 05C09; 05C31; 05C76; 05C99

1. Introduction

In this paper, let M , G and N denote a Banach space, a nonempty subset of M and the set of all natural numbers, respectively. The mapping L : G G is said to have a fixed point u G if L u = u . The set of all fixed points of L is denoted by F ( L ) . If there exists a constant l [ 0 , 1 ) , such that L u L v l u v for any u , v G then L is called a contraction, and it is called nonexpansive if L u L v u v for all u , v G . It is called quasi-nonexpansive if F ( L ) and L u u * u u * for all u G and u * F ( L ) .
The numerous applications of nonexpansive mappings to the solutions of problems in applied science and engineering have drawn the attention of many authors to study their basic concepts and their generalizations.
A prominent generalization of nonexpansive mappings was given in 2008 by Suzuki [1]. The author introduced a nonexpansive-type mapping known as generalized nonexpansive mappings or mappings satisfying the condition ( C ) .
Definition 1.
A mapping L : G G is said to satisfy condition ( C ) if
1 2 u L u u v L u L v u v ,
for all u , v G .
Another generalization of the class of mappings fulfilling (1) was given in 2017 by Pant and Shukla [2]. This class of mappings is known as generalized α –nonexpansive mappings.
Definition 2.
A mapping L : G G is called generalized α-nonexpansive if a constant α [ 0 , 1 ) exists and for each u , v G the following holds:
1 2 u L u u v L u G v α L u v + α L v u + ( 1 2 α ) u v .
In recent years, many authors have studied this class of mappings; see, e.g., [3,4,5,6,7,8].
One of the widely used approaches for approximating the fixed points of operators that can be nonlinear is the use of iterative methods. Many iterative methods have been introduced in the past few years. Some well-known iterative methods in the literature are given in [9,10,11,12,13].
The following iterative method is known as the Mann [14] iterative method:
u 0 G , u m + 1 = ( 1 α m ) u m + α m L u m , m N ,
where the sequence { α m } ( 0 , 1 ) .
The Ishikawa iterative method was introduced in 1974 by Ishikawa [15] to approximate the fixed points of nonexpansive mappings as follows:
u 0 G , v m = ( 1 β m ) u m + β m L u m , u m + 1 = ( 1 α m ) u m + α m L u m . m N ,
where the sequences { α m } , { β m } ( 0 , 1 ) .
In 2000, Noor [16] proposed the following three-steps iterative method, which incorporates the Mann and the two-step man (Ishikawa) iterative methods:
u 0 G , w m = ( 1 γ m ) u m + γ m L u m , v m = ( 1 β m ) u m + β m L w m , u m + 1 = ( 1 α m ) u m + α m L v m . m N ,
where the sequences { α m } , { β m } , { γ m } ( 0 , 1 ) .
A modification of the Ishikawa iterative method was given in 2007 by Agarwal et al. [17]. This method is known as the S iterative method, and it is defined as follows:
u 0 G , v m = ( 1 β m ) u m + β m L u m , u m + 1 = ( 1 α m ) L u m + α m L v m , m N ,
where the sequences { α m } , { β m } ( 0 , 1 ) . For contraction mappings, the authors proved that (6) has a better rate of convergence than the Mann iterative method.
The Picard–Mann iterative method was introduced in 2013 by Khan [18] as follows:
u 0 G , v m = ( 1 β m ) u m + α m L u m , u m + 1 = L v m , m N ,
where the sequence { α m } ( 0 , 1 ) .
In 2014, Abbas and Nazir [19] provided the following three-steps iterative method:
u 0 G , w m = ( 1 γ m ) u m + γ m L u m , v m = ( 1 β m ) L u m + β m L w m , u m + 1 = ( 1 α m ) h m + p m L u m , m N ,
where the sequences { α m } , { β m } , { γ m } ( 0 , 1 ) . The authors showed that their method has a better rate of convergence than the S iterative method.
Recently, an efficient and faster iterative method for finding the fixed points of contraction mappings was introduce by Okeke [20]; the method, which is called the Picard–Ishikawa iterative method, is as follows:
u 0 G , w m = ( 1 β m ) u m + β m L u m , v m = ( 1 α m ) u m + α m L w m , u m + 1 = L v m , m N ,
where the sequences { α m } , { β m } ( 0 , 1 ) . The author proved that (9) has a better convergence rate than most of the iterative methods defined above for contraction mappings. Now, it is natural to ask the following question:
Is it possible to approximate the fixed points of a class of mappings, such as generalized α-nonexpansive mappings, that is more general than those studied with the iterative methods (3)–(8)?
One of our aims in this article is to give an affirmative answer to the above question.
On the other hand, fractional calculus is utilized in different aspects of mathematics as a result of its several applications in modeling various physical phenomena in science and engineering. The notion of fractional calculus emanated from the fact D α ( f ( x ) ) , where α is a non-integer. Over time, various researchers, such as Euler, Riemann–Liouville, Leibniz, Wallis and Bernoulli have made a number of contributions in this research direction. Fractional calculus can be applied to several fields of sciences. For instance, fluid mechanics [21], dynamic of viscoelastic materials [22], propagation of spherical flames [23], viscoelastic materials [24] and electromagnetism [25].
In the real world, differential equations (DEs) are utilized to model many physical problems. Most of these problems are more complex and cannot be modeled by using the classical DEs [26,27,28]. In order to model these complex problems, many authors have used a new approach known as fractional differential equations (FDEs). FDEs are widely used in the mathematical modeling of real-life physical problems, and this is as a result of their several applications in real-world science and engineering problems, such as solid mechanics, economics, oscillation of earthquakes, continuum and statistical mechanics, anomalous transport, rough substrates, dynamics of interfaces between soft nanoparticles and solid mechanics, fluid-dynamic traffic models and bio–engineering and colored noise (see [29] and the references therein).
Delay differential equations (DDEs) have been applied in various aspects of science and engineering. DDEs are suitable for physical systems, depend on past data and simplify the ordinary differential equation. FDDs have been applied in different areas of mathematical modelings, such as epidemiology, population dynamics, physiology, immunology and neural networks [29].
It is important to note that there is no precise approach for finding an analytical or exact solution for every FDDE. Different techniques have been developed for solving these problems.
Motivated by the ongoing research in these directions, we prove several weak and strong convergence theorems of the Picard–Ishikawa method (9) for fixed points of generalized α -nonexpansive mappings in mild conditions within the control parameters. We present some nontrivial examples of generalized α –nonexpansive mappings. We further show that the class of generalized α –nonexpansive mappings is more general than some nonexpansive-type mappings. The efficiency of the studied method over several existing methods is tested using numerical examples. Lastly, we use our main results to solve a delay fractional differential equation in the Caputo sense. Our results generalize and improve many well-known existing results.
The article is organized as follows: In Section 2, some useful definitions and lemmas are recalled. The convergence results of the considered method and numerical examples that validate our findings are presented in Section 3. In Section 4, we consider the application of the considered algorithm in approximating the solution of a delay differential equation in the Caputo sense.

2. Preliminaries

The following definitions, lemmas and propositions will be used in obtaining our main results:
Definition 3
([30]). The Opial condition is said to be satisfied by a Banach space M if, for any sequence { u m } in M , { u m } u M implies
lim sup m u m u < lim sup m u m v , v M with v u .
Definition 4
([30]). If M is a Banach space, such that for each ϵ ( 0 , 2 ] there exists δ > 0 with u , v M satisfying u 1 , v 1 and u v > ϵ such that we have u + v 2 < 1 δ , then we say that M is uniformly convex.
Lemma 1
([30]). Let { μ m } be any sequence that satisfies 0 < u μ m v < 1 for all m 1 and { u m } and let { v m } be any sequences in a uniformly convex Banach space M , such that
lim sup m u m w , lim sup m v m w and lim sup m μ m u m + ( 1 μ m ) v m = w
hold for some w 0 . Then, lim m u m v m = 0 .
Let M be a Banach space and G be a nonempty closed convex subset of M . Let { u m } be a bounded sequence in M . For u M , we set
r ( u , { u m } ) = lim sup m u m u .
The asymptotic radius of { u m } relative to G is defined by
r ( G , { u m } ) = inf { r ( u , { u m } ) : u G } .
The asymptotic center of { u m } relative to G is given as:
A ( G , { u m } ) = { u G : r ( u , { u m } ) = r ( G , { u m } ) } .
It is well known that A ( G , { u m } ) consists of exactly one point in a uniformly convex Banach space.
Let L : G G be a nonlinear operator, such that F ( L ) . Then, I L is called demiclosed at zero if for any u m G the following implication holds:
u m u and ( I L ) u m 0 u F ( L ) .
Lemma 2
([31]). Let { ϕ m } and { σ m } be sequences in [ 0 , ) , such that:
ϕ m + 1 ( 1 λ m ) ϕ m + λ m σ m ,
where λ m ( 0 , 1 ) for all m N , m = 0 λ m = and σ m 0 for all m N ; then,
0 lim sup m ϕ m lim sup m σ m .
Definition 5
([32]). The condition ( I ) is said to be satisfied by a self-mapping L defined on G if a nondecreasing function g : [ 0 , ) [ 0 , ) exists with g ( 0 ) = 0 , and if g ( s ) > 0 for all s > 0 , such that u L u g ( d ( u , F ( L ) ) ) for all u G , where d ( u , F ( L ) ) = inf u * F ( L ) u u * .
Proposition 1
([2]). Let M be a Banach space and G be a nonempty subset of M if L is any self map. Then:
(i) 
If L fulfills condition (C) then L satisfies (2).
(ii) 
If L satisfies (2), such that F ( L ) , then L is quasi-nonexpansive.
(iii) 
If L satisfies (2) then F ( L ) is closed. Moreover, if M is strictly convex and G is convex then F ( L ) is also convex.
(iv) 
If L satisfies (2) then we obtain
u L v 3 + α 1 α u L u + u v , u , v G .
Definition 6
([33]). The Caputo fractional order derivation of a continuous function F in the closed interval [ a , b ] is defined by
( D a + q c F ) ( s ) = 1 Γ ( k q ) a s ( s t ) k q 1 F ( k ) ( t ) d t ,
where k = [ q ] + 1 .

3. Weak and Strong Convergence Theorems

In this part of the article, several weak and strong convergence theorems will be stated and proved using the Picard–Ishikawa iterative method (9) for mappings satisfying (2). Furthermore, we provide some novel numerical examples. One of the provided examples will be used to compare the computational efficiency of (9) with some well-known iterative methods in the literature.
Theorem 1.
Let G be a closed, convex and nonempty subset of a Banach space M . Let L : G G be a generalized α-Reich–Suzuki nonexpansive mapping. If { u m } is the sequence defined by (9) then lim m u m u * exists for all u * F ( L ) .
Proof. 
Assume that u * F ( L ) ; then, by Proposition 1(ii) and (9) we obtain
w m u * = ( 1 β m ) u m + β m L u m u * ( 1 β m ) u m u * + β m L u m u * ( 1 γ m ) u m u * + γ m u m u * u m u * .
Again, by (12) we obtain
v m u * = ( 1 α m ) u m + α m L w m u * ( 1 α m ) u m u * + α m L w m u * ( 1 α m ) u m u * + α m w m u * u m u * .
From (13), we obtain
u m + 1 u * = L v m u * v m u * u m u * ,
which means that the sequence { u m u * } is bounded and decreasing. Therefore, lim m u m u * exists for all u * F ( L ) . □
Theorem 2.
If L , G , M and { u m } are defined as demonstrated in Theorem 1 then F ( L ) if and only if the sequence { u m } is bounded and lim m L u m u m = 0 .
Proof. 
We have shown in Theorem 1 that { u m } is a bounded sequence and lim m u m u * exists for any u * F ( L ) . Setting
lim m u m u * = ,
it follows from (12) and (15) that
lim sup m w m u * lim sup m u m u * = .
By Proposition 1(ii), we obtain
lim sup m L u m u * lim sup m u m u * = .
Now, from (9), we obtain
u m + 1 u * = L u m u * v m u * = ( 1 α m ) u m + α m L w m u * ( 1 α m ) u m u * + α m L w m u * ( 1 α m ) u m u * + α m w m u * = u m u * α m u m u * + α m w m u * ,
which implies that
u m + 1 u * u m u * α m w m u * u m u *
Therefore,
u m + 1 u * u m u * u m + 1 u * u m u * α m w m u * u m u * ,
which gives us
u m + 1 u * w m u * .
Therefore,
lim inf m w m u * .
By (16) and (19), we obtain
= lim m w m u * = lim m ( 1 α m ) u m + α m L u m u * = lim m α m ( L u m u * ) + ( 1 α m ) ( u m u * )
Combining Lemmas 1, (15), (17) and (20), we obtain
lim m L u m u m = 0 .
Let u * A ( G , { u m } ) ; then,
r ( { u m } , L u * ) = lim sup m u m L u * lim sup m 3 + α 1 α u m L u m + L u m = lim sup m 3 + α 1 α u m L u m + lim sup m L u m u * lim sup m u m u * = r ( { u m } , u * ) .
It follows that L u * A ( G , { u m } ) . By the uniform convexity of M it is implied that A ( G , { u m } ) is a unit set and, thus, one obtains L u * = u * . Therefore, F ( L ) .
Theorem 3.
If L , G , M and { u m } are the same as in Theorem 1, with F ( L ) , then it is the case that if the Opial property is satisfied by M then { u m } weakly converges to a point in F ( L ) .
Proof. 
Since F ( L ) , it follows from Theorem 2 and Theorem 1 that lim m u m u * exists and lim m L u m u m = 0 . Now, we show that { u m } has just one weakly sub-sequential limit in F ( L ) . Assume that k and h are two weak sub-sequential limits of { u m j } and { u m k } , respectively. From Theorem 2 and the demicloseness of ( I L ) at 0, we know that ( I L ) k = 0 . Thus, L k = k and, by a similar approach, we obtain L h = h . Next, we prove uniqueness. Assume k h ; then, by the Opial condition, we obtain
lim m u m k = lim m j u m j k < lim m j u m j h = lim m u m h = lim m k u m k h < lim m k u m k k = lim m u m k .
This shows contraction; therefore, k = h . Thus, { u m } weakly converges to an element in F ( L ) . □
Theorem 4.
Let L , G , M and { u m } be the same as in Theorem 1, with F ( L ) . Then, { u m } converges strongly to an element of F ( L ) if and only if lim m d ( u m , F ( L ) = 0 , where d ( u m , F ( L ) ) = inf { u m u * : u * F ( L ) } .
Proof. 
The necessity is not hard to demonstrate, so we will omit it. Next, we show the converse case. Let u * be any fixed point of L ; then, lim inf d ( u m , F ( L ) ) = 0 . From Theorem 1, one knows that lim m u m u * exists for each u * F ( L ) and this implies that lim inf m d ( u m , F ( L ) ) = 0 . Next, we demonstrate that { u m } is a Cauchy sequence in G . Due to lim inf m d ( u m , F ( L ) ) = 0 , inasmuch as for any > 0 a constant m 0 N exists with
d ( u m , F ( L ) ) < 2 inf { u m u * : u * F ( L ) } < 2 ,
for all m m 0 . Therefore, inf { u m 0 u * : u * F ( L ) } < 2 . Therefore, there exists u * F ( L ) , such that
u m 0 u * < 2 .
For n , m m 0 , we obtain
u m + n u m u m + n u * + u m u * u m 0 u * + u m 0 u * = 2 u m 0 u * < .
It follows that { u m } is a Cauchy sequence in G . Due to the completeness of G , we obtain lim m u m = p for some p G . Furthermore, lim m d ( u m , F ( L ) ) = 0 shows that p F ( L ) . □
Theorem 5.
Let L , G , M and { u m } be the same as in Theorem 1 with F ( L ) . Suppose G is compact; then, { u m } strongly converges to a fixed point, e.g., u * F ( L ) .
Proof. 
Owing to the hypothesis that F ( L ) , we know from Theorem 2 that lim m L u m u m = 0 . Since G is compact, one can have a subsequence { u m j } of { u m } with lim m u m j u * G . From Proposition 1, one obtains
u m j L u * 3 + α 1 α L u m j u m j + u m j u * .
On taking j , L u * = u * , i.e., u * F ( L ) . By Theorem 1, lim m u m u * exists for any u * F ( L ) , and so the sequence { u m } strongly converges to u * . □
Theorem 6.
Let L , G , M and { u m } be defined as in Theorem 1 with F ( L ) . If L fulfills condition ( I ) then { u m } strongly converges to an element of L .
Proof. 
Due to Theorem 2, one obtains
lim s L u m u m = 0 .
From (22) and condition (I) in Definition 5, one obtains
lim s g ( d ( u m , F ( L ) ) ) lim m L u m u m = 0 ,
which implies that lim m g ( d ( u m , F ( L ) ) ) = 0 . We know that g is a nondecreasing self function defined on [ 0 , ) with g ( 0 ) = 0 , g ( s ) > 0 for all s ( 0 , ) ; therefore, we obtain
lim m d ( u m , F ( L ) ) = 0 .
By Theorem 4, it follows that { u m } strongly converges to an element of F ( L ) . □
Next, a numerical experiment will be carried out on a mapping that satisfies (2) but does not satisfy condition ( C ) , as follows:
Example 1.
Let M = R and G = [ 3 , 6 ] . We define L : G G by
L u = u + 3 2 , if u [ 3 , 4 ] , 3 , if u ( 4 , 6 ] .
For α = 1 3 , we will show that L is a mapping satisfying (2) in the following cases:
Case (I): Let u , v [ 3 , 4 ] ; then,
α | L u v | + α | L v u | + ( 1 2 α ) | u v | = 1 3 u + 3 2 v + 1 3 v + 3 2 u + 1 3 | u v | 1 3 3 u 2 3 v 2 + 1 3 u v 1 2 | u v | + 1 3 u v 1 2 | u v | = | L u L v | .
Case (II): Let u [ 3 , 4 ] and v ( 4 , 6 ] ; then,
α | L u v | + α | L v u | + ( 1 2 α ) | u v | = 1 3 u + 3 2 v + 1 3 u 3 + 1 3 | u v | 1 3 u 2 + v 9 2 + 1 3 u v 1 3 3 u 2 9 2 1 2 | u 3 | = | L u L v | .
Case (III): Let u , v ( 4 , 6 ] ; then,
α | L u v | + α | L v u | + ( 1 2 α ) | u v | 0 = | L u L v | .
From Case (I)(III), we see that L is a generalized α-nonexpansive mapping for α = 1 3 .
Moreover, if we take u = 39 10 and v = 29 7 , we obtain
1 2 u L u = 9 40 17 70 = u v .
On the other hand,
L u L v = 9 20 > 17 70 = u v .
Hence, L does not fulfill the condition ( C ) .
Next, for α m = β m = γ m = m + 5 m + 6 for m N and u 0 = 4 , we obtain the following Table 1 and Table 2, Figure 1 and Figure 2.
It is not hard to see from the above figures and tables that the Picard–Ishikawa iterative method convergences faster to 3 (the fixed point of L ) than the other compared iterative methods.
Now, we provide an example of a mapping satisfying (2) in a higher dimensional space as follows:
Example 2.
Let M = R 2 and G = { v = ( v 1 , v 2 ) : ( v 1 , v 2 ) [ 0 , 1 ] × [ 0 , 1 ] } be a subset of M with the taxicab norm
v = ( v 1 , v 2 ) = | v 1 | + | v 2 | .
Let L : G G be defined by
L ( v 1 , v 2 ) = 1 v 1 , 1 v 2 , if ( v 1 , v 2 ) [ 0 , 1 2 ] × [ 0 , 1 ] , 1 + v 1 3 , 1 + v 2 3 , if ( v 1 , v 2 ) ( 1 2 , 1 ] × [ 0 , 1 ] .
If v = ( 0 , 0 ) and w = 51 100 , 1 4 we obtain L v = ( 1 , 1 ) , L w = 151 300 , 5 12 , 1 2 w L w = 13 150 19 25 = v w . But L v L w = 27 25 > 19 25 = v w . Thus, L is not enriched with condition (C). Next, we show that L satisfies the inequality (10). The following cases will be considered:
(i) 
If v = ( v 1 , v 2 ) , w = ( w 1 , w 2 ) [ 0 , 1 2 ] × [ 0 , 1 ] ;
v L w v L v + L v L w = v L v + ( | v 1 w 1 | + | v 2 w 2 | ) = v L v + v w .
(ii) 
If v = ( v 1 , v 2 ) , w = ( w 1 , w 2 ) ( 1 2 , 1 ] × [ 0 , 1 ] ;
v L w v L v + L v L w = v L v + 1 3 ( | v 1 w 1 | + | v 2 w 2 | ) v L v + ( | v 1 w 1 | + | v 2 w 2 | ) = v L v + v w .
(iii) 
If v = ( v 1 , v 2 ) [ 0 , 1 2 ] × [ 0 , 1 ] and w = ( w 1 , w 2 ) ( 1 2 , 1 ] × [ 0 , 1 ] ;
v L w = 3 v 1 w 1 1 3 + 3 v 2 w 2 1 3 = v 1 w 1 + 2 v 1 1 3 + v 2 w 2 + 2 v 2 1 3 v 1 w 1 3 + 2 v 1 1 3 + v 2 w 2 3 + 2 v 2 1 3 ( | 2 v 1 1 | + | 2 v 2 1 ) + ( | v 1 w 1 | + | v 2 w 2 | ) = v L v + v w .
Thus, the mapping L satisfies the inequality (10) with 3 + α 1 α 1 and has a fixed point 1 2 , 1 2 . Hence, L is a generalized α-nonexpansive mapping.

4. An Application to Fractional Delay Differential Equations in the Caputo Sense

Fractional derivatives and integrals have been widely studied in various fields that have been in the developing stage especially for some decades now [34]. The techniques based on fractional calculus establish models of engineering systems better than the ordinary derivatives approaches [34]. Particularly, fractional differential equations as an important research branch of fractional calculus have been extensively studied by many authors as a result of fractional calculus’ numerous applications in engineering and applied sciences. Numerous schemes have been developed for numerical solutions of fractional differential equations.
In this article, we will approximate the solution of the following fractional delay differential equation in the Caputo sense via the Picard–Ishikawa iterative method (9):
D γ c u ( z ) = f ( z , u ( z ) , u ( z p ) , z [ d , J ] ,
with the initial conditions
u ( z ) = ϱ ( z ) , z [ d q , d ] ,
where p > 0 , γ ( 0 , 1 ) , J > 0 , q > 0 , the mapping ϱ C ( [ d p , d ] : m ) , u m is continuous and the mapping f : [ d , J ] × m × m m is also continuous. We assume that the following conditions hold:
(C1
The Lipschitz constant L f > 0 exists with
f ( z , u 1 , v 1 ) f ( z , u 2 , v 2 ) L f ( u 1 v 1 + u 2 v 2 )
for each z + and u 1 , v 1 , u 2 , v 2 m ;
(C2
A constant δ L > 0 exists with 2 L δ L < 1 .
Let u * C ( [ d p , J ] : m ) C 1 ( [ d , J ] : m ) be a function satisfying (25) and (26); then, u * is a solution of (25) and (26). It is shown in [35] that the solution to the problem (25) and (26) is equivalent to the solution of the following integral equation:
w ( z ) = ϱ ( d ) + 1 Γ ( γ ) d z ( z q ) ( γ 1 ) f ( q , u ( q ) , u ( q p ) ) d q , z [ d , J ] ,
where u ( z ) = ϱ ( z ) , [ d q , d ] . We define the norm · δ L on C ( [ d p , J ] : k ) by
ϱ δ L = sup ϱ ( z ) E γ ( δ L w γ ) for all ϱ C ( [ d p , d ] : m ) ,
where E γ : is the Mittag-Leffler function and it is defined by
E γ ( z ) = m = 0 z k Γ ( γ m + 1 ) , for all z .
Clearly, C ( [ d p , d ] : m , · δ L ) is a Banach space.
From condition ( C 1 ), Wang et al. [33] showed that the solution of problem (25) and (26) exists and it is also unique. Now, we utilize the Picard–Ishikawa iterative method (9) to estimate the solution of problem (25) and (26).
The main result in this section is given as follows:
Theorem 7.
Let z and ϱ be the same functions defined above. If the conditions ( C 1 )–( C 2 ) are performed, then the sequence generated by (9) converges to a unique solution to problem (25) and (26), say u * , in G = C ( [ d p , J ] : m ) C 1 ( [ d , J ] : m ) .
Proof. 
Let L : G G be an operator defined by
L u ( z ) = ϱ ( d ) + 1 Γ ( γ ) d w ( w q ) ( γ 1 ) f ( q , u ( q ) , u ( q p ) ) d q , w [ d , J ] , ϱ ( z ) , z [ d q , d ] .
We now show that u m u * as m . Suppose z [ d q , d ] ; then, evidently, u m u * as m . So, if [ d , J ] , by (9) and the conditions ( C 1 )–( C 2 ) one obtains
w m u * = ( 1 β m ) u m + β m L u m u * ( 1 β m ) u m u * + β m L u m u * .
We take the supremum over [ d p , J ] on both sides of (29) and we obtain
sup z [ d p , J ] w m u * ( 1 β m ) sup z [ d p , J ] u m u * + β m sup z [ d p , J ] L u m u * ( 1 β m ) sup z [ d p , J ] u m u * + β m sup z [ d p , J ] 1 Γ ( γ ) d z ( z q ) ( γ 1 ) f ( q , u m ( q ) , u m ( q p ) ) d q 1 Γ ( γ ) d z ( z q ) ( γ 1 ) f ( q , u * ( q ) , u * ( q p ) ) d q ( 1 β m ) sup z [ d p , J ] u m u * + β m sup z [ d p , J ] 1 Γ ( γ ) d z ( z d ) ( γ 1 ) × L f ( u m ( q ) u * ( q ) + u m ( q p ) u * ( q p ) ) d q ( 1 β m ) sup z [ d p , J ] u m u * + β m 1 Γ ( γ ) d z ( z q ) ( γ 1 ) d q × L f ( sup z [ d p , J ] u m ( q ) u * ( q ) + sup z [ d p , J ] u m ( q p ) u * ( q p ) )
If both sides of (30) are divided by E γ ( δ L w γ ) we obtain
sup z [ d p , J ] u m u * E γ ( δ L z γ ) ( 1 β m ) sup z [ d p , J ] u m u * E γ ( δ L z γ ) + β m L f Γ ( γ ) d z ( z q ) ( γ 1 ) d q × sup z [ d p , J ] u m ( q ) u * ( q ) E γ ( δ L z γ ) + sup z [ d p , J ] u m ( q p ) u * ( q p ) E γ ( δ L z γ ) .
By (28), we then reduce (31) to
w m u * δ L ( 1 β m ) u m u * δ L + β m Γ ( γ ) d z ( z q ) ( γ 1 ) d q × L f ( u m ( q ) u * ( q ) δ L + u m ( q p ) u * ( q p ) δ L ) = ( 1 β m ) u m u * δ L + β m ( 2 L f ) u m u * δ L 1 Γ ( γ ) d z ( z η ) ( γ 1 ) d q = ( 1 β m ) u m u * δ L + β m ( 2 L f ) E γ ( δ L w γ ) u m u * δ L 1 Γ ( γ ) d z ( z q ) ( γ 1 ) E γ ( δ L z γ ) d q = ( 1 β m ) u m u * δ L + β m ( 2 L f ) E γ ( δ L z γ ) u m u * δ L . c I γ D γ c E γ ( δ L z γ ) δ L = ( 1 β m ) u m u * δ L + β m ( 2 L f ) E γ ( δ L z γ ) . E γ ( δ L z γ ) δ L u m u * δ L = ( 1 β m ) u m u * δ L + β m ( 2 L f ) δ L u m u * δ L .
Since 2 L f δ L < 1 , it follows that
w m u * δ L u m u * δ L .
Again, from (9) we obtain
v m u * = ( 1 α m ) u m + α m L w m u * ( 1 α m ) u m u * + α m L w m u * .
If we take the supremum over [ d p , J ] on both sides of (34) we obtain
sup z [ d p , J ] v m u * ( 1 α m ) sup z [ d p , J ] u m u * + α m sup z [ d p , J ] L w m u * ( 1 α m ) sup z [ d p , J ] u m u * + α m sup z [ d p , J ] 1 Γ ( γ ) d z ( z q ) ( γ 1 ) f ( q , w m ( q ) , w m ( q p ) ) d q 1 Γ ( γ ) d z ( z q ) ( γ 1 ) f ( q , u * ( q ) , u * ( q p ) ) d q ( 1 α m ) sup z [ d p , J ] u m u * + α m sup z [ d p , J ] 1 Γ ( γ ) d z ( z d ) ( γ 1 ) × L f ( w m ( q ) u * ( q ) + w m ( q p ) u * ( q p ) ) d q ( 1 α m ) sup z [ d p , J ] u m u * + α m 1 Γ ( γ ) d z ( z q ) ( γ 1 ) d q × L f ( sup z [ d p , J ] w m ( q ) u * ( q ) + sup z [ d p , J ] w m ( q p ) u * ( q p ) )
If both sides of (35) are divided by E γ ( δ L w γ ) we have
sup z [ d p , J ] v m u * E γ ( δ L z γ ) ( 1 α m ) sup z [ d p , J ] u m u * E γ ( δ L z γ ) + α m L f Γ ( γ ) d z ( z q ) ( γ 1 ) d q × sup z [ d p , J ] w m ( q ) u * ( q ) E γ ( δ L z γ ) + sup z [ d p , J ] w m ( q p ) u * ( q p ) E γ ( δ L z γ ) .
By (28), we then reduce (36) to
v m u * δ L ( 1 α m ) u m u * δ L + α m Γ ( γ ) d z ( z q ) ( γ 1 ) d q × L f ( u m ( q ) u * ( q ) δ L + u m ( q p ) u * ( q p ) δ L ) = ( 1 α m ) u m u * δ L + α m ( 2 L f ) u m u * δ L 1 Γ ( γ ) d z ( z η ) ( γ 1 ) d q = ( 1 α m ) u m u * δ L + α m ( 2 L f ) E γ ( δ L z γ ) w m u * δ L 1 Γ ( γ ) d z ( z q ) ( γ 1 ) E γ ( δ L z γ ) d q = ( 1 α m ) u m u * δ L + α m ( 2 L f ) E γ ( δ L z γ ) w m u * δ L . c I γ D γ c E γ ( δ L z γ ) δ L = ( 1 α m ) u m u * δ L + α m ( 2 L f ) E γ ( δ L z γ ) . E γ ( δ L z γ ) δ L u m u * δ L = ( 1 α m ) u m u * δ L + α m ( 2 L f ) δ L w m u * δ L .
Since 2 L f δ L < 1 , then from (33) and (37) it follows that
v m u * δ L u m u * δ L .
Finally, from (9) we obtain
u m + 1 u * = L v m u * .
If we take the supremum over [ d p , J ] on both sides of (39) we obtain
sup z [ d p , J ] u m + 1 u * sup z [ d p , J ] L v m u * sup z [ d p , J ] 1 Γ ( γ ) d z ( z q ) ( γ 1 ) f ( q , v m ( q ) , v m ( q p ) ) d q 1 Γ ( γ ) d z ( z q ) ( γ 1 ) f ( q , u * ( q ) , u * ( q p ) ) d q sup z [ d p , J ] 1 Γ ( γ ) d z ( z d ) ( γ 1 ) × L f ( v m ( q ) u * ( q ) + v m ( q p ) u * ( q p ) ) d q 1 Γ ( γ ) d z ( z q ) ( γ 1 ) d q × L f ( sup z [ d p , J ] v m ( q ) u * ( q ) + sup z [ d p , J ] v m ( q p ) u * ( q p ) )
If both sides of (39) are divided by E γ ( δ L w γ ) we obtain
sup z [ d p , J ] u m + 1 u * E γ ( δ L z γ ) L f Γ ( γ ) d z ( z q ) ( γ 1 ) d q × sup z [ d p , J ] v m ( q ) u * ( q ) E γ ( δ L z γ ) + sup z [ d p , J ] v m ( q p ) u * ( q p ) E γ ( δ L z γ ) .
By (28), we then reduce (40) to
u m + 1 u * δ L 1 Γ ( γ ) d z ( z q ) ( γ 1 ) d q × L f ( u m ( q ) u * ( q ) δ L + u m ( q p ) u * ( q p ) δ L ) = 2 L f u m u * δ L 1 Γ ( γ ) d z ( z η ) ( γ 1 ) d q = 2 L f E γ ( δ L z γ ) v m u * δ L 1 Γ ( γ ) d z ( z q ) ( γ 1 ) E γ ( δ L z γ ) d q = 2 L f E γ ( δ L z γ ) v m u * δ L . c I γ D γ c E γ ( δ L z γ ) δ L = 2 L f E γ ( δ L z γ ) . E γ ( δ L z γ ) δ L u m u * δ L = 2 L f δ L v m u * δ L .
Combining (38) and (40) we obtain
u m + 1 u * δ L u m u * δ L .
If we set u m + 1 u * δ L = ψ m then we obtain
ψ m + 1 ψ m , m N .
Thus, { ψ m } is a monotonically decreasing sequence of real numbers. This implies that it is a bounded sequence, so we obtain
lim m ψ m = inf { ψ m } = 0 .
Hence,
lim m u m u * δ L = 0 .

5. Conclusions

In this work, we have studied an efficient iterative method known as the Picard–Ishikawa method, as defined in (9). We used this method to approximate the fixed points of generalized α -nonexpansive mappings. Under standard and mild conditions imposed on the control parameters of the Picard–Ishikawa method, we proved several weak and convergence theorems of the method. We have shown numerically that the studied method has a better rate of convergence than some well-known methods for generalized α -nonexpansive mappings. We solved a problem involving fractional delay differential equations via the Picard–Ishikawa iterative method. Since the class of mappings studied in this work is more general than those in many existing results, our findings extend, generalize and unify several existing results in the literature.

Author Contributions

Conceptualization, A.E.O. and H.A.N.; Methodology, J.A.U.; Software, J.O. and M.O.U.; Validation, Funding acquisition, Formal analysis, H.A.N.; Writing—original draft, A.E.O.; Supervision, O.K.N. All authors have read and agreed to the published version of the manuscript.

Funding

The authors extend their appreciation to Prince Sattam Bin Abdulaziz University for funding this research through project number (PSAU/2023/01/90102).

Data Availability Statement

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

Conflicts of Interest

The authors declare that they have no competing interest.

References

  1. Suzuki, T. Fixed point theorems and convergence theorems for some generalized nonexpansive mappings. J. Math. Anal. Appl. 2008, 340, 1088–1095. [Google Scholar] [CrossRef]
  2. Pant, R.; Shukla, R. Approximating fixed points of generalized α–nonexpansive mappings in Banach spaces. Numer. Funct. Anal. Optim. 2017, 38, 248–266. [Google Scholar] [CrossRef]
  3. Garodia, C.; Uddin, I. A new iterative method for solving split feasibility problem. J. Appl. Anal. Comput. 2020, 10, 986–1004. [Google Scholar] [CrossRef] [PubMed]
  4. Iqbal, H.; Abbas, M.; Husnine, S.M. Existence and approximation of fixed points of multivalued generalized α-nonexpansive mappings in Banach spaces. Numer. Algorithms 2020, 85, 1029–1049. [Google Scholar] [CrossRef]
  5. 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]
  6. 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]
  7. Okeke, G.A.; Ofem, A.E.; Abdeljawad, T.; Alqudah, M.A.; Khan, A. A solution of a nonlinear Volterra integral equation with delay via a faster iteration method. AIMS Math. 2023, 8, 102–124. [Google Scholar] [CrossRef]
  8. Ullah, K.; Ayaz, F.; Ahmad, J. Some convergence results of M iterative process in Banach spaces. Asian-Eur. J. Math. 2021, 14, 2150017. [Google Scholar] [CrossRef]
  9. Okeke, G.A.; Abbas, M. A solution of delay differential equations via Picard–Krasnoselskii hybrid iterative process. Arab. J. Math. 2017, 6, 21–29. [Google Scholar] [CrossRef]
  10. Picard, E. Memoire sur la theorie des equations aux derivees partielles et la methode des approximations successives. J. Math. Pures Appl. 1890, 6, 145–210. [Google Scholar]
  11. Thakur, B.S.; Thakur, D.; Postolache, M. A new iteration scheme for approximating fixed points of nonexpansive mappings. Filomat 2016, 30, 2711–2720. [Google Scholar] [CrossRef]
  12. Okeke, G.A.; Ofem, A.E. A novel iterative scheme for solving delay differential equations and nonlinear integral equations in Banach spaces. Math. Methods Appl. Sci. 2022, 45, 5111–5134. [Google Scholar] [CrossRef]
  13. Ofem, A.E.; Abuchu, J.A.; George, R.; Ugwunnadi, G.C.; Narain, O.K. Some new results on convergence, weak w2–stability and data dependence of two multivalued almost contractive mappings in hyperbolic spaces. Mathematics 2023, 10, 3720. [Google Scholar] [CrossRef]
  14. Mann, W.R. Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 4, 506–510. [Google Scholar] [CrossRef]
  15. Ishikawa, S. Fixed points by a new iteration method. Proc. Am. Math. Soc. 1974, 44, 147–150. [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. Agarwal, R.P.; Regan, D.O.; Sahu, D.R. Iterative construction of fixed points of nearly asymptotically nonexpansive mappings. J. Nonlinear Convex Anal. 2007, 8, 61–79. [Google Scholar]
  18. Khan, S.H. A Picard-Mann hybrid iterative process. Fixed Point Theory Appl. 2013, 2013, 69. [Google Scholar] [CrossRef]
  19. Abbas, M.; Nazir, T. A new faster iteration process applied to constrained minimization and feasibility problems. Mat. Vesn. 2014, 66, 223–234. [Google Scholar]
  20. Okeke, G.A. Convergence analysis of the Picard–Ishikawa hybrid iterative process with applications. Afr. Mat. 2019, 30, 817–835. [Google Scholar] [CrossRef]
  21. Kulish, V.V.; Lage, J.L. Application of fractional calculus to fluid mechanics. J. Fluids Eng. 2002, 123, 803–806. [Google Scholar] [CrossRef]
  22. Lederman, C.; Roquejoffre, J.M.; Wolanski, N. Mathematical justification of a nonlinear integro-differential equation for the propagation of spherical flames. Ann. Mat. Pura Appl. 2004, 183, 173–239. [Google Scholar] [CrossRef]
  23. Naeem, M.; Zidan, A.M.; Nonlaopon, K.M.; Syam, I.; Al–Zhour, Z.; Shah, R. A new analysis of fractional-order equal-width equations via novel techniques. Symmetry 2021, 13, 886. [Google Scholar] [CrossRef]
  24. Bagley, R.L.; Torvik, P.J. Fractional calculus in the transient analysis of viscoelastically damped structures. AIAA J. 1985, 23, 918–925. [Google Scholar] [CrossRef]
  25. Engheta, N. On fractional calculus and fractional multipoles in electromagnetism. IEEE Trans. Antennas Propag. 1996, 44, 554–566. [Google Scholar] [CrossRef]
  26. Esuabana, I.M.; Abasiekwere, U.A.; Ugboh, J.A.; Lipcsey, Z. Equivalent construction of ordinary differential equations from impulsive system. Acad. J. Appl. Math. Sci. 2018, 4, 77–89. [Google Scholar]
  27. Lipcsey, Z.; Esuabana, I.M.; Ugboh, J.A.; Isaac, I.O. Integral representation of functions of bounded variation. J. Math. 2019, 2019, 1065946. [Google Scholar] [CrossRef]
  28. Effanga, E.O.; Ugboh, J.A.; Enang, E.I.; Eno, B.E.A. A tool for constructing pair-wise balanced incomplete block design. J. Mod. Math. Stat. 2009, 3, 69–72. [Google Scholar]
  29. Naeem, S.M.; Ullah, R.; Mustafa, S.; Bariq, A. Analysis of the fractional-order delay differential equations by the numerical method. Complexity 2022, 2022, 3218213. [Google Scholar] [CrossRef]
  30. Schu, J. Weak and strong convergence to fixed points of asymptotically nonexpansive mappings. Bull. Aust. Math. Soc. 1991, 43, 153–159. [Google Scholar] [CrossRef]
  31. Soltuz, S.M.; Grosan, T. Data dependence for Ishikawa iteration when dealing with contractive like operators. Fixed Point Theory Appl. 2008, 2008, 242916. [Google Scholar] [CrossRef]
  32. Senter, H.F.; Dotson, W.G. Approximating fixed points of nonexpansive mapping. Proc. Amer. Math. Soc. 1974, 44, 375–380. [Google Scholar] [CrossRef]
  33. Wang, F.F.; Chen, D.Y.; Zhang, X.G.; Wu, Y. The existence and uniqueness theorem of the solution to a class of nonlinear fractional order system with time delay. Appl. Math. Lett. 2016, 53, 45–51. [Google Scholar] [CrossRef]
  34. Babakhani, A.; Baleanu, D.; Agarwal, R.P. The existence and uniqueness of solutions for a class of nonlinear fractional differential equations with infinite delay. Abstr. Appl. Anal. 2013, 2013, 592964. [Google Scholar] [CrossRef]
  35. Kilbas, A.; Marzan, S. Cauchy problem for differential equation with Caputo derivative. Fract. Calc. Appl. Anal. 2004, 7, 297–321. [Google Scholar]
Figure 1. Graph corresponding to Table 1.
Figure 1. Graph corresponding to Table 1.
Fractalfract 08 00166 g001
Figure 2. Graph corresponding to Table 2.
Figure 2. Graph corresponding to Table 2.
Fractalfract 08 00166 g002
Table 1. Convergence behavior of various iterative methods for Example 1.
Table 1. Convergence behavior of various iterative methods for Example 1.
StepMannSKhanPicard–Ishikawa
14.00000000004.00000000004.00000000004.0000000000
23.62500000003.35937500003.31250000003.2421875000
33.39062500003.12915039063.09765625003.0586547852
43.24414062503.04641342163.03051757813.0142054558
53.15258789063.01667982343.00953674323.0034403838
63.09536743163.00599431153.00298023223.0008332180
73.05960464483.00215420573.00093132263.0002017950
83.03725290303.00077416773.00029103833.0000488722
93.02328306443.00027821653.00009094953.0000118362
103.01455191523.00009998413.00002842173.0000028666
113.00909494703.00003593183.00000888183.0000006943
123.00568434193.00001291303.00000277563.0000001681
133.00355271373.00000464063.00000086743.0000000407
143.00222044603.00000166773.00000027113.0000000099
153.00138777883.00000059933.00000008473.0000000024
163.00086736173.00000021543.00000002653.0000000006
173.00054210113.00000007743.00000000833.0000000001
183.00033881323.00000002783.00000000263.0000000000
193.00021175823.00000001003.00000000083.0000000000
203.00013234893.00000000363.00000000033.0000000000
213.00008271813.00000000133.00000000013.0000000000
223.00005169883.00000000053.00000000003.0000000000
233.00003231173.00000000023.00000000003.0000000000
243.00002019483.00000000013.00000000003.0000000000
253.00001262183.00000000003.00000000003.0000000000
Table 2. Convergence behavior of various iterative methods for Example 1.
Table 2. Convergence behavior of various iterative methods for Example 1.
StepIshikawaNoorAbbasPicard–Ishikawa
14.00000000004.00000000004.00000000004.0000000000
23.48437500003.43164062503.27929687503.2421875000
33.23461914063.18631362923.07800674443.0586547852
43.11364364623.08042053133.02178703993.0142054558
53.05504614113.03471276843.00608505223.0034403838
63.02666297463.01498344113.00169953613.0008332180
73.01291487833.00646746193.00047467513.0002017950
83.00625564423.00279161933.00013257533.0000488722
93.00303007773.00120497633.00003702793.0000118362
103.00146769393.00052011673.00001034183.0000028666
113.00071091423.00022450353.00000288843.0000006943
123.00034434913.00009690483.00000080673.0000001681
133.00016679413.00004182813.00000022533.0000000407
143.00008079093.00001805473.00000006293.0000000099
153.00003913313.00000779313.00000001763.0000000024
163.00001895513.00000336383.00000000493.0000000006
173.00000918143.00000145203.00000000143.0000000001
183.00000444723.00000062673.00000000043.0000000000
193.00000215413.00000027053.00000000013.0000000000
203.00000104343.00000011683.00000000003.0000000000
213.00000050543.00000005043.00000000003.0000000000
223.00000024483.00000002183.00000000003.0000000000
233.00000011863.00000000943.00000000003.0000000000
243.00000005743.00000000413.00000000003.0000000000
253.00000002783.00000000173.00000000003.0000000000
263.00000001353.00000000083.00000000003.0000000000
273.00000000653.00000000033.00000000003.0000000000
283.00000000323.00000000013.00000000003.0000000000
293.00000000153.00000000013.00000000003.0000000000
303.00000000073.00000000003.00000000003.0000000000
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

Ugboh, J.A.; Oboyi, J.; Udo, M.O.; Nabwey, H.A.; Ofem, A.E.; Narain, O.K. On a Faster Iterative Method for Solving Fractional Delay Differential Equations in Banach Spaces. Fractal Fract. 2024, 8, 166. https://doi.org/10.3390/fractalfract8030166

AMA Style

Ugboh JA, Oboyi J, Udo MO, Nabwey HA, Ofem AE, Narain OK. On a Faster Iterative Method for Solving Fractional Delay Differential Equations in Banach Spaces. Fractal and Fractional. 2024; 8(3):166. https://doi.org/10.3390/fractalfract8030166

Chicago/Turabian Style

Ugboh, James Abah, Joseph Oboyi, Mfon Okon Udo, Hossam A. Nabwey, Austine Efut Ofem, and Ojen Kumar Narain. 2024. "On a Faster Iterative Method for Solving Fractional Delay Differential Equations in Banach Spaces" Fractal and Fractional 8, no. 3: 166. https://doi.org/10.3390/fractalfract8030166

Article Metrics

Back to TopTop