Next Article in Journal
A Multi-Camera System-Based Relative Pose Estimation and Virtual–Physical Collision Detection Methods for the Underground Anchor Digging Equipment
Previous Article in Journal
Distributed Gradient Descent Framework for Real-Time Task Offloading in Heterogeneous Satellite Networks
Previous Article in Special Issue
Applying Theorems on b-Metric Spaces to Differential and Integral Equations Through Connected-Image Contractions
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Efficient Iterative Scheme for Approximating the Fixed Point of a Function Endowed with Condition (Bγ,μ) Applied for Solving Infectious Disease Models

by
Godwin Amechi Okeke
1,
Akanimo Victor Udo
1 and
Rubayyi T. Alqahtani
2,*
1
Functional Analysis and Optimization Research Group Laboratory (FANORG), Department of Mathematics, School of Physical Sciences, Federal University of Technology Owerri, P.M.B. 1526 Owerri, Imo State, Nigeria
2
Department of Mathematics and Statistics, College of Science, Imam Mohammad Ibn Saud Islamic University (IMSIU), Riyadh, Saudi Arabia
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(4), 562; https://doi.org/10.3390/math13040562
Submission received: 23 December 2024 / Revised: 20 January 2025 / Accepted: 3 February 2025 / Published: 8 February 2025
(This article belongs to the Special Issue Fixed Point, Optimization, and Applications II)

Abstract

:
The purpose of this paper is to construct a new fixed-point iterative scheme, called the Picard-like iterative scheme, for approximating the fixed point of a mapping that satisfies condition ( B γ , μ ) in the setting of a uniformly convex Banach space. We prove that this novel iterative scheme converges faster than some existing iterative schemes in the literature. Moreover, G -stability and almost G -stability results are proven. Furthermore, we apply our results for approximating the solution of an integral equation that models the spread of some infectious diseases. Similarly, we also applied the results for approximating the solution of the boundary value problem by embedding Green’s function in our novel method. Our results extend and generalize other existing results in the literature.

1. Introduction

Let D be a subset of a uniformly convex Banach space X. A self mapping G : D D is a mapping satisfying condition (C) on the subset D , if
1 2 x G x x y G x G y x y ,
for all x , y D .
The mapping satisfying condition (C) was introduced by Suzuki [1] in 2008 as an extension and generalization of nonexpansive mappings. Furthermore, this class of nonlinear mappings is known to be weaker than mappings with nonexpansiveness and stronger than mappings with quasi-nonexpansiveness.
In 2011, García-Falset et al. [2] introduced a more general mapping than the Suzuki’s mappings satisfying condition (C). It was described as a mapping satisfying condition (E) or the García-Falset mapping on D , and defined as
x G y μ x G x + x y
for all x , y D and μ 1 . Patir et al. [3], in 2018, introduced a class of generalized two-parameter nonexpansive mapping known as mapping satisfying condition ( B γ , μ ) , and proved that it was wider than mappings satisfying condition (C) of Suzuki [1]. This class of mapping is defined as follows:
Definition 1
([3]). Let D be a subset of a uniformly convex Banach space, X. A mapping G : D D satisfies condition ( B γ , μ ) if for any two elements x , y D , one can choose a γ [ 0 , 1 ] and some μ [ 0 , 1 2 ] with 2 μ γ , such that
γ x G x x y + μ y G y
implies
G x G y ( 1 γ ) x y + μ ( x G y + y G x ) .
Natural processes form the basis of understanding the world around us, encompassing phenomena such as the motion of objects, heat transfer, fluid dynamics, and more. These processes, governed by principles of motion and change, provide insights into the laws of nature and are essential for scientific and technological advancements. To describe such phenomena quantitatively, we rely on mathematical tools, with differential equations playing a central role.
Differential equations, whether ordinary or partial, of an integer or fractional order, allow us to model these processes mathematically. The classification of these equations depends on the order of the differential coefficient and the number of independent variables involved. Such equations are often accompanied by initial conditions or boundary conditions, leading to either initial value problems (IVPs) or boundary value problems (BVPs).
Once a natural phenomenon is modeled using differential equations, the next critical step is to determine its solution using appropriate mathematical methods, unlocking deeper understanding and practical applications.
Fixed-point theory is an important tool for solving differential equations, particularly for proving the existence and uniqueness of solutions, including the approximation of the solution through the use of an iterative scheme (see for example [4,5,6] and other literature). This theory revolves around the concept of obtaining a point x called the fixed point, such that G x = x for any mapping G : D D , where D X .
Fixed-point theory has been applied for solving several problems including BVP, which involves the use of Green’s function (see [7,8,9,10,11] and the references therein).
The objective of this work is to construct an effective fixed-point iterative scheme that performs better than some existing iterative schemes for a mapping satisfying condition ( B γ , μ ) in a way to generalize and extend them. We apply it for solving a third-order BVP via Green’s function with series of numerical examples and illustrations. Furthermore, we apply it for approximating the solution of an integral equation modeling the spread of certain infectious diseases with a periodic contact rate with seasonal variations.
The rest of this paper is arranged such that in Section 2, preliminary facts, definitions, and lemmas are presented. Section 3 contains the main results, which include weak and strong convergence theorems and where the stability/almost stability of the new iterative scheme are considered. In Section 4, the application of the new iterative scheme to an infectious disease model is considered. Section 5 applies a boundary value problem of the third order via Green’s function. Finally, Section 6 provides the conclusion.

2. Preliminaries

While fixed-point theory is very instrumental in proving the existence and uniqueness of solutions for differential equations transformed to an operator equation, it can also be used to approximate the solutions by using a fixed-point iterative scheme.
In 2018, Ullah and Arshad [12] introduced the M iterative scheme, as follows:
u 0 D w n = ( 1 α n ) u n + α n G u n v n = G w n u n + 1 = G v n , n N ,
where { α n } is a real sequence in [ 0 , 1 ] . The scheme was used to prove weak and strong convergence theorems for Suzuki-generalized nonexpansive mapping in the framework of uniformly convex Banach spaces.
Gürsoy et al. [13], in 2014, introduced an iterative scheme called the Picard-S, defined as follows:
u 0 D w n = ( 1 β n ) u n + β n G u n v n = ( 1 α n ) G u n + α n G w n u n + 1 = G v n , n N .
Abbas et al. (2022) [14] constructed the AA iterative scheme, which is defined as follows:
u 0 D x n = ( 1 α n ) u n + α n G u n w n = G [ ( 1 β n ) x n + β n G x n ] v n = G [ ( 1 γ n ) G x n + γ n G w n ] u n + 1 = G v n , n N .
They used this iterative scheme to approximate the fixed point of ( b , η ) -enriched contraction mapping in the framework of Banach spaces and applied it for approximating the solution to a delay fractional differential equation.
In 2018, Ullah and Arshad [15] proposed a new iteration process called the K iteration process, defined as:
u 0 D w n = ( 1 β n ) u n + β n G u n v n = G ( ( 1 α n ) w n + α n G w n ) u n + 1 = G v n , n N .
The authors used this iterative scheme to approximate the fixed point of a Suzuki-generalized nonexpansive mapping in the setting of uniformly convex Banach spaces.
Recently, in 2024, Ullah et al. [16] used the K iteration process (4) to approximate the fixed point of mapping, satisfying condition ( B γ , μ ) in the setting of Banach space.
Motiveted by the foregoing, we propose a new fixed-point iterative scheme called the Picard-like iterative scheme, as follows:
u 0 D x n = G [ ( 1 α n ) u n + α n G u n ] w n = G 2 x n v n = G 2 w n u n + 1 = G 2 v n , n N .
Next, we consider some definitions and lemmas that will be useful in the sequel.
Definition 2
([17,18]). Let D be a nonempty closed convex subset of a Banach space X and { u n } be a bounded sequence in X. For each u X , we define
(a) 
asymptotic radius of { u n } at u as a functional, R ( · , { u n } ) : X R + defined by R ( u , { u n } ) = lim sup n u u n ,
(b) 
asymptotic radius of { u n } relative to the set D by
R ( D , { u n } ) = inf { R ( u , { u n } ) : u D } , and
(c) 
asymptotic center of { u n } relative to the set X by
A ( D , { u n } ) = { u X : R ( u , { u n } ) = R ( D , { u n } ) } .
Definition 3
([18]). A Banach space X is said to satisfy the Opial condition [19] if, for each sequence { u n } in X, converging weakly to u X , we have
lim sup n u n u < lim sup n u n w ,
for all w X , such that u w .
Definition 4
([20]). A mapping G : D D with F ( G ) is said to satisfy condition (I) if there exists a nondecreasing function h : [ 0 , ) [ 0 , ) with h ( 0 ) = 0 , h ( s ) > 0 for s ( 0 , ) , such that u G u h ( ρ ( u , F ( G ) ) ) for all u D , where ρ ( u , F ( G ) ) = inf { u τ : τ F ( G ) } .
Definition 5
([21]). Let G : D G be an operator on a real Banach space X. Assume that u n B and u n + 1 = f ( G , u n ) defines an iterative scheme that generates a sequence { u n } n = 0 in D . Assume, furthermore, that { u n } n = 0 converges strongly to τ F ( G ) , where F ( G ) is the set of all fixed points of G . Assume that { s n } n = 0 is an arbitrary bounded sequence in X and set ϵ n = s n + 1 f ( G , s n ) . Then,
1. 
the iterative scheme { u n } n = 0 in a real Banach space X, defined by u n + 1 = f ( G , u n ) , is said to be G -stable or stable with respect to G if lim n ϵ n = 0 implies lim n p n τ = 0
2. 
the iterative scheme { u n } n = 0 defined by u n + 1 = f ( G , u n ) is said to be almost G -stable if n = 0 ϵ n < implies that lim n s n τ = 0 .
Lemma 1
([3]). Let D be a nonempty subset of a Banach space X with an Opial condition and G : D D is a mapping satisfying condition ( B γ , μ ). If τ is a fixed point of G , then for each x D ,
τ G x τ x .
Lemma 2
([22]). 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 { u n } n = 0 and { r n } n = 0 be sequences in X, such that lim sup n u n λ , lim sup n r n λ and lim sup n α n u n + ( 1 α n ) r n = λ for some λ 0 . Then, lim n u n r n = 0 .
Proposition 1
([3]). Let D be a nonempty subset of a Banach space X. Suppose that G : D D is a mapping satisfying condition ( B γ , μ ) on D . Then, for all x , y D and for 0 λ 1 ,
1. 
G x G 2 x x G x
2. 
at least one of the following holds:
(i) 
λ 2 x G x x y
(ii) 
λ 2 G x G 2 x G x y .
The condition ( i ) implies G x G y ( 1 λ 2 ) x y + μ ( x G y + y G x ) and condition ( i i ) implies G 2 x G y ( 1 λ 2 ) G x y + μ ( G x G y + y G 2 x ) .
3. 
x G y ( 3 λ ) x G x + ( 1 λ 2 ) x y + μ ( 2 x G x + x G y + y G x + 2 G x G 2 x )
Lemma 3
([23]). If ϖ [ 0 , 1 ] is a real number and { ϵ n } n = 0 is a sequence of positive numbers, such that lim n ϵ n = 0 , then for any sequence of positive numbers, { s n } n = 0 satisfying s n + 1 ϖ s n + ϵ n , ( n = 0 , 1 , 2 , ) , such that lim n s n = 0 .
Lemma 4
([24]). Let { η n } n = 0 and { ϵ n } n = 0 be sequences of nonnegative numbers and δ [ 0 , 1 ] , such that
η n + 1 = δ η n + ϵ n n 0 .
If n = 0 ϵ n < , then n = 0 η n < .
Lemma 5
([3]). Assume D is a nonempty subset of a Banach space X endowed with the Opial property. Assume G : D D is a mapping satisfying condition ( B γ , μ ) . If { u n } is a sequence in X, such that
1. 
{ u n } converges weakly to τ,
2. 
lim n G u n u n = 0 ,
then G τ = τ .
Proposition 2
([25]). Assume that D is any nonempty closed subset of a Banach space and { u n } be any Fejer-monotone sequence in the set D . Then, { u n } converges strongly to the point of D , if and only if lim n ρ ( u n , D ) = 0 .

3. Main Results

3.1. Weak and Strong Convergence Theorems

Before stating the main results of this section, it suffices to state and prove the following lemmas, which will be helpful for proving the main results.
Lemma 6.
Let D be a nonempty closed convex subset of a Banach space X and G : D D is a mapping satisfying condition ( B γ , μ ) with F ( G ) . Suppose { u n } is a sequence generated by the iterative scheme (5), then lim n u n τ exists for each τ F ( G ) .
Proof. 
Let τ F ( G ) be a fixed point. By Lemma 1, and using (5), we have,
x n τ = G [ ( 1 α n ) u n + α n G u n ] τ ( 1 α n ) u n + α n G u n τ ( 1 α n ) u n τ + α n G u n τ ( 1 α n ) u n τ + α n u n τ = u n τ .
Using (5) and (7)
w n τ = G [ G x n ] τ G x n τ x n τ = u n τ
and
v n τ = G [ G w n ] τ G w n τ w n τ
Combining (5), (8) and (9), we have
u n + 1 τ = G [ G v n ] τ G v n τ v n τ u n τ .
As we have shown that u n + 1 τ u n τ , it follows that { u n τ } is bounded and nonincreasing. Hence, for all τ F ( G ) , lim n u n τ exists, thereby completing the proof. □
Lemma 7.
Assume D is a nonempty closed convex subset of a uniformly convex Banach space X and G : D D is a mapping satisfying condition ( B γ , μ ) , if { u n } is a sequence generated by the iterative scheme (5). Then, F ( G ) if and only if { u n } is bounded and lim n G u n u n = 0 .
Proof. 
Suppose that F ( G ) and τ F ( G ) is a fixed point. Then, by Lemma 6, we have that lim n u n τ exists and { u n } is bounded.
Let ω be a real value,
lim n u n τ = ω
From (7)–(9) as in the proof of Lemma 6, together with (10), we have
lim sup n x n τ lim sup n u n τ ω ,
lim sup n w n τ lim sup n u n τ ω .
and
lim sup n v n τ lim sup n u n τ ω .
By Lemma 1, we have that
G u n τ u n τ ,
and
lim sup n G u n τ lim sup n u n τ = ω .
Now,
u n + 1 τ = G 2 v n τ G v n τ v n τ
Again from Lemma 1, together with (10), we have
ω = lim inf n u n + 1 τ lim inf n v n τ .
It can immediately follow from (13) and (17) that
ω = lim inf n v n τ lim sup n v n τ ω
and we have
lim n v n τ = ω
From (18), we also have
ω = lim inf n v n τ lim inf n w n τ ,
which follows that
ω lim inf n w n τ lim sup n w n τ ω .
lim n w n τ = ω
and
w n τ = G 2 x n τ G x n τ x n τ .
That is,
w n τ x n τ
Taking lim inf on both sides, we have
ω lim inf n w n τ lim inf n x n τ
Using (11) and (21), we have
ω lim inf n w n τ lim sup n x n τ ω
and
lim n x n τ = ω .
From (22)
ω = lim n x n τ = lim n G [ ( 1 α n ) u n + α n G u n ] τ lim n ( 1 α n ) u n + α n G u n τ lim n ( 1 α n ) ( u n τ ) + α n ( G u n τ ) .
With (10), (15) and (23) in sight and applying Lemma 2, it is clear that lim n G u n u n = 0 .
  • Conversely, assume that { u n } is bounded and lim n G u n u n = 0 . We can show that F ( G ) . To do that, let τ A ( D , { u n } ) . Applying (3) of Proposition 1 for γ = ω 2 , ω [ 0 , 1 ] ,
u n G τ ( 3 ω ) u n G u n + 1 ω 2 u n τ + μ ( 2 u n G u n + u n G τ + τ G u n + 2 G u n G 2 ) ( 3 ω ) u n G u n + 1 ω 2 u n τ + μ ( 2 u n G u n + u n G τ + u n τ + u n G u n + 2 G u n G 2 u n ) .
Again, by condition (2) of Proposition 1, it follows that
( 1 μ ) lim sup n u n G τ 1 ω 2 + μ lim sup n x n τ
or
lim sup n u n G τ 1 ω μ + μ 1 μ lim sup n x n τ
As 1 ω μ + μ 1 μ 1 , for 2 μ γ = ω 2 , then
lim sup n u n G τ lim sup n u n τ ,
it follows that
R ( G τ , { u n } ) R ( τ , { u n } ) .
That is, G τ A ( D , { u n } ) . As the set A ( D , { u n } ) is singleton, then, it follows that G τ = τ . Hence, completing the proof. □
Theorem 1.
Suppose D is a nonempty closed subset of a uniformly convex Banach space X satisfying the Opial condition (6). Assume G : D D is a mapping satisfying condition ( B γ , μ ) with F ( G ) . Then, the sequence { u n } n = 0 generated by the fixed-point iterative scheme (5) converges weakly to a fixed point, τ F ( G ) .
Proof. 
By Lemma 7, clearly, { u n } is bounded. As X is a uniformly convex Banach space, then it can obviously be reflexive. From the Eberlein theorem, there exists a convergent subsequence { u n k } of { u n } , such that u n k τ 1 for some τ 1 D (where ⇀ denotes weak convergence).
From the hypothesis of Lemma 7 lim k G u n k u n k = 0 and applying Lemma 5, we have that τ 1 F ( G ) .
We want to show that τ 1 is a weak limit of { u n } . We assume that τ 1 is the only weak limit of { u n } , that is { u n } converges weakly to τ 1 .
Suppose in the contrary that the claim does not hold, then we can construct another subsequence { u n l } of { u n } and further assume that it converges to another point τ 2 D , such that τ 1 τ 2 .
As in the previous claim, it follows that, τ 2 F ( G ) . From Lemma 6 and using the Opial condition (6) for Banach space, we have
lim n u n τ 1 = lim k u n k τ 1 < lim k u n k τ 2 = lim n u n τ 2 = lim l u n l τ 2 < lim l u n l τ 1 = lim n u n τ 1
Clearly, we obtain lim n u n τ 1 < lim n u n τ 1 , which is obviously a contradiction. Hence, τ 1 = τ 2 and the proof is complete. □
Theorem 2.
Assume D is a nonempty closed and convex subset of a uniformly convex Banach space X, and suppose that G : D D is a mapping satisfying condition ( B γ , μ ) with F ( G ) . If { u n } n = 0 is a sequence generated by the iterative scheme (5). Then, { u n } n = 0 converges strongly to a fixed point τ F ( G ) provided that the mapping satisfies condition ( I ) .
Proof. 
For the fact that G satisfies condition ( I ) , we have that lim n ρ ( u n , F ( G ) ) = 0 .
We are to show that F ( G ) is closed. To do so, we assume that { t n } is an arbitrary sequence in F ( G ) and it converges to some point t D . As γ t n G t n t n t + μ t G t n , by condition ( B γ , μ ) , we obtain
t n G t = G t n G t ( 1 γ ) t n t + μ ( t n G t + t G t n ) = ( 1 γ ) t n t + μ t n G t + μ t G t n .
This implies that as 2 μ < γ , we have
t n G t 1 γ + μ 1 μ t n t t n t .
Hence, t n G t . This follows that G t = t and, as such, t F ( G ) . Therefore, F ( G ) is closed.
  • By the hypothesis of Lemma 6, we have that { u n } is Fejer-monotone with respect to F ( G ) . Again, from Proposition 2, { u n } converges strongly to a fixed point in F ( G ) . □
Theorem 3.
Let G : D D be a mapping satisfying condition ( B γ , μ ) defined on a nonempty closed convex subset D of a uniformly convex Banach space X, such that F ( G ) . If { u n } is a sequence generated by (5), then { u n } converges to a fixed point of G if and only if lim inf n u n F ( G ) = 0 .
Proof. 
If the sequence { u n } converges to a fixed point τ F ( G ) , then
lim inf n u n τ = 0
so that
lim inf n u n F ( G ) = 0 .
Conversely, suppose that lim inf n u n F ( G ) = 0 . From Lemma 6, it is clear that
u n + 1 τ u n τ , for any τ F ( G )
and we have
u n + 1 F ( G ) u n F ( G ) .
It follows that u n F ( G ) forms a decreasing sequence that is bounded below by zero and it is guaranteed that lim n u n F ( G ) exists.
As lim inf n u n F ( G ) = 0 , so is lim n u n F ( G ) = 0 as well.
Now, it is our aim to show that { u n } is a Cauchy sequence in D . Given ϵ > 0 as any arbitrary number, there exists n 0 N , such that for all n n 0 , we obtain
ρ ( u n , F ( G ) ) < ϵ 4 .
In particular,
inf { ρ ( u n 0 , τ ) : τ F ( G ) } < ϵ 4 ,
so that there exists a τ F ( G ) such that
u n 0 τ < ϵ 2 .
Hence, for m , n n 0 , we obtain
u n + m u n u n + m τ + u n τ u n 0 τ + u n 0 τ = 2 u n 0 τ < 2 ϵ 2 = ϵ
which shows that { u n } is a Cauchy sequence in D .
As D is a closed subset of a Banach space X, D is also a Banach space and it follows that { u n } must converge to some point u D .
As lim n ρ ( u n , F ( G ) ) = 0 , which gives ρ ( u , F ( G ) ) . Therefore, F ( G ) is closed and so u F ( G ) . □

3.2. Stability and Almost Stability Results

Theorem 4.
Let X be a Banach space. Suppose G : D D is a mapping satisfying condition ( B γ , μ ) with fixed point τ F ( G ) . Furthermore, suppose that { u n } is a sequence generated by the iterative scheme (5) and converges to the fixed point τ . Then, (5) is stable with respect to the mapping G .
Proof. 
Let { s n } be an arbitrary sequence in D and let the sequence generated by the iterative scheme (5) be u n + 1 = f ( G , u n ) and it converges to a unique fixed point τ .
  • Let ϵ n = s n + 1 f ( G , s n ) . We show that lim n ϵ n = 0 if and only if
lim n s n τ = 0 .
Set
u n = G s n .
Suppose lim n ϵ n = 0 ,
s n + 1 τ = s n + 1 f ( G , s n ) + f ( G , s n ) τ s n + 1 f ( G , s n ) + f ( G , s n ) τ = ϵ n + f ( G , s n ) τ ϵ n + G 2 v n τ ϵ n + G v n τ ϵ n + v n τ ,
but
v n τ = G 2 w n τ G w n τ w n τ ,
and
w n τ = G 2 x n τ G x n τ x n τ ,
moreover,
x n τ = G [ ( 1 α n ) u n + α n G u n ] τ ( 1 α n ) u n + α n G u n τ ( 1 α n ) u n τ + α n G u n τ ( 1 α n ) u n τ + α n u n τ = u n τ = G s n τ s n τ .
Combining (25)–(27), we have
v n τ s n τ .
Putting (28) in (24)
s n + 1 τ ϵ n + s n τ .
By Lemma 3, we have lim n s n τ = 0 .
Conversely, suppose lim n s n τ = 0 , then
ϵ n = s n + 1 f ( G , s n ) s n + 1 τ + τ f ( G , s n ) s n + 1 τ + τ f ( G , s n ) s n + 1 τ + τ G 2 v n = s n + 1 τ + G 2 v n τ s n + 1 τ + G v n τ s n + 1 τ + v n τ s n + 1 τ + G 2 w n τ s n + 1 τ + G w n τ s n + 1 τ + w n τ s n + 1 τ + G 2 x n τ s n + 1 τ + G x n τ s n + 1 τ + x n τ s n + 1 τ + G [ ( 1 α n ) u n + α n G u n ] τ s n + 1 τ + ( 1 α n ) u n + α n G u n τ s n + 1 τ + ( 1 α n ) u n τ + α n u τ s n + 1 τ + u n τ s n + 1 τ + s n τ .
Taking limit as n on both sides and taking cognizance that lim n s n τ = 0 . Hence, the fixed-point iterative scheme is stable with respect to the mapping G . □
Next is the almost G -stability result.
Theorem 5.
Let X, D and G be the same as used in Theorem 4 with G being a mapping that satisfies condition ( B γ , μ ) for F ( G ) . Then the iterative scheme (5) is almost G -stable.
Proof. 
Let { s n } be an approximate sequence of { u n } in D . Assume that the iterative scheme (5) is represented as u n + 1 = f ( G , u n ) and it converges to a fixed point τ and let ϵ n = s n + 1 f ( G , s n ) , n N .
We are to prove that n = 0 ϵ n < implies lim n s n τ = 0 .
Let n = 0 ϵ n < , then by (5), we obtain:
s n + 1 τ = s n + 1 f ( G , s n ) + f ( G , s n ) τ s n + 1 f ( G , s n ) + f ( G , s n ) τ ϵ n + f ( G , s n ) τ ϵ n + G 2 v n τ ϵ n + G v n τ ϵ n + v n τ ϵ n + G 2 w n τ ϵ n + G w n τ ϵ n + w n τ ϵ n + G 2 x n τ ϵ n + G x n τ ϵ n + x n τ ϵ n + G [ ( 1 α n ) u n + α n G u n ] τ ϵ n + ( 1 α n ) u n + α n G u n τ ϵ n + ( 1 α n ) u n τ + α n G u n τ ϵ n ( 1 α n ) u n τ + α n u n τ = ϵ n + u n τ ϵ n + s n τ .
Set η n = s n τ , then η n + 1 < η n + ϵ n .
As n = 0 ϵ n < , then by Lemma 4, we have n = 0 η n < . It follows that lim n η n = 0 , that is, lim n s n τ = 0 . Therefore, the proof is complete. □

3.3. Numerical Example

Here, we provide an example of a mapping that satisfies condition ( B γ , μ ) , specifically for when γ = 1 and μ = 1 2 . Furthermore, this example is used to compare the rate of convergence of our iterative scheme (5) with all of AA, K*, M, and Picard-S iterative schemes for α n = β n = γ n = 4 5 . Table 1 and Figure 1 below shows a comparison of the rate of convergence of the mentioned iterative schemes with our new scheme in line with Example 1 below.
Example 1.
Define a mapping G : [ 5 , 7 ] [ 5 , 7 ] as follows
G u = u + 5 2 , if u 7 5 , if u = 7 .
We want to show that the mapping satisfies condition ( B γ , μ ) . If γ = 1 and μ = 1 2 , then our aim is to show that G satisfies condition ( B 1 , 1 2 ) .
Case A 
For u , v [ 5 , 7 ) , we obtain
( 1 γ ) | u v | + μ ( | u G v | + | v G u | ) = 1 2 ( | u G v | + | v G u | ) = 1 2 | u ( v + 5 2 ) | + | v ( u + 5 2 ) | 1 2 | 3 u 2 3 v 2 | = 3 4 | u v | 1 2 | u v | = | G u G v |
Case B 
For u [ 5 , 7 ] and y = 7 , we obtain
( 1 γ ) | u v | + μ ( | u G v | + | v G u | ) = 1 2 ( | u G v | + | v G u | ) = 1 2 ( | u 5 | + | v ( u + 5 2 ) | ) = 1 2 | u 5 | + 1 2 | v ( u + 5 2 ) | 1 2 | u 5 | = | G u G v |
Case C 
For u = v = 7 , we obtain
( 1 γ ) | u v | + μ ( | u G v | + | v G u | ) 0 = | G u G v | .
We can conclude that G satisfies condition ( B 1 , 1 2 ) .

4. Application to Infectious Diseases Model

Mathematical models for the transmission of infectious diseases are essential tools for understanding how diseases spread within populations and for designing effective intervention strategies. These models range from simple to highly complex, depending on the disease, population structure, and the level of detail required. Some of such models include; the SIR model, SEIR model, SIS model, stochastic model, and network models. In [26,27,28], the following nonlinear integral equation
u ( t ) = t λ t f ( s , u ( s ) ) d s
was presented to represent a model for the spread of certain infectious diseases with a periodic contact rate that varies according to season, where u ( t ) is the demography of the population infected (also known as the infective class) with the disease at time t, f ( t , u ( t ) ) is the new infective population per unit time (i.e., f ( t , 0 ) = 0 ), and λ is period of time an individual remains infectious and continue spreading the disease.
To analyze the existence of solution of (29), let t [ 0 , η ] and X = ( [ 0 , η ] , R ) be a Banach space with supremum norm
u = sup t [ 0 , η ] { | u ( t ) | : u X } ,
such that u 1 u 2 = sup t [ 0 , η ] { | u 1 ( t ) u 2 ( t ) | } .
To continue, we define an operator G : X X by
G u ( t ) = t λ t f ( s , u ( s ) ) d s .
Furthermore, f satisfies the following conditions:
(C1
f : R × R + R + is continuous,
(C2
f ( t , s ) = f ( t + η , s ) , t R , s 0 ,
(C3
| f ( s , u 1 ( t ) ) f ( s , u 2 ( t ) ) | | u 1 ( t ) u 2 ( t ) | , u 1 , u 2 X .
Remark 1.
The operator (30) clearly satisfies the ( B γ , μ ) condition, as defined in Definition 1 for x , y D , provided that f ( s , u ) satisfies Lipschitz condition with respect to the second variable, u with a Lipschitz constant L > 0 and s [ t λ , t ] . For the second part of the condition, one may choose γ = 1 L λ (for L λ < 1 ) and μ = γ 2 .
Theorem 6.
Suppose conditions ( C 1 ) ( C 3 ) are satisfied. Let λ [ 0 , 1 ] , { α n } ( 0 , 1 ) is a real sequence of the iterative scheme (5) such that n = 0 α n = . The nonlinear integral equation model (29) has a solution ℓ and the iterative scheme (5) converges to a fixed point ℓ.
Proof. 
Recall X = ( [ 0 , η ] , R ) and u = sup t [ 0 , η ] { | u ( t ) | : u X } .
Let { u n } be a sequence generated by the iterative scheme (5) for the operator G : X X defined by (30), i.e.,
G u ( t ) = t λ t f ( s , u ( s ) ) d s .
It is our aim to show that { u n } converges to as n .
From (5), (30) and condition ( C 1 ) ( C 3 ) , we have
x n = G [ ( 1 α n ) u n + α n G u n ] = G [ ( 1 α n ) u n + α n G u n ] G ( 1 α n ) u n + α n G u n ( 1 α n ) u n + α n G u n = ( 1 α n ) u n + α n G u n G ( 1 α n ) u n + α n sup t [ 0 , η ] | G u n G | ( 1 α n ) u n + α n sup t [ 0 , η ] | t λ t f ( s , u n ( s ) ) d s t λ t f ( s , ( s ) ) d s | = ( 1 α n ) u n + α n sup t [ 0 , η ] | t λ t f ( s , u n ( s ) ) f ( s , ( s ) ) d s | = ( 1 α n ) u n + α n sup t [ 0 , η ] t λ t | f ( s , u n ( s ) ) f ( s , ( s ) ) | d s ( 1 α n ) u n + α n sup t [ 0 , η ] t λ t | u n ( s ) ( s ) | d s ( 1 α n ) u n + α n λ u n = [ 1 ( 1 λ ) α n ] u n
using (5)
w n = G 2 x n G x n = G x n G sup t [ 0 , η ] | G x n ( t ) G ( t ) | sup t [ 0 , η ] | t λ t f ( s , x n ( s ) ) d s t λ t f ( s , ( s ) ) d s | = sup t [ 0 , η ] | t λ t f ( s , x n ( s ) ) f ( s , ( s ) ) d s | = sup t [ 0 , η ] t λ t | f ( s , x n ( s ) ) f ( s , ( s ) ) | d s sup t [ 0 , η ] t λ t | x n ( s ) ( s ) | d s λ x n
again, using (5)
v n = G 2 w n G w n = G w n G sup t [ 0 , η ] | G w n ( t ) G ( t ) | sup t [ 0 , η ] | t λ t f ( s , w n ( s ) ) d s t λ t f ( s , ( s ) ) d s | sup t [ 0 , η ] | t λ t f ( s , w n ( s ) ) f ( s , ( s ) ) d s | = sup t [ 0 , η ] t λ t | f ( s , w n ( s ) ) f ( s , ( s ) ) | d s sup t [ 0 , η ] t λ t | w n ( s ) ( s ) | d s λ w n
using (5)
u n + 1 = G 2 v n G v n = G v n G sup t [ 0 , η ] | G v n ( t ) G ( t ) | sup t [ 0 , η ] | t λ t f ( s , v n ( s ) ) d s t λ t f ( s , ( s ) ) d s | sup t [ 0 , η ] | t λ t f ( s , v n ( s ) ) f ( s , ( s ) ) d s | = sup t [ 0 , η ] t λ t | f ( s , v n ( s ) ) f ( s , ( s ) ) | d s sup t [ 0 , η ] t λ t | v n ( s ) ( s ) | d s λ v n
Combining (31)–(34), we have
u n + 1 = λ 3 [ 1 ( 1 λ ) α n ] u n [ 1 ( 1 λ ) α n ] u n .
By induction, we have
u n + 1 u 0 k = 0 n [ 1 ( 1 λ ) α k ] .
From basic analysis, we recall that 1 x e x for x [ 0 , 1 ] , so that
u n + 1 u 0 e ( 1 λ ) k = 0 n α k .
Taking limit as n , we have that lim n u n = 0 . Thereby. completing the proof. □

5. Application to Boundary Value Problem of Third Order via Green’s Function

5.1. Construction of Green’s Function

Consider a third-order boundary value problem (BVP);
g 1 ( t ) h ( t ) + q 2 ( t ) h ( t ) + q 3 ( t ) h ( t ) + q 4 ( t ) h ( t ) = Ψ ( t )
for a t b , with the following boundary conditions (BCs);
B λ 1 [ h ] = ζ 1 h ( λ 1 ) + ζ 2 h ( λ 1 ) + ζ 3 h ( λ 1 ) = ζ B λ 2 [ h ] = η 1 h ( λ 2 ) + η 2 h ( λ 2 ) + η 3 h ( λ 2 ) = η B λ 3 [ h ] = ξ 1 h ( λ 3 ) + ξ 2 h ( λ 3 ) + ξ 3 h ( λ 3 ) = ξ
for λ 3 = λ 2 or λ 3 = λ 1 . Equation (36) can be shortened to:
L [ h ] = Ψ ( t )
where L [ h ] is linear and the right-hand side can be written as Ψ ( t , h ( t ) , h ( t ) , h ( t ) ) . The right-hand side could be linear or nonlinear. For the BCs, ζ , η and ξ are constants.
If the homogeneous part of (36) (i.e., L [ h ] = 0 ) is solved, then three linearly independent complementary solutions h 1 , h 2 and h 3 can be obtained and can subsequently be used to construct the Green’s function, which is a piecewise function defined as a linear combination of the linearly independent solutions h 1 , h 2 and h 3 ; thus,
G ( t , s ) = k 1 h 1 + k 2 h 2 + k 3 h 3 , a < t < s l 1 h 1 + l 2 h 2 + l 3 h 3 , s < t < b
where k 1 , k 2 , k 3 , l 1 , l 2 , l 3 are constants whose real values can be obtained using the following axioms;
(A1
G ( t , s ) satisfies the associated boundary conditions;
B λ 1 [ G ( t , s ) ] = B λ 2 [ G ( t , s ) ] = B λ 3 [ G ( t , s ) ] = 0
(A2
G ( t , s ) is continuous at t = s , that is
k 1 h 1 ( s ) + k 2 h 2 ( s ) + k 3 h 3 ( s ) = l 1 h 1 ( s ) + l 2 h 2 ( s ) + l 3 h 3 ( s )
(A3
G ( t , s ) is continuous at t = s , that is
k 1 h 1 ( s ) + k 2 h 2 ( s ) + k 3 h 3 ( s ) = l 1 h 1 ( s ) + l 2 h 2 ( s ) + l 3 h 3 ( s )
(A4
G ( t , t ) has jump disconttinuity at t = s ;
k 1 h 1 ( s ) + k 2 h 2 ( s ) + k 3 h 3 ( s ) + 1 g ( s ) = l 1 h 1 ( s ) + l 2 h 2 ( s ) + l 3 h 3 ( s ) .
If the Green function, G ( t , s ) can solve the BVP, (36), then it will satisfy the equation,
L [ G ( t , s ) ] = δ ( t s )
subject to the homogeneous boundary conditions
B λ 1 [ G ( t , s ) ] = B λ 2 [ G ( t , s ) ] = B λ 3 [ G ( t , s ) ] = 0 ,
where δ is the Kronecker Delta.

5.2. Picard-like-Green Iterative Scheme

To construct the New Picard-like-Green iterative scheme, we embed the Green’s function in the Picard-like fixed-point iterative scheme (5).
To do this, we begin by considering the following nonlinear boundary value problem
L [ h ] + N [ h ] = Ψ ( t , h )
where L [ h ] is linear in h, N [ h ] is nonlinear in h, and Ψ ( t , h ) is a function in h that could be either linear or nonlinear.
The general solution of (40) can be expressed as h = h c + h p , with h c being the complementary solution subject to the homogeneous part, L [ h ] = 0 of (40) with regards to the boundary conditions mentioned in axiom ( A 1 ) . Furthermore, h g is a particular solution of the nonhomogeneous part of (40).
Next, we define an integral operator in terms of Green’s function, G ( t , s ) and the particular solution, h p :
H [ h p ] = a b G ( t , s ) L [ h p ] d s .
Remark 2.
Observe that the operator H [ h p ] ( t ) = a b G ( t , s ) L [ h p ] ( s ) d s of Equation (41) satisfies condition ( B γ , μ ) , provided that:
(a) 
the kernel, G ( t , s ) which represents the Green function is bounded,
(b) 
L is a bounded linear operator, and
(c) 
one can choose γ = 1 λ and μ = γ 2 for λ = M ( b a ) < 1 where M is a bound for G ( t , s ) (i.e., | G ( t , s ) M | ) and L , > 0 .
For convenience, let h p be simply h, so that (41) becomes
H [ h ] = a b G ( t , s ) L [ h ] d s
Clearly, h is a fixed point if and only if h is the solution to Equation (40).
Let
h = a b G ( t , s ) [ Ψ ( t , h ) N [ h ] ] d s ,
then
H [ h ] = a b G ( t , s ) [ L [ h ] + N [ h ] Ψ ( t , h ) N [ h ] + Ψ ( t , h ) ] d s a b G ( t , s ) [ L [ h ] + N [ h ] Ψ ( t , h ) ] d s + a b G ( t , s ) [ Ψ ( t , h ) N [ h ] ] d s = h + a b G ( t , s ) [ L [ h ] + N [ h ] Ψ ( t , h ) ] d s .
Applying the new iterative scheme (5), we obtain
u 0 D x n = H [ ( 1 α n ) u n + α n H u n ] w n = H 2 x n v n = H 2 w n u n + 1 = H 2 v n , n N
wher { α n } is a real sequence in ( 0 , 1 ) .
If (43) is expanded with regards to (42), we have
x n = [ ( 1 α n ) u n + α n H u n ] + a b G ( t , s ) [ L [ ( 1 α n ) u n + α n H u n ] + N [ ( 1 α n ) u n + α n H u n ] Ψ ( t , [ ( 1 α n ) u n + α n H u n ] ) ] d s = ( 1 α n ) u n + α n { u n + a b G ( t , s ) [ L [ u n ] + N [ u n ] Ψ ( t , u n ) ] d s } + a b G ( t , s ) [ L [ ( 1 α n ) u n + α n { u n + a b G ( t , s ) [ L [ u n ] + N [ u n ] Ψ ( t , u n ) ] d s } ] + N [ ( 1 α n ) u n + α n { u n + a b G ( t , s ) [ L [ u n ] + N [ u n ] Ψ ( t , u n ) ] d s } ] Ψ ( t , [ ( 1 α n ) u n + α n { u n + a b G ( t , s ) [ L [ u n ] + N [ u n ] Ψ ( t , u n ) ] d s } ] ) ] d s = u n + α n a b G ( t , s ) [ L [ u n ] + N [ u n ] Ψ ( t , u n ) ] d s + a b G ( t , s ) [ L [ u n + α n a b G ( t , s ) [ L [ u n ] + N [ u n ] Ψ ( t , u n ) ] d s ] + N [ u n + α n a b G ( t , s ) [ L [ u n ] + N [ u n ] Ψ ( t , u n ) ] d s ] Ψ ( t , u n + a b G ( t , s ) [ L [ u n ] + N [ u n ] Ψ ( t , u n ) ] d s ) ] d s
w n = H [ x n + a b G ( t , s ) [ L [ x n ] + N [ x n ] Ψ ( t , x n ) ] d s ] = x n + a b G ( t , s ) [ L [ x n ] + N [ x n ] Ψ ( t , x n ) ] d s + a b G ( t , s ) [ L [ x n + a b G ( t , s ) [ L [ x n ] + N [ x n ] Ψ ( t , x n ) ] d s ] + N [ x n + a b G ( t , s ) [ L [ x n ] + N [ x n ] Ψ ( t , x n ) ] d s ] Ψ ( t , H x n ) ] d s
v n = H [ w n + a b G ( t , s ) [ L [ w n ] + N [ w n ] Ψ ( t , w n ) ] d s ] = w n + a b G ( t , s ) [ L [ w n ] + N [ w n ] Ψ ( t , w n ) ] d s + a b G ( t , s ) [ L [ w n + a b G ( t , s ) [ L [ w n ] + N [ w n ] Ψ ( t , w n ) ] d s ] + N [ w n + a b G ( t , s ) [ L [ w n ] + N [ w n ] Ψ ( t , w n ) ] d s ] Ψ ( t , H w n ) ] d s
u n + 1 = H [ v n + a b G ( t , s ) [ L [ v n ] + N [ v n ] Ψ ( t , v n ) ] d s ] = v n + a b G ( t , s ) [ L [ v n ] + N [ v n ] Ψ ( t , v n ) ] d s + a b G ( t , s ) [ L [ v n + a b G ( t , s ) [ L [ v n ] + N [ v n ] Ψ ( t , v n ) ] d s ] + N [ v n + a b G ( t , s ) [ L [ v n ] + N [ v n ] Ψ ( t , v n ) ] d s ] Ψ ( t , H v n ) ] d s
This can summarily be written as:
x n = u n + α n a b G ( t , s ) [ L [ u n ] + N [ u n ] Ψ ( t , u n ) ] d s + a b G ( t , s ) [ L [ u n + α n a b G ( t , s ) [ L [ u n ] + N [ u n ] Ψ ( t , u n ) ] d s ] + N [ u n + α n a b G ( t , s ) [ L [ u n ] + N [ u n ] Ψ ( t , u n ) ] d s ] Ψ ( t , u n + a b G ( t , s ) [ L [ u n ] + N [ u n ] Ψ ( t , u n ) ] d s ) ] d s w n = x n + a b G ( t , s ) [ L [ x n ] + N [ x n ] Ψ ( t , x n ) ] d s + a b G ( t , s ) [ L [ x n + a b G ( t , s ) [ L [ x n ] + N [ x n ] Ψ ( t , x n ) ] d s ] + N [ x n + a b G ( t , s ) [ L [ x n ] + N [ x n ] Ψ ( t , x n ) ] d s ] Ψ ( t , H x n ) ] d s v n = w n + a b G ( t , s ) [ L [ w n ] + N [ w n ] Ψ ( t , w n ) ] d s + a b G ( t , s ) [ L [ w n + a b G ( t , s ) [ L [ w n ] + N [ w n ] Ψ ( t , w n ) ] d s ] + N [ w n + a b G ( t , s ) [ L [ w n ] + N [ w n ] Ψ ( t , w n ) ] d s ] Ψ ( t , H w n ) ] d s u n + 1 = v n + a b G ( t , s ) [ L [ v n ] + N [ v n ] Ψ ( t , v n ) ] d s + a b G ( t , s ) [ L [ v n + a b G ( t , s ) [ L [ v n ] + N [ v n ] Ψ ( t , v n ) ] d s ] + N [ v n + a b G ( t , s ) [ L [ v n ] + N [ v n ] Ψ ( t , v n ) ] d s ] Ψ ( t , H v n ) ] d s

5.3. Convergence Analysis

We can now find the solution for the BVP via Green’s function by showing the convergence analysis of our iterative scheme, the Picard like-Green scheme (43). This can be achieved by considering the following third-order BVP;
h ( t ) = Ψ ( t , h ( t ) , h ( t ) , h ( t ) )
with BCs
h ( 1 ) = K 1 , h ( 1 ) = K 2 , h ( 2 ) = K 3 .
We obtain the Green’s function by solving the homogeneous equation h ( t ) = 0 . The Green’s function is given as follows:
G ( t , s ) = k 1 t 2 + k 2 t + k 3 , 1 t s 2 l 1 t 2 + l 2 t + l 3 , 1 s t 2
The real values of k i , l i ( i = 1 , 2 , 3 ) can be obtained by applying axioms ( A 1 ) ( A 4 ) , so that (45) becomes
G ( t , s ) = s 2 2 + 2 s 2 + ( s 2 2 2 s + 2 ) t , 1 t s 2 s 2 + 2 s 2 + ( s 2 2 s + 2 ) t 1 2 t 2 , 1 s t 2 .
Next, we redefine the Picard-like-Green iterative scheme (43) as
x n = G G [ ( 1 α n ) u n + α n G G u n ] w n = G G 2 x n v n = G G 2 w n u n + 1 = G G 2 v n
where the operator G G : C 2 ( [ 1 , 2 ] ) C 2 ( [ 1 , 2 ] ) is defined as
G G = u + 1 2 G ( t , s ) ( u Ψ ( s , u , u , u ) ) d s
The initial iterate, u 0 of (47) satisfies the equation u 0 = 0 with BCs; u 0 ( 1 ) = K 1 , u 0 ( 1 ) = K 2 and u 0 ( 2 ) = K 3 .
If we apply integration by part three times to 1 2 G ( t , s ) u ( s ) d s , as it appears in (48) and keeping in mind that 1 2 3 G ( t , s ) s 3 u ( s ) d s = 1 2 δ ( x s ) u ( s ) d s , we have that
G G ( u ) = ( 2 t ) K 1 + 1 2 ( t 2 3 t + 2 ) K 2 + ( t 1 ) K 3 1 2 G ( t , s ) Ψ ( s , u , u , u ) d s .
Furthermore, we want to show that the operator G G is a contraction on the Banach space C 2 ( [ 1 , 2 ] ) with respect to the norm
u C 2 = i = 0 2 sup s [ 1 , 2 ] | u ( i ) ( s ) |
under certain conditions on Ψ . Particularly, we prove that G G is a Zamfirescu operator under certain conditions on Ψ .
Theorem 7.
Assume Ψ as in G G , satisfies the Lipschitz condition
| Ψ ( s , u , u , u ) Ψ ( s , m , m , m ) | σ 1 | u ( s ) m ( s ) | + σ 2 | u ( s ) m ( s ) | + σ 3 | u ( s ) m ( s ) |
where σ 1 , σ 2 and σ 3 are positive constants, such that
1 8 max { σ 1 , σ 2 , σ 3 } 1 .
The operator G G is a contraction on the Banach space C 2 ( [ 1 , 2 ] , · C 2 ) , and the sequence { u n } defined by (5) converges strongly to the fixed point of G G .
Proof. 
Let u 1 , u 2 C 2 ( [ 1 , 2 ] ) , so that by (49), we have
| G G ( u 1 ) G G ( u 2 ) | = | 1 2 G ( t , s ) Ψ ( s , u 1 , u 1 , u 1 ) d s 1 2 G ( t , s ) Ψ ( s , u 2 , u 2 , u 2 ) d s | = | 1 2 G ( t , s ) [ Ψ ( s , u 1 , u 1 , u 1 ) Ψ ( s , u 2 , u 2 , u 2 ) ] d s | 1 2 | G ( t , s ) | | [ Ψ ( s , u 1 , u 1 , u 1 ) Ψ ( s , u 2 , u 2 , u 2 ) ] | d s sup [ 1 , 2 ] × [ 1 , 2 ] | G ( t , s ) | 1 2 | [ Ψ ( s , u 1 , u 1 , u 1 ) Ψ ( s , u 2 , u 2 , u 2 ) ] | d s = G ( 3 4 , 1 ) 1 2 | [ Ψ ( s , u 1 , u 1 , u 1 ) Ψ ( s , u 2 , u 2 , u 2 ) ] | d s = 1 8 1 2 | [ Ψ ( s , u 1 , u 1 , u 1 ) Ψ ( s , u 2 , u 2 , u 2 ) ] | d s 1 8 1 2 σ 1 | u 1 ( s ) u 2 ( s ) | + σ 2 | u 1 ( s ) u 2 ( s ) | + σ 3 | u 1 ( s ) u 2 ( s ) | d s 1 8 max { σ 1 , σ 2 , σ 3 } 1 2 i = 1 2 | u 1 ( i ) ( s ) u 2 ( i ) ( s ) | d s 1 8 max { σ 1 , σ 2 , σ 3 } u 1 u 2 C 2 < u 1 u 2 C 2
which shows that G G is a contraction.
Again, we prove that the sequence { u n } generated by the Picard-like iterative scheme (5) converges strongly to the fixed point of the operator, G G .
As G G is a contraction as shown above, it is guaranteed from the Banach contraction principle that there exists a unique fixed point, τ of G G in the Banach space C 2 ( [ 1 , 2 ] , · C 2 ) . Then, what is left is to show that lim n = 0 . From (47), we have
x n τ = G G [ ( 1 α n ) u n + α n G G u n ] τ δ ( 1 α n ) u n + α n G G u n τ δ ( 1 α n ) u n τ + δ α n G G u n τ δ ( 1 α n ) u n τ + δ 2 α n u n τ = [ δ ( 1 α n ) + δ 2 α n ] u n τ = δ [ 1 ( 1 δ ) α n ] u n τ
w n τ = G G 2 x n τ δ G G x n τ δ 2 x n τ
v n τ = G G 2 w n τ δ G G w n τ δ 2 w n τ
u n + 1 τ = G G 2 v n τ δ G G v n τ δ 2 v n τ .
Combining (50) and (51), we have;
w n τ δ 3 [ 1 ( 1 δ ) α n ] u n τ
Putting (54) in (52),
v n τ δ 5 [ 1 ( 1 δ ) α n ] u n τ
Combining (53) and (55), we have
u n + 1 τ δ 7 [ 1 ( 1 δ ) α n ] u n τ .
Inductively,
u n + 1 τ δ 7 ( n + 1 ) [ 1 ( 1 δ ) α n ] u 0 τ δ 7 ( n + 1 ) u 0 τ j = 0 n [ 1 ( 1 δ ) α j ] .
From basic analysis, it is obvious that 1 x e x for 0 < x < 1 , so that
u n + 1 τ δ 7 ( n + 1 ) u 0 τ j = 0 n e ( 1 δ ) α j δ 7 ( n + 1 ) u 0 τ n + 1 e ( 1 δ ) j = 0 α j .
Clearly, if j = 0 = , such that e ( 1 δ ) j = 0 α j 0 as n , then lim n u n τ = 0 , which completes the proof. □
Example 2.
Consider the equation
u ( t ) + [ u ( t ) + 2 t u ( t ) + 1 3 t ( u ( t ) ) 2 ] e u 4 = 0
with BCs.
u ( 1 ) = 0 , u ( 1 ) = 1 , u ( 2 ) = ln 2 .
The Green’s function corresponding to the homogeneous linear part of (56), that is u = 0 on the interval [ 1 , 2 ] is
G ( t , s ) = 1 2 t 2 + ( 1 2 s 2 + s 2 ) + s 2 2 s + 2 , 1 s t 2 . ( 1 2 s 2 + 2 s 2 ) t + ( 1 2 s 2 2 s + 2 ) , 1 t s 2 .
Applying the Picard-like-Green iterative scheme, as expressed in (44), we have the initial iterate as
u 0 = 1 ln 2 + ( 3 2 + ln 2 ) t 1 2 t 2
and,
x n = ( u n + α n 1 t 1 2 t 2 + ( 1 2 s 2 + s 2 ) + s 2 2 s + 2 × u n ( s ) + [ u ( s ) + 2 s u n ( s ) + 1 2 s ( u n ( s ) ) 2 ] e u n ( s ) 4 d s + α n t 2 ( 1 2 s 2 + 2 s 2 ) t + ( 1 2 s 2 2 s + 2 ) × u n ( s ) + [ u n ( s ) + 2 s u n ( s ) + 1 2 s ( u n ( s ) ) 2 ] e u n ( s ) 4 d s ) + 1 t 1 2 t 2 + ( 1 2 s 2 + s 2 ) + s 2 2 s + 2 × [ u n + α n 1 t 1 2 t 2 + ( 1 2 s 2 + s 2 ) + s 2 2 s + 2 × u n ( s ) + [ u ( s ) + 2 s u n ( s ) + 1 2 s ( u n ( s ) ) 2 ] e u n ( s ) 4 d s + α n t 2 ( 1 2 s 2 + 2 s 2 ) t + ( 1 2 s 2 2 s + 2 ) × u n ( s ) + [ u n ( s ) + 2 s u n ( s ) + 1 2 s ( u n ( s ) ) 2 ] e u n ( s ) 4 d s ] d s + t 2 ( 1 2 s 2 + 2 s 2 ) t + ( 1 2 s 2 2 s + 2 ) × [ u n + α n 1 t 1 2 t 2 + ( 1 2 s 2 + s 2 ) + s 2 2 s + 2 × u n ( s ) + [ u ( s ) + 2 s u n ( s ) + 1 2 s ( u n ( s ) ) 2 ] e u n ( s ) 4 d s + α n t 2 ( 1 2 s 2 + 2 s 2 ) t + ( 1 2 s 2 2 s + 2 ) × u n ( s ) + [ u n ( s ) + 2 s u n ( s ) + 1 2 s ( u n ( s ) ) 2 ] e u n ( s ) 4 d s ] d s ,
w n = ( x n + α n 1 t 1 2 t 2 + ( 1 2 s 2 + s 2 ) + s 2 2 s + 2 × x n ( s ) + [ x ( s ) + 2 s x n ( s ) + 1 2 s ( x n ( s ) ) 2 ] e x n ( s ) 4 d s + α n t 2 ( 1 2 s 2 + 2 s 2 ) t + ( 1 2 s 2 2 s + 2 ) × x n ( s ) + [ x n ( s ) + 2 s x n ( s ) + 1 2 s ( x n ( s ) ) 2 ] e x n ( s ) 4 d s ) + 1 t 1 2 t 2 + ( 1 2 s 2 + s 2 ) + s 2 2 s + 2 × [ x n + α n 1 t 1 2 t 2 + ( 1 2 s 2 + s 2 ) + s 2 2 s + 2 × x n ( s ) + [ x ( s ) + 2 s x n ( s ) + 1 2 s ( x n ( s ) ) 2 ] e x n ( s ) 4 d s + α n t 2 ( 1 2 s 2 + 2 s 2 ) t + ( 1 2 s 2 2 s + 2 ) × x n ( s ) + [ x n ( s ) + 2 s x n ( s ) + 1 2 s ( x n ( s ) ) 2 ] e x n ( s ) 4 d s ] d s + t 2 ( 1 2 s 2 + 2 s 2 ) t + ( 1 2 s 2 2 s + 2 ) × [ x n + α n 1 t 1 2 t 2 + ( 1 2 s 2 + s 2 ) + s 2 2 s + 2 × x n ( s ) + [ x ( s ) + 2 s x n ( s ) + 1 2 s ( x n ( s ) ) 2 ] e x n ( s ) 4 d s + α n t 2 ( 1 2 s 2 + 2 s 2 ) t + ( 1 2 s 2 2 s + 2 ) × x n ( s ) + [ x n ( s ) + 2 s x n ( s ) + 1 2 s ( x n ( s ) ) 2 ] e x n ( s ) 4 d s ] d s ,
v n = ( w n + α n 1 t 1 2 t 2 + ( 1 2 s 2 + s 2 ) + s 2 2 s + 2 × w n ( s ) + [ w ( s ) + 2 s w n ( s ) + 1 2 s ( w n ( s ) ) 2 ] e w n ( s ) 4 d s + α n t 2 ( 1 2 s 2 + 2 s 2 ) t + ( 1 2 s 2 2 s + 2 ) × w n ( s ) + [ w n ( s ) + 2 s w n ( s ) + 1 2 s ( w n ( s ) ) 2 ] e w n ( s ) 4 d s ) + 1 t 1 2 t 2 + ( 1 2 s 2 + s 2 ) + s 2 2 s + 2 × [ w n + α n 1 t 1 2 t 2 + ( 1 2 s 2 + s 2 ) + s 2 2 s + 2 × w n ( s ) + [ w ( s ) + 2 s w n ( s ) + 1 2 s ( w n ( s ) ) 2 ] e w n ( s ) 4 d s + α n t 2 ( 1 2 s 2 + 2 s 2 ) t + ( 1 2 s 2 2 s + 2 ) × w n ( s ) + [ w n ( s ) + 2 s w n ( s ) + 1 2 s ( w n ( s ) ) 2 ] e w n ( s ) 4 d s ] d s + t 2 ( 1 2 s 2 + 2 s 2 ) t + ( 1 2 s 2 2 s + 2 ) × [ w n + α n 1 t 1 2 t 2 + ( 1 2 s 2 + s 2 ) + s 2 2 s + 2 × w n ( s ) + [ w ( s ) + 2 s w n ( s ) + 1 2 s ( w n ( s ) ) 2 ] e w n ( s ) 4 d s + α n t 2 ( 1 2 s 2 + 2 s 2 ) t + ( 1 2 s 2 2 s + 2 ) × w n ( s ) + [ w n ( s ) + 2 s w n ( s ) + 1 2 s ( w n ( s ) ) 2 ] e w n ( s ) 4 d s ] d s ,
u n + 1 = ( v n + α n 1 t 1 2 t 2 + ( 1 2 s 2 + s 2 ) + s 2 2 s + 2 × v n ( s ) + [ v ( s ) + 2 s v n ( s ) + 1 2 s ( v n ( s ) ) 2 ] e v n ( s ) 4 d s + α n t 2 ( 1 2 s 2 + 2 s 2 ) t + ( 1 2 s 2 2 s + 2 ) × v n ( s ) + [ v n ( s ) + 2 s v n ( s ) + 1 2 s ( v n ( s ) ) 2 ] e v n ( s ) 4 d s ) + 1 t 1 2 t 2 + ( 1 2 s 2 + s 2 ) + s 2 2 s + 2 × [ v n + α n 1 t 1 2 t 2 + ( 1 2 s 2 + s 2 ) + s 2 2 s + 2 × v n ( s ) + [ v ( s ) + 2 s v n ( s ) + 1 2 s ( v n ( s ) ) 2 ] e v n ( s ) 4 d s + α n t 2 ( 1 2 s 2 + 2 s 2 ) t + ( 1 2 s 2 2 s + 2 ) × v n ( s ) + [ v n ( s ) + 2 s v n ( s ) + 1 2 s ( v n ( s ) ) 2 ] e v n ( s ) 4 d s ] d s + t 2 ( 1 2 s 2 + 2 s 2 ) t + ( 1 2 s 2 2 s + 2 ) × [ v n + α n 1 t 1 2 t 2 + ( 1 2 s 2 + s 2 ) + s 2 2 s + 2 × v n ( s ) + [ v ( s ) + 2 s v n ( s ) + 1 2 s ( v n ( s ) ) 2 ] e v n ( s ) 4 d s + α n t 2 ( 1 2 s 2 + 2 s 2 ) t + ( 1 2 s 2 2 s + 2 ) × v n ( s ) + [ v n ( s ) + 2 s v n ( s ) + 1 2 s ( v n ( s ) ) 2 ] e v n ( s ) 4 d s ] d s .
With the best choice of α n ( 0 , 1 ) , our new Picard-like-Green iterative scheme performs better than other existing Green’s-function-based iterative schemes such as Picard–Green [7], Mann–Green [8], Ishikawa–Green [9], Khan–Green [29], Picard–Ishikawa–Green [30], and many more in the literature.

6. Conclusions

In this paper, our new iterative scheme (5) approximates the fixed point of mapping satisfying the condition ( B γ , μ ) , as shown in the main results. The scheme converges faster than some selected schemes, already existing in the literature, as shown in Example 1 which is also presented numerically in Table 1 and Figure 1. Furthermore, the Picard-like-Green iterative scheme generalizes other Green’s-function-based scheme highlighted in the work. Finally, to show the applicability of our main results, it is applied to the approximation of the solution of infectious disease models.

Author Contributions

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

Funding

This work was supported and funded by the Deanship of Scientific Research at Imam Mohammad Ibn Saud Islamic University (IMSIU) (grant number IMSIU-DDRSP2501).

Institutional Review Board Statement

This article does not contain any studies with human participants or animals performed by any of the authors.

Data Availability Statement

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

Acknowledgments

This work was supported and funded by the Deanship of Scientific Research at Imam Mohammad Ibn Saud Islamic University (IMSIU) (grant number IMSIU-DDRSP2501).

Conflicts of Interest

The authors declare that they have no conflict of interest.

References

  1. Suzuki, T. Fixed point theorems and convergence theorems for some generalized nonexpansive mappings. J. Math. Appl. 2008, 340, 1088–1095. [Google Scholar] [CrossRef]
  2. García-Falset, J.; Llorens-Fuster, E.; Suzuki, T. Fixed point theory for a class of generalized nonexpansive mapping. J. Math. Anal. 2011, 375, 185–195. [Google Scholar] [CrossRef]
  3. Patir, B.; Goswami, N.; Mishra, V.N. Some results on fixed theory for a class of generalized nonexpansive mappings. Fixed Point Theory Appl. 2018, 2018, 19. [Google Scholar] [CrossRef]
  4. 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]
  5. Banach, S. Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales. Fundam. Math. 1922, 3, 133–181. [Google Scholar] [CrossRef]
  6. Krasnosel’skii, M.A. Two observations about the method of successive approximations. Usp. Mat. Nauk. 1955, 10, 123–127. [Google Scholar]
  7. Khuri, S.A.; Sayfy, A.; Zaveri, A. A new iteration method based on Green’s functions for the solution of PDEs. Int. J. Comput. Math. 2017, 3, 3091–3103. [Google Scholar] [CrossRef]
  8. Khuri, S.A.; Sayfy, A. Numerical solution of functional differential equations: A Green’s function-based iterative approach. Int. J. Comput. Math. 2018, 95, 1937–1949. [Google Scholar] [CrossRef]
  9. Khuri, S.A.; Louhichi, I. A new fixed point iteration method for nonlinear third-order BVPs. Int. J. Comput. Math. 2021, 98, 2220–2232. [Google Scholar] [CrossRef]
  10. Okeke, G.A.; Udo, A.V.; Alqahtani, R.T.; Hussain, N. A faster iterative scheme for solving nonlinear fractional differential equation of the Caputo type. AIMS Math. 2023, 8, 28488–28516. [Google Scholar] [CrossRef]
  11. Okeke, G.A.; Ofem, A.E.; Işik, H. A faster iterative method for solving nonlinear third-order BVPs based on Green’s function. Bound. Value Probl. 2022, 2022, 103. [Google Scholar] [CrossRef]
  12. Ullah, K.; Arshad, M. Numerical reckoning fixed points for Suzuki’s generalized nonexpansive mapping via new iteration process. Filomat 2018, 32, 187–196. [Google Scholar] [CrossRef]
  13. Gürsoy, P.; Karakaya, V. A Picard-S hybrid iteration method for solving a differential equation with retarded argument. arXiv 2014, arXiv:1403.2546v2. [Google Scholar]
  14. Abbas, M.; Asghar, M.W.; De la Sen, M. Approximation of the solution of delay fractional differential equation using AA-iterative scheme. Mathematics 2022, 10, 273. [Google Scholar] [CrossRef]
  15. Ullah, K.; Arshad, M. New three-step iteration process and fixed point approximation in Banach spaces. J. Linear Topol. Algebra 2018, 7, 87–100. [Google Scholar]
  16. Ullah, K.; Abbas, M.; Ahmad, J.; Ahmad, F. Approximating fixed point of operators satisfying the (Bγ,μ) condition. Iran. J. Math. Sci. Inform. 2024, 19, 135–148. [Google Scholar] [CrossRef]
  17. Agarwal, R.P.; O’Regan, D.; Sahu, D.R. Fixed Point Theory for Lipschitzian Type Mppings with Applications; Topological Fixed Point Theory and Its Applications; Springer: New York, NY, USA, 2009; Volume 6. [Google Scholar] [CrossRef]
  18. Goebel, K.; Kirk, W.A. Topics in Metric Fixed Theory; Cambridge University Press: Cambridge, UK, 1990. [Google Scholar] [CrossRef]
  19. Opial, Z. Weak convergence of the sequence of successive approximations for nonexpansive mapping. Bull. Am. Math. Soc. 1967, 73, 591–597. [Google Scholar] [CrossRef]
  20. Senter, H.F.; Dotson, W.G., Jr. Approximating fixed points of nonexpansive mappings. Proc. Am. Math. Soc. 1974, 44, 375–380. [Google Scholar] [CrossRef]
  21. Liu, Z.; Kang, S.M.; Cho, Y.J. Convergence and almost stability of Ishikawa iterative scheme with errors for m-accretive operators. Comput. Math. Appl. 2004, 47, 767–778. [Google Scholar] [CrossRef]
  22. Schu, J. Weak and strong convergence to fixed points of asymptotically nonexpansive mappings. Bull. Aust. Math. Soc. 1991, 43, 153–159. [Google Scholar] [CrossRef]
  23. Berinde, V. On the stability of some fixed procedure. Bul. Ştiinţ. Univ. Baia Mare Ser. B Mat.-Inform. 2002, XVIII, 7–14. [Google Scholar]
  24. Berinde, V. Summable almost stability of fixed point iteration procedures. Carpathian J. Math. 2003, 19, 81–88. [Google Scholar]
  25. Bauschke, H.H.; Combettes, P.L. Convex Analysis and Monotone Operator Theory in Hilbert Spaces; Springer: New York, NY, USA, 2011. [Google Scholar]
  26. Alam, K.H.; Rohen, Y.; Tomar, A. On fixed point and its application to the spread of infectious diseases model in Mvb-metric space. Math. Methods Appl. Sci. 2024, 47, 6489–6503. [Google Scholar] [CrossRef]
  27. Leggett, R.W.; Williams, L.R. A fixed point theorem with application to an infectious disease model. J. Math. Anal. Appl. 1980, 76, 91–97. [Google Scholar] [CrossRef]
  28. Zhang, S.-S.; Bian, W.-M. Fixed point indexes and its applications to nonlinear integral equations modelling infectious diseases. Appl. Math. Mech. 1989, 10, 399–406. [Google Scholar] [CrossRef]
  29. Ali, F.; Ali, J.; Uddin, I. A novel approach for the solution of BVPs via Green’s function and fixed point iterative method. J. Appl. Math. Comput. 2021, 66, 167–181. [Google Scholar] [CrossRef]
  30. Okeke, G.A.; Udo, A.V.; Rasulov, Z. A novel Picard-Ishikawa-Green’s iterative scheme for solving third order boundary value problems. Math. Meth. Appl. Sci. 2024, 47, 7255–7269. [Google Scholar] [CrossRef]
Figure 1. Graph corresponding to Table 1.
Figure 1. Graph corresponding to Table 1.
Mathematics 13 00562 g001
Table 1. Comparison of speed of convergence of some iterative scheme for Example 1.
Table 1. Comparison of speed of convergence of some iterative scheme for Example 1.
StepPicard-like K MAAPicard-S
14.99064.82004.70004.93404.6600
25.00004.98384.95504.99784.9422
35.00004.99854.99324.99994.9902
45.00004.99994.99905.00004.9983
55.00005.00004.99985.00004.9997
65.00005.00005.00005.00005.0000
75.00005.00005.00005.00005.0000
85.00005.00005.00005.00005.0000
95.00005.00005.00005.00005.0000
105.00005.00005.00005.00005.0000
115.00005.00005.00005.00005.0000
125.00005.00005.00005.00005.0000
135.00005.00005.00005.00005.0000
145.00005.00005.00005.00005.0000
155.00005.00005.00005.00005.0000
165.00005.00005.00005.00005.0000
175.00005.00005.00005.00005.0000
185.00005.00005.00005.00005.0000
195.00005.00005.00005.00005.0000
205.00005.00005.00005.00005.0000
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

Okeke, G.A.; Udo, A.V.; Alqahtani, R.T. An Efficient Iterative Scheme for Approximating the Fixed Point of a Function Endowed with Condition (Bγ,μ) Applied for Solving Infectious Disease Models. Mathematics 2025, 13, 562. https://doi.org/10.3390/math13040562

AMA Style

Okeke GA, Udo AV, Alqahtani RT. An Efficient Iterative Scheme for Approximating the Fixed Point of a Function Endowed with Condition (Bγ,μ) Applied for Solving Infectious Disease Models. Mathematics. 2025; 13(4):562. https://doi.org/10.3390/math13040562

Chicago/Turabian Style

Okeke, Godwin Amechi, Akanimo Victor Udo, and Rubayyi T. Alqahtani. 2025. "An Efficient Iterative Scheme for Approximating the Fixed Point of a Function Endowed with Condition (Bγ,μ) Applied for Solving Infectious Disease Models" Mathematics 13, no. 4: 562. https://doi.org/10.3390/math13040562

APA Style

Okeke, G. A., Udo, A. V., & Alqahtani, R. T. (2025). An Efficient Iterative Scheme for Approximating the Fixed Point of a Function Endowed with Condition (Bγ,μ) Applied for Solving Infectious Disease Models. Mathematics, 13(4), 562. https://doi.org/10.3390/math13040562

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