Next Article in Journal
Contrasting the Implicit Method in Incoherent Lagrangian and the Correction Map Method in Hamiltonian
Next Article in Special Issue
Solutions of Fractional Differential Inclusions and Stationary Points of Intuitionistic Fuzzy-Set-Valued Maps
Previous Article in Journal
Novel “Anti-Zeolite” Ba3Sr3B4O12: Eu3+ Phosphors: Crystal Structure, Optical Properties, and Photoluminescence
Previous Article in Special Issue
Advancements in Hybrid Fixed Point Results and F-Contractive Operators
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Fixed-Point Estimation by Iterative Strategies and Stability Analysis with Applications

by
Hasanen A. Hammad
1,2,* and
Doha A. Kattan
3
1
Department of Mathematics, Unaizah College of Sciences and Arts, Qassim University, Buraydah 52571, Saudi Arabia
2
Department of Mathematics, Faculty of Science, Sohag University, Sohag 82524, Egypt
3
Department of Mathematics, College of Sciences and Art, King Abdulaziz University, Rabigh 25712, Saudi Arabia
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(7), 1400; https://doi.org/10.3390/sym15071400
Submission received: 19 June 2023 / Revised: 6 July 2023 / Accepted: 9 July 2023 / Published: 11 July 2023

Abstract

:
In this study, we developed a new faster iterative scheme for approximate fixed points. This technique was applied to discuss some convergence and stability results for almost contraction mapping in a Banach space and for Suzuki generalized nonexpansive mapping in a uniformly convex Banach space. Moreover, some numerical experiments were investigated to illustrate the behavior and efficacy of our iterative scheme. The proposed method converges faster than symmetrical iterations of the S algorithm, Thakur algorithm and K * algorithm. Eventually, as an application, the nonlinear Volterra integral equation with delay was solved using the suggested method.

1. Introduction

Many problems in mathematics and other fields of science can be modeled into an equation with a suitable operator. The existence of the solution to this equation equates to the existence of the fixed point (FP) of the appropriate operator. Due to the large number of recent, valuable studies that include the FP method, these points have become the mainstay for nonlinear analysis due to the ease and smoothness of this method, in addition to the numerous and exciting applications in economics, biology, chemistry, game theory, engineering, physics, etc. [1,2,3,4,5,6].
A very important branch is the involvement of FPs in approximation by symmetrical algorithms. Numerous problems such as convex feasibility problems, convex optimization problems, monotone variational inequalities and image restoration problems can be thought of as FP problems of nonexpansive mappings; hence, approximating them has a range of specialized applications.
In this paper, the symbols Ω , Θ , R + , N , ⇀, ⟶ and λ ( ) refer to the Banach space, a nonempty closed convex subset (CCS) of an Ω , the set of nonnegative real numbers, the set of natural numbers, weak convergence, strong convergence and the set of all FPs (the point θ Θ so that an equation θ = θ is true).
There are two main categories that can be used to group the main concepts of FP theory. Finding the prerequisites and requirements necessary for an operator to own fixed points is the first step. Another option is to locate these fixed points using certain schematic methods. The first category is known formally as the existence part, while the second category is known as the computation or approximation part. Studying the behaviors of FPs, such as stability and data dependence, is an essential but less well-known topic of FP theory.
The class of weak contractions that appropriately covers the class of Zamfirescu operators [7] was supplied by Berinde in [8]. Similarly, many authors also refer to this class of mappings as almost contraction mappings (ACMs).
Definition 1.
A mapping : Θ Θ is called ACM if the following inequality is true:
θ ϑ 1 θ ϑ + 2 θ θ , for all θ , ϑ Θ ,
where 0 < 1 < 1 and 2 0 .
In 2003, ACM (1) was generalized by Imoru and Olantiwo [9] by replacing the constant 2 with a strictly increasing continuous function ϖ : R + R + with ϖ ( 0 ) = 0 as follows:
Definition 2.
A mapping : Θ Θ is called contractive-like if there exist a constant 0 < 1 < 1 and a strictly increasing continuous function ϖ : R + R + with ϖ ( 0 ) = 0 such that
θ ϑ 1 θ ϑ + ϖ θ θ , for all θ , ϑ Θ .
Clearly, Inequality (2) is symmetrical to Inequality (1) if ϖ ( t ) = 2 ( t ) .
The analysis of the performance and behavior of algorithms that make significant contributions to real-world applications is one of the key trends in FP techniques. Therefore, in order to enhance the functionality and convergence behavior of algorithms for nonexpansive mappings, several authors tended to develop numerous symmetrical iterative schemes for approximating FPs, for example, Mann [10], Ishikawa [11], Noor [12], Argawal et al. [13], Abbas and Nazir [14] and HR [15,16].
Let { σ j } and { κ j } be sequences in [ 0 , 1 ] ; the following procedures are known as the S algorithm [13], Picard-S algorithm [17], Thakur algorithm [18] and K * algorithm [19]:
ξ Θ , ρ j = ( 1 σ j ) ξ j + σ j ξ j , ξ j + 1 = ( 1 κ j ) ξ i + γ i ρ i , j 1 .
ξ Θ , ρ j = ( 1 σ j ) ξ j + σ j ξ j , Υ j = ( 1 κ j ) ξ j + κ j ρ j , ξ j + 1 = Υ j , j 1 .
ξ Θ , ρ j = ( 1 σ j ) ξ j + σ j ξ j , Υ j = ( 1 κ j ) ξ j + κ j ρ j , ξ j + 1 = Υ j , j 1 .
ξ Θ , ρ j = ( 1 σ j ) ξ j + σ j ξ j , Υ j = ( 1 κ j ) ξ j + κ j ξ j , ξ j + 1 = Υ j , j 1 .
Analytically and numerically, for contractive-like mappings, the authors showed that the iterative technique (6) converges faster than those of Karakaya et al. [20] and Thakur et al. [18], respectively. Consequently, Iteration (6) converges faster than (3), (4) and (5).
On the other hand, nonlinear integral Equations (NIEs) are used to explain mathematical models that derive from mathematical physics, engineering, economics, biology, etc. In particular, NIEs are produced by boundary value problems and mathematical modeling of the spatiotemporal dynamics of the epidemic. Recently, many authors have used iterative methods to solve NIEs; for instance, see [21,22,23,24,25,26]. The efficiency and effectiveness of iterative methods are determined by several factors, the most important of which are speed, stability and reliability. Many researchers and writers have studied these factors using the fixed-point method. For more details, see [27,28].
Continuing on the same approach, in this paper, we introduce the convergence and stability results for ACMs and Suzuki generalized nonexpansive mappings (SGNMs) in a BS and a uniformly convex Banach space (UCBS) in the following faster iterative scheme:
ξ Θ , ρ j = ( 1 σ j ) ξ j + σ j ξ j , Υ j = ( 1 κ j ) ρ j + κ j ρ j , Λ j = ( ( 1 τ j ) Υ j + τ j Λ j ) , ξ j + 1 = Λ j , for all j N ,
where σ j , κ j and τ j are sequences in [ 0 , 1 ] . Some numerical examples are given to illustrate that the considered iteration converges faster than the iterations of the S algorithm, Thakur algorithm and K * algorithm with appropriate parameters. Ultimately, the proposed method is implicated in finding the solution to a nonlinear Volterra integral equation with delay.

2. Preliminary Work

In this section, we provide some definitions and lemmas that will be helpful in the sequel.
Definition 3.
A mapping : Ω Ω is called an SGNM if
1 2 θ θ θ ϑ θ ϑ θ ϑ , for all θ , ϑ Ω .
Definition 4.
A BS Ω is called a uniformly convex if for each ϵ ( 0 , 2 ] there exists δ > 0 , such that for θ , ϑ Ω satisfying θ 1 , ϑ 1 and θ ϑ > ϵ , we have θ + ϑ 2 < 1 δ .
Definition 5.
A BS Ω is considered to satisfy Opial’s condition if for any sequence { θ j } in Ω such that θ j θ Ω implies
lim sup j θ j θ < lim sup j θ j ϑ
for all ϑ Ω , where θ ϑ .
Definition 6.
Assume that { θ j } is a bounded sequence in Ω . For θ Ω , we set
( θ , { θ j } ) = lim sup j θ j ϑ .
The asymptotic radius and center of { θ j } relative to Ω are described as
( Ω , { θ j } ) = inf { ( θ , { θ j } ) : θ Ω } .
The asymptotic center of { θ j } relative to Ω is defined by
Z ( Ω , { θ j } ) = { θ Ω such that ( θ , { θ j } ) ) = ( Ω , { θ j } ) } .
Clearly, Z ( Ω , { θ j } ) contains one single point in a UCBS.
Definition 7.
([29]). Let { σ j } and { κ j } be nonnegative real sequences converging to σ and κ, respectively. If there exist ζ R + such that ζ = lim i σ j σ κ j κ , then we have the following possibilities:
  • If ζ = 0 , then { σ j } converges to σ faster than κ j does to κ ;
  • If ζ ( 0 , ) , then the two sequences have the same rate of convergence.
Definition 8.
([30]). A mapping : Ω Ω is said to be satisfy Condition I , if the inequality
d ϑ , λ ( ) ϑ ϑ ,
is true, for all ϑ Ω , where d ϑ , λ ( ) = inf { ϑ θ : θ λ ( ) } .
Proposition 1
([31]). For a self-mapping : Ω Ω , we have
( 1 )
ℑ is an SGNM if ℑ is nonexpansive.
( 2 )
ℑ is a quasi-nonexpansive mapping if ℑ is an SGNM with a nonempty FP set.
( 3 )
If ℑ is an SGNM, then the inequality below holds
θ θ 3 θ θ + θ ϑ , for all ϑ , θ Ω .
Lemma 1.
([31]). Assume that Θ is any subset of a BS Ω , which satisfies Opial’s condition. Let : Θ Θ be an SGNM. If { θ i } θ and lim j ϑ j θ j = 0 , then I is demiclosed at zero and θ = θ .
Lemma 2.
([31]). If : Ω Ω is an SGNM, then it owns a FP provided that Θ is a weakly compact convex subset of a BS Ω .
Lemma 3.
([29]). Let { ψ i } and { ψ j * } be nonnegative real sequences such that
ψ i + 1 ( 1 ϰ j ) ψ j + ψ j * , ϰ j ( 0 , 1 ) , for each j 1 ,
if j = 0 ϰ j = and lim i ψ j * ϰ j = 0 , then lim j ψ j = 0 .
Lemma 4.
([32]). Let { ψ j } and { ψ j * } be nonnegative real sequences such that
ψ j + 1 ( 1 ϰ j ) ψ j + ϰ j ψ j * , ϰ j ( 0 , 1 ) , for each j 1 .
if j = 0 ϰ j = , and ψ j * 0 , then lim sup j ψ j * lim sup j ψ j 0 .
Lemma 5.
([33]). Let Ω be a UCBS and { ϰ j } be a sequence such that 0 < u ϰ j u * < 1 , for all j 1 . Assume that { θ j } and { ϑ j } are two sequences in Ω such that for some μ 0 ,
lim sup j { ϑ j } μ , lim sup j { θ j } μ and lim sup i ϰ j θ j + ( 1 ϰ j ) ϑ j = μ .
Then lim i θ j ϑ j = 0 .

3. Rate of Convergence

In this part, we demonstrate analytically that for ACMs, our iterative method (7) converges faster than the iterative method in (6) in the sense of Berinde [29].
Theorem 1.
Let Θ be a nonempty CCS of a BS Ω and : Θ Θ be a ACM with λ ( ) . If { ξ j } is the iterative sequence given by (7) with { σ j } , { κ j } , { τ j } [ 0 , 1 ] and j = 0 τ j = . Then { ξ j } θ λ ( ) .
Proof. 
Let θ λ ( ) ; using (7), one has
ρ j θ = ( 1 σ j ) ξ j + σ j ξ j θ = ( 1 σ j ) ξ j θ + σ j ξ j ζ ( 1 σ j ) ξ j θ + σ j ξ j θ ( 1 σ j ) ξ j ζ + 1 σ j ξ j θ = 1 ( 1 1 ) σ j ξ j θ .
From (7) and (8), we have
Υ j θ = ( 1 κ j ) ρ j + κ j ρ j θ = θ ( 1 κ j ) ρ j + κ j ρ j 1 θ ( 1 κ j ) ρ j + κ j ρ j + 2 θ θ = 1 ( 1 κ j ) ρ j θ + κ j ρ j θ 1 ( 1 κ j ) ρ j θ + 1 κ j ρ j θ 1 1 ( 1 1 ) κ j ρ j ζ 1 1 ( 1 1 ) κ j 1 ( 1 1 ) σ j ξ j θ .
Using (7) and (9), we get
Λ j θ = ( 1 τ j ) Υ j + τ j Υ j θ 1 ( 1 τ j ) Υ j θ + κ j Υ j θ 1 1 ( 1 1 ) τ j Υ j ζ 1 2 1 ( 1 1 ) κ j 1 ( 1 1 ) σ j 1 ( 1 1 ) τ j ξ j θ .
Utilizing (7) and (10), we can write
ξ j + 1 θ = Λ j θ 1 Λ j θ 1 3 1 ( 1 1 ) τ j 1 ( 1 1 ) κ j 1 ( 1 1 ) σ j ξ j θ .
As θ < 1 and 0 κ j , σ j 1 , for all j N , then 1 ( 1 1 ) κ j 1 ( 1 1 ) σ j < 1 . Thus, (11) takes the form
ξ j + 1 θ 1 3 1 ( 1 1 ) τ j ξ j θ .
From (12), we deduce that
ξ j + 1 θ 1 3 1 ( 1 1 ) τ j ξ j θ 1 3 1 ( 1 1 ) τ j 1 ξ j 1 θ 1 3 1 ( 1 1 ) τ 0 ξ 0 θ .
It follows from (13) that
ξ j + 1 θ 1 3 ( j + 1 ) ξ 0 θ u = 0 j 1 ( 1 1 ) τ u .
From the definition of θ and τ , we have 1 ( 1 θ ) γ u < 1 . Since 1 u e u for all u [ 0 , 1 ] , the inequality (14) can be written as
ξ j + 1 θ 1 3 ( j + 1 ) e ( 1 1 ) u = 0 j τ u ξ 0 θ .
Letting j in (15), we get lim j ξ j θ = 0 , i.e., { ξ j } θ λ ( ) .
For uniqueness. Let θ , θ * λ ( ) such that θ θ * , hence
θ θ * = θ θ * 1 θ θ * + 2 θ θ = 1 θ θ * < θ θ * ,
which is a contradiction, that is, θ θ * .
Theorem 2.
Let Θ be a nonempty CCS of a BS Ω and : Θ Θ be a ACM with λ ( ) . If { ξ j } is the iterative sequence considered by (7) with { σ j } , { κ j } , { τ j } [ 0 , 1 ] and 0 < τ τ j 1 , for all i 1 . Then, { θ j } converges to θ faster than the iterative approach (6).
Proof. 
It follows from (14) and the assumption 0 < τ τ j 1 that
ξ j + 1 θ 1 3 ( j + 1 ) ξ 0 θ u = 0 j 1 ( 1 1 ) τ u = 1 3 ( j + 1 ) ξ 0 θ 1 ( 1 1 ) τ j + 1 .
Similarly, the iterative process (6) ([19], Theorem 3.2) takes the form:
m j + 1 θ 1 2 ( j + 1 ) m 0 θ u = 0 j 1 ( 1 1 ) τ u .
Since 0 < τ τ j 1 , for some τ > 0 and all j 1 , then (16) can be written as
m j + 1 θ 1 2 ( j + 1 ) m 0 θ u = 0 j 1 ( 1 1 ) τ u = 1 2 ( j + 1 ) m 0 θ 1 ( 1 1 ) τ j + 1 .
Set
ζ = 1 3 ( j + 1 ) ξ 0 θ 1 ( 1 1 ) τ j + 1 ,
and
ζ ^ = 1 2 ( j + 1 ) m 0 θ 1 ( 1 1 ) τ j + 1 .
Then
Δ j = ζ ζ ^ = 1 3 ( j + 1 ) ξ 0 θ 1 ( 1 1 ) τ j + 1 1 2 ( j + 1 ) m 0 θ 1 ( 1 1 ) τ j + 1 = 1 j + 1 .
Letting j , we get lim j Δ j = 0 . Hence, { ξ j } converges faster than { m j } to θ .

4. Convergence Results

In this section, we provide some convergence results of our iteration scheme (7) for the SGNM in the setting of UCBSs. First, we prove the following lemmas:
Lemma 6.
Let Θ be a nonempty CCS of a BS Ω and : Θ Θ be an SGNM with λ ( ) . If { ξ j } is the iterative sequence proposed by (7), then lim j ξ j θ exists, for each θ λ ( ) .
Proof. 
Let θ λ ( ) and ϑ Θ . By Proposition 1 ( 2 ) , we have
1 2 θ θ = 0 θ ϑ θ ϑ θ ϑ .
From (7), one has
ρ j θ = ( 1 σ j ) ξ j + σ j ξ j θ ( 1 σ j ) ξ j θ + σ j ξ j θ ( 1 σ j ) ξ j θ + σ j ξ j θ = ξ j θ .
Using (7) and (17), we obtain
Υ j θ = ( 1 κ j ) ρ j + κ j ρ j θ ( 1 κ j ) ρ j + η i Ξ ρ j θ ( 1 κ j ) ρ j θ + κ j Ξ ρ j θ ( 1 κ j ) ρ j θ + κ j ρ j θ = ρ j θ ξ j θ .
Similarly, from (7) and (18), we get
Λ j θ = ( 1 τ j ) Υ j + τ j Υ j θ ( 1 τ j ) Υ j θ + τ j Υ j θ Υ j θ ξ j θ .
Finally, it follows from (7) and (19) that
ξ j + 1 θ = Λ j θ = Λ j θ ξ j θ ,
which implies that { ξ j θ } is bounded and nondecreasing sequence. Hence lim j ξ j θ exists for each θ λ ( ) .
Lemma 7.
Let Θ be a nonempty CCS of a UCBs Ω and : Θ Θ be an SGNM If { ξ j } is the iterative sequence given by (7), then λ ( ) if and only if { ξ j } is bounded and lim j ξ j ξ j = 0 .
Proof. 
Let λ ( ) and θ λ ( ) . Due to Lemma 6, { ξ j } is bounded and lim j ξ j θ exists. Set
lim j ξ j θ = ω .
From (20) in (17) and taking the lim sup , we have
lim sup j ρ j θ lim sup j ξ j θ = ω .
Based on Proposition 1 ( 2 ) , one can write
lim sup j ξ j θ lim sup j ξ j θ = ω .
From (7) and (17)–(19), we have
ξ j + 1 θ = Λ j θ Λ j θ = ( 1 τ j ) Υ j + τ j Υ j θ ( 1 τ j ) Υ j θ + τ j Υ j θ Υ j θ = ( 1 κ j ) ρ j + κ j ρ j θ ( 1 κ j ) ρ j θ + κ j ρ j θ ( 1 κ j ) ξ j θ + κ j ρ j θ = ξ j θ κ j ξ j θ + κ j ρ j θ .
Hence,
ξ j + 1 θ ξ j θ κ j ρ j θ ξ j θ .
As κ j [ 0 , 1 ] , from (22), we get
ξ j + 1 θ ξ j θ ξ j + 1 θ ξ j θ κ j ρ j θ ξ j θ ,
which leads to ξ j + 1 θ ρ j θ .
Applying (20), we have
ω lim inf j ρ j θ .
From (21) and (23), we get
ω = lim j ρ j θ = lim i ( 1 σ j ) ξ j + σ j ξ j θ = lim j ( 1 σ j ) ξ j θ + σ j ξ j θ = lim j σ j ξ j θ + ( 1 σ j ) ξ j θ .
It follows from (20), (21), (24) and Lemma 5 that { ξ j } is bounded and lim j ξ j ξ j = 0 .
Conversely, let { ξ j } be a bounded and lim j ξ j ξ j = 0 . Consider θ Z ( Ω , { ξ j } ) , then by Proposition 1 ( 3 ) , and Definition 6, we have
( θ , { ξ j } ) = lim sup j ξ j θ lim sup j 3 ξ j ξ j + ξ j θ = lim sup j ξ j θ = θ , { ξ j } ,
which implies that θ Z ( Ω , { ξ j } ) . Since Ω is a uniformly convex and Z Λ , { ξ j } has exactly one point, then we have θ = θ .
Theorem 3.
Let { ξ j } be a sequence iterated by (7) and let Ω , Θ and ℑ be defined as in Lemma 7. Then, { ξ j } θ λ ( ) if Λ satisfies Opial’s condition and λ ( ) .
Proof. 
Assume that θ λ ( ) , due to Lemma 6, lim j ξ j θ exists.
Next, we show that { ξ j } has a weak sequential limit in λ ( ) . In this regard, consider { ξ j a } , { ξ j b } { ξ j } with { ξ j a } θ and { ξ j b } θ * for all θ , θ * Θ . From Lemma 7, we get lim j ξ j ξ j = 0 . Using Lemma 1 and since I is demiclosed at 0, we have I θ = 0 , which implies that θ = θ . Similarly θ * = θ * .
Now, if θ θ * , then by Opial’s condition, we get
lim j ξ j θ = lim a ξ j a θ < lim a ξ j a θ * = lim j ξ j θ * = lim b ξ j b θ * < lim b ξ j b θ = lim j ξ j θ ,
which is a contradiction; hence, θ = θ * and { ξ j } θ λ ( ) .
Theorem 4.
Let { ξ j } be a sequence iterated by (7). Furthermore, let Θ be a nonempty CCS of a UCBS Ω and : Θ Θ be an SGNM. Then, { ξ j } θ λ ( ) .
Proof. 
Due to Lemma 2 and 7, λ ( ) and lim j ξ j ξ j = 0 . Since Θ is compact, then there exists a subsequence { ξ j a } { ξ j } so that ξ j a θ for any θ Θ .
From Proposition 1 ( 3 ) , one has
ξ j a θ 3 ξ j a ξ j a + ξ j a θ , for all j N .
Letting a , we get θ = θ , that is, θ λ ( ) . From Lemma 6, we conclude that lim j ξ j θ exists for each θ λ ( ) , therefore { ξ j } θ .
Theorem 5.
Let { ξ j } be a sequence iterated by (7) and let Ω , Θ and ℑ be defined as in Lemma 7. Then, { ξ j } θ λ ( ) if and only if lim inf j d ( ξ j , λ ( ) ) = 0 , where d θ , λ ( ) = inf { θ ϑ : ϑ λ ( ) } .
Proof. 
It is clear that the necessary condition is satisfied. Let
lim inf j d ( ξ j , λ ( ) ) = 0 .
For Lemma 6, lim j ξ j θ exists for each θ λ ( ) , which leads to lim inf j d ( ξ j , λ ( ) ) exists. Hence
lim i d ( ξ j , λ ( ) ) = 0 .
Now, we claim that { ξ j } is a Cauchy sequence in Θ . Since lim inf j d ( ξ j , λ ( ) ) = 0 , for every ϵ > 0 there exists j 0 N such that
d ( ξ j , λ ( ) ) ϵ 2 and d ( ξ m , λ ( ) ) ϵ 2 , for each j , m j 0 .
Therefore
ξ j ξ m ξ j λ ( ) + λ ( ) ξ m = d ( ξ j , λ ( ) ) + d ( ξ m , λ ( ) ) ϵ 2 + ϵ 2 = ϵ ,
Thus, { ξ j } is a Cauchy sequence in Θ . Since Θ is closed, then there exists θ ^ Θ such that lim j ξ j = θ ^ . As lim i d ( ξ j , λ ( ) ) = 0 , lim i d ( θ ^ , λ ( ) ) = 0 . Therefore, θ ^ λ ( ) and this completes the proof. □

5. Stability Results

In 1987, Harder [34] rigorously examined the idea of stability of an FP iteration process in her Ph.D. thesis as follows:
Definition 9.
Let : Θ Θ be a self-mapping and ϖ r + 1 = g ( , ϖ r ) be a FP iteration so that { ϖ r } converges to ϖ Ξ ( ) . For arbitrary sequence { q r } in Ω , define
ε r = q r g ( , q r ) , for all r N .
Then, the FP iteration method is called ℑ-stable if the assertion below holds
lim r ε r = 0 if and only if lim r q r = ϖ .
Several writers have lately examined the idea of stability in Definition 9 for various classes of contraction mappings; for example, see [35]. Since the sequence { q r } is arbitrarily chosen, Berinde pointed out in [1] that the concept of stability in Definition 9 is not precise. To overcome this restriction, the same author noted that if { q r } were approximate sequences of { ϖ r } , then the definition would make sense. As a result, any iterative process will be weakly stable if it is stable, but the converse is not true in general.
Definition 10.
([1]). A sequence { q r } Θ is called an approximate sequence of { ϖ r } Θ , if for any b 1 , there is α = α ( b ) so that
ϖ r q r α , for all r b .
Definition 11.
([1]). Let { ϖ r } be an iterative process defined for ϖ 0 Θ as
ϖ r + 1 = g ( , ϖ r ) , r 0 ,
where : Θ Θ is a given mapping. Suppose that { ϖ r } converges to a FP ϖ * of ℑ and for any approximate sequence { q r } Θ of { ϖ r }
lim r ε r = lim r q r + 1 g ( , q r ) = 0 implies lim r q r = ϖ * ,
then, Equation (25) is called weakly stable with respect to , or weakly ℑ-stable.
The following theorem demonstrates the stability of our iteration approach (7).
Theorem 6.
Let Θ be a nonempty CCS of a BS Ω . Suppose that { ξ j } is a sequence iterated by (7) with { σ j } , { κ j } , { τ j } [ 0 , 1 ] and j = 0 τ j = . If the mapping : Θ Θ satisfies (1), then the proposed method is ℑ-stable.
Proof. 
Let { Υ j } Θ be a chosen sequence and { ξ j } be a sequence generating by (7) such that ξ j + 1 = ( , ξ j ) with ξ j ζ as j . Consider
φ j = Υ j + 1 ( , Υ j ) .
To prove is stable, it is sufficient to show that
lim j φ j = 0 if and only if lim j Υ j = θ , wher θ λ ( ) .
Now, assume that lim j φ j = 0 . Using (7) and (12), one has
Υ j + 1 θ = Υ j + 1 ( , Υ j ) + ( , Υ j ) θ Υ j + 1 ( , Υ j ) + ( , Υ j ) θ = φ j + ( , Υ j ) θ = φ j + ( 1 τ j ) ( 1 κ j ) ( 1 σ j ) Υ j + σ j Υ j + κ j ( 1 σ j ) Υ j + σ j Υ j + τ j ( 1 κ j ) ( 1 σ j ) Υ j + σ j Υ j + κ j ( 1 σ j ) Υ j + σ j Υ j θ = 1 3 1 ( 1 1 ) τ j Υ j θ + φ j ,
for j N . Let
ψ j = Υ j θ , e j = ( 1 1 ) τ j ( 0 , 1 ) and ψ j * = φ j .
Since lim j φ j = 0 , then lim i ψ j * e j = lim i ψ j e j = 0 . Therefore, all assumptions of Lemma 3 hold, consequently lim j Υ j θ = 0 , , i.e., lim j Υ j = θ .
Conversely, let lim j Υ j = θ , then
φ j = Υ j + 1 ( , Υ j ) = Υ j + 1 θ + θ ( , Υ j ) Υ j + 1 θ + θ ( , Υ j ) Υ j + 1 θ + 1 3 1 ( 1 1 ) τ j Υ j θ ,
passing j , we obtain lim j φ j = 0 . This finishes the proof. □
The following example supports Theorem 6.
Example 1.
Assume that Θ = [ 0 , 1 ] and ( R , . ) is a BS equipped with the usual norm. Define a mapping : [ 0 , 1 ] [ 0 , 1 ] by ξ = ξ 8 . Clearly, 0 is a unique FP of ℑ and ℑ fulfills (7) with 1 = 1 4 and 2 0 .
Next, we show that the proposed algorithm (7) is ℑ-stable. In this regard, assume that σ j = κ j = τ j = 1 j + 4 and ξ 0 [ 0 , 1 ] , then by (7), one has
ρ j = 1 1 j + 4 + 1 8 j + 4 ξ i = 1 7 8 j + 4 ξ j , Υ j = 1 8 1 7 4 j + 4 + 49 8 2 j + 4 2 ξ j , Λ j = 1 8 3 1 7 4 j + 4 + 49 8 2 j + 4 2 ξ j , ξ j + 1 = 1 8 3 1 42 8 j + 4 + 49 8 2 j + 4 2 + 147 2 × 8 2 ( j + 4 ) 2 343 8 3 ( j + 4 ) 3 ξ j = 1 8 3 42 8 4 j + 4 + 49 8 5 j + 4 2 + 147 2 × 8 5 ( j + 4 ) 2 343 8 6 ( j + 4 ) 3 = 1 511 512 + 42 8 4 j + 4 49 8 5 j + 4 2 147 2 × 8 5 ( j + 4 ) 2 + 343 8 6 ( j + 4 ) 3 ξ j .
Put Υ j = 511 512 + 42 8 4 j + 4 49 8 5 j + 4 2 147 2 × 8 5 ( j + 4 ) 2 + 343 8 6 ( j + 4 ) 3 . Clearly, Υ j ( 0 , 1 ) for each j > 0 and i = 0 Υ j = 0 . Due to Lemma 3, lim j ξ j = 0 . It is easy to see that lim j ξ j = lim j ξ j = 0 .
Now, consider j = 1 j + 5 for each j > 0 , we have
0 lim j ξ j j lim j ξ j + lim j j = 0 ,
which implies that lim j ξ j j = 0 . Hence, the two sequences { ξ j } and { j } are equivalent.
Finally, assume that φ j is the sequence associated with the iterative sequence { ξ j } , then, we have
φ j = j + 1 511 512 + 42 8 4 j + 4 49 8 5 j + 4 2 147 2 × 8 5 ( j + 4 ) 2 + 343 8 6 ( j + 4 ) 3 j = 1 j + 6 511 512 + 42 8 4 j + 4 49 8 5 j + 4 2 147 2 × 8 5 ( j + 4 ) 2 + 343 8 6 ( j + 4 ) 3 j 0 , as r .
Hence, the proposed algorithm (7) is ℑ-stable.

6. Numerical Examples

In this section, we provide illustrative examples to assess the convergence of iteration (7) in comparison to some of the most popular iterative schemes in the literature.
Example 2.
Assume that Ω = R 3 and Θ = ϖ = ( ϖ 1 , ϖ 2 , ϖ 3 ) : ( ϖ 1 , ϖ 2 , ϖ 3 ) [ 0 , 6 ] 3 , where [ 3 , 6 ] 3 = [ 3 , 6 ] × [ 3 , 6 ] × [ 3 , 6 ] is a subset of Ω equipped with the norm ϖ = ( ϖ 1 , ϖ 2 , ϖ 3 ) = ϖ 1 + ϖ 2 + ϖ 3 . Define a mapping : Θ Θ by
ϖ = ϖ 1 3 , ϖ 2 3 , ϖ 3 3 , if ( ϖ 1 , ϖ 2 , ϖ 3 ) [ 0 , 3 ) 3 , ϖ 1 6 , ϖ 2 6 , ϖ 3 6 , if ( ϖ 1 , ϖ 2 , ϖ 3 ) [ 3 , 6 ] 3 .
It is clear that ℑ owns a unique FP; it is ( 0 , 0 , 0 ) . Now, we shall show that ℑ is a contractive-like mapping and, hence, an ACM. In this regard, we define the function ξ : [ 0 , ) [ 0 , ) by ξ ( ϖ ) = ϖ 4 . Obviously, ξ is a strictly increasing continuous function with ξ ( 0 ) = 0 . If ϖ [ 0 , 3 ) 3 , we have
ϖ ϖ = ( ϖ 1 , ϖ 2 , ϖ 3 ) ϖ 1 3 , ϖ 2 3 , ϖ 3 3 = 2 ϖ 1 3 , 2 ϖ 2 3 , 2 ϖ 3 3 ,
and
ξ ϖ ϖ = ξ 2 ϖ 1 3 , 2 ϖ 2 3 , 2 ϖ 3 3 = ϖ 1 6 , ϖ 2 6 , ϖ 3 6 = ϖ 1 6 + ϖ 2 6 + ϖ 3 6 .
Analogously, if ϖ [ 3 , 6 ] 3 , one has
ϖ ϖ = ( ϖ 1 , ϖ 2 , ϖ 3 ) ϖ 1 6 , ϖ 2 6 , ϖ 3 6 = 5 ϖ 1 6 , 5 ϖ 2 6 , 5 ϖ 3 6 ,
and
ξ ϖ ϖ = ξ 5 ϖ 1 6 , 5 ϖ 2 6 , 5 ϖ 3 6 = 5 ϖ 1 24 , 5 ϖ 2 24 , 5 ϖ 3 24 = 5 ϖ 1 24 + 5 ϖ 2 24 + 5 ϖ 3 24 .
After that, we discuss the cases below:
(I) 
If ϖ , υ [ 0 , 3 ) 3 , then by (26), we get
ϖ υ = ϖ 1 3 , ϖ 2 3 , ϖ 3 3 υ 1 3 , υ 2 3 , υ 3 3 = ϖ 1 3 υ 1 3 + ϖ 2 3 υ 2 3 + ϖ 3 3 υ 3 3 = 1 3 ϖ 1 υ 1 + ϖ 2 υ 2 + ϖ 3 υ 3 = 1 3 ( ϖ 1 , ϖ 2 , ϖ 3 ) ( υ 1 , υ 2 , υ 3 ) = 1 3 ϖ υ 1 3 ϖ υ + ϖ 1 6 + ϖ 2 6 + ϖ 3 6 = 1 3 ϖ υ + ξ ϖ ϖ .
(II) 
If ϖ , υ [ 3 , 6 ] 3 , then by (27), we have
ϖ υ = ϖ 1 6 , ϖ 2 6 , ϖ 3 6 υ 1 6 , υ 2 6 , υ 3 6 = ϖ 1 6 υ 1 6 + ϖ 2 6 υ 2 6 + ϖ 3 6 υ 3 6 = 1 6 ϖ 1 υ 1 + ϖ 2 υ 2 + ϖ 3 υ 3 = 1 6 ( ϖ 1 , ϖ 2 , ϖ 3 ) ( υ 1 , υ 2 , υ 3 ) = 1 6 ϖ υ 1 6 ϖ υ + 5 ϖ 1 24 + 5 ϖ 2 24 + 5 ϖ 3 24 1 3 ϖ υ + ξ ϖ ϖ .
(III) 
If ϖ [ 0 , 3 ) 3 and υ [ 3 , 6 ] 3 , then by (26), we obtain that
ϖ υ = ϖ 1 3 , ϖ 2 3 , ϖ 3 3 υ 1 6 , υ 2 6 , υ 3 6 = ϖ 1 3 υ 1 6 , ϖ 2 3 υ 2 6 , ϖ 3 3 υ 3 6 = ϖ 1 6 + ϖ 1 6 υ 1 6 , ϖ 2 6 + ϖ 2 6 υ 2 6 , ϖ 3 6 + ϖ 3 6 υ 3 6 ϖ 1 6 + ϖ 1 6 υ 1 6 + ϖ 2 6 + ϖ 2 6 υ 2 6 + ϖ 3 6 + ϖ 3 6 υ 3 6 ϖ 1 6 + ϖ 2 6 + ϖ 3 6 + ϖ 1 6 υ 1 6 + ϖ 2 6 υ 2 6 + ϖ 3 6 υ 3 6 = 1 6 ϖ 1 υ 1 + ϖ 2 υ 2 + ϖ 3 υ 3 + ξ ϖ ϖ 1 3 ( ϖ 1 , ϖ 2 , ϖ 3 ) ( υ 1 , υ 2 , υ 3 ) + ξ ϖ ϖ = 1 3 ϖ υ + ξ ϖ ϖ .
(IV) 
If υ [ 0 , 3 ) 3 and ϖ [ 3 , 6 ] 3 , then by (26), one has
ϖ υ = ϖ 1 6 , ϖ 2 6 , ϖ 3 6 υ 1 3 , υ 2 3 , υ 3 3 = ϖ 1 6 υ 1 3 , ϖ 2 6 υ 2 3 , ϖ 3 6 υ 3 3 = ϖ 1 3 ϖ 1 6 υ 1 3 , ϖ 2 3 ϖ 2 6 υ 2 3 , ϖ 3 3 ϖ 3 6 υ 3 3 ϖ 1 3 ϖ 1 6 υ 1 3 + ϖ 2 3 ϖ 2 6 υ 2 3 + ϖ 3 3 ϖ 3 6 υ 3 3 ϖ 1 6 + ϖ 2 6 + ϖ 3 6 + ϖ 1 3 υ 1 3 + ϖ 2 3 υ 2 3 + ϖ 3 3 υ 3 3 = 1 3 ϖ 1 υ 1 + ϖ 2 υ 2 + ϖ 3 υ 3 + ξ ϖ ϖ = 1 3 ( ϖ 1 , ϖ 2 , ϖ 3 ) ( υ 1 , υ 2 , υ 3 ) + ξ ϖ ϖ = 1 3 ϖ υ + ξ ϖ ϖ .
Based on the above cases, we conclude that condition (7) is satisfied. Hence, ℑ is a contractive-like mapping.
Example 3.
Assume that R , . is a BS equipped with the usual norm and Δ = [ 3 , 5 ] . Define a mapping : Θ Θ by
ϖ = ϖ + 6 3 , if ϖ < 5 , 2 , if ϖ = 5 .
To prove that ℑ does not satisfy Condition (C), we take ϖ = 4 and υ = 5 , then
1 2 ϖ ϖ = 1 2 4 4 = 1 3 < 1 = ϖ υ .
But
ϖ υ 4 5 = 10 3 6 3 = 4 3 > 1 = ϖ υ .
Hence, ℑ does not satisfy Condition (C).
Now, to show that ℑ is an SGNM, we consider following cases:
(I) 
If ϖ , υ < 5 , we get
ϖ ϖ + υ υ + ( 1 2 ) ϖ υ = 1 2 ϖ ϖ + 6 3 + 1 2 υ υ + 6 3 = 1 2 2 ϖ 6 3 + 1 2 2 υ 6 3 1 2 2 ϖ 6 3 2 υ 6 3 = 1 2 2 ϖ 3 2 υ 3 = 1 3 ϖ υ = ϖ υ .
(II) 
If ϖ < 5 and υ = 5 , we obtain
ϖ ϖ + υ υ + ( 1 2 ) ϖ υ = 1 2 ϖ ϖ + 6 3 + 1 2 5 2 = 1 2 2 ϖ 6 3 + 3 2 = ϖ 3 + 1 2 ϖ 3 = ϖ υ .
(III) 
If υ < 5 and ϖ = 5 , we have
ϖ ϖ + υ υ + ( 1 2 ) ϖ υ = 1 2 5 2 + 1 2 υ υ + 6 3 = 3 2 + 1 2 2 υ 6 3 = 1 2 + υ 3 υ 3 = ϖ υ .
  • If υ = ϖ = 5 , we can write
    ϖ ϖ + υ υ + ( 1 2 ) ϖ υ = 3 > 0 = 2 υ = ϖ υ .
Hence, ℑ is an SGNM and has a unique FP 3.
Numerically, by using MATLAB R2015a, we show that our iterative scheme (7) converges faster than both iterations (5) and (6) as follows:
Let Ω = ( , ) , Θ = [ 0 , 50 ] , and : Θ Θ be a mapping described as
( ξ ) = ξ 2 9 ξ + 54 .
Clearly, 6 is a unique FP of . Consider σ j = κ j = τ j = 1 5 j + 10 , with distinct starting points. Then, we get the following Table 1 and Table 2 and Figure 1, Figure 2, Figure 3, Figure 4, Figure 5 and Figure 6 for comparing the different iterative techniques.
Remark 1.
The two main metrics used to evaluate the efficiency and success of the iterative process are time and the number of repetitions. saves time and effort when strong convergence is easily attained with the fewest repetitions in various optimization and variational inequality problems. The tables and figures above make it clear that our strategy is effective, and our algorithm acts properly when compared to other more sober iterations in this direction.

7. Solving a Nonlinear Integral Equation with Delay

In this section, we apply iteration (7) to determine the existence of the solution to the following nonlinear Volterra equation with delay:
ξ ( t ) = η ( t ) + k t Φ t , ς , ξ ( ς ) , ξ ( ς μ ) ) d ς , t J = [ k , l ] .
with the condition
ξ ( t ) = Ξ ( t ) , t [ k μ , k ] ,
where k , l R , Ξ C [ k μ , k ] , R and μ , > 0 . Clearly, the space = C [ k , l ] , R , . is a BS, where the norm . is described as ξ ϑ = max t J ξ ( t ) ϑ ( t ) and C [ k , l ] , R is the set of all continuous functions defined on [ k , l ] .
Th following theorem is the main result in this part:
Theorem 7.
Suppose that Θ is a nonempty CCS of a BS ℶ and { ξ j } is a sequence generated by (7) with { σ j } , { κ j } , { τ j } [ 0 , 1 ] . Let : be an operator described as
ξ ( t ) = η ( t ) + k t Φ t , ς , ξ ( ς ) , ξ ( ς μ ) ) d ς , t J ,
with ξ ( t ) = Ξ ( t ) , t [ k μ , k ] . Assume that the following statements are true:
( s i )
the functions η : J R and Φ : J × J × R × R R are continuous;
( s i i )
there exists a constant A Φ > 0 so that
Φ t , ς , ξ 1 , ξ 2 ) Φ t , ς , ξ 1 * , ξ 2 * ) A Φ ξ 1 ξ 1 * + ξ 2 ξ 2 * ,
for all ξ 1 , ξ 2 , ξ 1 * , ξ 2 * R + and t , ς J ;
( s i i i )
for each t , ς J , 2 A Φ ( t k ) < 1 .
Then the integral Equation (28) with (29) has a unique solution ξ ^ C [ k , l ] . Further, if ℑ is a mapping satisfying (2), then ξ j ξ ^ .
Proof. 
First, we prove that has a FP by using the Banach contraction principle. Recall that
ξ ( t ) ξ * ( t ) = 0 , ξ , ξ * C [ k μ , k ] , R , t [ k μ , k ] .
Next, for each t J , we can write
ξ ( t ) ξ * ( t ) = η ( t ) + k t Φ t , ς , ξ ( ς ) , ξ ( ς μ ) ) d ς η ( t ) + k t Φ t , ς , ξ * ( ς ) , ξ * ( ς μ ) ) d ς k t Φ t , ς , ξ ( ς ) , ξ ( ς μ ) ) Φ t , ς , ξ * ( ς ) , ξ * ( ς μ ) ) d ς A Φ k t ξ ( ς ) ξ * ( ς ) + ξ ( ς μ ) ξ * ( ς μ ) d ς A Φ k t max k μ ς l ξ ( ς ) ξ * ( ς ) + max k μ ς l ξ ( ς μ ) ξ * ( ς μ ) d ς = A Φ k t ξ ξ * + ξ ξ * d ς = 2 A Φ k t ξ ξ * d ς = 2 A Φ ( t k ) ξ ξ * .
Since 2 A Φ ( t k ) < 1 , we conclude that the operator has a unique FP λ ( ) = { ξ ^ } because it is a contraction. Hence, the problem (28) with (29) has a unique solution ξ ^ C [ k , l ] .
Finally, we show that ξ j ξ ^ . For each ξ , ξ * Θ , one has
ξ ( t ) ξ * ( t ) ξ ( t ) ξ ( t ) + ξ ( t ) ξ * ( t ) ξ ( t ) ξ ( t ) + η ( t ) + k t Φ t , ς , ξ ( ς ) , ξ ( ς μ ) ) d ς η ( t ) + k t Φ t , ς , ξ * ( ς ) , ξ * ( ς μ ) ) d ς ξ ( t ) ξ ( t ) + A Φ k t ξ ( ς ) ξ * ( ς ) + ξ ( ς μ ) ξ * ( ς μ ) d ς max k μ ς l ξ ( t ) ξ ( t ) + A Φ k t max k μ ς l ξ ( ς ) ξ * ( ς ) + max k μ ς l ξ ( ς μ ) ξ * ( ς μ ) d ς = ξ ξ + A Φ k t ξ ξ * + ξ ξ * d ς ξ ξ + 2 A Φ ( t k ) ξ ξ * .
Hence,
ξ ξ * ξ ξ + 2 A Φ ( t k ) ξ ξ * .
It is clear that the mapping fulfills (1) with 1 = 2 A Φ ( t k ) < 1 and 2 = 0 . Therefore, all requirements of Theorem 1 are satisfied. Then, the sequence { ξ j } established by the iterative scheme (7) strongly converges to the unique solution of Equation (28) with (29). □

8. Conclusion and Open Discussions

The FPs of contractive-like mappings were approximated in this work using a four-step iterative method. It has been shown analytically that for contractive-like mappings, the new iterative technique converges faster than the iterative approaches (6). Furthermore, we have demonstrated numerically that our iterative method converges faster than numerous well-known iterative schemes, such as (5) and (6) for ACMs. Similarly, the stability result of the iterative scheme (7) was also obtained. Moreover, some weak and strong convergence results are proved for SGNMs in UCBSs. Further, illustrative examples were investigated to support our results. The considered iteration was applied to determine the existence of a solution to a nonlinear Volterra integral equation. Ultimately, we identified the following as potential future work:
  • The variational inequality problem can be solved using our iteration (1) if we define the mapping in a Hilbert space Ω endowed with an inner product space. This problem can be described as: find * such that
    * , * 0 for all Ω ,
    where : Ω Ω is a nonlinear mapping. In several disciplines, including engineering mechanics, transportation, economics and mathematical programming, variational inequalities are a crucial and indispensable modeling tool; see [36,37] for more details.
  • Our methodology can be extended to include gradient and extra-gradient projection techniques, which are crucial for locating saddle points and resolving a variety of optimization-related issues; see [38].
  • We can accelerate the convergence of the proposed algorithm by adding shrinking projection and CQ terms. These methods stimulate algorithms and improve their performance to obtain strong convergence; for more details, see [39,40,41,42].
  • If we consider the mapping as an α -inverse strongly monotone and the inertial term is added to our algorithm, then we have the inertial proximal point algorithm. This algorithm is used in many applications such as monotone variational inequalities, image restoration problems, convex optimization problems and split convex feasibility problems, see [43,44]. For more accuracy, these problems can be expressed as mathematical models such as machine learning and the linear inverse problem.
  • In addition, second-order differential equations and fractional differential equations, which Green’s function can be used to transform into integral equations, can be solved using our approach. Therefore, they are simple to treat and resolve using the same method as in Section 7.

Author Contributions

H.A.H. contributed to conceptualization and writing the theoretical results; D.A.K. contributed to conceptualization, writing and editing. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

FPsFixed points
BSsBanach spaces
CCSClosed convex subset
Weak convergence
Strong convergence
ACMsAlmost contraction mappings
NIEsNonlinear integral equations
SGNMsSuzuki generalized nonexpansive mappings
UCBSsUniformly convex Banach spaces

References

  1. Berinde, V. Iterative Approximation of Fixed Points; Springer: Berlin/Heidelberg, Germany, 2007. [Google Scholar]
  2. Karapınar, E.; Abdeljawad, T.; Jarad, F. Applying new fixed point theorems on fractional and ordinary differential equations. Adv.Differ. Equ. 2019, 2019, 1–25. [Google Scholar] [CrossRef] [Green Version]
  3. Khan, S.H. A Picard-Mann hybrid iterative process. Fixed Point Theory Appl. 2013, 2013, 1–10. [Google Scholar] [CrossRef]
  4. Phuengrattana, W.; Suantai, S. On the rate of convergence of Mann, Ishikawa, Noor and SP-iterations for continuous functions on an arbitrary interval. J. Comput. Appl. Math. 2011, 235, 3006–3014. [Google Scholar] [CrossRef] [Green Version]
  5. Karahan, I.; Ozdemir, M. A general iterative method for approximation of fixed points and their applications. Adv. Fixed Point Theory 2013, 3, 510–526. [Google Scholar]
  6. Chugh, R.; Kumar, V.; Kumar, S. Strong convergence of a new three step iterative scheme in Banach spaces. Am. J. Comp. Math. 2012, 2, 345–357. [Google Scholar] [CrossRef] [Green Version]
  7. Zamfirescu, T. Fixed point theorems in metric spaces. Arch. Math. 1972, 23, 292–298. [Google Scholar] [CrossRef]
  8. Berinde, V. On the approximation of fixed points of weak contractive mapping. Carpath. J. Math. 2003, 19, 7–22. [Google Scholar]
  9. Imoru, C.O.; Olantiwo, M.O. On the stability of Picard and Mann iteration processes. Carpath. J. Math. 2003, 19, 155–160. [Google Scholar]
  10. Mann, W.R. Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 4, 506–510. [Google Scholar] [CrossRef]
  11. Ishikawa, S. Fixed points by a new iteration method. Proc. Am. Math. Soc. 1974, 44, 147–150. [Google Scholar] [CrossRef]
  12. Noor, M.A. New approximation schemes for general variational inequalities. J. Math. Anal. Appl. 2000, 251, 217–229. [Google Scholar] [CrossRef] [Green Version]
  13. 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]
  14. Abbas, M.; Nazir, T. A new faster iteration process applied to constrained minimization and feasibility problems. Math. Vesn. 2014, 66, 223–234. [Google Scholar]
  15. Hammad, H.A.; Rehman, H.U.; De la Sen, M. A novel four-step iterative scheme for approximating the fixed point with a supportive application. Inf. Sci. Lett. 2021, 10, 333–339. [Google Scholar]
  16. Hammad, H.A.; Rehman, H.U.; De la Sen, M. A New four-step iterative procedure for approximating fixed points with Application to 2D Volterra integral equations. Mathematics 2022, 10, 4257. [Google Scholar] [CrossRef]
  17. Gursoy, F.; Karakaya, V. A Picard-S hybrid type iteration method for solving a differential equation with retarded argument. arXiv 2014, arXiv:1403.2546v2. [Google Scholar]
  18. Thakur, B.S.; Thakur, D.; Postolache, M. A new iterative scheme for numerical reckoning fixed points of Suzuki’s generalized nonexpansive mappings. Appl. Math. Comput. 2016, 275, 147–155. [Google Scholar] [CrossRef]
  19. Ullah, K.; Arshad, M. Numerical reckoning fixed points for Suzuki’s generalized nonexpansive mappings via new iteration process. Filomat 2018, 32, 187–196. [Google Scholar] [CrossRef] [Green Version]
  20. Karakaya, V.; Atalan, Y.; Dogan, K.; Bouzara, N.E.H. Some fixed point results for a new three steps iteration process in Banach spaces. Fixed Point Theory 2017, 18, 625–640. [Google Scholar] [CrossRef] [Green Version]
  21. Maleknejad, K.; Torabi, P. Application of fixed point method for solving Volterra-Hammerstein integral equation. U.P.B. Sci. Bull. Ser. A 2012, 74, 45–56. [Google Scholar]
  22. Hammad, H.A.; Agarwal, P.; Momani, S.; Alsharari, F. Solving a fractional-Order differential equation using rational symmetric contraction mappings. Fractal Fract. 2021, 5, 159. [Google Scholar] [CrossRef]
  23. Wazwaz, A.M. A reliable treatment for mixed Volterra-Fredholm integral equations. Appl. Math. Comput. 2002, 127, 405–414. [Google Scholar] [CrossRef]
  24. Atlan, Y.; Karakaya, V. Iterative solution of functional Volterra-Fredholm integral equation with deviating argument. J. Nonlinear Convex Anal. 2017, 18, 675–684. [Google Scholar]
  25. Hammad, H.A.; Zayed, M. Solving systems of coupled nonlinear Atangana–Baleanu-type fractional differential equations. Bound Value Probl. 2022, 2022, 101. [Google Scholar] [CrossRef]
  26. Ofem, A.E.; Igbokwe, D.I. An efficient iterative method and its applications to a nonlinear integral equation and a delay differential equation in Banach spaces. Turk. J. Ineq. 2020, 4, 79–107. [Google Scholar]
  27. Ali, F.; Ali, J. Convergence, stability, and data dependence of a new iterative algorithm with an application. Comput. Appl. Math. 2020, 39, 1–15. [Google Scholar] [CrossRef]
  28. Hudson, A.; Joshua, O.; Adefemi, A. On modified Picard-S-AK hybrid iterative algorithm for approximating fixed point of Banach contraction map. MathLAB J. 2019, 4, 111–125. [Google Scholar]
  29. Berinde, V. Picard iteration converges faster than Mann iteration for a class of quasicontractive operators. Fixed Point Theory Appl. 2004, 2, 97–105. [Google Scholar]
  30. Senter, H.F.; Dotson, W. Approximating fixed points of nonexpansive mapping. Proc. Am. Math. Soc. 1974, 44, 375–380. [Google Scholar] [CrossRef]
  31. Suzuki, T. Fixed point theorems and convergence theorems for some generalized nonexpansive mappings. J. Math. Anal. Appl. Math. 2008, 340, 1088–1095. [Google Scholar] [CrossRef] [Green Version]
  32. 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] [Green Version]
  33. Schu, J. Weak and strong convergence to fixed points of asymptotically nonexpansive mappings. Bull. Aust. Math. Soc. 1991, 43, 153–159. [Google Scholar] [CrossRef] [Green Version]
  34. Harder, A.H. Fixed Point Theory and Stability Results for Fixed-Point Iteration Procedures. Ph.D. Thesis, University of Missouri-Rolla, St. Rolla, MO, USA, 1987. [Google Scholar]
  35. Okeke, G.A.; Abbas, M.; De la Sen, M. Approximation of the fixed point of multivalued quasi-nonexpansive mappings via a faster iterative process with applications. Discret. Dyn. Nat. Soc. 2020, 2020, 8634050. [Google Scholar] [CrossRef]
  36. Konnov, I.V. Combined Relaxation Methods for Variational Inequalities; Springer: Berlin/Heidelberg, Germany, 2001. [Google Scholar]
  37. Facchinei, F.; Pang, J.S. Finite-Dimensional Variational Inequalities and Complementarity Problems; Springer Series in Operations Research; Springer: New York, NY, USA, 2003; Volume II. [Google Scholar]
  38. Korpelevich, G.M. The extragradient method for finding saddle points and other problems. Ekon. Mat. Metod. 1976, 12, 747–756. [Google Scholar]
  39. Martinez-Yanes, C.; Xu, H.K. Strong convergence of the CQ method for fixed point iteration processes. Nonlinear Anal. 2006, 64, 2400–2411. [Google Scholar] [CrossRef]
  40. Hammad, H.A.; Rahman, H.; De la Sen, M. Shrinking projection methods for accelerating relaxed inertial Tseng-type algorithm with applications. Math. Probl. Eng. 2020, 2020, 7487383. [Google Scholar] [CrossRef]
  41. Hammad, H.A.; Cholamjiak, W.; Yambangwai, W.; Dutta, H. A modified shrinking projection methods for numerical reckoning fixed points of G-nonexpansive mappings in Hilbert spaces with graph. Miskolc Math. Notes 2019, 20, 941–956. [Google Scholar] [CrossRef]
  42. Tuyen, T.M.; Hammad, H.A. Effect of shrinking projection and CQ-methods on two inertial forward-backward algorithms for solving variational inclusion problems. Rend. Circ. Mat. Palermo II Ser. 2021, 70, 1669–1683. [Google Scholar] [CrossRef]
  43. Bauschke, H.H.; Combettes, P.L. Convex Analysis and Monotone Operator Theory in Hilbert Spaces; Springer: Berlin/Heidelberg, Germany, 2011. [Google Scholar]
  44. Bauschke, H.H.; Borwein, J.M. On projection algorithms for solving convex feasibility problems. SIAM Rev. 1996, 38, 367–426. [Google Scholar] [CrossRef] [Green Version]
Figure 1. A graphical comparison of Equations (5)–(7) where z 1 = 3.00 .
Figure 1. A graphical comparison of Equations (5)–(7) where z 1 = 3.00 .
Symmetry 15 01400 g001
Figure 2. A graphical comparison of Equations (5)–(7) where z 1 = 3.00 .
Figure 2. A graphical comparison of Equations (5)–(7) where z 1 = 3.00 .
Symmetry 15 01400 g002
Figure 3. A graphical comparison of Equations (5)–(7) where z 1 = 3.82 .
Figure 3. A graphical comparison of Equations (5)–(7) where z 1 = 3.82 .
Symmetry 15 01400 g003
Figure 4. A graphical comparison of Equations (5)–(7) where z 1 = 3.82 .
Figure 4. A graphical comparison of Equations (5)–(7) where z 1 = 3.82 .
Symmetry 15 01400 g004
Figure 5. A graphical comparison of Equations (5)–(7) where z 1 = 4.44 .
Figure 5. A graphical comparison of Equations (5)–(7) where z 1 = 4.44 .
Symmetry 15 01400 g005
Figure 6. A graphical comparison of Equations (5)–(7) where z 1 = 4.44 .
Figure 6. A graphical comparison of Equations (5)–(7) where z 1 = 4.44 .
Symmetry 15 01400 g006
Table 1. Numerical comparison of results of Equations (5)–(7).
Table 1. Numerical comparison of results of Equations (5)–(7).
Number of Iterations
Initial Point ( z 1 )Equation (5)Equation (6)Equation (7)
3.00 16137
3.82 231810
4.44 252010
Table 2. Numerical comparison of results of Equations (5)–(7).
Table 2. Numerical comparison of results of Equations (5)–(7).
Execution Time in Seconds
Initial Point ( z 1 )Equation (5)Equation (6)Equation (7)
3.00 0.004832900000000000.005957500000000000.000157200000000000
3.82 0.002367600000000000.007555200000000000.00779860000000000
4.44 0.007059300000000000.009460300000000000.00744400000000000
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

Hammad, H.A.; Kattan, D.A. Fixed-Point Estimation by Iterative Strategies and Stability Analysis with Applications. Symmetry 2023, 15, 1400. https://doi.org/10.3390/sym15071400

AMA Style

Hammad HA, Kattan DA. Fixed-Point Estimation by Iterative Strategies and Stability Analysis with Applications. Symmetry. 2023; 15(7):1400. https://doi.org/10.3390/sym15071400

Chicago/Turabian Style

Hammad, Hasanen A., and Doha A. Kattan. 2023. "Fixed-Point Estimation by Iterative Strategies and Stability Analysis with Applications" Symmetry 15, no. 7: 1400. https://doi.org/10.3390/sym15071400

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