Next Article in Journal
QM-BZ-Algebras and Quasi-Hyper BZ-Algebras
Previous Article in Journal
Subclasses of Yamakawa-Type Bi-Starlike Functions Associated with Gegenbauer Polynomials
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Efficient Iterative Procedure for Proximally Quasi-Nonexpansive Mappings and a Class of Boundary Value Problems

1
Department of Mathematical Sciences, University of Lakki Marwat, Lakki Marwat 28420, Pakistan
2
Department of Mathematics and Statistics, International Islamic University, H-10, Islamabad 44000, Pakistan
3
Department of Mathematics and Physics, Hebei University of Architecture, Zhangjiakou 075024, China
4
Department of Mathematics and General Sciences, Prince Sultan University, P.O. Box 66833, Riyadh 11586, Saudi Arabia
5
Department of Medical Research, China Medical University, Taichung 40402, Taiwan
*
Authors to whom correspondence should be addressed.
Axioms 2022, 11(3), 90; https://doi.org/10.3390/axioms11030090
Submission received: 1 January 2022 / Revised: 1 February 2022 / Accepted: 3 February 2022 / Published: 24 February 2022

Abstract

:
It is well-known in the literature that many analytical techniques are introduced in order to find a solution for problems such as functional, differential, and integral equations. These analytical techniques sometimes fail to solve such problems, thus prompting the proposal of numerical methods for approaching their approximate solutions. This paper suggests a multi-valued version of an efficient iterative procedure called the F iterative procedure in Banach space and establishes its weak and strong convergence to fixed points of certain proximally quasi-nonexpansive operators. To support these results and to suggest the high accuracy of this procedure, we develop an example of a proximally quasi-nonexpansive operator and perform a comparative numerical experiment. As an application, we solve a two-point boundary value problem (BVP) in Banach space. Our results are new and extend some results from the literature for the new setting of mappings.

1. Introduction and Preliminaries

Let E be a subset of a normed vector space X. The operator T : E E is called a contraction if:
| | T a T b | | η | | a b | | ,
where 0 < η < 1 . Banach [1] was the first to introduce these mappings and proved that such mappings in a closed subset of Banach space always posses a unique fixed point, that is, T q = q for some q. Note that when the real constant θ is equal to 1 in (1), then T is called nonexpansive. When the space X is restricted to the case of uniformly convex Banach space (UCBS), and E is closed bounded and convex in X, then each nonexpansive map T : E E has a fixed point (e.g., see Browder [2] and Gohde [3]).
Note that it is sometimes possible that a given equation (functional, differential, integral, etc.) has a solution, but its value cannot be found by applying available analytical methods. In such cases, one needs the approximate value of such solutions. The natural question of how to obtain such approximate solutions arises, which is one of the difficult tasks. One of the successful methods are iterative techniques, which are the best choice for computing such approximate solutions. To achieve the objective, we first try to express the original given equation in the form of a fixed point equation, in a way that the fixed point set of this equation coincides with the solution set of the original equation. We then use an iterative method, which converges in the fixed point set of the fixed point equation, and hence in the solution set of the original equation as well.
It is normally easy to iterate a single-valued function, but for a multi-valued map, it is a difficult task. The fixed point theory connected to multi-valued maps has played a significant role in many areas of science and technology (e.g., see [4] and others). Thus, once any result for a single-valued map is available in the literature, it is always desirable to obtain its multi-valued version. Now, we can set the concepts of fixed points for multi-valued maps: a point q E is called a fixed point for a multi-valued map T : E P E if q is an element of the set T q , that is, q T q , where P E = { G E : G is proximinal } . If T q = { q } for every fixed point q of T , then such a multi-valued map is said to be endowed with the endpoint condition (e.g., see Jung [5]). All throughout, F i x ( T ) will denote the fixed point set of T .
To establish the fixed point and the related results on multi-valued maps, one often requires the following concept of metric. Suppose that E C B = { G E : G is closed and bounded } and set the real-valued function H : E C B × E C B R with the following formula:
H ( G , W ) = max sup g G d ( g , W ) , sup w W d ( w , G ) , for each G , W E C B .
Here, the function H essentially holds all requirements of the metric, which is called a Hausdorff metric on the set E C B .
Using the function H, we thus mention the following notions of multi-valued maps.
Definition 1.
If E is any nonempty subset of Banach space, T : E E C B and a , b E and q F i x ( T ) . Then T is known as:
(i) 
nonexpansive if H ( T a , T b ) | | a b | | ;
(ii) 
quasi-nonexpansive if H ( T a , T q ) | | a q | | ;
(iii) 
proximally nonexpansive if H ( P T a , P T b ) | | a b | | ;
(iv) 
proximally quasi-nonexpansive if H ( P T a , P T q ) | | a q | | .
Remark 1.
Note that a nonexpansive multi-valued map is always continuous. Moreover, every multi-valued nonexpansive map with a nonempty fixed point set is always a multi-valued quasi-nonexpansive, but the converse is not valid in general because there exists discontinuous, multi-valued maps which are multi-valued quasi-nonexpansive (e.g., see [6] and others).
When a result on the existence of a fixed point for a given operator is proved, then calculating such a fixed point by using an appropriate fixed point iteration method is essentially an active research area on its own. To compute the value of contractions, the well-known result of Banach [1] essentially suggests the simplest Picard iteration method. However, the drawback of this method is that it fails to converge in the fixed point set of nonexpansive operators; for example, T a = a 1 2 is a nonexpansive mapping on the set [ 0 , 1 ] and admits a unique fixed point q = 1 2 , but the Picard iteration method suggests a divergent sequence for every selection of a 1 [ 0 , 1 ] { 1 2 } . In order to find the fixed points of nonexpansive mappings and to gain a relatively better rate of convergence, there are many iterative processes in the literature (cf. Mann [7], Ishikawa [8], Picard-Ishikawa [9], Noor [10], Agarwal [11], Abbas [12], Picard-S [13], and so on). The fixed point theory of multi-valued mappings finds its roots in the papers of Nadler [14], who studied the Banach result [1] in the setting of multi-valued mappings. In [15], Lim proved a fixed point theorem for a multi-valued nonexpansive, which is in fact the multi-valued version of the Browder–Göhde fixed point theorem. In 2005, Sastry and Babu [16] essentially constructed multi-valued versions of the Mann and Ishikawa iteration schemes, respectively, for multi-valued nonexpansive mappings and proved their convergence results in a Hilbert space setting. Panyanak [17] studied these schemes in the general context of a UCBS setting. Soon, Song, and Wang [18] improved the main outcome of Panyanak [17] by introducing the Mann and Ishikawa iterative schemes in a new sense. However, the Song and Wang [18] iterative schemes use too much time consumer estimates; these schemes also require the endpoint condition to establish their convergence. After this, Shahzad and Zegeye [6] constructed new modified Mann and Ishikawa iterative schemes and proved their convergence for proximally nonexpansive mappings without an endpoint condition. Song and Cho [19] extended their results to the setting of proximally quasi-nonexpansive mappings. Using the idea of Shahzad and Zegeye [6], Khan and Yilirim [20] used the S iteration for approximating fixed points of proximally nonexpansive mappings. Khan et al. [21] used the Abbas iteration for approximating fixed points of proximally quasi-nonexpansive nonexpansive mappings. Okeke et al. [9] used the Picard–Ishikawa iterative scheme to approximate fixed points of proximally quasi-nonexpansive mappings. The aim of this paper is to propose new efficient algorithms for the class of proximally quasi-nonexpansive mappings and a class of BVPs on a Banach space setting.
Now we list the following single-valued iterative schemes along with their multi-valued versions in Table 1. Set P T a = { b T a : d ( a , T a ) = | | a b | | } , u n P T ( a n ) , v n P T ( b n ) , and w n P T ( c n ) .
Now we set and study the following F iterative scheme, the single-valued version of which was introduced and studied by Ali and Ali [22] for multi-valued mappings:
a 1 E , d n = ( 1 α n ) a n + α n u n , c n = r n , b n = w n , a n + 1 = v n , n N ,
where u n P T ( a n ) , v n P T ( b n ) , w n P T ( c n ) , r n P T ( d n ) , and α n ( 0 , 1 ) . In this research paper, we approximate fixed points for the class of proximally quasi-nonexpansive mappings (which contains the class of proximally nonexpansive mappings as a special case) using the multi-valued version of the F iterative scheme (2). We establish several weak and strong convergence results for proximally quasi-nonexpansive operators regarding the iteration method (2). To validate the theoretical outcome, we suggest some numerical examples and perform a comparative experiment.
As usual, some of the following concepts will be used.
Definition 2
([23]). A normed vector space X is said to be with Opial’s property if any { a n } X converges in the weak sense to w * , then the following equation:
lim sup n | | a n w * | | < lim sup n | | a n w * * | | ,
essentially holds for any element w * * X { w * } .
Definition 3
([20]). A multi-valued operator, namely T : E P E , is said to be demiclosed at point d E if any { a n } E admitting a weak limit, namely w, and s n T a n admitting a strong limit, namely s, then one has s T a .
Definition 4
([24]). A multi-valued operator, namely T : E P E , is said to satisfy a condition ( I ) if there is a continuous and non-decreasing function, namely ψ : [ 0 , [ [ 0 , [ , with the following properties ψ ( 0 ) = 0 , ψ ( t ) > 0 for every t ] 0 , [ such that d ( a , T a ) ψ d ( a , F i x ( T ) for each choice of a E .
Song and Cho [19] noted the following facts.
Lemma 1.
The following conditions for any multi-valued mapping T : E P E are equivalent.
( c 1 )
q F i x ( T ) ;
( c 2 )
P T ( q ) = { q } ;
( c 3 )
q F i x ( P T ) .
Furthermore, F i x ( T ) = F i x ( P T ) .
Every UCBS X enjoys the following property.
Lemma 2
([25]). Suppose 0 < a π n b < 1 and t n , s n X for n N . If X denotes a UCBS, lim sup n | | t n | | ν , lim sup n | | s n | | ν and lim n | | π n t n + ( 1 π n ) s n | | = ν , where ν 0 is some real constant, then lim n | | t n s n | | = 0 .

2. Main Results

Lemma 3.
If the operator T : E P E is proximally quasi-nonexpansive on a convex nonempty closed subset E of a UCBS X and the set F i x ( T ) , then the sequence of iterates (2) has the property lim n | | a n q | | that exists for each fixed point q of T .
Proof. 
For any q F i x ( T ) and n N , consider the following:
| | d n q | | = | | ( ( 1 α n ) a n + α n u n ) q | | ( 1 α n ) | | a n q | | + α n | | u n q | | ( 1 α n ) | | a n q | | + α n H ( P T a n , P T q ) ( 1 α n ) | | a n q | | + α n | | a n q | | = | | a n q | | .
Hence, we obtain | | d n q | | | | a n q | | . Using this, we have the following:
| | a n + 1 q | | = | | v n q | | H ( P T b n , P T q ) | | b n q | | = | | w n q | | H ( P T c n , P T q ) | | c n q | | = | | r n q | | H ( P T d n , P T q ) | | d n q | | | | a n q | | .
Consequently, we obtain the inequality | | a n + 1 q | | | | a n q | | for all fixed points q of T and n N . It follows that lim n | | a n q | | exists for each fixed point q of T . □
Using the established lemma above, we provide another key lemma, which will help us in establishing the main outcome of the sequel.
Lemma 4.
If the operator T : E P E is proximally quasi-nonexpansive on a convex nonempty closed subset E of a UCBS X and the set F i x ( T ) , then the sequence of iterates (2) has the property lim n d ( a n , P T a n ) = 0 .
Proof. 
We proved in Lemma 3 that lim n | | a n q | | exists if one selects any q F i x ( T ) . This strong limit establishes that lim n | | a n q | | = ν , where ν 0 denotes any real constant. Without loss of generality, we assume that ν > 0 . Then, since T is proximally quasi-nonexpansive and u n P T , it follows that:
lim sup n | | u n q | | lim sup n H ( P T a n , P T q ) lim sup n | | a n q | | = ν .
Looking deeply into the proof of Lemma 3, it can be seen that:
| | d n q | | | | a n q | | ,
lim sup n | | d n q | | lim sup n | | a n q | | = ν .
Once again, we can observe the proof of Lemma 3 to note the following:
| | a n + 1 q | | | | d n q | | ,
ν = lim inf n | | a n + 1 q | | lim inf n | | d n q | | .
We can now combine inequalities (4) and (5) to get the following equality:
lim n | | d n q | | = ν .
Using (6), we get the following equation:
ν = lim n | | d n q | | = lim n | | ( 1 α n ) ( a n q ) + α n ( u n q ) | | .
Now, all the requirements for Lemma 2 are fulfilled, and hence:
lim n | | a n u n | | = 0 .
Since u n P T a n , we get the equation below:
lim n d ( a n , P T a n ) = 0 .
We now suggest the weak convergence result.
Theorem 1.
If the operator T : E P E is proximally quasi-nonexpansive on a convex nonempty closed subset E of a UCBS X and the set F i x ( T ) , then the sequence of iterates (2) converges weakly in the set F i x ( T ) whenever I P T is assumed to be demiclosed at zero and X is endowed with the Opial’s property.
Proof. 
Suppose q F i x ( T ) , it follows that p F i x ( P T ) . By Lemma 3, lim n | | a n q | | exists. To obtain the weak convergence of { a n } in the set F i x ( T ) , we take two points w 1 , w 2 E such that the subsequences { a n j } and { a n k } of { a n } respectively converge weakly to them. According to (7), u n T a n exists such that lim n | | a n u n | | = 0 . According to the demicloseness of I P T at zero, the element w 1 F i x ( T ) . Similarly, one can prove that w 2 F i x ( T ) . It now remains to be proven that w 1 = w 2 . If w 1 w 2 . Now, using Opial’s property of space, one has the following:
lim n | | a n w 1 | | = lim j | | a n j w 1 | | < lim j | | a n j w 2 | | = lim n | | a n w 2 | | = lim k | | a n k w 2 | | < lim k | | a n k w 1 | | = lim n | | a n w 1 | | .
Hence, we have reached lim n | | a n w 1 | | < lim n | | a n w 1 | | . This strict inequality suggests a contradiction. Thus, the proof is established. □
After the weak convergence, we are now interested in providing the strong convergence result.
Theorem 2.
If the operator T : E P E is proximally quasi-nonexpansive on a convex nonempty compact subset E of a UCBS X, and the set F i x ( T ) , then the sequence of iterates (2) converges strongly in the set F i x ( T ) .
Proof. 
The set E is convex and compact, so the sequence { u n } is contained in E and has a convergent subsequence, namely { u n i } . Suppose lim i | | u n i p | | = 0 for some p E . The target is to prove that p is a fixed point of T and a strong limit of { u n } . Now, P T is proximally nonexpansive and a n i P T ( u n i ) . Additionally, according to Lemma 4, lim i | | u n i a n i | | = 0 . Accordingly, we have the following:
d ( p , P T p ) d ( p , u n i ) + d ( u n i , P T u n i ) + d ( P T u n i , P T p ) | | u n i p | | + | | u n i a n i | | + H ( P T u n i , P T p ) | | u n i p | | + | | u n i a n i | | + | | u n i p | | .
If we apply lim i , we obtain d ( p , P T ( p ) ) = 0 . Thus, p F i x ( P T ) , so by Lemma 1, p F i x ( T ) ; that is, p is also a fixed point of T . By Lemma 3, lim n | | u n p | | exists. Hence, p is the strong limit of { u n } . □
The last result is established under the compactness of the set E. For the next results, the compactness of E is not essential; however, the condition ( I ) of T must be assumed.
Theorem 3.
If the operator T : E P E is proximally quasi-nonexpansive on a convex nonempty closed subset E of a UCBS X and the set F i x ( T ) , then the sequence of iterates (2) converges strongly in the set F i x ( T ) whenever T is assumed to be endowed with the condition ( I ) .
Proof. 
By Lemma 3, lim n | | a n q | | exists for every choice of q F i x ( T ) = F i x ( P T ) . When lim n | | a n q | | = 0 , then one has nothing to show. Hence, we consider the only case lim n | | a n q | | = ν > 0 . We have observed in Lemma 3 that | | a n + 1 q | | | | a n q | | . This gives inf q F i x ( T ) | | a n q | | inf q F i x ( T ) | | a n q | | . Hence, we get the following equation:
d ( a n + 1 , F i x ( T ) ) d ( a n , F i x ( T ) ) .
Accordingly, we notice that lim n d ( a n , F i x ( T ) ) exists. The next purpose is to show lim n d ( a n , F i x ( T ) ) = 0 . Set lim n d ( a n , F i x ( T ) ) = b for some real constant b > 0 . Thus, for every choice of n N , set the following:
h n = u n q | | a n q | | , g n = a n q | | a n q | | .
It can be observed that | | g n | | = 1 and | | h n | | 1 because | | u n q | | H ( P T a n , P T q ) | | a n q | | . Thus, using condition ( I ) of T , one has:
lim inf n | | g n h n | | = lim inf n a n q | | a n q | | u n q | | a n q | | = lim inf n | | a n u n | | | | a n q | | lim inf n d ( a n , T a n ) | | a n q | | lim inf n ψ ( d ( a n , F i x ( T ) ) | | a n q | | ψ ( b ) ν > 0 .
Next, since lim n | | a n q | | = ν and lim n | | d n q | | = ν (see the proof of Lemma 4). Using these two, one has the following:
lim n | | ( 1 α n ) g n + α n h n | | = lim n ( 1 α n ) a n q | | a n q | | + α n u n q | | a n q | | = lim n ( 1 α n ) a n + α n u n q | | a n q | | = lim n | | d n q | | lim n | | a n q | | = ν ν = 1 .
Thus,
lim n | | ( 1 α n ) g n + α n h n | | = 1 .
Now, by Lemma 2, we get lim n | | g n h n | | = 0 , which is clearly a contradiction to lim inf n | | g n h n | | > 0 . Thus, we conclude that lim n d ( a n , F i x ( T ) ) = 0 . Therefore:
lim n | | a n q | | = 0 .
Hence, the sequence { a n } converges strongly to some fixed point q of T . □
Now we compare the speed of convergence of our iterative process with many other processes. To do this, we consider the following example.
Example 1.
If E = [ 0 , 5 ] and T : E P E is defined as T a = [ 0 , a + 2 3 ] for each a E , then the following holds:
(i) 
F i x ( T ) ;
(ii) 
T satisfies condition I;
(iii) 
T is proximally nonexpansive.
Proof. 
For (i), we see that F i x ( T ) = [ 0 , 1 , that is, F i x ( T ) . For (ii), we set a nondeacreasing function ψ : [ 0 , ) [ 0 , ) such that ψ ( t ) = t 2 for each t 0 . Now,
Case (I). When a F i x ( T ) = [ 0 , 1 ] , then d ( a , T a ) = 0 = d ( a , F i x ( T ) ) . Hence,
d ( a , T a ) = 0 ψ ( d ( a , F i x ( T ) ) ) .
Case (II). When a E F i x ( T ) = ( 1 , 5 ] . Then,
d ( a , T a ) = d a , 0 , a + 2 3 = a a + 2 3 = 2 3 a 1 a 1 2 = ψ ( a 1 ) = ψ d ( a , [ 0 , 1 ] ) = ψ d ( a , F i x ( T ) ) .
Consequently, d ( a , T a ) ψ ( d ( a , F i x ( T ) ) ) for each a E . This proves (ii). Finally, we prove (iii). Notice that P T a = { a } whenever a F i x ( T ) , and P T a = { a + 2 3 } if otherwise. There are two cases to prove the proximally quasi-nonexpansiveness of T as provided below.
Case (I). When a F i x ( T ) . Then, for any fixed point q of T , we have the following equation:
H ( P T a , P T q ) = H ( { a } , { q } ) = | a q | .
Case (II). When a E F i x ( T ) = ( 1 , 5 ] . Then, for any fixed point q of T , we have the following equation:
H ( P T a , P T q ) = H ( { a + 2 3 } , { q } ) = | ( a + 2 3 ) q | | a q | .
Consequently, H ( P T a , P T q ) | a q | for each a E and q F i x ( T ) . This proves (iii). Hence, all the requirements of our main results now hold. Thus, { a n } generated by (2) converges to a point of F i x ( T ) . This convergence can be seen in the Table 2. □
Assume that α n = 0.70 and β n = 0.65 and γ n = 0.45 , we compare the high accuracy of the proposed F iterative method with the Picard–S [13], Picard–Ishikawa [9], S [11], Noor [10], Ishikawa [8], and Mann [7] iterative methods using T of Example 1. The iterative values are provided in Table 2, and the convergence behaviors can be observed in Figure 1.
Remark 2.
Table 2 and Figure 1 suggest that the F iterative method is better than all of the Picard–S, Picard–Ishikawa, S, Noor, Ishikawa, and Mann iterative processes. Every proximally nonexpansive mapping is proximally quasi-nonexpansive; thus, our results are also valid for proximally nonexpansive mappings. The presented results in this section therefore improve and extend many well-known single and multi-valued results from the current literature, especially Shahzad and Zegeye [6], Khan and Yilirim [20], Okeke [26], Gursoy and Karakaya [13], Ali and Ali [22], and many others.

3. An Application to a Class of BVPs

BVPs of various orders played a very significant role, especially in mathematical modelings, physics, and engineering problems. Finding approximate solutions for different classes of BVPs with various orders is also an active and difficult field of mathematics. In the present article, we propose and study a new approach for solving a two-point BVP (second order) by applying the F iterative method of Ali and Ali [22]. We now take a real Banach space X and select any a 1 X . Then, the F iterates suggest a sequence { a n } , which is generated in the following way:
d n = ( 1 α n ) a n + α n T a n , c n = T d n , b n = T b n , a n + 1 = T a n , n N .
Notice that the sequence 0 < α n < 1 involved in method (8) essentially holds the restriction α n = .
Now, the well-known Green’s function is given as follows. For each z [ i , j ] , assume that h ( z ) is a continuous map on the interval [ i , j ] , then functions which satisfy a = h ( z ) can be written as follows:
a = K 0 + K 1 z + i j ( z y ) h ( y ) d y .
Thus, the unique solution of the following given BVP:
a = h ( z ) , a ( i ) = 0 , a ( j ) = 0 ,
is in the form of (9), provided that K 0 and K 1 have appropriate values. If the values of both of the K 0 and K 1 are known, then the solution of (10) can be expressed in the following form:
a ( z ) = i j G ( z , y ) h ( y ) d y ,
where the notation G ( z , y ) is known as Green’s function of the BVP:
a = 0 , a ( i ) = 0 , a ( j ) = 0 ,
and it is defined in the following way:
G ( z , y ) = ( z i ) ( y j ) j i for i z y , ( z j ) ( y i ) j i for y z j .
In the same way, the solution of BVP:
a = h ( z ) , a ( i ) = ζ 0 , a ( j ) = ζ 1 ,
can be easily stated in the following way:
a ( z ) = i j G ( z , y ) h ( y ) d y + q ( z ) ,
where q ( z ) is the solution for the equation a = 0 , with q ( i ) = ζ 0 and q ( j ) = ζ 1 . Suppose the function f ( z , a , a ) is continuous on the set [ i , j ] × R 2 . Then (11) suggests that whenever q ( z ) is the solution of a = 0 with q ( i ) = ζ 0 and q ( j ) = ζ 1 , then the function a ( z ) C ( 1 ) [ i , j ] is the solution for the BVP:
a = f ( z , a , a ) , a ( i ) = ζ 0 , a ( j ) = ζ 1 ,
if and only if a ( z ) is the element of C ( 1 ) [ a , b ] , and it is always the solution of the following given integral equation:
a ( z ) = i j G ( z , y ) f ( y , a ( y ) , a ( y ) ) d y + q ( z ) , on [ i , j ] .
Now assume that T : C ( 1 ) [ i , j ] C ( 1 ) [ i , j ] is given by the following equation:
T [ a ( z ) ] = i j G ( z , y ) f ( y , a ( y ) , a ( y ) ) d y + q ( z ) ,
for every choice of a C ( 1 ) [ i , j ] such that i z j , then each fixed point of the mapping T is the solution of (13), as well as of (12).
Recently, Bello et al. [27] suggested the following two-point BVP:
a = f ( z , a , a ) i z j ,
λ 0 a ( i ) + v 0 a ( i ) = ζ 0 , λ 1 a ( j ) + v 1 a ( j ) = ζ 1 ,
where both the λ 0 , λ 1 , v 0 and v 1 are any real numbers satisfying λ 0 2 + v 0 2 > 0 and λ 1 2 + v 1 2 > 0 and so on.
Now to solve (14) and (15) with process (8), we must first transform the underlying problem in the following way:
d n = ( 1 α n ) a n + α n a n = ( 1 α n ) a n + α n f ( z , a n , a n ) , c n = d n = f ( z , d n , d n ) , b n = c n = f ( z , c n , c n ) , a n + 1 = b n + 1 = f ( z , b n , b n ) , λ 0 a n + 1 ( i ) + v 0 a n + 1 ( i ) = ζ 0 , λ 1 a n + 1 ( j ) + v 1 a n + 1 ( j ) = ζ 1 ,
where α n ( 0 , 1 ) and α n = .
Keep in mind that a ( z ) solves (14) as well as (15) if and only if it essentially solves the following:
a ( z ) = i j G ( z , y ) f ( y , a ( y ) , a ( y ) ) d y + q ( z ) on [ i , j ] ,
and the notation G ( z , y ) represents Green’s function associated with the following BVP:
a = 0 , λ 0 a ( i ) + v 0 a ( i ) = ζ 0 , λ 1 a ( j ) + v 1 a ( j ) = ζ 1 ,
and q ( z ) is the solution of (17).
We now assume that T : C ( 1 ) [ i , j ] C ( 1 ) [ i , j ] is set as follows:
T [ d ( z ) ] = i j G ( z , y ) f ( y , d ( y ) , d ( y ) ) d y + q ( z ) , T [ c ( z ) ] = i j G ( z , y ) f ( y , c ( y ) , c ( y ) ) d y + q ( z ) , T [ b ( z ) ] = i j G ( z , y ) f ( y , b ( y ) , b ( y ) ) d y + q ( z ) , T [ a ( z ) ] = i j G ( z , y ) f ( y , a ( y ) , a ( y ) ) d y + q ( z ) ,
where the mapping T is such that every solution a ( z ) of (14) and (15) is the fixed point of T [28].
Next, we take the derivative of our proposed iteration process defined by (8) in order to solve the suggested BVP. For this purpose, we assume E to be any nonempty convex subset of real Banach space X and T : E P E to be a multi-valued mapping. Suppose the sequence { a n } E is generated by (8) such that { α n } ( 0 , 1 ) with α n = .
Now we are in the position to compare our procedure (16) with (8) to establish their equivalence. First, we differentiate (18) as follows:
( T d n ) = i j t G ( z , y ) f ( y , d n ( y ) , d n ( y ) ) d y + q ( z ) , ( T c n ) = i j t G ( z , y ) f ( y , c n ( y ) , c n ( y ) ) d y + q ( z ) , ( T b n ) = i j t G ( z , y ) f ( y , b n ( y ) , b n ( y ) ) d y + q ( z ) , ( T a n ) = i j t G ( z , y ) f ( y , a n ( y ) , a n ( y ) ) d y + q ( z ) .
Second, twice differentiating (8), we have the following equation:
d n = ( 1 α n ) a n + α n ( T a n ) c n = ( T d n ) b n = ( T c n ) a n + 1 = ( T b n ) n N .
Now, the third step is to differentiate (19), as follows:
( T d n ) = i j 2 z 2 G ( z , d n ( y ) , d n ( y ) ) d y + q ( z ) , ( T c n ) = i j 2 z 2 G ( z , c n ( y ) , c n ( y ) ) d y + q ( z ) , ( T b n ) = i j 2 z 2 G ( z , b n ( y ) , b n ( y ) ) d y + q ( z ) , ( T a n ) = i j 2 z 2 G ( z , a n ( y ) , a n ( y ) ) d y + q ( z ) .
Lastly, by substituting (21) in (20), one has the following:
d n = ( 1 α n ) a n + α n ( i j 2 z 2 G ( z , a n ( y ) , a n ( y ) ) d y + q ( z ) ) , c n = i j 2 z 2 G ( z , d n ( y ) , d n ( y ) ) d y + q ( z ) , b n = i j 2 z 2 G ( z , c n ( y ) , c n ( y ) ) d y + q ( z ) , a n + 1 = i j 2 z 2 G ( z , b n ( y ) , b n ( y ) ) d y + q ( z ) , n N .
Now (22) can be expressed as follows, which is our proposed fixed point method:
d n = ( 1 α n ) a n + α n a = ( 1 α n ) a n + α n f ( z , a n , a n ) , c n = d n = f ( z , d n , d n ) , b n = c n = f ( z , c n , c n ) , a n + 1 = b n = f ( z , a n , a n ) , n N .
We now provide the main outcome of this section.
Theorem 4.
Suppose T : C ( 1 ) [ i , j ] C ( 1 ) [ i , j ] is a contraction operator (18), with a contraction constant 0 < η < 1 . If f a 1 C ( 1 ) [ i , j ] is any affine function, and { a n } is a sequence of iterates (8) with a = 0 and the boundary condition in (15) with { α n } in ( 0 , 1 ) such that α n = , then the sequence { a n } converges to the solution q C ( 1 ) [ i , j ] of (14) and (15)
Proof. 
The Banach result [1] suggests the uniqueness and existence of q C ( 1 ) [ i , j ] . We show that the sequence { a n } converges strongly to this q. Using (8), one has the following:
| | d n q | | = | | ( 1 α n ) a n + α n T a n T q | | ( 1 α n ) | | a n q | | + α n | | T a n T q | | ( 1 α n ) | | a n q | | + α n ( η | | a n q | | ) ( 1 α n ( 1 η ) ) | | a n q | | .
Hence:
| | a n + 1 q | | = | | T b n T q | | η | | b n q | | = η | | T c n T q | | η 2 | | c n q | | = η 2 | | T d n T q | | η 3 | | d n q | | η 3 ( 1 α n ( 1 η ) ) | | a n q | | .
Inductively, we obtain the following:
| | a n + 1 q | | | | a 1 q | | η 3 n Π k = 1 n ( 1 α k ( 1 η ) ) .
Since η ( 0 , 1 ) and α n ( 0 , 1 ) for n N , therefore 1 α n ( 1 η ) < 1 . Now using the well-known inequality 1 z e z for z [ 0 , 1 ] together with α n = and then applying n , we get from (24), lim n | | a n q | | = 0 . It follows that a n q . Accordingly, { a n } converges to a solution q C ( 1 ) [ i , j ] of (14) and (15). □

4. Conclusions and Future Plan

We proposed the multi-valued version of the F iterative method and proved its convergence for the class of proximally nonexpansive operators on Banach space. To support the main outcome, we presented an example of proximally nonexpansive operators and proved that its proposed method provides high accuracy corresponding to the other methods. Finally, we solved a two-point BVP, which was one of the aims of this paper. Note that:
(i)
The main outcome related to the convergence extends the idea of Ali and Ali [22], whose research idea is limited to the case of single-valued operators;
(ii)
Theorem 4 extends and unifies the main results of Bello et al. [27] and Okeke et al. [26] because, as we observed in Table 2 and Figure 1, the F iterative method is better than the Mann iteration that was used by Bello et al. [27] and the Picard–Ishikawa iteration which was used by Okeke et al. [26];
(iii)
In the future, we will try to use the obtained results of the paper to solve some problems related the class of fractional differential equations.

Author Contributions

The listed authors of the paper gave equal work to each part of the paper. 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 included in the references within the article.

Acknowledgments

We are thankful for the support provided by Research Project of Basic Scientific Research, business expenses of provincial colleges and universities in Hebei Province (2021QNJS11); Innovation and Improvement Project of the academic team of Hebei University of Architecture Mathematics and Applied Mathematics (NO. TD202006); The Major Project of the Education Department in Hebei (No. ZD2021039); Nature Science Foundation of Hebei Province under (No. A2019404009; China Postdoctoral Science Foundation (No. 2019M661047); Postdoctoral Foundation of Hebei Province under Grant B2019003016.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Banach, S. Sur les operations dans les ensembles abstraits et leur application aux equations integrales. Fund. Math. 1922, 3, 133–181. [Google Scholar] [CrossRef]
  2. Browder, F.E. Nonexpansive nonlinear operators in a Banach space. Proc. Nat. Acad. Sci. USA 1965, 54, 1041–1044. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  3. Gohde, D. Zum Prinzip der Kontraktiven Abbildung. Math. Nachr. 1965, 30, 251–258. [Google Scholar] [CrossRef]
  4. Gorniewicz, L. Topological Fixed Point Theory of Multivalued Mappings; Kluwer Academic Pub.: Dordrecht, The Netherlands, 1999. [Google Scholar]
  5. Jung, J.S. Strong convergence theorems for multivalued nonexpansive nonself mappings in Banach spaces. Nonlinear Anal. 2007, 66, 2345–2354. [Google Scholar] [CrossRef]
  6. Shahzad, N.; Zegeye, H. On Mann and Ishikawa iteration schemes for multivalued maps in Banach spaces. Nonlinear Anal. 2009, 71, 838–844. [Google Scholar] [CrossRef]
  7. Mann, W.R. Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 4, 506–510. [Google Scholar] [CrossRef]
  8. Ishikawa, S. Fixed points by a new iteration method. Proc. Am. Math. Soc. 1974, 44, 147–150. [Google Scholar] [CrossRef]
  9. Okeke, G.A. Convergence analysis of the Picard-Ishikawa hybrid iterative process with applications. Afr. Mat. 2019, 30, 817–835. [Google Scholar] [CrossRef]
  10. Noor, M.A. New approximation schemes for general variational inequalities. J. Math. Anal. Appl. 2000, 251, 217–229. [Google Scholar] [CrossRef] [Green Version]
  11. Agarwal, R.P.; O’Regan, D.; Sahu, D.R. Iterative construction of fixed points of nearly asymptotically nonexpansive mappings. J. Nonlinear Convex Anal. 2007, 8, 61–79. [Google Scholar]
  12. Abbas, M.; Nazir, T. A new faster iteration process applied to constrained minimization and feasibility problems. Math. Vesnik 2014, 66, 223–234. [Google Scholar]
  13. Gursoy, F.; Karakaya, W. A Picard-S hybrid type iteration method for solving a differential equation with retarded argument. arXiv 2014, arXiv:1403.2546v2. [Google Scholar]
  14. Nadler, S.B. Multivalued contraction mappings. Pracific J. Math. 1969, 30, 475–488. [Google Scholar]
  15. Lim, T.C. A fixed point theorem for multivalued nonexpansive mappings in a uniformly convex Banach spaces. Bull. Am. Math. Soc. 1974, 80, 1123–1126. [Google Scholar] [CrossRef] [Green Version]
  16. Sastry, K.P.R.; Babu, G.V.R. Convergence of Ishikawa iterates for multivalued mappings with a fixed point. Czechoslov. Math. J. 2005, 55, 817–826. [Google Scholar] [CrossRef] [Green Version]
  17. Panyanak, B. Mann and Ishikawa iterative processes for multivalued mappings in Banach spaces. Comp. Math. Appl. 2007, 54, 872–877. [Google Scholar] [CrossRef] [Green Version]
  18. Song, Y.; Wang, H. Erratum to “Mann and Ishikawa iterative processes for multivalued mappings in Banach spaces". Comput. Math. Appl. 2008, 52, 2999–3002. [Google Scholar] [CrossRef] [Green Version]
  19. Song, Y.; Cho, Y.J. Some notes on Ishikawa iteration for multi-valued mappings. Bull. Korean Math. Soc. 2011, 48, 575–584. [Google Scholar] [CrossRef]
  20. Khan, S.H.; Yilirim, I. Fixed points of multivalued mappings nonexpansive mappings in Banach spaces. Fixed Point Theory Appl. 2012, 73, 1–9. [Google Scholar] [CrossRef] [Green Version]
  21. Khan, S.; Abbas, M.; Sertaj, A. Fixed points of multivalued quasi-nonexpansive mappings using a faster iterative process. Acta Math. Sin. Engl. Ser. 2014, 30, 1231–1241. [Google Scholar] [CrossRef] [Green Version]
  22. Ali, F.; Ali, J. A new iterative scheme to approximating fixed points and the solution of a delay differential equation. J. Nonlinear Convex Anal. 2020, 21, 2151–2163. [Google Scholar]
  23. Opial, Z. Weak convergence of the sequence of successive approximations for nonexpansive mappings. Bull. Am. Math. Soc. 1967, 73, 591–597. [Google Scholar] [CrossRef] [Green Version]
  24. Sentor, H.F.; Dotson, W.G. Approximating fixed points of nonexpansive mappings. Proc. Am. Math. Soc. 1974, 44, 375–380. [Google Scholar] [CrossRef]
  25. Schu, J. Weak and strong convergence to fixed points of asymtotically nonexpansive mappings. Bull. Austral. Math. Soc. 1991, 43, 153–159. [Google Scholar] [CrossRef] [Green Version]
  26. 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]
  27. Bello, N.; Alkali, A.J.; Roko, A. A fixed point iterative method for the solution of two-point boundary value problems for a second orderd differential equatons. Alex. Eng. J. 2018, 57, 2515–2520. [Google Scholar] [CrossRef]
  28. Wadai, M.; Kilicman, A. On the two point boundary value problems using variational fixed point iterative scheme. Malay. J. Math. Sci. 2017, 11, 137–160. [Google Scholar]
Figure 1. Different colors are assigned to show the behaviors of some of the methods.
Figure 1. Different colors are assigned to show the behaviors of some of the methods.
Axioms 11 00090 g001
Table 1. Some well-known schemes along with their multi-valued versions.
Table 1. Some well-known schemes along with their multi-valued versions.
Name of IterationSingle-Valued VersionMulti-Valued Version
Mann a n + 1 = ( 1 α n ) a n + α n T a n a n + 1 = ( 1 α n ) a n + α n u n
Ishikawa b n = ( 1 β n ) a n + β n T a n b n = ( 1 β n ) a n + β n u n
a n + 1 = ( 1 α n ) a n + α n T b n a n + 1 = ( 1 α n ) a n + α n v n
Noor c n = ( 1 γ n ) a n + γ n T a n c n = ( 1 γ n ) a n + γ n u n
b n = ( 1 β n ) a n + β n T c n b n = ( 1 β n ) a n + β n w n
a n + 1 = ( 1 α n ) a n + α n T b n a n + 1 = ( 1 α n ) a n + α n v n
S b n = ( 1 β n ) a n + β n T a n b n = ( 1 β n ) a n + β n u n
b n + 1 = ( 1 α n ) a n + α n T b n a n + 1 = ( 1 α n ) u n + α n v n
Picard–Ishikawa c n = ( 1 γ n ) a n + γ n T a n c n = ( 1 γ n ) a n + γ n u n
b n = ( 1 β n ) a n + β n T c n b n = ( 1 β n ) a n + β n w n
a n + 1 = T b n a n + 1 = v n
Picard–S c n = ( 1 γ n ) a n + γ n T a n c n = ( 1 γ n ) a n + γ n u n
b n = ( 1 β n ) T a n + β n T c n b n = ( 1 β n ) u n + β n w n
a n + 1 = T b n a n + 1 = v n
Table 2. Some iterates suggested by the F, Picard–S, Picard–Ishikawa, S, Noor, Ishikawa, and Mann methods for T given in Example 1.
Table 2. Some iterates suggested by the F, Picard–S, Picard–Ishikawa, S, Noor, Ishikawa, and Mann methods for T given in Example 1.
nFPicard–SPicard–IshikawaSNoorIshikawaMann
13.53.53.53.53.53.53.5
21.049381.193521.360191.580562.042642.080562.33333
31.000981.014981.051891.134821.434841.467041.71111
41.000021.001161.007481.031311.181351.201871.37926
511.000091.001081.007271.075631.087251.20227
611.000011.000161.001691.031541.037711.10788
7111.000021.000391.013161.016301.05754
81111.000091.005491.007051.03069
91111.000021.002291.003051.01637
1011111.000951.001321.00873
1111111.000401.000571.00466
1211111.000171.000251.00248
1311111.000071.000111.00132
1411111.000031.000051.00071
1511111.000011.000021.00038
16111111.000011.00020
171111111.00011
181111111.00006
191111111.00003
201111111.00001
211111111
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Ullah, K.; Ahmad, J.; Arshad, M.; Ma, Z.; Abdeljawad, T. An Efficient Iterative Procedure for Proximally Quasi-Nonexpansive Mappings and a Class of Boundary Value Problems. Axioms 2022, 11, 90. https://doi.org/10.3390/axioms11030090

AMA Style

Ullah K, Ahmad J, Arshad M, Ma Z, Abdeljawad T. An Efficient Iterative Procedure for Proximally Quasi-Nonexpansive Mappings and a Class of Boundary Value Problems. Axioms. 2022; 11(3):90. https://doi.org/10.3390/axioms11030090

Chicago/Turabian Style

Ullah, Kifayat, Junaid Ahmad, Muhammad Arshad, Zhenhua Ma, and Thabet Abdeljawad. 2022. "An Efficient Iterative Procedure for Proximally Quasi-Nonexpansive Mappings and a Class of Boundary Value Problems" Axioms 11, no. 3: 90. https://doi.org/10.3390/axioms11030090

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