The impact of climate change on China's central region grain production: evidence from spatiotemporal pattern evolution

1.   Introduction

Suppose $\mathcal{B}$ is a Banach space and $\emptyset\neq \mathcal{C}\subseteq \mathcal{B}$. Now we many set an operator $T:\mathcal{C}\rightarrow \mathcal{C}$. $T$ is known as contraction if $||Tv-Tv^{\prime}||\leq\alpha||v-v^{\prime}||,$ whenever $v, v^{\prime}\in \mathcal{C}$ and $\alpha\in (0, 1)$. We call $T$ a nonexpansive operator if $\alpha = 1$. When $Tv^{\ast} = v^{\ast}$ for some $v^{\ast}\in \mathcal{C}$, then this element $v^{\ast}$ is known as a fixed point for $T$ and in this case we denote the set $\{v^{\ast}\in \mathcal{C}: Tv^{\ast} = v^{\ast}\}$ simply by $F_{T}$. However, if $Gv^{\ast} = 0$, for an operator $G:\mathcal{C}\rightarrow \mathcal{C}$, then it is called a zero of $G$ and in this case we denote the set $\{v^{\ast}\in\mathcal{C}:Gv^{\ast} = 0\}$ by $\mathcal{S}$. The class of nonexpansive operators is widely considered by lot of authors in different frame of works. In particular, Browder ^[6] and Gohde ^[10] separately provided the existence of fixed point result for these operators in a uniformly convex Banach space (UCBS) setting. Precisely, they noted that if $\mathcal{C}$ is bounded convex and closed in a UCBS, then a nonexpansive operator $T:\mathcal{C}\rightarrow \mathcal{C}$ essentially admits a fixed point. In 1975, Zhang ^[24] noticed a new notion of nonlinear operators as follows: an operator $T:\mathcal{C}\rightarrow \mathcal{C}$ on a subset $\mathcal{C}$ is essentially called mean nonexpansive if one can find two nonnegative reals $a, b$ satisfying $a+b\leq1$ such that

Remark 1.1. The class of mean nonexpansive operators is one of the important class of nonlinear mappings because it includes properly the class of all nonexpansive operators, that is, if $T:\mathcal{C}\rightarrow \mathcal{C}$ is nonexpansive then $T$ satisfies the requirement of a mean nonexpansive operator with $a = 1$ and $b = 0$. However, the converse is not valid in general as shown by the following example (see also Examples 5.1 and 5.2 in the last section of this paper).

Example 1.1. If $\mathcal{C} = [0, 4]$, then we can set an operator $T:\mathcal{C}\rightarrow \mathcal{C}$ by the following formula

Here, $T$ is discontinuous at $v = 4$ and hence not nonexpansive. On the other hand, it is straightforward to show that $T$ is a mean nonexpansive operator.

The existence of fixed points of mean nonexpansive operators in Banach spaces has been studied by some authors. In particular, Zhang ^[24] suggested a unique fixed point result for the class of mean nonexpansive operators in a Banach space endowed with a normal structure. Moreover, Wu and Zhang ^[23] and Zuo ^[25] provided some related properties and fixed point theorems for these operators in a Banach space. The first purpose of this research is to study the computation of fixed points for these maps under an appropriate algorithm. Secondly, we apply these results to solve some problems under new algorithms.

After the existence of a fixed point for a given operator, it is very natural to construct an iterative scheme, which approximate the value of this fixed point. We know that in general, that Picard iterates $v_{k+1} = Tv_{k}$ converges for Banach contractions but not for nonexpansive maps. Thus to find the value of the fixed point for nonexpansive and accordingly of generalized nonexpansive maps and also to obtain a relatively better rate of convergence, many schemes are available in the literature given below.

Mann ^[14] provided the following algorithm:

where $\mu_{k}\in (0, 1)$.

Ishikawa ^[11] constructed a new iterative algorithm as follows:

where $\mu_{k}, \eta_{k}\in (0, 1)$.

In 2000, Noor ^[16] first time introduced a three-step iterative algorithm, which is more general than that of Mann and Ishikawa iterative algorithms:

where $\mu_{k}, \eta_{k}, \theta_{k}\in (0, 1)$.

In 2007, Agarwal et al. ^[4] provided the $S$ iterative algorithm, which is independent of but better than the both the Mann and Ishikawa iterative algorithm for many nonlinear operators:

where $\mu_{k}, \eta_{k}\in (0, 1)$.

In 2014, Abbas and Nazir ^[2] considered another three-step iterative algorithm, which gives better approximation results as compared Mann, Ishikawa, Noor and $S$ iterative algorithm. Their algorithm reads as follows:

where $\mu_{k}, \eta_{k}, \theta_{k}\in (0, 1)$.

In 2016, Thakur et al. ^[21] (TTP) constructed a novel three-step iterative algorithm as follows:

where $\mu_{k}, \eta_{k}, \theta_{k}\in (0, 1)$.

By means of the iterative algorithm ^[21], they approximate fixed points for nonexpansive operators through weak and strong convergence on a Banach space setting. They also compared the high accuracy of this algorithm with the other well-known algorithms in the setting of nonexpansive operators. Maniu ^[15] proved that this algorithm is stable with respect to weak contractions. Here, we want to show that the main results of ^[21] can be extended to the setting of mean nonexpansive operators. We also give an example of mean nonexpansive operators which fails to hold the nonexpansiveness condition. We connect the three-step algorithm (1.6) and the other three-step algorithms with this example and show that this algorithm provide a high accuracy as compared the others three-step algorithms in the general setting of mean nonexpansive operators.

2.   Preliminaries

To obtain the required aim, we first provide some elementary facts and results.

Consider a Banach space $\mathcal{B}$ and $\emptyset\neq \mathcal{C}\subseteq \mathcal{B}$. Select an element $q_{0}\in \mathcal{B}$ and choose a bounded sequence, namely, $\{v_k\}\subseteq \mathcal{B}$. We may set $r(q_{0}, \{v_k\})$ as

The asymptotic radius of the sequence $\{v_k\}$ connected with the set $V$ will be denoted by $r(\mathcal{C}, \{v_k\})$ and given by

The asymptotic center of the sequence $\{v_k\}$ connected with the set $\mathcal{C}$ will be denoted by $A(\mathcal{C}, \{v_k\})$ and given by

Remark 2.1. The set $A(\mathcal{C}, \{v_{k}\})$ some-times does not has any element. But in the setting of UCBS, it is always a singleton set. The convexity of the $A(\mathcal{C}, \{v_{k}\})$ is also known in the case when $\mathcal{C}$ is a weakly compact and convex set, (see, e.g., ^[3,20] and others).

If a Banach space $\mathcal{B}$ is given. Then it is said to be endowed with the Opial's condition ^[17] in the case, when each $\{ v_{k} \}$ in $\mathcal{B}$ converges in the weak sense to $v\in \mathcal{B}$ enjoys the following strict inequality:

The following result is known from ^[25].

Lemma 2.1. Assume that $\mathcal{C}$ is a nonempty convex and closed subset of a reflexive Banach space (RBS) $\mathcal{B}$ and $T:\mathcal{C}\rightarrow \mathcal{C}$ a mean nonexpansive operator. If a sequence $\{v_{k}\}$ converges in the weak sense to $v^{\ast}$ and $\lim_{k\rightarrow \infty}||v_{k}-Tv_{k}|| = 0$, then $v^{\ast}\in F_{T}$ provided that $\mathcal{B}$ has the Opial's property.

Now we take an important property of a UCBS from ^[18].

Lemma 2.2. If $\mathcal{B}$ is a UCBS such that for any two sequences $\{e_{k}\}$ and $\{v_{k}\}$ in $\mathcal{B}$ with $\limsup_{k\rightarrow \infty}||e_{k}||\leq z$, $\limsup_{k\rightarrow \infty}||v_{k}||\leq z$ and $\lim_{k\rightarrow \infty}||\mu_{k}e_{k}+(1-\mu_ {k})v_{k}|| = z$, for $0 < c\leq \mu_{k}\leq d < 1$ and some $z\geq 0$. Then $\lim_{k\rightarrow \infty}||e_{k}-v_{k}|| = 0$.

3.   Convergence theorems of mean nonexpansive operators

Notice that, throughout the section, $\mathcal{B}$ denotes a UCBS. The main outcome of this section is begun with the following key lemma. It should be noted that this lemma extends and improves [21, Lemma 4.1] from the setting of nonexpansive operators to the setting of mean nonexpansive operators.

Lemma 3.1. If $\mathcal{C}$ is a nonempty convex and closed subset of $\mathcal{B}$ such that $T:\mathcal{C}\rightarrow \mathcal{C}$ is a mean nonexpansive operator having $F_{T}\neq \emptyset$. Then $\lim_{k\rightarrow \infty}||v_{k}-v^{\ast}||$ exists for every $v^{\ast}\in F_{T}$, where $\{v_{k}\}$ is a sequence generated by (1.6).

Proof. For, $v^{\ast}\in F_{T}$, we have $v^{\ast} = Tv^{\ast}$. Then using (1.6), we have

and

While using the above inequilities, we have

It has been observed that $\{||v_{k}-v^{\ast}||\}$ is non-increasing and bounded. It follows that $\lim_{k\rightarrow \infty}||v_{k}-v^{\ast}||$ exists for all fixed point $v^{\ast}$ of $T$.

The next theorem will be helpful in proving the main results of the sequel.

Theorem 3.1. If $\mathcal{C}$ is a nonempty convex and closed subset of $\mathcal{B}$ such that $T:\mathcal{C}\rightarrow \mathcal{C}$ is a mean nonexpansive operator having $F_{T}\neq \emptyset$ and $\{v_{k}\}$ is a sequence defined in (1.6). Then the sequence $\{v_{k}\}$ is bounded and $\lim_{k\rightarrow \infty}||v_{k}-Tv_{k}|| = 0$.

Proof. If we select any element $v^{\ast}\in F_{T}$, then it is clear from the Lemma 3.1, that, $\{v_{k}\}$ is bounded. We want to show that $\lim_{k\rightarrow \infty}||v_{k}-Tv_{k}|| = 0$. Now, according to Lemma 3.1, $\lim_{k\rightarrow \infty}||v_{k}-v^{\ast}||$ exists. We set

Now,

Also,

Similarly,

From (3.2) and (3.4), we get

From (3.5), we have

Applying Lemma 2.2, we obtain

Now we want to establish a strong convergence theorem on a compact domain. This result includes the result if one considers a nonexpansive operator.

Theorem 3.2. If $\mathcal{C}$ is a nonempty convex and closed subset of $\mathcal{B}$ such that $T:\mathcal{C}\rightarrow \mathcal{C}$ is a mean nonexpansive operator having $F_{T}\neq \emptyset$. Then $\{v_{k}\}$ defined in (1.6) converges in the strong sense to a point of $F_{T}$ if $\mathcal{C}$ is compact.

Proof. Thanks to the convexity of $\mathcal{C}$, we can say that $\{v_{k}\}\subseteq \mathcal{C}$. Also remembering the compactness of $\mathcal{C}$, one can choose a strongly convergent subsequence $\{v_{k_{m}}\}$ of $\{v_{k}\}$ such that $v_{k_{m}}\rightarrow v_{0}$. Now we show that $Tv_{0} = v_{0}$. For this

Consequently, we obtain

According to Theorem 3.1, we have $\lim_{k\rightarrow \infty}||v_{k_{m}}-Tv_{k_{m}}|| = 0$, so applying $m\rightarrow \infty$ on (3.6), we obtain $Tv_{0} = v_{0}$. This shows that $v_{0}\in F_{T}$. By Lemma 3.1, $\lim_{k\rightarrow \infty}||v_{k}-v_{0}||$ exists. Consequently, $v_{0}$ is the strong limit of $\{v_{k}\}$ and element of $F_{T}$.

If we drop the compactness assumption, we have the following result. It should be noted that this theorem extends and improves [21, Theorem 4.4] from the setting of nonexpansive operators to the setting of mean nonexpansive operators.

Theorem 3.3. If $\mathcal{C}$ is a nonempty convex and closed subset of $\mathcal{B}$ such that $T:\mathcal{C}\rightarrow \mathcal{C}$ is a mean nonexpansive operator having $F_{T}\neq \emptyset$. Then $\{v_{k}\}$ defined in (1.6) converges in the strong sense to a point of $F_{T}$, if and only if $\liminf_{k\rightarrow \infty}d(v_{k}, F_{T}) = 0$.

Proof. The necessity is straight forward.

Conversely, we may assume that $\liminf_{k\rightarrow \infty}d(v_{k}, F_{T}) = 0$ and choose $v^{\ast}\in F_{T}$. From the Lemma 3.1, $\lim_{k\rightarrow \infty}||v_{k}-v^{\ast}||$ exists. By assumption, we conclude that $\lim_{k\rightarrow \infty}d(v_{k}, F_{T}) = 0$. We want to show that $\{v_{k}\}$ form a Cauchy sequence in the set $\mathcal{C}$. As we have proved that $\lim_{k\rightarrow \infty}d(v_{k}, F_{T}) = 0$, so for a given $\varepsilon > 0$, one can choose $r_{0}\in \mathbb{N}$ in such a way that for each $k\geq r_{0}$,

In particular, $\inf\{||v_{k_{0}}-v^{\ast}||:v^{\ast}\in F_{T}\} < \frac{\varepsilon}{2}$. This suggests the existence of $v^{\ast}\in F_{T}$ such that

Now for $r, m\geq k_{0}$,

Hence, we observe that $\{v_{k}\}$ form a Cauchy sequence in the closed set $V$ and so one can choose some $v^{\ast}\in \mathcal{C}$ such that $\lim_{k\rightarrow \infty}v_{k} = v^{\ast}$. Now $\lim_{k\rightarrow \infty}d(v_{k}, F_{T}) = 0$ gives that $d(v^{\ast}, F_{T}) = 0$. The closeness of $F_{T}$ follows from the mean nonexpansiveness of $T$. Hence $v^{\ast}\in F_{T}$.

We want to show a strong convergence theorem under the following condition.

Definition 3.1. ^[19] On a nonempty subset $\mathcal{C}$ of $\mathcal{B}$, an operator $T:\mathcal{C}\rightarrow \mathcal{C}$ is said to have a condition $(I)$ in the case, when there is a selfmap $R:[0, \infty)\rightarrow [0, \infty)$ such that $R(i) = 0$, if and only if $i = 0$, $R(i) > 0$ for all real constants $i\in(0, \infty)$ and $||v-Tv^{\prime}||\geq R(d(v, F_{T}))$ for all $v\in \mathcal{C}$.

The following theorem extends and improves [21, Theorem 4.5] from the setting of nonexpansive operators to the setting of mean nonexpansive operators.

Theorem 3.4. If $\mathcal{C}$ is a nonempty convex and closed subset of $\mathcal{B}$ such that $T:\mathcal{C}\rightarrow \mathcal{C}$ is a mean nonexpansive operator having $F_{T}\neq \emptyset$. Then $\{v_{k}\}$ defined in (1.6) converges in the strong sense to a point of $F_{T}$ if $T$ has a condition $(I)$.

Proof. In the view of Theorem 3.1, we conclude the following

By combining condition $(I)$ with (3.7), we get

Since the selfmap $R$ is such that $R(0) = 0$ and $R(a) > 0$ for all $i > 0$. It follows that

It has been observed that all the requirements of Theorem 3.3 are present, one concludes that $T$ converges strongly to a fixed point of $T$.

This section we close by providing a weak convergence theorem. It should be noted that this theorem extends and improves [21, Theorem 4.3] from the setting of nonexpansive operators to the setting of mean nonexpansive operators.

Theorem 3.5. If $\mathcal{C}$ is a nonempty convex and closed subset of $\mathcal{B}$ such that $T:\mathcal{C}\rightarrow \mathcal{C}$ is a mean nonexpansive operator having $F_{T}\neq \emptyset$. Then $\{v_{k}\}$ defined in (1.6) converges in the weak sense to a point of $F_{T}$ if $\mathcal{B}$ has the Opial's property.

Proof. We can write from Theorem 3.1 that $\{v_{k}\}$ is bounded and $\lim_{k\rightarrow \infty}||v_{k}-Tv_{k}|| = 0$. It is known that $\mathcal{B}$ is RBS in the case when $\mathcal{B}$ is UCBS. Thanks to the reflexiveness of the space, the generated sequence $\{v_{k}\}$ eventually possess a subsequence which we may denote by $\{v_{k_{s}}\}$ equiped with a weak limit $v_{1}\in \mathcal{C}$. Now we may apply Lemma 2.1, and obtain $v_{1}\in F_{T}$. Next we want to show that the element $v_{1}$ is also a weak limit of $\{v_{k}\}$. If the element $v_{1}$ is not the weak limit of the sequence $\{v_{k}\}$, then we may set another weakly convergent subsequence $\{v_{k_{t}}\}$ of $\{v_{k}\}$ equiped with a weak limit $v_{2}\in \mathcal{C}$ in such a way that $v_{2}\neq v_{1}$. Applying Lemma 2.1, $v_{2}\in F_{T}$. Now applying Lemma 3.1 and also the Opial condition, one has

The above observations give a contradiction. Thus, we must accept that the element $v_{1}$ is the weak limit of $\{v_{k}\}$. This finishes the proof.

4.   Some applications

If a linear or nonlinear equation has a solution then some-times it is either very hard or impossible to compute the value of such a solution under ordinary analytical approaches ^[1,12,22]. For instance, see the following equations,

which are not easy to solve by applying available analytical approaches of the literature. In such a case, the approximate value of such a solution is desirable. To find an approximate value of a solution, we must rearrange the given equation in the form of fixed point equation $v = Tv$. Notice that here the operator $T$ should be set on a certian space $\mathcal{B}$. In this case, fixed point set of $T$ is same as the solution set of the given equation. Fixed point theorems provides the existence and uniqueness of a fixed point for $T$, while iterative algorithms finds the value of this fixed point by imposing some conditions (on $T$, the domain of $T$ or any other). Banach Contraction Principle (BCP) ^[5] offers a unique fixed point for $T$ if $T$ is a contraction and $\mathcal{B}$ is a complete metric space and suggest a basic iterative algorithm due to Picard for computing its value. However, for nonexpansive operators, Picard algorithm in general fails to converge. The class of nonexpansive operators includes contractions and has important applications in many areas of applied sciences, that is, in image reconstruction and signal processing problems, the operator $T$ is essentially nonexpansive, when the method of an averaging operators is used, (see e.g., Byrne ^[7] and others).

Accordingly, here we propose algorithms that are the modifications of the TTP algorithm (1.6) (which we call here TTP type algorithms) and using our main results, we show that these algorithms eventually solves SFPs and VIPs, respectively.

4.1.   Split feasibility problems

If $\mathcal{B}_{1}$ and $\mathcal{B}_{2}$ are two given real Hilbert spaces. Then the concept of a SFP mathematically, a SFP ^[8] reads as follows:

The subset $\mathcal{C}\subseteq\mathcal{B}_{1}$ as well as the subset $\mathcal{Q}\subseteq\mathcal{B}_{2}$ are assumed as closed, convex and $A:\mathcal{B}_{1}\rightarrow \mathcal{B}_{2}$ is an operator which is assumed at the same time linear and bounded. From ^[13], we know that, many problems arise in the research of signal processing as well as the design of any provided nonlinear synthetic discriminant filter as concerns optical pattern recognition, can be set in the form of SFPs.

We may suppose that the SFP (4.1) has a nonempty solution set, and we denote it by $\mathcal{S}$. Now, from ^[13], we know that, $v^{\ast}\in \mathcal{C}$ solves (4.1) if and only if it solves the below provided fixed point equation:

The above used notations $P_{\mathcal{C}}$ as well as $P_{\mathcal{Q}}$ are used for the nearest point projection (NPP) onto the already choosen sets $\mathcal{C}$ and $\mathcal{Q}$, respectively. While $\xi > 0$ and $A^{\ast}$ denotes the adjoint operator of corresponding to the operator $A$. In ^[7], Byrne was the first researcher among other things, who noted that if $\eta$ is a scalar that denotes a spectral radius of $A^{\ast}A$ and suppose $0 < \xi < \frac{2}{\eta}$, we can say that

is essentially nonexpansive and the weak convergence of the below $\mathcal{C}\mathcal{Q}$ iterative algorithm

is confirm in the set $\mathcal{S}$.

The improvement and extension the above weak convergence to case of strong convergence gained the attention of many authors. However to do this, one needs some more assumptions, (see e.g., ^[13] and others) to study a recent survey on the Halpern type algorithms.

In this research, our approach is to consider mean nonexpansive operators, which are generally not continuous on the domain on which they are defined (as shown by examples in this paper), instead of nonexpansive operators, that are essentially throughout continuous on the domain on which they are defined. In this case, we assume that a SFP has a solution, and prove that the proposed iterative algorithm converges weakly and strongly to its solution.

Theorem 4.1. Let the SFP (4.1) be consistent, that is, $\mathcal{S}\neq\emptyset$, $0 < \xi < \frac{2}{\eta}$ and $P_{\mathcal{C}}(I_{id}-\xi A^{\ast}(I_{id}-P_{\mathcal{Q}})A)$ be a mean nonexpansive operator. Then there exists $\mu_{k}, \eta_{k}, \theta_{k}\in (0, 1)$ in a way that the suggested iterative algorithm sequence $\{v_{k}\}$ produced as

accordingly weakly convergent to $v^{\ast}$ which is a solution of SFP problem (4.1).

Proof. Puti $T = P_{\mathcal{C}}(I_{id}-\xi A^{\ast}(I_{id}-P_{\mathcal{Q}})A)$. Then $T$ is a mean nonexpansive operator. According to Theorem 3.5, $\{v_{k}\}$ converges weakly to a point of $F_{T}$. But $F_{T} = \mathcal{S}$, it follows that $\{v_{k}\}$ converges weakly to a solution $v^{\ast}$ of the SFP problem (4.1).

The strong convergence is the following.

Theorem 4.2. Let the SFP (4.1) be consistent, that is, $\mathcal{S}\neq\emptyset$, $0 < \xi < \frac{2}{\eta}$ and $P_{\mathcal{C}}(I_{id}-\xi A^{\ast}(I_{id}-P_{\mathcal{Q}})A)$ be a mean nonexpansive operator. Then there exists $\mu_{k}, \eta_{k}, \theta_{k}\in (0, 1)$ in a way that the suggested iterative algorithm sequence $\{v_{k}\}$ produced as

accordingly strongly convergent to $v^{\ast}$ which is a solution of SFP problem (4.1) provided that $\liminf_{k\rightarrow \infty} d(v_{k}, \mathcal{S}) = 0$.

Proof. Puti $T = P_{\mathcal{C}}(I_{id}-\xi A^{\ast}(I_{id}-P_{\mathcal{Q}})A)$. Then $T$ is mean nonexpansive. According to Theorem 3.3, $\{v_{k}\}$ converges strongly to a point of $F_{T}$. But $F_{T} = \mathcal{S}$, it follows that $\{v_{k}\}$ converges strongly to a solution $v^{\ast}$ of the SFP problem (4.1).

4.2.   Variational inequality problems

Suppose a Hilbert space $\mathcal{B}$ and $\emptyset\neq \mathcal{C}\subset \mathcal{B}$ is closed and convex. The operator $M: \mathcal{B} \rightarrow \mathcal{B}$ is known as monotone if

Now we give the concept of a VIP. Mathematically, a VIP reads as follows:

In ^[7], the author noted that if $\xi > 0$, then $v^{\ast}\in \mathcal{C}$ is always a solution for the VIP (4.2) if and only if $v^{\ast}$ is a solution of the below given fixed point equation:

where $P_{\mathcal{C}}$ denotes the nearest point projection onto the set $\mathcal{C}$.

In ^[7], the author noted that if $I_{id}-\xi M$ and $P_{\mathcal{C}} (I_{id} -\xi M)$ are nonexpansive operators, then, the sequence $\{v_{k}\}$ generated by the following iterative algorithm:

converges weakly to a solution of the VIP (4.2), provided that such solutions essentially exist.

In this research, our approach is to consider mean nonexpansive operators, which are generally not continuous on the domain on which they are defined (as shown by examples in this paper), instead of nonexpansive operators, that are essentially throughout continuous on the domain on which they are defined. In this case, we assume that a VIP has a solution, and prove that the proposed iterative algorithm converges weakly and strongly to its solution.

Theorem 4.3. Let the VIP (4.2) be consistent, that is, $\mathcal{S}\neq\emptyset$, $\xi > 0$. If $P_C (I_{id} -\xi M)$ is a mean nonexpansive operator. Then there exists $\mu_{k}, \eta_{k}, \theta_{k}\in (0, 1)$ in a way that the suggested iterative algorithm sequence $\{v_{k}\}$ produced as

accordingly weakly convergent to $v^{\ast}$ which is a solution of VIP problem (4.2).

Proof. Puti $T = P_\mathcal{C} (I_{id} -\xi M)$. Then $T$ is a mean nonexpansive operator. According to Theorem 3.5, $\{v_{k}\}$ converges weakly to a point of $F_{T}$. But $F_{T} = \mathcal{S}$, it follows that $\{v_{k}\}$ converges weakly to a solution $v^{\ast}$ of the VIP problem (4.2).

Theorem 4.4. Let the VIP (4.2) be consistent, that is, $\mathcal{S}\neq\emptyset$, $\xi > 0$. If $P_\mathcal{C} (I_{id} -\xi M)$ is a mean nonexpansive operator. Then there exists $\mu_{k}, \eta_{k}, \theta_{k}\in (0, 1)$ in a way that the suggested iterative algorithm sequence $\{v_{k}\}$ produced as

accordingly strongly convergent to $v^{\ast}$ which is a solution of VIP problem (4.2) provided that $\liminf_{k\rightarrow \infty}d(v_{k}, \mathcal{S}) = 0$.

Proof. Put $T = P_\mathcal{C} (I_{id} -\xi M)$. Then $T$ is mean nonexpansive. According to Theorem 3.3, $\{v_{k}\}$ converges weakly to a point of $F_{T}$. But $F_{T} = \mathcal{S}$, it follows that $\{v_{k}\}$ converges strongly to a solution $v^{\ast}$ of the VIP problem (4.2).

5.   Examples

We first construct an example of discontinuous mean nonexpansive maps having a unique fixed point. We show that this example does not belong to the class of nonexpansive operators as.

Example 5.1. If $\mathcal{C} = [1, 5]$, then $\mathcal{C}$ is clearly close and convex. We now set $T:\mathcal{C}\rightarrow \mathcal{C}$ that is defined as follows:

We want to show that $T$ is mean nonexpansive on $\mathcal{C}$. We need to find some positive real constants $a, b$ with $a+b\leq1$, suchjthat $||Tv-Tv^{\prime}||\leq a||v-v^{\prime}||+b||v-Tv^{\prime}||$, for every $v, v^{\prime}\in \mathcal{C}$. Choose $a = \frac{1}{2} = b$, then $a+b\leq1$. We suggest the following cases.

(i) Suppose that $1\leq v, v^{\prime} < 2$. Then

(ii) Suppose that $2\leq v, v^{\prime} < 5$. Then

(iii) Suppose that $1\leq v^{\prime} < 2$ and $2 < v\leq5$.

(iv) Suppose that $1\leq v < 2$ and $2\leq v^{\prime}\leq5$.

It has been observed that the operator $T$ is mean nonexpansive on the set $\mathcal{C}$. Notice that $T$ is being discontinuous and hence not nonexpansive. Precisely, if $v = 1.9$ and $v^{\prime} = 2$, then $||Tv-Tv^{\prime}|| > ||v-v^{\prime}||$. Using this example, we provide some values obtained from different iterative algorithms in the Table 1 and the behaviors of there iterates can be viewed in the Figure 1.

Table 1.  Iterates of Picard, Mann (1.1), Ishikawa (1.2), Noor (1.3), S (1.4), Abbas (1.5), and TTP (1.6) using the operator $T$ of Example 5.1.

	k	Picard	Mann	Ishikawa	Noor	S	Abbas and Nazir	TTP
	$1$	4.3	4.3	4.3	4.3	4.3	4.3	4.3
	$2$	4.6500	4.5975	4.6942	4.7159	4.7467	4.7470	4.8037
	$3$	4.8250	4.7686	4.8664	4.8847	4.9083	4.9086	4.9449
	$4$	4.9125	4.8669	4.9416	4.9532	4.9668	4.9670	4.9846
	$5$	4.9563	4.9235	4.9745	4.9810	4.9880	4.9881	4.9957
	$6$	4.9781	4.9560	4.9889	4.9923	4.9957	4.9957	4.9988
	$7$	4.9891	4.9747	4.9951	4.9969	4.9984	4.9984	4.9997
	$8$	4.9945	4.9855	4.9979	4.9987	4.9994	4.9994	5.9999
	$9$	4.9973	4.9916	4.9991	4.9995	4.9998	4.9998	5.0000
	$10$	4.9986	4.9952	4.9996	4.9998	4.9999	4.9999	5.0000
	$11$	4.9993	4.9972	4.9998	4.9999	5.0000	5.0000	5.0000
	$12$	4.9997	4.9984	4.9999	5.0000	5.0000	5.0000	5.0000
	$13$	4.9998	4.9991	5.0000	5.0000	5.0000	5.0000	5.0000
	$14$	4.9999	4.9995	5.0000	5.0000	5.0000	5.0000	5.0000
	$15$	5.0000	4.9997	5.0000	5.0000	5.0000	5.0000	5.0000
	$16$	5.0000	4.9998	5.0000	5.0000	5.0000	5.0000	5.0000
	$17$	5.0000	4.9999	5.0000	5.0000	5.0000	5.0000	5.0000
	$18$	5.0000	5.0000	5.0000	5.0000	5.0000	5.0000	5.0000

---

 | Show Table

DownLoad: CSV

Figure 1.  Behaviors of iterates of the Table 1.

DownLoad: Full-Size Img PowerPoint

Now, we show some furhter high accuracy of the TTP iterative algorithm. We use Example 5.2, and set $||v_{k}-v^{\ast}|| < 10^{-15}$ our stopping cretrian. Observations are provided in the Tables 2–4 and Figures 2–4.

Table 2.  $\mu_{k} = \frac{k}{k+3}$, $\eta_{k} = \frac{k}{\sqrt{(k+7)}}$ and $\theta_{k} = \frac{2k}{5k+2}$.

$\text{Number of iterative steps to reach the fixed point.}$
$v_{1}$	Noor (1.3)	Abbas and Nazir (1.5)	TTP(1.6)
$0.12$	$17$	$13$	$\textbf{10}$
$0.28$	$17$	$14$	$\textbf{10}$
$0.50$	$17$	$14$	$\textbf{11}$
$0.75$	$18$	$14$	$\textbf{11}$
$0.99$	$18$	$16$	$\textbf{11}$

---

 | Show Table

DownLoad: CSV

Table 3.  $\mu_{k} = \frac{k}{k+1}$, $\eta_{k} = \frac{k}{k+7}$ and $\theta_{k} = \sqrt{\left(\frac{1}{3k+4}\right)}$.

$\text{Number of iterative steps to reach the fixed point.}$
$v_{1}$	Noor (1.3)	Abbas and Nazir (1.5)	TTP(1.6)
$0.12$	$15$	$16$	$\textbf{14}$
$0.28$	$16$	$17$	$\textbf{14}$
$0.50$	$16$	$17$	$\textbf{15}$
$0.75$	$16$	$17$	$\textbf{15}$
$0.99$	$16$	$17$	$\textbf{15}$

---

 | Show Table

DownLoad: CSV

Table 4.  $\mu_{k} = \frac{k}{(7k+25)^{\frac{1}{7}}}$, $\eta_{k} = 1-\left(\frac{1}{k+7}\right)$ and $\theta_{k} = \frac{k}{k+25}$.

$\text{Number of iterative steps to reach the fixed point.}$
$v_{1}$	Noor (1.3)	Abbas and Nazir (1.5)	TTP(1.6)
$0.12$	$26$	$15$	$\textbf{12}$
$0.28$	$27$	$15$	$\textbf{13}$
$0.50$	$27$	$16$	$\textbf{13}$
$0.75$	$27$	$16$	$\textbf{13}$
$0.99$	$28$	$16$	$\textbf{13}$

---

 | Show Table

DownLoad: CSV

Figure 2.  Behaviors comparison of the three-step methods by putting the parameters as in the Table 2 and the starting point $v_{1} = 0.14$.

DownLoad: Full-Size Img PowerPoint

Figure 3.  Behaviors comparison of the three-step methods by putting the parameters as in the Table 3 and the starting point $v_{1} = 0.52$.

DownLoad: Full-Size Img PowerPoint

Figure 4.  Behaviors comparison of the three-step methods by putting the parameters as in the Table 4 and the starting point $v_{1} = 0.98$.

DownLoad: Full-Size Img PowerPoint

We finish our paper with the following example that illustrates our main results.

Example 5.2. If $\mathcal{C} = [0, 1]$, then we can set an operator $T:\mathcal{C}\rightarrow \mathcal{C}$ by the following formula

Here, $T$ is discontinuous and hence not nonexpansive. On the other hand, $T$ is a mean nonexpansive operator. Moreover, the domain of $T$ is closed convex subset of a UCBS, so the sequence of TTP iteration (1.6) converges to its fixed point.

6.   Conclusions

The paper provided a three-step iterative approach to compute fixed points of mean nonexpansive maps in a Banach space setting. Weak and strong convergence on compact and noncompact domains are essentially established. We have showed by examples that mean nonexpansive mappings are in general discontinuous and include all nonexpansive mappings. Accordingly, we have improved the main results of Thakur et al. ^[21] in two ways:

$({\rm{i}})$ From nonexpansive operators to the wider setting of mean nonexpansive operators.

$({\rm{ii}})$ From continuous operators to the general setting of discontinuous operators.

As applications of the main outcome, we have suggested two new three-step TTP type projection algorithms to find a solution for SFP and VIP in the context of mean nonexpansive mappings. We have performed some numerical experiments to provide the high accuracy of the studied three-step algorithm corresponding to the other three-step algorithms in context of mean nonexpansive operators.

7.   Open problem

We now leave an intersting open problem for the readers as follows.

Open Problem. Can we extend the results of this paper to the setting of hyperbolic spaces?

Acknowledgments

This study is supported via funding from Prince Sattam bin Abdulaziz University project number (PSAU/2023/R/1444).

Conflict of interest

The authors declare no conflict of interest.