Next Article in Journal
Uncertainty Modeling and Stability Assessment of Minimum Spanning Trees in Network Design
Previous Article in Journal
On the Dynamics of Some Higher-Order Nonlinear Difference Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Stability of the F Algorithm on Strong Pseudocontractive Mapping and Its Application

by
Taiwo P. Fajusigbe
1,
Francis Monday Nkwuda
2,
Hussaini Joshua
3,4,
Kayode Oshinubi
5,*,
Felix D. Ajibade
1 and
Jamiu Aliyu
6
1
Department of Mathematics, Federal University Oye-Ekiti, Oye-Ekiti 371104, Nigeria
2
Department of Mathematics, Federal University of Agriculture, Abeokuta 111101, Nigeria
3
Department of Mathematics, Faculty of Science, University of Kerala, Kariavattom 695581, India
4
Department of Mathematics, Faculty of Science, University of Maiduguri, Maiduguri 600104, Nigeria
5
School of Informatics, Computing and Cyber System, Northern Arizona University, Flagstaf, AZ 86011, USA
6
Mathematics Division, Department of Mathematical Sciences, Stellenbosch University, Stellenbosch 7602, South Africa
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(23), 3811; https://doi.org/10.3390/math12233811
Submission received: 6 September 2024 / Revised: 25 November 2024 / Accepted: 27 November 2024 / Published: 2 December 2024

Abstract

:
This paper investigates the stability of the F iterative algorithm applied to strongly pseudocontractive mappings within the context of uniformly convex Banach spaces. The study leverages both analytic and numerical methods to demonstrate the convergence and stability of the algorithm. In comparison to previous works, where weak-contraction mappings were utilized, the strongly pseudocontractive mappings used in this study preserve the convergence property, exhibit greater stability, and have broader applicability in optimization and fixed point theory. Additionally, this work shows that the type of mapping employed converges faster than those in earlier studies. The results are applied to a mixed-type Volterra–Fredholm nonlinear integral equation, and numerical examples are provided to validate the theoretical findings. Key contributions of this work include the following: (i) the use of strongly pseudocontractive mappings, which offer a more stable and efficient convergence rate compared to weak-contraction mappings; (ii) the application of the F algorithm to a wider range of problems; and (iii) the proposal of future directions for improving convergence rates and exploring the algorithm’s behavior in Hilbert and reflexive Banach spaces.
MSC:
65K15; 47J25; 65J15; 90C33

1. Introduction

Throughout this work, X denotes a real Banach space, and Z represents the set of non-negative integers. D ( H ) is the domain of the self-mapping H, while F ( X ) refers to the fixed point set of H.
The mapping H is said to be as follows:
  • Lipschitzian with constant L if for L > 0 , the following inequality holds for all x , y D ( H ) :
    H ( x ) H ( y ) L x y .
    Here, L is a constant that satisfies 0 < L < .
  • Contractive if in inequality (1), L ( 0 , 1 ) .
  • Nonexpansive if in inequality (1), L = 1 .
Definition 1
([1]). A mapping H is said to be k-strongly pseudocontractive if there exists a constant k > 1 such that
x y x y + r I H x r I H y ,
for all x , y D H and for all r < 0 .
Remark 1.
From the result of Kato [2], inequality (1) is equivalent to inequality (2); then, there exists j x y J x y such that
H x H y , j x y x y 2 ,
for all x , y D H .
Remark 2.
From the inequality (1), Bogin [3] obtained the following inequality:
H x H y , j x y k x y 2
or
H x H y , j x y ( 1 k ) x y 2 ,
and the mapping H is said to be strongly pseudocontractive for some k 0 , 1 .
Remark 3.
A strongly pseudocontractive mapping is said to be a strongly ϕ-pseudocontractive mapping, given ϕ defined as ϕ ( s ) = k s for k ( 0 , 1 ) where the converse is not required to be true.
Definition 2.
A mapping H is said to be strongly ϕ-pseudocontractive x , y Z where there exists j ( x y ) J ( x y ) and there is a strictly increasing function ϕ : [ 0 , ) [ 0 , ) with ϕ ( 0 ) = 0 such that
H x H y , j ( x y ) x y 2 ϕ ( x y ) x y .
Remark 4.
A strongly ϕ-pseudocontractive mapping is said to be generalized strongly Φ-pseudocontractive mapping with Φ : 0 , 0 , defined by Φ ( s ) = ϕ ( s ) where the converse is not needed to be true.
Definition 3.
A mapping H is said to be generalized strongly Φ-pseudocontractive x , y Z , having j x y J x y and a strictly increasing function Φ : [ 0 , ) [ 0 , ) with Φ ( 0 ) = 0 such that
H x H y , j ( x y ) x y 2 Φ ( x y ) .
Definition 4
([4]). Let H be a self-mapping on a subset of a Banach space Z with a fixed point p and { t n } be an arbitrary sequence in K. Then, an iterative scheme p n + 1 = f ( H , p n ) for some function f, converging to a fixed point p, is said to be H-stable or stable with respect to H if for
ϑ n = t n + 1 f ( H , t n ) ( n Z + ) ,
lim n ϑ n = 0 if and only if lim n t n = p .
The stability results of various iterative schemes for several classes of nonlinear mappings have been identified and studied by many researchers. Among them is Ostrowski [4] who introduced the concept of stability for a fixed point iterative scheme and proved that Picard’s iterative scheme is stable with respect to contraction mappings. The theorem is as follows:
Theorem 1
([4]). Let p 0 be an arbitrary point in Z. Suppose { p n } is a sequence in Z which satisfies
p n + 1 = x n 1 H ( x n ( 2 ) H ( . . . . . H ( x n ( k ) H p n + ( 1 x n ( k ) ) p n + u n ( k ) ) + . . . . ) + ( 1 x n ( 2 ) P n + u n ( 2 ) ) + ( 1 x n ( 1 ) p n + u n ( 1 ) )
For p 0 Z , n = 1 , 2 , 3 , , { t n } is a sequence in Z; then,
ϑ n = p n + 1 ( 1 x n ( 1 ) ) p n x n ( 1 ) H p n ( 1 ) u n ( 1 ) , n = 0 , 1 ,
where ( u n ( i ) ) are sequences in a real Banach space Z and ( x n i ) , i = 1 , k where k is a real sequence in [ 0 , 1 ] satisfying the following conditions:
(c1.)
n = 0 u n ( 1 ) ;
(c2.)
lim n u n ( i ) = 0 , i = 2 , k ;
(c3.)
lim n x n ( 1 ) = 0 , i = 1 , k ;
(c4.)
n = 1 x n ( 1 ) = .
Then,
(i) 
the sequence { p n } is almost H-stable
(ii) 
lim n p n + 1 = p f ( H ) implies lim n ϑ = 0
Harder and Hicks [5] extended the work of Ostrowski [4] for more general iterative schemes with contractive conditions. In the process of estimating fixed points, the authors considered an estimated sequence { t n } instead of the theoretical sequence { p n } due to rounding errors and numerical estimation of functions. The authors stated the stability of an iterative scheme as follows:
Theorem 2
([5]). Let ( Z , d ) be a complete metric space and H : Z Z be a mapping. Then, given that f H = { p Z : H p = p } is the set of fixed points of H, let { t n } n = 0 Z be the sequence generated by an iterative scheme which is defined by
t n + 1 = f ( H , t n ) , f o r n = 0 , 1 , 2 , , t 0 Z ,
where t 0 Z is the first estimation and f is some function. Considering that the sequence { t n } n = 0 converges to a fixed point p of H, then, setting ϑ n = d t n + 1 , f ( H , t n ) n = 0 , 1 , 2 , shows that the iterative scheme is H-stable if and only if
lim n ϑ n = 0 lim n t n = p .
Also, Ajibade et al [6] obtained the convergence and stability of the Ishikawa iterative process for a class of ϕ -quasinonexpansive mappings. Recently, Ali and Ali [7] constructed a new two-step iterative algorithm, known as F iteration to estimate the fixed points of weak contractions in Banach spaces as given below:
p 0 Z p n + 1 = H q n q n = H 1 r n p n + r n H p n .
The authors proved that the sequence of the proposed algorithm converges strongly to a fixed point of weak contractions. The F iterative scheme is also shown to be almost stable for weak contractions and converges to a fixed point faster than Picard, Mann, Ishikawa, S, normal-S and Varat iterative schemes. A data dependence result was obtained using the F iteration, and numerical examples were presented to validate the results. Furthermore, the results were also used to estimate the solution of the nonlinear quadratic Volterra integral equation. Finally, in the work, an open question arose thus—“can the sequence { p n } generated by F iterative scheme converge to a fixed point of nonexpansive or pseudocontractive mappings?” In response to the question, Ajibade et al. [8] showed that the sequence generated by the F iterative algorithm (5) converges strongly to a fixed point of a strongly pseudocontractive mapping in the framework of uniformly convex Banach spaces.
In addition, Gursoy [9] studied a mixed Volterra–Fredholm nonlinear integral equation and utilized it via a normal S-iterative scheme to show that the iterative sequence generated converges to a solution of its integral equation. Subsequently, Ali et al. [10] studied Picard’s three-step iterative scheme for the estimation of fixed points of Zamfirescu mappings in an arbitrary Banach space. The authors proved that Picard’s three-step iterative scheme was almost H-stable and converged faster than Picard, Mann, Ishikawa, Noor, S, normal S and other existing iterative schemes. Lastly, they applied the result to estimate the solution of a mixed Volterra–Fredholm nonlinear integral equation. More recently, Alshehri et al. [11] examined the J F iterative scheme and estimated the fixed points of a nonlinear mapping which satisfies a condition in uniformly convex Banach spaces. Thereafter, weak and strong convergence results were obtained. The authors also highlighted that the J F iterative scheme is weakly w 2 H -stable with respect to most contractions, and at the end of their main results, a numerical example was given to show that the J F iterative scheme is more effective in its convergence than some existing iterative schemes. As part of its application, the J F iterative scheme was employed to approximate the solution of a mixed Volterra–Fredholm nonlinear integral equation (see also [12,13]). Several investigations were also conducted by researchers in the literature on the iterative scheme (see [14,15,16,17,18,19,20,21]). The mixed Volterra–Fredholm nonlinear integral equation which was first introduced by Cracium and Serban [22] is given as follows:
p t = F t , p t , a 1 t 1 . . . . a j t j K t , s , p s d s a 1 b 1 . . . . a j b j T t , s , p s d s .
Motivated by the works of [7,8,9], we investigate the stability of the F iterative algorithm on a strongly pseudocontractive mapping in the framework of uniformly convex Banach space. The result is obtained via numerical and analytic methods (see [23,24,25,26,27,28,29,30,31]). The applicability of the result is shown on a mixed-type Volterra–Fredholm nonlinear integral equation. Finally, a numerical example is given. Some of the novel contributions of this work are as follows:
(i)
In [7], the authors used weak-contraction mapping to obtain the result, while in this work, we utilized strongly pseudocontractive mapping which preserves the convergence property, is more stable, and has wider applicability in optimization and fixed point theory.
(ii)
The type of map used in this work converges faster than the maps used in the previous works (see [7,8,9]).
In Section 1, an overview of previous works in this research direction is considered. Basic definitions, remarks, and results are given. In Section 2, useful lemmas necessary for proving our result are presented. In Section 3, the main results are presented. In Section 4, the applicability of our result is shown. Section 5 contains a numerical example that validates the main result. The last section contains concluding remarks and recommendations.

2. Preliminaries

Useful lemmas necessary to prove our main results are presented in this section as follows:
Lemma 1.
Let J : Z 2 Z be the normalized duality mapping, then
a + b 2 a 2 + 2 b , j ( a + b ) ,
for all a , b Z where j ( a + b ) J ( a + b ) .
Lemma 2.
If μ n n = 0 is a non-negative real sequence satisfying
μ n + 1 1 γ n μ n + σ n ,
where γ n 0 , 1 , n = 1 γ n = , and σ n = o γ n , then μ n 0 as n .

3. Main Results

To show the stability of the F iterative scheme using strongly pseudocontractive mapping in a uniformly convex Banach space, we prove the following theorem:
Theorem 3.
Let Z be a uniformly Banach space and H : Z Z be a strongly pseudocontractive mapping with a bounded set and with F ( H ) . Let { r n } be a real sequence in ( 0 , 1 ) satisfying the following conditions:
lim n r n = 0 , n = 1 r n = .
Let P 0 be an arbitrary point in Z with { t n } , a sequence in Z. Assume that { p n } is a sequence in Z which satisfies the iterative scheme
t n + 1 = H c n c n = H a n a n = 1 r n t n + r n H t n .
Then,
(i) 
lim n t n = p F ( H ) lim n ϑ n = 0 .
(ii) 
The sequence { p n } is almost H-stable.
Proof. 
(i) Let lim n t n = p F ( H ) , where
ϑ n = t n + 1 f ( H , t n ) = t n + 1 ( 1 r n ) t n r n H t n .
Then, using some arithmetic and the conditions of the theorem, we obtain the following:
ϑ n = t n + 1 ( 1 r n ) t n r n H t n = t n + 1 p ( 1 r n ) t n + ( 1 r n ) p + r n p r n H t n = t n + 1 p ( 1 r n ) ( p t n ) + r n ( p H t n ) | | t n + 1 p | | + ( 1 r n ) | | p t n | | + r n | | p H t n | | ϑ n | | t n + 1 p | | + ( 1 r n ) | | t n p | | + r n | | H t n p | | 0 a s n .
Thus, the theorem follows in the first part.
(ii) To show that the sequence { t n } is bounded, we have
| | t n + 1 p | | = t n + 1 ( 1 r n ) t n r n H t n + ( 1 r n ) ( t n p ) + r n ( H t n H p ) | | t n + 1 ( 1 r n ) t n r n H t n | | + | | ( 1 r n ) ( t n p ) + r n ( H t n H p ) | | ϑ n + ( 1 r n ) | | ( t n p ) | | + r n | | ( H t n H p ) | | = ( 1 r n ) | | ( t n p ) | | + r n M 1 + ϑ n ,
where
M 1 = sup n N | | H t n H p | | .
| | t n + 1 p | | 2 = | | t n + 1 ( 1 r n ) t n r n H t n + ( 1 r n ) ( t n p ) + r n ( H t n H p ) | | 2 | | ( 1 r n ) ( t n p ) + r n ( H t n H p ) | | 2 + 2 t n + 1 ( 1 r n ) t n r n H t n , j t n + 1 p ( 1 r n ) 2 | | t n p | | 2 + 2 r n ( H t n H p ) , j ( ( 1 r n ) ( t n p ) + r n ( H t n H p ) ) + 2 t n + 1 ( 1 r n ) t n r n H t n , j t n + 1 p = ( 1 r n ) 2 | | t n p | | 2 + 2 r n ( H t n H p ) , j ( ( 1 r n ) ( t n p ) + r n ( H t n H p ) ) + 2 r n ( H t n H p ) , j ( t n p ) + 2 t n + 1 ( 1 r n ) t n r n H t n , j t n + 1 p . ( i ) .
On the other hand,
| | t n + 1 ( 1 r n ) t n r n H t n , j t n + 1 p | | M 1 ϑ n . ( i i ) .
From (i) and (ii), we have
| | t n + 1 p | | 2 ( 1 r n ) 2 | | t n p | | 2 + 2 r n ( H t n H p ) , j ( 1 r n ) ( t n p ) + r n ( H t n H p ) j ( t n p ) + 2 r n ( H t n H p ) , j ( t n p ) + 2 M 1 ϑ n . ( i i i )
Since H is strongly pseudocontractive,
H t n H p , j ( t n , p ) k | | t n p | | 2 .
Using the above inequality in (iii), we obtain
| | t n + 1 p | | 2 ( 1 r n ) 2 | | t n p | | 2 + 2 r n ( H t n H p ) , j ( 1 r n ) ( t n p ) + r n ( H t n H p ) j ( t n p ) + 2 r n k | | t n p | | 2 + 2 M 1 ϑ n . ( i v )
Now, we show that the following sequence
ϱ n = H t n H p , j ( ( 1 r n ) ( t n p ) + r n ( H t n H p ) ) j ( t n p ) ,
converges as n . By the condition of the theorem and because t n and H t n are a bounded sequence in Z,
( 1 r n ) ( t n p ) + r n ( H t n H p ) j ( t n p ) t n p r n ( t n p ) + r n ( H t n H p ) ( t n p ) = r n H t n r n t n + r n p r n H p 0 a s n .
Z is a uniformly smooth Banach space and j is uniformly continuous on any bounded subset of Z. Thus, we have
j ( ( 1 r n ) ( t n p ) + r n ( H t n H p ) ) j ( t n p ) 0 a s n
which makes ϱ n 0 a s n . Using the above conditions in (iv), we have
| | t n + 1 p | | 2 ( 1 r n ) 2 | | t n p | | 2 + 2 r n ϱ n + 2 r n k | | t n p | | 2 + 2 M 1 ϑ n [ ( 1 r n ) 2 + 2 r n k ] | | t n p | | 2 + 2 r n ϱ n + 2 M 1 ϑ n = [ 1 ( 2 r n r n 2 2 r n k ) ] | | t n p | | 2 + 2 r n ϱ n + 2 M 1 ϑ n = [ 1 r n ( 2 r n 2 k ) ] | | t n p | | 2 + 2 r n ϱ n + 2 M 1 ϑ n , ( v )
by choosing a large positive N, such that for all n N and 1 r n 2 < k < 2 r n 2 , σ n = 2 r n ϱ n + 2 M 1 ϑ n , the inequality (v) above yields
| | t n + 1 p | | 2 [ 1 r n ( 2 r n 2 k ) ] | | t n p | | 2 + σ n
Therefore, by setting μ n = | | t n p | | 2 and γ n = r n ( 2 r n 2 k ) ,
μ n + 1 ( 1 γ n ) μ n + σ n .
By using Lemma 2, we have γ n [ 0 , 1 ] ,   n = 1 γ n = and σ n = 0 ( r n ) . On taking the limit of both sides and n = 1 ϑ n thus, μ n 0 implies that t n p as n . Hence, the sequence { p n } generated by the F iterative scheme is almost H-stable. □

4. Application

In this aspect, the solution of a mixed Volterra–Fredholm nonlinear integral equation was approximated using the iterative scheme (6).
The mixed Volterra–Fredholm nonlinear integral equation is given as follows:
p t = F t , p t , a 1 t 1 . . . . a j t j K t , s , p s d s a 1 b 1 . . . . a j b j T t , s , p s d s ,
where a 1 ; b 1 × . . . . × a j ; b j is an interval in R j , t = t 1 , t 2 , , t j , s = s 1 , s 2 , , s j a 1 , b 1 × × a j , b j , K , T : a 1 ; b 1 × . . . . × a j ; b j × a 1 ; b 1 × . . . . × a j ; b j × R R continuous functions and F : a 1 ; b 1 × . . . . × a j ; b j × R 3 R .
Considering that the following conditions are satisfied:
M 1   K , T : C a 1 ; b 1 × . . . . × a j ; b j × a 1 ; b 1 × . . . . × a j ; b j × R ;
M 2   F C a 1 ; b 1 × . . . . × a j ; b j × a 1 ; b 1 × . . . . × a j ; b j × R 3 ;
M 3 there exist non-negative constants α , η , and γ such that
| F t , e 1 , e 2 , e 3 F t , f 1 , f 2 , f 3 | α | e 1 f 1 | + η | e 2 f 2 | + γ | e 3 f 3 | ,
for all t a 1 ; b 1 × . . . . × a j ; b j , e j , f j R , j = 1 , 2 , 3 .
M 4 there exist non-negative constants L K and L T such that
| K t , s , u K t , s , v | L K | u v |
| T t , s , u T t , s , v | L T | u v | ,
for all t , s a 1 ; b 1 × . . . . × a j ; b j , u , v R .
M 5   α + η L K + γ L T b 1 a 1 . . . . b j a j < 1 . By the solution of problem 4.2 , we mean a function p C a 1 , b 1 × × a j , b j .
Theorem 4.
Assume that conditions M 1 M 5 are satisfied. Then, a unique solution for Theorem 3 exists for p C a 1 , b 1 × × a j , b j . Therefore, using the iterative Scheme in Equation (6), we prove the following main result.
Theorem 5.
Let Y = C a 1 , b 1 × × a j , b j , . be a Banach space with Chebyshev’s norm. An operator H : Y Y with { p n } as a sequence defined by the iterative scheme in Equation 6 is given as
H p t = F t , p t , a 1 t 1 . . . . a j t j K t , s , p s d s a 1 b 1 . . . . a j b j T t , s , p s d s ,
where F , K and T are defined as above. Considering that conditions M 1 M 5 are satisfied, Theorem 3 exists and the iterative scheme in Equation (6) converges to a unique solution p C a 1 , b 1 × × a j , b j .
Proof. 
Firstly, we need to show the kind of mapping to be defined by H.
H p H p 2 = H p p 2 = | H p t H p t | 2 . = F t , p t , a 1 t 1 a j t j K t , s , p s d s a 1 b 1 a j b j T t , s , p s d s F t , p t , a 1 t 1 a j t j K t , s , p s d s a 1 b 1 a j b j T t , s , p s d s 2
| p ( t ) p ( t ) | + η | a 1 t 1 a j t j K t , s , p s d s a 1 t 1 a j t j K t , s , p s d s | + γ | a 1 b 1 a j b j T t , s , p s d s a 1 b 1 a j b j T t , s , p s d s | 2
α | p t p t | + η a 1 t 1 a j t j | K t , s , p s K t , s , p s | d s + γ a 1 b 1 a j b j | T t , s , p s T t , s , p s | d s 2
α | p t p t | + η a 1 t 1 a j t j L K | p s p s | d s + γ a 1 b 1 a j b j L T | p s p s | d s 2
= α p p + η a 1 t 1 a j t j L K p p d s + γ a 1 b 1 . a j b j L T p p d s 2
H p H p 2 [ α p p + η L K t 1 a 1 t 2 a 2 t j a j p p . + γ L T b 1 a 1 b 2 a 2 b j a j p p ] 2
implying
H p H p 2 α + η L K + γ L T b 1 a 1 b j a j p p 2 .
Applying assumption M 5 we have
α + η L K + γ L H b 1 a 1 b j a j < 1 .
Moreover, Equation (10) can be written as follows:
H p H p 2 α + η L K + γ L T b 1 a 1 b j a j 2 p p 2 ,
by setting
k : = α + η L K + γ L T b 1 a 1 b j a j 2 < 1 .
Thus,
H p H p 2 = H p p , j H p p k p p 2 .
Hence, this shows that the operator defined by H is a strongly pseudocontractive mapping. As stated in Theorem (3), we consider that p is the fixed point of H. So, we show that p n p as n . Inserting iterative scheme (6), Equation (10) and conditions M 1 M 4 , we have
z n p = 1 r n p n + r n H p n     = 1 r n p n + r n H p n r n p + r n p p   = 1 r n p n p + r n H p n p = | 1 r n p n t p t + r n H p n t p t | 1 r n | p n t p t | + r n | H p n t p t | .
= 1 r n | p n t p t |     + r n | F t , p n t , a 1 t 1 a j t j K t , s , p n s d s , a 1 b 1 a j b j T t , s , p n s d s F t , p t , a 1 t 1 a j t j K t , s , p s d s , a 1 b 1 a j b j T t , s , p s d s | .
    1 r n | p n t p t | + r n α | p n t p t | + r n η | a 1 t 1 a j t j K t , s , p n s d s     a 1 t 1 a j t j K t , s , p s d s | + r n γ | a 1 b 1 a j b j T t , s , p n s d s a 1 b 1 a j b j T t , s , p s d s |     1 r n | p n t p t | + r n α | p n t p t | + r n η a 1 t 1 a j t j | K t , s , p n s K t , s , p s | d s + r n γ a 1 b 1 a j b j | T t , s , p n s T t , s , p s | d s 1 r n p n t p t + r n α p n t p t + r n η a 1 t 1 a j t j L K p n s p s d s + r n γ a 1 b 1 a j b j L T p n s p s d s .
z n p α p n p + η L K t 1 a 1 t 2 a 2 t j a j p n p + γ L T b 1 a 1 b 2 a 2 b j a j p n p .
This implies that
z n p p n p 1 r n 1 α + η L K + γ L T b 1 a 1 b j a j .
Similarly, we have
q n p = H z n p = | H z n t H p t | = F t , z n t , a 1 t 1 a j t j K t , s , z n s d s a 1 b 1 a j b j T t , s , z n s d s F t , p t , a 1 t 1 a j t j K t , s , p s d s a 1 b 1 a j b j T t , s , p s d s
α | z n t p t | + η a 1 t 1 a j t j K t , s , z n s d s a 1 t 1 a j t j K t , s , p s d s     + γ a 1 b 1 a j b j H t , s , q n s d s a 1 b 1 a j b j H t , s , p s d s
α | z n t p t | + η a 1 t 1 a j t j | K t , s , z n s K t , s , p s | d s + γ a 1 b 1 a j b j | T t , s , z n s T t , s , p s | d s
α | z n t p t | + η a 1 t 1 a j t j L K | z n s p s | d s + γ a 1 b 1 a j b j L T | z n s p s | d s = α z n p + η a 1 t 1 a j t j L K z n p d s + γ a 1 b 1 a j b j L T z n p d s
q n p α z n p + η L K t 1 a 1 t 2 a 2 t j a j z n p + γ L T b 1 a 1 b 2 a 2 b j a j z n p .
Thus, it implies that
q n p α + η L K + γ L T b 1 a 1 b j a j z n p .
p n + 1 p = H q n p = | H q n t H p t | = F t , q n t , a 1 t 1 a j t j K t , s , q n s d s a 1 b 1 a j b j T t , s , q n s d s F t , p t , a 1 t 1 a j t j K t , s , p s d s a 1 b 1 a j b j T t , s , p s d s
α | q n ( t ) p ( t ) | + η | a 1 t 1 a j t j K t , s , q n s d s a 1 t 1 a j t j K t , s , p s d s | + γ | a 1 b 1 a j b j T t , s , q n s d s a 1 b 1 a j b j T t , s , p s d s |
α | q n t p t | + η a 1 t 1 a j t j | K t , s , q n s K t , s , p s | d s + γ a 1 b 1 a j b j | T t , s , q n s T t , s , p s | d s
α | q n t p t | + η a 1 t 1 a j t j L K | q n s p s | d s + γ a 1 b 1 a j b j L T | q n s p s | d s
= α | q n p | + η a 1 t 1 a j t j L K | q n p | d s + γ a 1 b 1 . . . . a j b j L T | q n p | d s
p n + 1 p α q n p + η L K t 1 a 1 t 2 a 2 t j a j q n p + γ L T b 1 a 1 b 2 a 2 b j a j q n p .
This implies that
p n + 1 p α + η L K + γ L T b 1 a 1 b j a j q n p .
Substituting (13) into (14) gives
p n + 1 p α + η L K + γ L T b 1 a 1 b j a j 2 z n p .
Substituting (12) into (15),
p n + 1 p α + η L K + γ L T b 1 a 1 b j a j 2 × 1 r n 1 α + η L K + γ L H b 1 a 1 b j a j × p n p .
Applying assumption M 5 , we have
α + η L K + γ L T b 1 a 1 b j a j < 1 .
Also,
α + η L K + γ L T b 1 a 1 b j a j 2 < 1 2 .
So,
p n + 1 p 1 r n 1 α + η L K + γ L T b 1 a 1 b j a j × p n p .
Thus, it follows by induction that
p n + 1 p p 0 p × k = 0 n 1 r k 1 α + η L K + γ L T × i = 1 j b i a i .
Since r k 0 , 1 for all k N , using assumption M 5 gives
1 r k 1 α + η L K + γ L T i = 1 j b i a i < 1 .
Accepting the fact that exp y 1 y , ∀ y 0 , 1 where Equation 4.17 is rewritten as
p n + 1 p p 0 p exp 1 α + η L K + γ L T × i = 1 j b i a i k = 0 n r k .
Taking the lim a s n on both sides yields lim n p n p = 0 , which implies p n p . Hence, (6) converges strongly to a unique solution of the mixed-type Volterra–Fredholm nonlinear integral Equation (9). □

5. Numerical Example

Example 1.
Let Y = 0 , 1 and consider the mapping H x = x 7 1 + x . Now, F H = 0 . Hence, we claim that the F iteration algorithm is stable. Let us consider r n = 1 2 and the control sequence p n = q n = 1 n , then lim n p n = 0 .
  • Solution:
ϑ n = p n + 1 H q n = p n + 1 H H 1 r n p n + r n H p n = p n + 1 H H 16 n + 14 2 n 14 n + 14 = p n + 1 H 16 n + 14 7 2 n 14 n + 14 + 16 n + 14 = p n + 1 16 n + 14 7 28 n 2 + 60 n + 28 = 1 n + 1 16 n + 14 7 28 n 2 + 60 n + 28 = 196 n 2 + 404 n + 182 196 n 2 + 420 n + 196 n + 1 = 196 n 2 + 404 n + 182 196 n 3 + 616 n 2 + 616 n + 196
On taking the lim a s n on both sides, we have lim n ϑ n = 0 . Hence, the F iterative algorithm is H-stable.
  • Iterative Test:
The F iterative scheme converged in 4 iterations to 0.0000001. The Mann iterative scheme converged in 23 iterations to 0.000002. The Ishikawa iterative scheme converged in 23 iterations to 0.000001. The S iteration scheme converged in 7 iterations to 0.0000000. In Table 1, we present the different iterative schemes values for the first 25 steps and in Figure 1, we showed the convergence of the different iterative schemes.

6. Conclusions

In conclusion, F iterative algorithm has been proved to be stable for a strongly pseudocontractive mapping on a uniformly convex Banach space. The applicability of the result is shown on a mixed-type Volterra–Fredholm nonlinear integral equation, and an example is also given which validates the result. Meanwhile, as an open problem, we pose the following questions:
(i)
Can the sequence { p n } generated by F iterative algorithm converge to a fixed point of strictly pseudocontractive mapping under a suitable condition unlike the strongly pseudocontractive mapping proved in this work?
(ii)
Can a researcher construct an iterative algorithm that converges faster than F iterative algorithm and also prove the stability of the algorithm?
(iii)
Can an investigation be carried out on both Hilbert and reflexive Banach spaces?

Author Contributions

Conceptualization, T.P.F., F.M.N., H.J., F.D.A. and J.A.; Methodology, T.P.F., F.M.N., H.J., F.D.A. and J.A.; Validation, T.P.F., F.M.N., H.J., F.D.A. and J.A.; Formal analysis, T.P.F., F.M.N., H.J., F.D.A. and J.A.; Investigation, T.P.F., F.M.N., H.J., K.O., F.D.A. and J.A.; Resources, K.O.; Writing—original draft, T.P.F., F.M.N., H.J., F.D.A. and J.A.; Writing—review & editing, T.P.F., F.M.N., H.J., K.O., F.D.A. and J.A.; Supervision, F.M.N., H.J. and K.O.; Project administration, F.M.N. and H.J.; Funding acquisition, K.O. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

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

Acknowledgments

The authors appreciate the Black in Mathematics Association (BMA) for providing the collaborative platform to carry out this research.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Nkwuda, F.M.; Oguntuase, J.A.; Abass, H.A.; Aphane, M. Approximating solution of system of variational inequality constrained split common fixed point problem in Hilbert spaces. Asia Pac. J. Math. 2024, 11, 57. [Google Scholar] [CrossRef]
  2. Kato, T. Nonlinear semigroup and evolution equations. J. Math. Soc. Jpn. 1967, 19, 508–520.1. [Google Scholar] [CrossRef]
  3. Bogin, J. On Strict Pseudocontractive and a Fixed Point Theorem; Technion Preprint MT-29; Haifa, Israel, 1974. [Google Scholar]
  4. Ostrowski, A.M. The round—Off stability of iterations. Z. Angew. Math. Mech. 1967, 47, 77–81. [Google Scholar] [CrossRef]
  5. Harder, A.M.; Hicks, T.L. Stability results for fixed point Procedures. Math. Jpn. 1988, 33, 693–706. [Google Scholar]
  6. Ajibade, F.D.; Akinbo, G.; Ajisope, M.O.; Fatai, M.O. Convergence and stability of the Ishikawa iterative process for a class of ϕ-quasinonexpansive mappings. Afr. Sci. Rep. 2022, 1, 73–80. [Google Scholar]
  7. Ali, F.; Ali, J. Convergence, stability, and data dependence of a new iterative algorithm with an application. J. Comp. Appl. Math. 2020, 39, 267. [Google Scholar] [CrossRef]
  8. Ajibade, F.D.; Nkwuda, F.M.; Joshua, H.; Fajusigbe, T.P.; Oshinubi, K. Investigation of the F* Algorithm on Strong Pseudocontractive Mappings and Its Application. Axioms 2023, 12, 1041. [Google Scholar] [CrossRef]
  9. Gursoy, F. Application of normal S—Iterative method to a nonlinear integral equation. Sci. World J. 2014, 2014, 943127. [Google Scholar] [CrossRef]
  10. Ali, F.; Ali, J.; Rodriguez-Lopez, R. Approximation of fixed points and the solution of a nonlinear integral equation. Nonlinear Funct. Anal. Appl. 2021, 26, 869–885. [Google Scholar]
  11. Delves, L.M.; Mohamed, J.L. Computational Methods for Integral Equation; Cambridge University Press: Cambridge, MA, USA, 1985. [Google Scholar]
  12. Brunner, H.; van Houwen, P.J. The Numerical Solution of Volterra Equations; CWI Monographs; North-Holland: Amsterdam, The Netherlands, 1986; Volume 3. [Google Scholar]
  13. Alshehri, M.G.; Khan, F.A.; Ali, F. An iterative algorithm to approximate fixed points of nonlinear operators with application. Mathematics 2022, 10, 1132. [Google Scholar] [CrossRef]
  14. Bing, T.; Qin, X. Modified inertial projection and contraction algorithms for solving variational inequality problems with non-Lipschitz continuous operators. Anal. Math. Phys. 2022, 12, 26. [Google Scholar]
  15. Yanlai, S.; Bazighifan, O. Two Regularization Methods for the Variational Inequality Problem over the Set of Solutions of the Generalized Mixed Equilibrium Problem. Mathematics 2022, 10, 2981. [Google Scholar] [CrossRef]
  16. Yanlai, S. An efficient radial basis function generated finite difference meshfree scheme to price multi-dimensional PDEs in financial options. J. Comput. Appl. Math. 2024, 436, 115382. [Google Scholar]
  17. Jenber, D.; Zegeye, H.; Takele, M.H.; Tufa, A.R. Strong convergence theorems for a solution of split common fixed point problem involving λ-strict quasi-Gf-pseudocontractive mappings in Banach spaces. J. Math. Comput. Sci. 2023, 30, 173–189. [Google Scholar]
  18. Gunasekar, T.; Raghavendran, P.; Santra, S.S.; Sajid, M. Analyzing existence, uniqueness, and stability of neutral fractional Volterra-Fredholm integro-differential equations. J. Math. Comput. Sci. 2024, 33, 390–407. [Google Scholar] [CrossRef]
  19. Stevic, S. Stability of a new iteration method for strongly pseudocontractive mappings. Demonstr. Math. J. 2003, 50, 71–85. [Google Scholar]
  20. Chidume, C.E. Approximation of fixed points of strongly pseudocontractive mappings. Proc. Am. Math. Soc. 1994, 120, 545–551. [Google Scholar] [CrossRef]
  21. Osilike, M.O. Stability of the Mann and Ishikawa iteration procedures for ϕ—strongly pseudocontractions and nonlinear equations of the ϕ-strongly accretive type. J. Math. Anal. Appl. 1998, 227, 319–334. [Google Scholar] [CrossRef]
  22. Cracium, C.; Serban, M.A. A nonlinear integral equation via Picard operators. Fixed Point Theory 2011, 12, 57–70. [Google Scholar]
  23. Agrawal, R.P.; O’Regan, D.; Sahu, D.R. Iterative construction of fixed points of nearly asymtotically nonexpansive mappings. J. Nonlinear. Convex. Anal. 2007, 8, 61–79. [Google Scholar]
  24. Srivastava, S.C.; Biswas, S. History, development and application of pseudocontractive mapping with fixed point theory. Int. J. Math. Trends -Technol.-IJMTT 2020, 66, 2231–5373. [Google Scholar]
  25. Mann, W.R. Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 4, 506–510. [Google Scholar] [CrossRef]
  26. Ishikawa, S. Fixed points by a new iteration method. Proc. Am. Math. Soc. 1974, 44, 147–150. [Google Scholar] [CrossRef]
  27. Stevic, S. Approximating fixed points of nonexpansive mappings by a new iteration method. Proc. Am. Math. Soc. 2006, 1, 437–450. [Google Scholar]
  28. Stevic, S. Approximating fixed points of strongly pseudocontractive mappings by a new iteration method. Appl. Anal. 2005, 84, 89–102. [Google Scholar] [CrossRef]
  29. Stevic, S. On stability results for a new approximating fixed points iteration process. Demonstr. Math. 2001, 34, 873–880. [Google Scholar] [CrossRef]
  30. Deimling, K. Zeros of accretive operators. Manuscripts Math. 1975, 13, 399–414. [Google Scholar] [CrossRef]
  31. Banas, J.; Sadarangani, K. Monotonicity properties of the superposition operator and their applications. J. Math. Anal. Appl. 2008, 340, 1385–1394. [Google Scholar] [CrossRef]
Figure 1. Convergence of the different iterative schemes.
Figure 1. Convergence of the different iterative schemes.
Mathematics 12 03811 g001
Table 1. A comparison of different iterative schemes.
Table 1. A comparison of different iterative schemes.
Step Number F MannIshikawaSNormal S
10.50000000.50000000.50000000.50000000.5000000
20.00425610.27381000.25325000.02705600.0307080
30.00004950.15226000.13545000.00296570.0024545
40.00000060.08556800.07398200.00036220.0002000
50.00000000.04841400.04090300.00004620.0000163
60.00000000.02750600.02279000.00000600.0000013
70.00000000.01566500.01276300.00000080.0000001
80.00000000.00893410.00717230.00000000.0000000
90.00000000.00509950.00404060.00000000.0000000
100.00000000.00291220.00228050.00000000.0000000
110.00000000.00166350.00128880.00000000.0000000
120.00000000.00095040.00072920.00000000.0000000
130.00000000.00054300.00041290.00000000.0000000
140.00000000.00031030.00023400.00000000.0000000
150.00000000.00017730.00013270.00000000.0000000
160.00000000.00010130.00007530.00000000.0000000
170.00000000.00005790.00004270.00000000.0000000
180.00000000.00003310.00002430.00000000.0000000
190.00000000.00001890.00001380.00000000.0000000
200.00000000.00001080.00000780.00000000.0000000
210.00000000.00000620.00000450.00000000.0000000
220.00000000.00000350.00000250.00000000.0000000
230.00000000.00000200.00000140.00000000.0000000
240.00000000.00000000.00000000.00000000.0000000
250.00000000.00000000.00000000.00000000.0000000
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

Fajusigbe, T.P.; Nkwuda, F.M.; Joshua, H.; Oshinubi, K.; Ajibade, F.D.; Aliyu, J. Stability of the F Algorithm on Strong Pseudocontractive Mapping and Its Application. Mathematics 2024, 12, 3811. https://doi.org/10.3390/math12233811

AMA Style

Fajusigbe TP, Nkwuda FM, Joshua H, Oshinubi K, Ajibade FD, Aliyu J. Stability of the F Algorithm on Strong Pseudocontractive Mapping and Its Application. Mathematics. 2024; 12(23):3811. https://doi.org/10.3390/math12233811

Chicago/Turabian Style

Fajusigbe, Taiwo P., Francis Monday Nkwuda, Hussaini Joshua, Kayode Oshinubi, Felix D. Ajibade, and Jamiu Aliyu. 2024. "Stability of the F Algorithm on Strong Pseudocontractive Mapping and Its Application" Mathematics 12, no. 23: 3811. https://doi.org/10.3390/math12233811

APA Style

Fajusigbe, T. P., Nkwuda, F. M., Joshua, H., Oshinubi, K., Ajibade, F. D., & Aliyu, J. (2024). Stability of the F Algorithm on Strong Pseudocontractive Mapping and Its Application. Mathematics, 12(23), 3811. https://doi.org/10.3390/math12233811

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