Next Article in Journal / Special Issue
Schröder-Based Inverse Function Approximation
Previous Article in Journal
The Branch-and-Bound Algorithm in Optimizing Mathematical Programming Models to Achieve Power Grid Observability
Previous Article in Special Issue
Approximation of Functions of the Classes CβψHα by Linear Methods Summation of Their Fourier Series
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Investigation of the F* Algorithm on Strong Pseudocontractive Mappings and Its Application

by
Felix D. Ajibade
1,
Francis Monday Nkwuda
2,
Hussaini Joshua
3,
Taiwo P. Fajusigbe
1 and
Kayode Oshinubi
4,*
1
Department of Mathematics, Federal University Oye-Ekiti, Oye-Ekiti 371104, Nigeria
2
Department of Mathematics, Federal University of Agriculture Abeokuta, Abeokuta 111101, Nigeria
3
Department of Mathematics, Faculty of Science, University of Kerala, Kerala 695034, India
4
School of Informatics, Computing and Cyber Systems, Northern Arizona University, Flagstaff, AZ 86011, USA
*
Author to whom correspondence should be addressed.
Axioms 2023, 12(11), 1041; https://doi.org/10.3390/axioms12111041
Submission received: 11 September 2023 / Revised: 6 November 2023 / Accepted: 6 November 2023 / Published: 8 November 2023
(This article belongs to the Special Issue Advanced Approximation Techniques and Their Applications)

Abstract

:
In the context of uniformly convex Banach space, this paper focuses on examining the strong convergence of the F * iterative algorithm to the fixed point of a strongly pseudocontractive mapping. Furthermore, we demonstrate through numerical methods that the F * iterative algorithm converges strongly and faster than other current iterative schemes in the literature and extends to the fixed point of a strong pseudocontractive mapping. Finally, under a nonlinear quadratic Volterra integral equation, the application of our findings is shown.

1. Introduction

Throughout this work, Z will be a real Banach space and X a uniformly convex set. H is considered to be a self-map, D ( H ) is the domain of the map H, and F ( X ) is the set of fixed points of the map H.
A self-mapping H is said to be
  • L-Lipschitizian if there exists L > 1 such that for all x , y D H
    H x H y L x y ,
    if L = 1 , then H is called nonexpansive, while H is called a contraction if L [ 0 , 1 ) .
  • k-strongly pseudocontractive if there exists a constant k > 1 such that
    [ x y x y + r I H x r I H y ] , x , y D H a n d r < 0 .
  • Accretive if j x y J x y such that
    [ H x H y , j x y x y 2 ] ,
    x , y D H .
Remark 1.
From [1], (2) and (3) above are equivalent.
Remark 2.
From inequality (2) above, ref. [2] obtained the following inequalities:
H x H y , j x y k x y 2
and
H x H y , j x y ( 1 k ) x y 2 .
Then, the mapping H is considered to be strongly pseudocontractive if k 0 , 1 .
Remark 3.
A strongly pseudocontractive mapping is said to be a strongly ϕ-pseudocontractive mapping, given ϕ defined as ϕ ( s ) = k for k ( 0 , 1 ) , where the converse is not needed to be true.
4.
A mapping H is said to be strongly ϕ -pseudocontractive if x , y Z , j ( x y ) J ( x y ) and having 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.
5.
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 ) .
Picard iteration: In 1890 [3], Picard discovered an iterative scheme called Picard iteration which was used to estimate fixed points of nonexpansive mappings:
p 0 Z p n + 1 = H p n .
The Mann iterative approach was developed in [4] to estimate fixed points of nonexpansive mappings:
p 0 Z p n + 1 = 1 r n p n + r n H p n .
Also, it was known that the Mann iterative scheme fails to converge to a fixed point of pseudocontractive mapping. The author in [5] established a two-step Mann (Ishikawa) iterative scheme which was firstly used to estimate fixed points of pseudocontractive mappings. The iterative scheme was later used on nonexpansive mappings without any assumption on the convexity of the Banach space:
p 0 Z p n + 1 = 1 r n p n + r n H q n q n = 1 s n p n + s n H p n .
S iteration: A two-step iterative scheme called an S iterative scheme was initiated in [6] and was applied for nearly asymptotically nonexpansive mapping:
p 0 Z p n + 1 = 1 r n H p n + r n H q n q n = 1 s n p n + s n H p n .
Normal-S iteration: Sahu established in [2] an iterative scheme called the normal-S iterative scheme for nonexpansive mapping, defined as
p 0 Z p n + 1 = H 1 r n p n + r n H p n .
F * iteration: To determine the fixed points of weak contractions in Banach spaces, the authors in [7] developed a novel two-step iterative approach known as F * iteration. It was demonstrated that the built-in method firmly converges to the fixed point of weak contractions. Additionally, it was demonstrated that the F * iterative scheme converged to a fixed point more quickly than the Picard, Mann, Ishikawa, S, normal-S, and Varat iterative schemes:
p 0 Z p n + 1 = H q n q n = H 1 r n p n + r n H p n .
However, the F * iteration produced a data-dependent result. Additionally, numerical illustrations were provided to corroborate their findings. Their findings were also applied to estimate the solution of the Volterra integral equation that is both nonlinear and quadratic. Finally, in the researchers’ work there arose an open question: “Can the sequence { p n } generated by the F * iterative scheme converge to a fixed point of nonexpansive or pseudocontractive mappings?”
In response to this, our research is motivated by employing pseudocontractive mappings for the convergence of the sequence { p n } generated by iteration to a fixed point. To achieve the desired result, certain existing inequalities in convex Banach spaces were utilized following the assumption of the existence of a fixed point. Other necessary conditions for convergence of the sequence generated by the F * algorithm to the fixed point of strong pseudocontractive mapping were also obtained.

1.1. Various Results on Convergence

In [8], the following iteration method was considered:
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 ) ,
n = 1 , 2 , 3 , , where 0 u n ( i ) 1 , for all n 1 and i = 1 , 2 , , k .
Given a sequence ( p n ) in Z satisfying (1), u n ( i ) = 0 for all n = 1 and for all i { 1 , , k } and the real sequence { u n ( i ) } , i = 1 , 2 , , k satisfying
(c1)
0 u n ( i ) u < 1 a n d n = 0 | | u n ( i ) | | ;
(c2)
0 u n ( i ) 1 , i = 2 , , k ;
(c3)
n = 1 ( u n ( 1 ) u n ( 2 ) + + u n ( 1 ) u n ( 2 ) u n ( k ) ) < ;
(c4)
lim n ( u n ( 2 ) + u n ( 2 ) u n ( 3 ) + + u n ( 2 ) u n ( 3 ) u n ( k ) = 0 .
If H ( p n ( i ) ) are bounded sets, then { p n } converges strongly to p F ( H ) and F ( H ) is a singleton.
In [9], the author proposed a new iterative scheme which was used in investigating the estimations of fixed points for nonexpansive mappings. The proposed iterative scheme generalized both Mann [4] and Ishikawa [5] iterative schemes, which have been studied rigorously by many researchers for estimating fixed points solutions of nonlinear mapping in Banach spaces. Stevic, in [8], examined the convergence of the iterative scheme given in (1) for strongly pseudocontractive mappings and a class of difference inequalities was examined which frequently appears in the investigation of the proposed iterative scheme. The newly introduced iterative scheme was later used in [8] to examine the convergence for strongly pseudocontractive mappings.
Theorem 1
([10]). Given that Z is a real Banach space with a uniformly convex dual space Z * and D is a bounded closed convex subset of Z. If H : D D is a single-valued Lipschitz strongly pseudocontractive mapping, then the Ishikawa iterative scheme of H converges strongly to a unique fixed point of H.
Theorem 2.
Assume that Z is a real uniformly smooth Banach space and D is a bounded closed convex and nonempty subset of Z. Given that H : D D is a strongly pseudocontractive map such that H p * = p * for some p * K . Setting { r n } , { s n } to be real sequences satisfying the following conditions:
(a.) 
0 r n , s n 1 n 0 ;
(b.) 
lim n r n = 0 ; lim n s n = 0 ;
(c.) 
n = 0 r n = .
So, for arbitrary p 0 D , the sequence { p n } given in the iterative form by
p 0 Z , p n + 1 = 1 r n p n + r n H q n , q n = 1 s n p n + s n H p n ,
converges strongly to p * . However, p * is unique.
Theorem 3
([11]). Given that Z is a real Banach space with a uniformly convex dual Z * , D is a nonempty closed convex bounded subset of Z, and H : D D is a continuous strongly pseudocontractive mapping. So, the Ishikawa iterative sequence { p n } n = 0 defined in [5] converges strongly to the unique fixed point of H.
Theorem 4.
Let p 0 be an arbitrary point in Z. Suppose { p n } is a sequence in Z which satisfies the recursive Formula (1), { t n } is a sequence in Z such that
ϑ 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 ) ) is a set of sequences in a real Banach space Z and ( x n i ) such that i = 1 , k , are k real sequences in [ 0 , 1 ] satisfying under the following conditions:
(c1.)
n = 0 u n ( 1 ) ;
(c2.)
lim n u n ( i ) = 0 , i = 2 , k ;
(c3.)
lim n x n ( i ) = 0 , i = 1 , k ;
(c4.)
n = 1 x n ( i ) = .
Then,
(i) 
the sequence { p n } is almost H-stable;
(ii) 
lim n p n + 1 = p f ( H ) implies lim n ϑ = 0 .

1.2. Nonlinear Quadratic Volterra Integral Equation

The authors in [12] investigated the monotonicity properties of the superposition operator and its applications. It was stated that an application of the monotonicity properties directly examines the solvability of a quadratic Volterra integral equation given in the form
x z = g z + f z , x z 0 z u z , τ , x τ d τ ,
where x and g are elements of a Frechet space J, f is a linear continuous map from J J , and u is a nonlinear map from J J such that z J = 0 , 1 .
Several problems in science, physics, engineering and related disciplines lead to linear and nonlinear Volterra integral equations of both the first and second kind. These equations are often difficult to solve analytically but an approximated solution can be provided using numerical techniques (see [13,14,15,16,17,18]).

1.3. Useful Lemmas

The lemmas below will be helpful in showing our main results.
Lemma 1
([19]). Suppose J : Z Z 2 is a 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
([11]). Given that μ n n = 0 is a set of non-negative real sequences satisfying
μ n + 1 1 γ n μ n + σ n ,
where γ n 0 , 1 , n = 1 γ n = , and σ n = o γ n . Then, μ n 0 as n .

2. Main Results

In this section, we will prove the strong convergence theorem for the F * iterative method for a strongly pseudocontractive mapping in uniformly convex Banach space.
Theorem 5.
Let Z be a real Banach space with a uniformly convex dual Z * , D be a nonempty closed convex bounded subset of Z and H : D D be a continuous strongly pseudocontractive mapping. Then, the F * iterative sequence { p n } n = 1 defined by
p 0 Z , p n + 1 = H q n , q n = H 1 r n p n + r n H p n ,
where { r n } and { p n } converges strongly to the unique fixed point of H.
Proof. 
The existence of a fixed point follows from [20].
Let p be a unique fixed point of H. Since H : D D is strongly pseudocontractive, I H is strongly accretive, where I is the identity operator and for every x , y D
p n + 1 p 2 = H q n p 2 = H H 1 r n p n + r n H p n H p , j p n + 1 p k H 1 r n p n + r n H p n p 2 = k H 1 r n p n + r n H p n H p , j q n p k 2 1 r n p n + r n H p n p 2 = k 2 p n r n p n + r n H p n + r n p n r n p n p 2 = k 2 r n H p n p + 1 r n p n p 2 k 2 1 r n 2 p n p 2 + 2 r n k 2 H p n p , j z n P k 2 1 r n 2 p n p 2 + 2 r n k 2 H p n p , j z n P j p n P + 2 r n k 2 H p n p , j p n P k 2 1 r n 2 p n p 2 + 2 r n k 3 p n p 2 + 2 r n k 2 H p n p , j z n P j p n P = k 2 1 r n 2 + 2 r n k p n p 2 + 2 r n H p n p , j z n P j p n P
Recall that 0 < k < 1 implies 0 < k 2 < 1 , which gives the inequality below
p n + 1 p 2 1 r n 2 + 2 r n k p n p 2 + 2 r n H p n p , j z n P j p n P = 1 2 r n r n 2 2 r n k p n p 2 + 2 r n H p n p , j z n P j p n P = 1 r n 2 r n 2 k p n p 2 + 2 r n H p n p , j z n P j p n P
where
α n = H p n p , j z n P j p n P .
Now, we shall show α n 0 as n . We observed that { H p n H p } is bounded; then, to show α n 0 as n , it suffices to show
j z n P j p n P 0 as n .
Truly, since X * is uniformly convex, j is uniformly continuous on any bounded subset of X. Noting that
z n p p n p = z n p n = 1 r n p n + r n H p n p n = r n H p n r n p n 0 as n .
so we see that
j z n P j p n P 0 as n .
where
σ n = 2 r n H p n p , j z n p j p n p .
We choose a large positive integer N such that for all n N , then
1 r n 2 < k < 2 r n 2 .
Thus, the above inequality yields
p n + 1 p 2 1 r n 2 r n 2 k p n p 2 + σ n .
Setting μ n = p n p 2 and γ n = r n 2 r n 2 k . Then,
μ n + 1 1 γ n μ n + σ n ,
with
γ n 0 , 1 , n = 1 γ n = ,
and
σ n = o r n .
By Lemma 2, (6) yields μ n 0 as n . □

3. Application to Nonlinear Quadratic Volterra Integral Equation

In this section, the solution estimated by the F * iterative process for a nonlinear quadratic Volterra integral problem will be discussed. So, we look at Equation (2) for the nonlinear quadratic Volterra integral, taking into account that the following claims are true:
(D1)
g C J and g is non-negative and nondecreasing on J = 0 , 1 .
(D2)
The function f : J × K R such that the following restrictions hold:
(i)
f on the set J × K is continuous;
(ii)
For x K , z J both fixed, the functions z f z , x and x f z , x are increasing on J and K, respectively, and f = f z , x is Lipschitz with respect to x, given that g 0 = g 0 = m i n { g z , z J } . However, f is positive on the set J × K , since K R + is not bounded and h 0 K .
(D3)
An increasing function k ( t ) = k : g 0 , + R + :
| f z , x 1 f z , x 2 | K t | x 1 x 2 | , for any z J and ∀ x 1 , x 2 g 0 , t .
(D4)
A function u : J × J × R R is continuous, such that u : J × J × R + R + , for arbitrarily fixed τ J and x R + and the function z u z , τ , x is increasing on J.
(D5)
A nondecreasing map m : R + R + : u z , τ , x m x for z , τ J and x 0 .
(D6)
There is a positive solution t 0 for the inequality
g + r k ( t ) + E 1 m t t ,
where E 1 = s u p { f z , 0 : z J } . Moreover, k t 0 m t 0 < 1 .
Now, the existence result follows as proved in [12] and which was later used in [7].
Theorem 6.
Under the assertions ( D 1 ) ( D 6 ) , Equation (2) has a minimum of a solution x = x z C J that is increasing and positive on the interval J . There follow some assertions for the estimation of the result of the integral Equation (2). Let P = { x C J : x z h o for z J } C W and P t 0 = { x P : x t 0 } , where t 0 > 0 comes from assertion ( D 6 ) , P t 0 is nonempty since t 0 h 0 is a closed bounded convex subset of C J .
If the Lipschitz condition u z , τ , x with respect to x holds, i.e., for z , τ J and for x 1 , x 2 P t o , then N > 0 :
u z , τ , x 1 u z , τ , x 2 N x 1 x 2 .
χ t 0 in assertion ( D 6 ) satisfies the following inequality:
0 < ( m t 0 K t 0 + t 0 K t 0 + E 1 ) < 1 .
So, we define an operator H on the set P t 0 by
H x z = g z + f z , x z 0 z u z , τ , x τ d τ , z J .
According to the proof provided in [12], H transforms the set P t 0 into itself as well as P. Additionally, H has at least one fixed point in P t 0 and is continuous on P t 0 .
Now, we show that the operator H is strongly pseudocontraction on P t 0 , and then, for z J , we have
H x z H y z 2 = f z , x z 0 z u z , τ , x τ d τ f z , y z 0 z u z , τ , y τ d τ 2 = f z , x z 0 z u z , τ , x τ d τ f z , y z 0 z u z , τ , x τ d τ + f z , y z 0 z u z , τ , x τ d τ f z , y z 0 z u z , τ , y τ d τ 2 f z , x z 0 z u z , τ , x τ d τ f z , y z 0 z u z , τ , x τ d τ + f z , y z 0 z u z , τ , x τ d τ f z , y z 0 z u z , τ , y τ d τ 2 k t 0 x z y z 0 z | u z , τ , x τ | d τ + | f z , y z | 0 z | u z , τ , x τ u z , τ , y τ | d τ 2 m t 0 k t 0 x z y z + t 0 k t 0 + E 1 N x z y z 2 = m t 0 k t 0 + t 0 k t 0 + E 1 N x z y z 2 = m t 0 k t 0 + t 0 k t 0 + E 1 N 2 x z y z 2
By assumption χ , we have that
m t 0 k t 0 + t 0 k t 0 + E 1 N < 1 .
Let k = m t 0 k t 0 + t 0 k t 0 + E 1 N 2 and by χ , we have k < 1 k < 1 .
Thus, operator S is a pseudocontraction which satisfies the inequality below:
H x z H y z 2 = H x z H y z , j x z y z k x z y z 2 .
Taking Y = C J , C = P t 0 , and H as in Equation (7), we obtain our desired result.
As stated in Theorem 2, we consider that p * is the fixed point of H . So, we show that p n p * as n . Substituting the iterative scheme 5 , Equation 7 , and conditions D 1 D 4 , we have
z n ( z ) p ( z ) = 1 r n p n ( z ) + r n H p n ( z ) p ( z ) = 1 r n p n ( z ) + r n H p n ( z ) r n p ( z ) + r n p ( z ) p ( z ) = 1 r n p n ( z ) p ( z ) + r n H p n ( z ) p ( z ) 1 r n p n ( z ) p ( z ) + r n H p n ( z ) p ( z ) = 1 r n p n ( z ) p * ( z ) + r n f ( z , p n ( z ) ) 0 z u ( z , τ , p n ( τ ) ) d τ f ( z , p * ( z ) ) 0 z u ( z , τ , p n ( τ ) ) d τ 1 r n p n ( z ) p * ( z ) + r n f ( z , p n ( z ) ) 0 z f ( z , τ , p n ( τ ) ) d τ f ( z , p * ( z ) ) 0 z u ( z , τ , p n ( τ ) ) d τ + r n f ( z , p * ( z ) ) 0 z u ( z , τ , p n ( τ ) ) d τ f ( z , p * ( z ) ) 0 z u ( z , τ , p n ( τ ) ) d τ 1 r n p n ( z ) p * ( z ) + k ( t 0 ) r n p n ( z ) p * ( z ) 0 z | u ( z , τ , p n ( τ ) ) | d τ + r n f ( z , p * ( z ) ) 0 z u ( z , τ , p n ( τ ) ) d τ 0 z u ( z , τ , p * ( τ ) ) d τ 1 r n p n ( z ) p * ( z ) + k ( t 0 ) r n p n ( z ) p * ( z ) 0 z | u ( z , τ , p n ( τ ) ) | + r n f ( z , p * ( z ) ) 0 z | u ( z , τ , p n ( τ ) ) u ( z , τ , p * ( τ ) ) | d τ 1 r n p n ( z ) p * ( z ) + r n m ( t 0 ) k ( t 0 ) p n ( z ) p * ( z ) + r n t 0 k ( t 0 ) + E 1 N p n z p * ( z )
z n ( z ) p * ( z ) ( 1 r n ) + r n { m ( t 0 ) k ( t 0 ) + r n t 0 k ( t 0 ) + E 1 N } p n ( z ) p * ( z )
q n ( z ) p * ( z ) = H z n ( z ) p * ( z ) = f ( z , z n ( z ) ) 0 z u ( z , τ , z n ( τ ) ) d τ f ( z , p * ( z ) ) 0 z u ( z , τ , p n ( τ ) ) d τ f ( z , z n ( z ) ) 0 z u ( z , τ , z n ( τ ) ) d τ f ( z , p * ( z ) ) 0 z u ( z , τ , z n ( τ ) ) d τ + f ( z , p * ( z ) ) 0 z u ( z , τ , z n ( τ ) ) d τ f ( z , p * ( z ) ) 0 z u ( z , τ , p * ( τ ) ) d τ f ( z , z n ( τ ) ) f ( z , p * ( z ) ) | 0 z u ( z , τ , z n ( τ ) ) d τ | + f ( z , p * ) | 0 z u ( z , τ , z n ( τ ) ) d τ 0 z u ( z , τ , p * ( τ ) ) d τ | k ( t 0 ) z n ( z ) p * ( z ) 0 z | u ( z , τ , p n ) | d τ + t 0 k ( t 0 ) + E 1 N z n ( z ) p * ( z ) = m ( t 0 ) k ( t 0 ) z n ( z ) p * ( z ) + t 0 k ( t 0 ) + E 1 N z n ( z ) p * ( z )
q n ( z ) p * ( z ) m ( t 0 ) k ( t 0 ) + t 0 k ( t 0 ) + E 1 N z n ( z ) p * ( z )
Substituting (8) into (9), we have
q n ( z ) p * ( z ) [ m ( t 0 ) k ( t 0 ) + t 0 k ( t 0 ) + E 1 N ] [ ( 1 r n ) + r n { m ( t 0 ) k ( t 0 ) + ( t 0 k ( t 0 ) + E 1 ) N } ] p n ( z ) p * ( z )
p n + 1 ( z ) p * ( z ) = H q n ( z ) p * ( z ) = f ( z , q n ( z ) ) 0 z u ( z , τ , q n ( τ ) ) d τ f ( z , p * ( z ) ) 0 z u ( z , τ , p * ( τ ) ) d τ f ( z , q n ( z ) ) 0 z u ( z , τ , q n ( τ ) ) d τ f ( z , p * ( z ) ) 0 z u ( z , τ , q n ( τ ) ) d τ + f ( z , p * ( z ) ) 0 z u ( z , τ , q n ( τ ) ) d τ f ( z , p * ( z ) ) 0 z u ( z , τ , p * ( τ ) ) d τ k ( t 0 ) q n ( z ) p * ( z ) 0 z | u ( z , τ , p n ( τ ) ) | d τ + t 0 k ( t 0 ) + E 1 N q n ( z ) p * ( z ) = m ( t 0 ) k ( t 0 ) q n ( z ) p * ( z ) + t 0 k ( t 0 ) + E 1 N q n ( z ) p * ( z )
therefore,
p n + 1 ( z ) p * ( z ) m ( t 0 ) k ( t 0 ) + t 0 k ( t 0 ) + E 1 N q n ( z ) p * ( z ) .
Substituting (10) into (11):
p n + 1 ( z ) p * ( z ) m ( t 0 ) k ( t 0 ) + t 0 k ( t 0 ) + E 1 N 2 [ ( 1 r n ) + r n { m ( t 0 ) k ( t 0 ) + t 0 k ( t 0 ) + E 1 N } ] p n ( z ) p * ( z ) .
Applying assumption χ :
m t 0 k t 0 + t 0 k t 0 + E 1 N < 1 ,
which implies also that
m t 0 k t 0 + t 0 k t 0 + E 1 N 2 < 1 ,
then, we have Equation (12) as
p n + 1 ( z ) p * ( z ) ( 1 r n ) + r n { m ( t 0 ) k ( t 0 ) + t 0 k ( t 0 ) + E 1 N } p n ( z ) p * ( z ) = 1 r n 1 { m ( t 0 ) k t 0 + t 0 k ( t 0 ) + E 1 N } p n ( z ) p * ( z )
p n + 1 ( z ) p * ( z ) 1 r n 1 { m ( t 0 ) k t 0 + t 0 k ( t 0 ) + E 1 N } p n ( z ) p * ( z ) .
Thus, it follows by induction that we have
p n + 1 ( z ) p * ( z ) p 0 ( z ) p * ( z ) × k = 0 n { 1 r k 1 { m ( t 0 ) k t 0 + t 0 k ( t 0 ) + E 1 N } } .
Since r k 0 , 1 for all k N , using assumption ( χ ) gives
1 r k 1 { m ( t 0 ) k t 0 + t 0 k ( t 0 ) + E 1 N } < 1 .
Accepting the fact that exp ( y ) 1 y , ∀ y 0 , 1 , where Equation 13 can be written as
p n + 1 ( z ) p * ( z ) p 0 ( z ) p * ( z ) exp 1 { m ( t 0 ) K t 0 + t 0 k ( t 0 ) + E 1 N } k = 0 n r k
taking the lim n of both sides, it yields lim n p n ( z ) p * ( z ) = 0 , implying p n ( z ) p * ( z ) .
Hence, the sequence p n generated by F * iterative scheme (5) converges strongly to the unique solution of integral Equation (7).

4. Numerical Examples

Example 1.
Let Y = R = , be a Banach space with usual norm and C = 0 , . Let R H = 0 , 2 3 . The map H : C C is a self-mapping defined by
H x = x 3 1 + x
for all x C . We can easily verify that H is a strongly pseudocontractive mapping and has a fixed point p = 0 . Now, we choose r n = 0.85 and s n = 0.15 with the initial guess p 0 = 5 .
From Table 1, we observe that the numerical results for F * iterative scheme (5) converge strongly and faster to zero at the sixth iteration when compared to the normal-S iterative scheme, which is the closest and converges among the other iterative schemes presented for the Volterra integral equation. Hence, the F * iterative scheme converges faster and better than the other iterative schemes existing in the literature. We present a graphical representation of our result in Figure 1.
Example 2.
Let Y = R be a Banach space with usual norm and C = 0 , . Let R H = 0 , 6 7 . The map H : C C is a self-mapping defined by
H x = x 7 1 + x
for all x C . We can easily verify that H is a strongly pseudocontractive mapping and has a fixed point p = 0 . Now, we choose r n = 0.85 and s n = 0.15 , with the initial guess p 0 = 5 .
From Table 2, we observe that the numerical results for F * iterative scheme (5) converge strongly and faster to zero at the fourth iteration when compared to the normal-S iterative scheme, which converges at the seventh iteration and is the closest to our algorithm among the other iterative schemes in the literature. We present a graphical representation of our result in Figure 2.

5. Conclusions

The historical development and application of pseudocontractive mapping with fixed point theory were extensively discussed in [21] and are a major subject of this work. In this paper, we investigated the convergence of an F * iterative scheme for a strongly pseudocontractive mapping on a uniformly convex Banach space. Using numerical examples, it has been found that the approach converges more quickly than the Picard, Mann, Ishikawa, S, normal-S iterative schemes for a strongly pseudocontractive mapping. This research work has studied the use of all of the generalized classes of strongly pseudocontractive mappings.

Author Contributions

Conceptualization, F.D.A., F.M.N., H.J. and T.P.F.; methodology, F.D.A., F.M.N., H.J. and T.P.F.; software, F.D.A., F.M.N., H.J. and T.P.F.; validation, F.D.A., F.M.N., H.J. and T.P.F.; formal analysis, F.D.A., F.M.N., H.J. and T.P.F.; investigation, F.D.A., F.M.N., H.J. and T.P.F.; resources, K.O.; writing—original draft, F.D.A., F.M.N., H.J. and T.P.F.; writing—review and editing, F.D.A., F.M.N., H.J., T.P.F. and K.O.; visualization, F.M.N., H.J. and T.P.F.; supervision, F.M.N. and K.O.; project administration, F.M.N. and K.O.; 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

Data are contained within the article.

Acknowledgments

The authors would like to express their heartfelt gratitude to the reviewers for their attentive reading, helpful criticism, and insightful recommendations that significantly enhanced the manuscript. The authors would like to appreciate the Black in Mathematics Association (BMA) for providing the collaborative platform to carry out this research.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Kato, T. Nonlinear semigroup and evolution equations. J. Math. Soc. Jpn. 1967, 19, 508–520. [Google Scholar] [CrossRef]
  2. Bogin, J. On Strict Pseudocontractive and a Fixed Point Theorem; Technion Preprint Series No. MT-219; Israel Institute of Technology: Haifa, Israel, 1974. [Google Scholar]
  3. Cracium, C.; Serban, M.A. A nonlinear integral equation via Picard operators. Fixed Point Theory 2011, 12, 57–70. [Google Scholar]
  4. Mann, W.R. Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 4, 506–510. [Google Scholar] [CrossRef]
  5. Ishikawa, S. Fixed points by a new iteration method. Proc. Am. Math. Soc. 1974, 44, 147–150. [Google Scholar] [CrossRef]
  6. 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]
  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. Stevic, S. Approximating fixed points of strongly pseudocontractive mappings by a new iteration method. Appl. Anal. 2000, 84, 89–102. [Google Scholar] [CrossRef]
  9. Stevic, S. Approximating fixed points of nonexpansive mappings by a new iteration method. Bull. Inst. Math. Acad. Sin. (New Ser.) 2006, 1, 437–450. [Google Scholar]
  10. Chidume, C.E. Approximation of fixed points of strongly pseudocontractive mappings. Proc. Am. Math. Soc. 1994, 120, 545–551. [Google Scholar] [CrossRef]
  11. Zhou, H.Y.; Jia, Y. Approximation of fixed points of strongly pseudocontractive maps without lipschitz assumptions. Proc. Am. Soc. 1997, 125, 1705–1709. [Google Scholar]
  12. Banas, J.; Sadarangani, K. Properties of the superposition operator and their applications. J. Math. Anal. Appl. 2008, 340, 1385–1394. [Google Scholar] [CrossRef]
  13. Brunner, H.; van der Houwen, P.J. The Numerical Solution of Volterra Equations; CWI Monographs: Amsterdam, The Netherlands, 1986; Volume 3. [Google Scholar]
  14. Delves, L.M.; Mohamed, J.L. Computational Methods for Integral Equation; Cambridge University Press: Cambridge, MA, USA, 1985. [Google Scholar]
  15. Grossman, S.I. Existence and stability of a class of nonlinear Volterra integral equation. Trans. Am. Math. Soc. 1970, 150, 541–556. [Google Scholar] [CrossRef]
  16. Maryam, G.A.; Faizan, A.K.; Ali, F. An iterative algorithm to approximate fixed points of nonlinear operators with application. Mathematics 2022, 10, 1132. [Google Scholar]
  17. Gursoy, F. Application of normal S-iterative method to a nonlinear integral equation. Sci. World J. 2014, 2014, 943127. [Google Scholar] [CrossRef] [PubMed]
  18. 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]
  19. Xu, H.K. Inequality in Banach spaces with applications. Nonlinear Anal. 1991, 16, 1127–1138. [Google Scholar] [CrossRef]
  20. Deimling, K. Zeros of accretive operators. Manuscripts Math. 1975, 13, 399–414. [Google Scholar] [CrossRef]
  21. Sahu, C.K.; Srivastava, S.C.; Biswas, S. History, development and application of pseudocontractive mapping with fixed point theory. Int. J. Math. Trends Technol. 2020, 66, 2231–5373. [Google Scholar] [CrossRef]
Figure 1. Figure to compare different iterative schemes for Example 1. P n are the values obtained during the iteration as n increases.
Figure 1. Figure to compare different iterative schemes for Example 1. P n are the values obtained during the iteration as n increases.
Axioms 12 01041 g001
Figure 2. Figure to compare different iterative schemes for Example 2. P n are the values obtained during the iteration as n increases.
Figure 2. Figure to compare different iterative schemes for Example 2. P n are the values obtained during the iteration as n increases.
Axioms 12 01041 g002
Table 1. Comparison of different iterative schemes for Example 1.
Table 1. Comparison of different iterative schemes for Example 1.
Iter No. F * PicardMannIshikawaNormal-S S
1555555
2 0.0473333 0.2777778 0.9861111 0.2714574 0.1655010 0.9797900
3 0.0021545 0.0724638 0.2885927 0.0657739 0.0203615 0.2777725
4 0.0001035 0.0225225 0.1067441 0.0188694 0.0028783 0.0977829
5 0.0000050 0.0073421 0.0433388 0.0056526 0.0004148 0.0374809
6 0.0000000 0.0024295 0.0182701 0.0017147 0.0000602 0.0148500
7 0.0000000 0.0008079 0.0078242 0.0005221 0.0000099 0.0059613
8 0.0000000 0.0002691 0.0033733 0.0001592 0.0000015 0.0024057
9 0.0000000 0.0000897 0.0014586 0.0000485 0.0000000 0.0009729
10 0.0000000 0.0000299 0.0006315 0.0000148 0.0000000 0.0003938
11 0.0000000 0.0000100 0.0002735 0.0000045 0.0000000 0.0001595
12 0.0000000 0.0000033 0.0001185 0.0000014 0.0000000 0.0000646
13 0.0000000 0.0000011 0.0000513 0.0000000 0.0000000 0.0000262
14 0.0000000 0.0000000 0.0000222 0.0000000 0.0000000 0.0000106
15 0.0000000 0.0000000 0.0000096 0.0000000 0.0000000 0.0000043
16 0.0000000 0.0000000 0.0000018 0.0000000 0.0000000 0.0000017
17 0.0000000 0.0000000 0.0000010 0.0000000 0.0000000 0.0000000
18 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000
Table 2. Comparison of different iterative schemes for Example 2.
Table 2. Comparison of different iterative schemes for Example 2.
Iter No. F * PicardMannIshikawaNormal-S S
1555555
2 0.0088054 0.1190476 0.8511905 0.1162349 0.0656867 0.8483777
3 0.0000484 0.0151976 0.1835123 0.0133737 0.0024346 0.1785341
4 0.0000002 0.0021386 0.0463552 0.0016812 0.0000942 0.0430757
5 0.0000000 0.0003049 0.0033292 0.0002136 0.0000037 0.0108503
6 0.0000000 0.0000435 0.0009023 0.0000272 0.0000001 0.0027646
7 0.0000000 0.0000062 0.0002448 0.0000035 0.0000000 0.0007065
8 0.0000000 0.0000001 0.0000664 0.0000004 0.0000000 0.0000180
9 0.0000000 0.0000000 0.0000180 0.0000000 0.0000000 0.0000462
10 0.0000000 0.0000000 0.0000050 0.0000000 0.0000000 0.0000118
11 0.0000000 0.0000000 0.0000013 0.0000000 0.0000000 0.0000030
12 0.0000000 0.0000000 0.0000003 0.0000000 0.0000000 0.0000007
13 0.0000000 0.0000000 0.0000000 0.0000000 0.0000000 0.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

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. https://doi.org/10.3390/axioms12111041

AMA Style

Ajibade FD, Nkwuda FM, Joshua H, Fajusigbe TP, Oshinubi K. Investigation of the F* Algorithm on Strong Pseudocontractive Mappings and Its Application. Axioms. 2023; 12(11):1041. https://doi.org/10.3390/axioms12111041

Chicago/Turabian Style

Ajibade, Felix D., Francis Monday Nkwuda, Hussaini Joshua, Taiwo P. Fajusigbe, and Kayode Oshinubi. 2023. "Investigation of the F* Algorithm on Strong Pseudocontractive Mappings and Its Application" Axioms 12, no. 11: 1041. https://doi.org/10.3390/axioms12111041

APA Style

Ajibade, F. D., Nkwuda, F. M., Joshua, H., Fajusigbe, T. P., & Oshinubi, K. (2023). Investigation of the F* Algorithm on Strong Pseudocontractive Mappings and Its Application. Axioms, 12(11), 1041. https://doi.org/10.3390/axioms12111041

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