1.
Introduction
Fixed point theory is widely becoming an indispensable area of mathematics in its right and the tools involved are used to solve nonlinear problems that sometimes appear unsolvable with the traditional analytical methods [1]. Practically, invoking some tools in fixed point theory have helped to circumvent the challenge encountered while trying to obtain the analytical solution of certain nonlinear problems. The reader can refer to [2]. Ways to address the challenge include the transformation of the nonlinear problem into a fixed point operator equation that is subsequently solved via approximation of the fixed point operator equation by using any suitable fixed point iterative scheme.
Many physical problems are usually formulated as differential equations (which could be ordinary or partial) and subsequently transformed into an integral equation of any type or kind. It is in this manner that the majority of physical problems have been formulated and represented as fractional differential equations. It is common knowledge through research, that fractional differential equations tend to have wider a range of application to real life situations (see, e.g., [3,4,5,6,7,8,9,10,11] and the references therein). As mentioned in the previous paragraph, it has been observed in several studies that obtaining the analytical solutions of quite a large number of nonlinear problems has been difficult and sometimes, impossible. Therefore, as a measure to circumvent this challenge, many methods including the fixed point method have been adopted by many researchers in an effort to obtain solutions to nonlinear fractional differential equations (NFDEs). Specifically, fixed point iterative schemes have been applied to solve nonlinear differential equations (see, e.g., [3,12,13,14,15,16,17,18,19,20,21,22]
It is our purpose in this paper to introduce a new fixed point iterative scheme called the AG iterative scheme that approximates the fixed point of a contraction mapping in a uniformly convex Banach space. We use the new scheme to prove some convergence, stability and data dependence results. Also, we show that our scheme converges faster than some existing schemes in literature, and we use a numerical example to substantiate our result. We show that our scheme converges weakly to a fixed point of Suzuki's generalized nonexpansive mapping that satisfies condition (C). As an application, we use the new scheme (2.9) to approximate the solution of an NFDEs of the Caputo type. Our result generalizes and extends many existing results in literature.
2.
Preliminaries
Let X be a Banach space and D be a nonempty, closed and convex subset of X. Assume that N, in this section and elsewhere, is the set of natural numbers and R represents the set of real numbers. The mapping J:D→D is called a contraction mapping if it satisfies the following condition:
for δ∈[0,1). If condition (2.1) reduces to
then the mapping J is said to be a nonexpansive mapping having a fixed point p∗∈F(J)≠∅.
Alternatively, Suzuki in 2008 (see [23]), gave the following definition for a generalized nonexpansive mapping.
Definition 2.1. [23] Let D be a nonempty closed convex subset of a Banach space X. Let J:D→D be a mapping. Then, J is said to satisfy condition (C) if the following condition holds
for all ω,ν∈D.
Let D be a nonempty closed convex subset of a Banach space X and {un} be a bounded sequence in X. For each u∈X, we define the following (see, for example, [24])
(a) asymptotic radius of {un} at u according to R(u,{un})=lim supn→∞‖u−un‖,
(b) asymptotic radius of {un} relative to the set D according to
(c) asymptotic center of {un} relative to the set X according to
Remark 2.1. [25] It is obvious that the set A(D,{un}) is a singleton in a uniformly convex Banach space.
Definition 2.2. [24] A Banach space X is said to satisfy the Opial condition [26] if for each sequence {un} in X, converging weakly to u∈X, we have
for all w∈X such that u≠w.
Definition 2.3. [27] Let {an}∞n=0 and {bn}∞n=0 be two iterative schemes converging respectively to a and b. Suppose that there exists
then, {an}∞n=0 converges faster to a than {bn}∞n=0 to b.
Definition 2.4. [27] Suppose that for two fixed point iterations {un}∞n=0 and {vn}∞n=0 converging to the same fixed point y∗, the error estimates
hold, where {an}∞n=0 and {bn}∞n=0 are two sequences of positive numbers converging to zero. Furthermore, if {an}∞n=0 converges faster than {bn}∞n=0, then {un}∞n=0 converges faster than {vn}∞n=0 to a fixed point p∗.
Definition 2.5. [28] Let {sn} be any arbitrary sequence in C[0,1]. Then an iterative scheme un+1=f(J,un), converging to a fixed point p∗, is said to be J-stable, or stable with respect to J, if, for ϵn=‖sn+1−f(J,sn)‖, ∀n∈N, limn→∞ϵn=0 iff limn→∞sn=p∗.
Lemma 2.1. [29] If ρ∈[0,1) is a real number and {ϵn}∞n=0 is a sequence of positive numbers such that limn→∞ϵn=0, then, for any sequence of positive numbers, {sn}∞n=0 satisfies that sn+1≤ρsn+ϵn(n=0,1,2,...) such that limn→∞sn=0.
Lemma 2.2. [30] Let X be a uniformly convex Banach space and {γn}∞n=0 be any sequence of numbers such that 0<a≤γn≤b<1, n≥1, for a,b∈R. Let {un}∞n=0 and {vn}∞n=0 be sequences in X such that lim supn→∞‖un‖≤φ, lim supn→∞‖rn‖≤φ and lim supn→∞‖γnun+(1−γn)rn‖=φ for some φ≥0. Then, limn→∞‖un−rn‖=0.
Lemma 2.3. [23] Let J be a self mapping on a uniformly convex subset D of a Banach space X. Suppose that J satisfies condition (C). Then
holds for ω,ν∈D.
Lemma 2.4. [23] Let J be a mapping on a subset D of a Banach space X with the Opial condition satisfying (2.2). Suppose that J is a Suzuki generalized nonexpansive mapping satisfying condition (C). If {un} converges weakly to p∗ and limn→∞‖Jun−un‖=0, then Jp∗=p∗. That is, I−J is demiclosed at zero.
Lemma 2.5. [31] Let {σn} be a nonnegative sequence for which one assumes that there exists n0∈N such that for all n≥n0, we can suppose that the following inequality is satisfied:
where ϖn∈(0,1), ∀n∈N, ∑∞n=0ϖn=∞ and ηn≥0∀n∈N. Then,
Lemma 2.6. [32] Let σn be a nonnegative sequence satisfying the inequality
with ηn∈[0,1], ∑∞j=0ηj=∞ and λn=o(ηn). Then limn→∞σn=0.
Lemma 2.7. [23] Let D be a nonempty subset of a Banach space X and J:D→D. If J is a Suzuki generalized nonexpansive mapping, then for all x∈D and p∗∈F(J), ‖Jx−Jp∗‖≤‖x−p∗‖ holds.
Approximation via a fixed point iterative scheme has been adopted by several researchers as a method to approximate several classes of operators. For example, Mann [33], in 1953, introduced the following iterative scheme:
where {αn} is a sequence in [0,1].
Khan [34] and Thakur et al. [35], in 2013 and 2016, respectively constructed the following schemes, called the Picard-Mann hybrid and Thakur iterative schemes:
where {αn} and {βn} are real sequences in (0,1). Khan proved that (2.4) converges faster than the Picard, Mann and Ishikawa iterative schemes.
In 2018, Ullah and Arshad [36] introduced the M iterative scheme as follows:
where {αn} is a real sequence in [0,1]. The scheme was used to prove weak and strong convergence theorems for Suzuki generalized nonexpansive mappings in the framework of uniformly convex Banach spaces.
Noor [37], in 2000, introduced an iterative scheme that included both the Mann and the Ishikawa iterative schemes as special cases. The scheme was defined as follows:
where {αn}, {βn} and {γn} are real sequences in [0,1].
Recently in 2019, Okeke [38] introduced the following iterative scheme:
where {αn} and {βn} are sequences in (0,1) and it was shown that the scheme converges faster than the Picard, Krasnoselskii [39], Mann, Ishikawa [40], Noor, Picard-Mann and Picard-Krasnoselkii [41] iterative schemes.
Motivated by the aforementioned developments, it is our aim in this paper to introduce a new fixed point iterative scheme that is more efficient than the ones highlighted above and others in literature. To achieve this, the AG fixed point iterative scheme is defined by the sequence {un} as follows:
where {αn}, {βn} and {γn} are sequences of real numbers in [0,1].
3.
Main results
In this section, we consider and prove the main results of this paper.
3.1. Convergence and stability results
Theorem 3.1. Let D be a nonempty closed convex subset of a Banach space X and J:D→D be a contraction mapping satisfying condition (2.1) such that F(J)≠∅. Suppose that {un}∞n=0 is an iterative sequence generated by the AG iterative scheme (2.9) satisfying ∑∞n=0αn=∞. Then {un}∞n=0 converges to a unique fixed point p∗ of J.
Proof. Let p∗∈F(J) be a fixed point of a contraction mapping J. The Banach contraction mapping principle guarantees the existence and uniqueness of the fixed point p∗. So, we want to show that un→p∗ as n→∞.
From (2.1) and (2.9), we have
Using (2.1), (2.9) and (3.1), we have
Again, using (2.1), (2.9) and (3.2), we have
Using (2.1), (2.9) and (3.3), we have
Since βn,γn∈[0,1] and δ∈(0,1), then
Repeating the process, we have
Hence,
δ∈[0,1) and αn∈[0,1]; thus, 1−αn(1−δ)<1 for all n∈N.
It is obvious from classical analysis that 1−x=e−x for x∈(0,1). Thus,
From the hypothesis of the theorem, ∞∑k=0αk=∞ such that e−(1−δ)∑∞k=0αk→0 as n→∞, that is,
This completes the proof. □
Theorem 3.2. Let D be a nonempty closed convex subset of a Banach space X and J:D→D be a contraction mapping satisfying condition (2.1) with the fixed point p∗∈F(J)≠∅. Let x0∈D generate the sequence {xn}∞n=0⊂D, as defined in (2.3), and u0∈D, given {un}∞n=0⊂D as defined by (2.9) with real sequences {αn}∞n=0, {βn}∞n=0, {γ}∞n=0∈[0,1] satisfying ∑∞n=0αn=∞. Then, the following statements are equivalent:
(i) The Mann iterative scheme (2.3) converges to the fixed point p∗∈F(J).
(ii) The AG iterative scheme (2.9) converges to the fixed point p∗∈F(J).
Proof. We shall show that (i) ⇒ (ii), that is, if the Mann iterative scheme (2.3) converges to a fixed point p∗, then the AG iterative scheme (2.9) also converges.
Using (2.3), (2.9) and condition (2.1), we have
Putting (3.7) in (3.6), we have
Since δ∈(0,1) and βn∈[0,1], then for each n∈N, δ2(1−βn)<1 such that (3.8) reduces to
Putting (3.9) in (3.5), we have
Let σn:=‖xn−un‖, ηn:=αn(1−δ)∈(0,1) and λn:=[(1−αn)+δ(1+δαn)+δ2[1−(1−δ)αn]]‖xn−Jxn‖.
Using the fact that Jp∗=p∗ and ‖xn−p∗‖→0 as n→∞, we have that
thus,
This implies that λn→0 as n→∞. By Lemma 2.6, we have that limn→∞‖xn−un‖=0.
Since
we have that ‖un−p∗‖→0 as n→∞.
Next, we shall show that (ii)⇒ (i). Using (2.3), (2.9) and condition (2.1), we have
Combining (3.11) and (3.12), we have
Let σn:=‖un−xn‖, ηn:=(1−δ)αn∈(0,1) and λn:=[δ2−δ3αn]‖Jun−un‖+(1−αn)‖Jxn−xn‖+δ‖Jun−xn‖.
Since Jp∗=p∗ and ‖un−p∗‖→0, as n→∞, then
thus, ‖Jun−un‖→0 as n→∞.
Also, if
then ‖xn−p∗‖→0 as n→∞; thus, ‖Jxn−xn‖→0 as n→∞. Similarly, ‖Jun−xn‖→0 as n→∞, which is consequent to the fact that
Thus, from Lemma 2.6, σn=‖un−xn‖ and limn→∞‖un−xn‖=0.
Since
we have that limn→∞‖xn−p∗‖=0. Hence, we have completed the proof. □
Theorem 3.3. Let X be a Banach space and J:D→D be a contraction mapping satisfying condition (2.1) with δ∈[0,1). Assume that J has a fixed point p∗∈F(J)≠∅. Let {un}∞n=0 be a sequence generated by the AG iterative scheme (2.9) satisfying ∑∞n=0αn=∞, n∈N, and that converges to p∗. Then, the AG iterative scheme is J-stable.
Proof. Suppose that {sn}∞n=0⊂X is an arbitrary sequence in D and suppose that the sequence generated by (2.9) is un+1=f(J,un) converging to a unique fixed point p∗.
Let ϵn=‖sn+1−f(J,sn)‖. We want to show that limn→∞ϵn=0 if and only if limn→∞‖sn−p∗‖=0.
Suppose that limn→∞ϵn=0. Using the triangle inequality, we have
Combining (3.13)–(3.16), we have
Since δ∈(0,1) and {αn},{βn},{γn}∈[0,1], then {(1−βn)δ+βnδ[1−(1−δ)γn]}[δ2(1−αn)+αnδ3]<1;
thus,
By Lemma 2.1, we have that limn→∞‖sn−p∗‖=0, that is, limn→∞sn=p∗.
Conversely, suppose that limn→∞sn=p∗; then,
By assumption, we have that limn→∞‖sn−p∗‖=0. On taking the limit as n→∞, limn→∞ϵn=0. Hence, the AG iterative scheme (2.9) is J-stable.
□
3.2. Weak convergence for Suzuki's generalized nonexpansive mapping
Before we continue with the next result in this section, it would be necessary to outline the following lemmas, as they will be important in proving subsequent results.
Lemma 3.1. Let D be a nonempty closed convex subset of a Banach space X and J:D→D be a Suzuki generalized nonexpansive mapping satisfying condition (C) with F(J)≠∅. Let {un}∞n=0 be a sequence generated by the AG iterative scheme (2.9) for u0∈D; then, limn→∞‖un−p∗‖ exists for all p∗∈F(J).
Proof. Let p∗∈F(J) and {un}∞n=0 for all n∈N. Since J is a Suzuki generalized nonexpansive mapping, by Lemma 2.7, we have that for x∈D and p∗∈F(J), ‖Jx−Jp∗‖≤‖x−p∗‖.
Using (2.9), we have
using (2.9) and (3.17), we have
and
And using (3.19) and (2.9), we have
Hence, {‖un−p∗‖} is bounded and a non-increasing sequence for p∗∈F(J). Therefore, limn→∞‖un−p∗‖ exists.
□
Lemma 3.2. Let D be a nonempty closed convex subset of a Banach space X. Assume that J:D→D is a Suzuki generalized nonexpansive mapping satisfying condition (C). Let {un}∞n=0 be a sequence generated by the AG iterative scheme (2.9). Then, F(J)≠∅ if and only if {un} is bounded and limn→∞‖Jun−un‖=0.
Proof. Suppose that F(J)≠∅ and p∗∈F(J). Then, by Lemma 3.1, we have that limn→∞‖un−p∗‖ exists and {un}∞n=0 is bounded.
Let
From (3.17), (3.18) and (3.19),
and
Since J satisfies condition (C), we have that
and
Now,
Taking the lim inf on both sides, we have
Thus, (3.23) and (3.25) will give
again,
Taking the lim inf on both sides, we have
Thus, (3.22) and (3.27) will give
and
Obviously,
Given that {βn}∈(0,1) and considering (3.29), it is convenient to have that
which results in
Taking the lim inf on both sides, we have
Thus, using (3.21) and (3.30), we have
and
From (3.31),
Therefore,
Using (3.20), (3.24), (3.32) and Lemma 2.2, we end by stating that limn→∞‖Jun−un‖=0. Conversely, suppose that {un} is bounded and limn→∞‖un−Jun‖=0. We want to show that F(J)≠∅. Let p∗∈A(D,{un}). By Lemma 2.3, we have that
It follows that Jp∗∈A(D,{un}). By Remark 2.1, we have that Jp∗=p∗. Hence the fixed point set F(J) is nonempty. □
At this point, we now consider the weak convergence result for a Suzuki generalized nonexpansive mapping satisfying condition (C).
Theorem 3.4. Let D be a nonempty closed convex subset of a uniformly convex Banach space X. Let J:D→D be a mapping satisfying condition (C). For any arbitrary u0∈D, the sequence {un}∞n=0 is generated by the AG iterative scheme (2.9) for n≥1, where {αn}, {βn} and {γn} are sequences of real numbers in [0,1] such that F(J)≠∅. Assume that X satisfies the Opial condition (2.2). Then, {un} converges weakly to the fixed point p∗∈F(J).
Proof. From Lemma 3.2, we have that {un} is bounded and limn→∞‖Jun−un‖=0 is subject to the fact that F(J)≠∅. Since X is uniformly convex, we can say that it is reflexive. By Eberlin's theorem there exists a subsequence {uni} of {un} such that uni⇀p1 for some p1∈D.
By Lemma 2.4, p1∈F(J). We want to prove that p1 is a weak limit of {un}, that is, {un} converges weakly to p1. On the contrary, suppose that {un} does not converge weakly to p1; then, we can construct another subsequence {unj} of {un} such that unj⇀p2 for some p2∈D and p1≠p2.
Again by Lemma 2.4, p2∈F(J). Since limn→∞‖un−p∗‖ exists for all p∗∈F(J), by Lemma 3.2 and Opial condition (2.2), we have
which is a contradiction. So p1=p2. This implies that {un} converges weakly to a fixed point of J, thereby completing the proof. □
3.3. Rate of convergence and data dependence result
Theorem 3.5. Let D be a nonempty closed convex subset of a Banach space X and J:D→D be a contraction mapping satisfying (2.1) with δ∈(0,1) such that F(J)≠∅. If {sn}, {pn}, {mn} and {un} are sequences respectively defined by the Picard-Mann, Thakur, M and AG iterative schemes converging to a fixed point p∗∈F(J). Then, the AG iterative scheme is faster than (2.4)–(2.6).
Proof. From (3.4) in Theorem 3.1, we have that
From Picard-Mann iterative scheme (2.4), we have
Now, by combining (3.34) and (3.35), we have
such that, by induction, we have
This implies that
From Thakur iterative scheme (2.5), we have
Combining (3.38) and (3.39), we have
Again, combining (3.37) and (3.40), we have
By induction,
From M iterative scheme (2.6), using the same approach as in (3.34)–(3.40), we have
and
Combining (3.43) and (3.44), we have
Combining (3.42) and (3.45), we have
Inductively,
such that
From (3.33), (3.36) and (3.46), let
Hence,
and
It can be concluded that the AG iterative scheme (2.9) converges to the fixed point p∗ faster than (2.4)–(2.6), thus completing the proof. □
Example 3.1. Let X=R and D=[0,20]⊆X. Let J:D→D be a mapping defined by Ju=√u2−9u+54 for all u∈D. Choose αn=βn=γn=34 for each n∈N with the initial value u0=10.J is a contraction mapping with contraction constant 92√54 and F(J)={6}. Tables 1 and 2 show that the AG fixed point iterative scheme (2.9) converges faster than the Picard-Mann, Mann, Thakur, Picard, Noor and M iterative schemes. Again, Figures 1 and 2 graphically display the fast convergence of the AG iterative scheme.
Remark 3.1. (1) The graphs in Figures 1 and 2 compare the rate of convergence of various iterative schemes based on the values in Tables 1 and 2 for Example 3.1. The values in Tables 1 and 2 marked in blue indicate the fixed point at each step, and it can be seen that different iterative schemes converge at different steps. Moreover, where there is no such indication implies that the iterative scheme converges at a step beyond 22. Consequently, our iterative scheme converging at Step 6 which is faster than the Picard-Mann (Step 13), Mann (not visible within 22 steps), Picard (Step 21), Noor (not visible within 22 steps), Thakur and M (Step 9) schemes.
Example 3.2. Let C=[1,6]⊆X=R and J:D→D be an operator defined by Ju=u2+1 for all u∈D. Choose αn=12, βn=13 and γn=14 for each n∈N with the initial value u0=2.5. J is a contraction mapping and the set of fixed points F(J)={2}. The values obtained via computation of the mapping for various iterative schemes are shown in Tables 3 and 4. And, the corresponding plots for the values are shown in Figure 3, indicating that the AG iterative converges faster than the Picard-Mann, Noor, Mann, Picard, M and Thakur iterative schemes.
Theorem 3.6. Let T be an approximate operator of J satisfying the contraction mapping condition (2.1). Let {un}∞n=0 be an iterative sequence generated by the AG iterative scheme (2.9) for J and define an iterative sequence {ϑ}∞n=0 as follows
where {αn}, {βn} and {γn} are real sequences in [0,1] satisfying the following conditions: (a) 12≤αn for all n∈N, and (b) ∞∑n=0αn=∞. If Jp∗=p∗ and T˜p∗=˜p∗ such that limn→∞ϑn=˜p∗, then we have that ‖p∗−˜p∗‖≤9ϵ1−δ where ϵ>0 is a fixed constant.
Proof. Using (2.1), (2.9) and (3.47), we have
putting (3.48) in (3.49), we have
putting (3.50) into (3.51) yields
Again,
Since δ∈[0,1) and αn,βn,γn∈[0,1], n∈N, then
and from assumption (a) where 1−αn≤αn, we have that
Let σn:=‖un−ϑn‖, ϖn:=αn(1−δ)∈(0,1) and ηn:=9ϵ(1−δ).
From Lemma 2.5, it follows that
From Theorem 3.1, we know that limn→∞un=p∗. Using this fact alongside the assumption that limn→∞ϑn=˜p∗, we obtain
This completes the proof. □
4.
Application to nonlinear fractional differential equations of Caputo type
The evolution of research involving fractional differential equations has been expansive since its discovery and the relevant significant studies in that area have been attributed to the fact that fractional differential equations have a wide range of applications in different domains. The extent of application of fractional differential equations include, but are not limited to the following areas: fluid flow, signal processing, electronics, biology, robotics, telecommunication systems, electrical networks, diffusive transport, traffic flow, gas dynamics, generalized Casson fluid modeling with heat generation and chemical reaction (see for example, [4,12,42,43,44] and the references therein).
We want to consider approximation of the solution of an NFDE of the Caputo type by using the AG fixed point iterative scheme (2.9).
To achieve our aim in this section, we consider the following NFDE of Caputo type with initial conditions:
where DCDζ is a Caputo fractional derivative of order ζ and f:[0,1]×R→R is a continuous function.
Let X=C[0,1] be a Banach space of continuous real functions from [0,1] into R, endowed with the usual supremum norm. The corresponding Green function associated with the NFDE (4.1) is given by
Lemma 4.1. Let X=C[0,1] be a Banach space with the supremum norm ‖⋅‖∞. Suppose that f:[0,1]×X→X is a continuous function; also, for δ∈(0,1), assume the following condition:
Theorem 4.1. Let X=C[0,1] be a Banach space endowed with the supremum norm as in Lemma 4.1. Let {un} be a sequence defined by AG iterative scheme (2.9) for the integral operator J:X→X defined by
∀t∈[0,1],∀y∈X. Suppose that condition (C1) of Lemma 4.1 is satisfied. Then the sequence defined by the AG iterative scheme (2.9) converges to the solution of problem (4.1).
Proof. It is obvious to note that y∈X is a solution of (4.1) if and only if y∈X is a solution of the integral equation
Let x,y∈X for all t∈[0,1]. Invoking Lemma 4.1, we have
Consequently, ‖Jy−Jz‖≤δ‖y−z‖. Therefore, J is a contraction mapping. By Theorem 3.1, the sequence {un}∞n=0 generated by the AG iterative scheme converges to a fixed point of J; hence, it converges to the solution of the NFDE (4.1). □
5.
Conclusions
We have been able to show that the AG iterative scheme converges faster than the Picard, Mann, Picard-Mann, Thakur, Noor and M iterative schemes through the example given in Section 3, with the results presented in Tables 1 and 2 and Figures 1 and 2. Weak convergence result of AG iterative scheme for a Suzuki generalized nonexpansive mapping was presented. Moreover, the stability and data dependence results have been proved for the new scheme. Finally, the new scheme has been applied to approximate the solution of an NFDE of the Caputo type. Our result has generalized and extended other existing results.
Use of AI tools declaration
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
Funding
This work was supported and funded by the Deanship of Scientific Research at Imam Mohammad Ibn Saud Islamic University (IMSIU) (grant number IMSIU-RG23140).
Acknowledgments
The authors wish to thank the editor and the reviewers for their useful comments and suggestions. This work was supported and funded by the Deanship of Scientific Research at Imam Mohammad Ibn Saud Islamic University (IMSIU) (grant number IMSIU-RG23140).
Conflicts of interest
The authors declare no conflict of interest.