An Iterative Algorithm to Approximate Fixed Points of Non-Linear Operators with an Application

Abstract

In this article, we study the JF iterative algorithm to approximate the fixed points of a non-linear operator that satisfies condition (E) in uniformly convex Banach spaces. Further, some weak and strong convergence results are presented for the same operator using the JF iterative algorithm. We also demonstrate that the JF iterative algorithm is weakly $w^2$$\mathcal{G}$-stable with respect to almost contractions. In connection with our results, we provide some illustrative numerical examples to show that the JF iterative algorithm converges faster than some well-known iterative algorithms. Finally, we apply the JF iterative algorithm to estimate the solution of a functional non-linear integral equation. The results of the present manuscript generalize and extend the results in existing literature and will draw the attention of researchers.

1. Introduction

Fixed point theory has an eminent position in pure and applied mathematics because it has a variety of applications in different fields within mathematics, such as differential and integral equations, variational inequalities, approximation theory, etc. The application of fixed point results is not merely confined to mathematics, but is also relevant in other fields, such as statistics, computer sciences, chemical sciences, physical sciences, economics, biological sciences, medical sciences, engineering, game theory, etc. (see, e.g., [1,2]). It is a domain that is of great interest in two research directions: the first is to find progressively wider classes of mappings and conditions under which the existence of fixed points can be proved; the second is to define iterative algorithms for the approximation of the fixed points of these mappings, as it is not always an easy task to approximate the fixed points using direct methods.

The fundamental result in metric fixed point theory is the Banach contraction principle, which was first introduced in the literature in 1922. This result provides the guarantee of the existence and uniqueness of the fixed point of a contraction mapping in a complete metric space. It not only demonstrates the existence and uniqueness of a fixed point, but also allows the Picard iterative algorithm to converge to that fixed point. Further, on account of its simplicity, utility and applicability, the Banach contraction principle has become an extremely well-known tool in solving existence problems in numerous branches of mathematical analysis. As such, several authors have improved, extended and generalized the Banach contraction principle. One of the most important generalizations of the Banach contraction principle was produced by Berinde [3] in 2003. He defined almost contraction mapping as follows.

A self-mapping $\mathcal{G}$ defined on a non-empty subset $\mathcal{S}$ of a Banach space $\mathcal{B}$ is called an almost contraction when constants $\delta \in (0,1)$ and $L\ge 0$ exist in such a way that:

$$\parallel \mathcal{G}x-\mathcal{G}y\parallel \le \delta \parallel x-y\parallel +L\parallel y-\mathcal{G}x\parallel ,\forall x,y\in \mathcal{S}.$$

(1)

It is worth mentioning here that condition (1) only ensures the existence of a fixed point of an almost contraction (see, [3]). For the uniqueness of the fixed point of an almost contraction, he proved the following result.

Theorem 1

([3]). Let $(\mathcal{B},d)$ be a complete metric space and $\mathcal{G}:\mathcal{B}\to \mathcal{B}$ be an almost contraction (1). When constants $\delta \in (0,1)$ and $L\ge 0$ exist in such a way that:

$$d(\mathcal{G}x,\mathcal{G}y)\le \delta d(x,y)+Ld(x,\mathcal{G}x),\forall x,y\in \mathcal{S}.$$

(2)

Then $\mathcal{G}$ has a unique fixed point, i.e., t, in $\mathcal{B}$.

Berinde has also shown that almost contractions include the classes of Kannan [4], Chatterjea [5] and Zamfirescu [6] mappings.

A widely studied extension of contraction mappings is the class of non-expansive mappings, which is natural and vast due to isometry and metric projections. A self-mapping $\mathcal{G}$ defined on a non-empty subset $\mathcal{S}$ of a Banach space $\mathcal{B}$ is said to be non-expansive when:

$$\parallel \mathcal{G}x-\mathcal{G}y\parallel \le \parallel x-y\parallel ,\forall x,y\in \mathcal{S}.$$

The fixed point theory for non-expansive mappings has a variety of applications in convex feasibility problems, convex optimization problems, monotone inequality problems, image restorations, etc. Due to its applicability, a large number of eminent researchers have generalized and extended this theory to the large classes of non-linear mappings. One of the most important generalizations of non-expansive mappings was produced by Garcia-Falset et al. [7] in 2011, which is defined as follows.

Definition 1

([7]). Let $\mathcal{S}$ be a non-empty subset of a Banach space $\mathcal{B}$ and $\mu \ge 1$. An operator $\mathcal{G}:\mathcal{S}\to \mathcal{B}$ is said to satisfy condition $\left(E_{\mu }\right)$ when:

$$\parallel x-\mathcal{G}y\parallel \le \mu \parallel x-\mathcal{G}x\parallel +\parallel x-y\parallel ,\forall x,y\in \mathcal{S}.$$

(3)

Moreover, $\mathcal{G}$ is said to satisfy condition $\left(E\right)$ when $\mathcal{G}$ satisfies condition $\left(E_{\mu }\right)$ with $\mu \ge 1$.

It can be easily seen that when $\mathcal{G}:\mathcal{S}\to \mathcal{B}$ is a non-expansive mapping, it satisfies condition $\left(E_{\mu }\right)$ with $\mu =1$. It is worth mentioning here that the class of operators that satisfy condition $\left(E\right)$ properly includes the classes of Hardy and Rogers mappings [8], mappings satisfying Suzuki’s condition $\left(C\right)$ [9], generalized $\alpha$ non-expansive mappings [10] and generalized $\alpha$–Reich–Suzuki non-expansive mappings [11].

In many instances, it is not possible to find the exact solution of fixed point problems. Therefore, iterative algorithms are used to approximate the solutions of the fixed point problems. Thus, a large number of iterative algorithms have been introduced and studied for the approximation of solutions to fixed point problems (see, e.g., [12,13,14,15,16,17,18,19,20,21,22], etc).

Very recently, Ali et al. [23] introduced a new iterative algorithm called the JF iterative algorithm, which is defined as follows.

Let $\mathcal{S}$ be a non-empty closed and convex subset of a Banach space $\mathcal{B}$ and let $\mathcal{G}:\mathcal{S}\to \mathcal{S}$ be the mapping. Then, the sequence $\left\{{\tau }_n\right\}$ is generated by an initial point ${\tau }_0$ and defined by:

$$\left\{\begin{array}{c}{\tau }_{n+1}=\mathcal{G}((1-{\mu }_n){\sigma }_n+{\mu }_n\mathcal{G}{\sigma }_n),\hfill \\ {\sigma }_n=\mathcal{G}{\xi }_n,\hfill \\ {\xi }_n=\mathcal{G}((1-{\theta }_n){\tau }_n+{\theta }_n\mathcal{G}{\tau }_n),n\in {\mathbb{Z}}^{+},\hfill \end{array}\right.$$

(4)

where $\left\{{\mu }_n\right\}$ and $\left\{{\theta }_n\right\}$ are control sequences in $(0,1)$ and ${\mathbb{Z}}^{+}$ denotes the set of non-negative integers. They pointed that the JF iterative algorithm is independent from all other iterative algorithms that have been previously defined in the literature. They have produced some weak and strong convergence results for Hardy and Rogers generalized non-expansive mappings using the JF iterative algorithm in uniformly convex Banach spaces. They have also numerically shown that the JF iterative algorithm converges to the fixed point of Hardy and Rogers generalized non-expansive mappings faster than some other remarkable iterative algorithms.

On the other hand, many scientific and engineering problems are presented in the form of non-linear integral equations. The class of initial and boundary value problems can be transformed to Fredholm or Volterra non-linear integral equations. The solution of non-linear integral equations exists locally and has blow-up phenomena (see, [24,25]). In Section 5, we apply the JF iterative method to approximate the solution of a non-linear integral equation in the setting of a Banach space.

Inspired by the above study, we aim to prove that the JF iterative algorithm is weakly $w^2$$\mathcal{G}$-stable with respect to almost contractions in the current manuscript. Further, we present some weak and strong convergence results for the operators that satisfy condition $\left(E\right)$ using the JF iterative algorithm in uniformly convex Banach spaces. We numerically show that the JF iterative algorithm converges to the fixed point of the operators that satisfy condition $\left(E\right)$ faster than Mann, Ishikawa, Noor, SP, S and Picard-S iterative algorithms. Finally, we approximate the solution of a mixed Volterra–Fredholm functional non-linear integral equation. The results of the present manuscript generalize and extend the results in existing literature, particularly those of [20,23].

2. Preliminaries

The aim of this section is to set out some lemmas and definitions that are used in this paper.

Lemma 1

([26]). Let $\left\{u_n\right\}$ and $\left\{{ϵ}_n\right\}$ be sequences in ${\mathbb{R}}_{+}$ that satisfy the following inequality:

$$u_{n+1}\le (1-v_n)u_n+{ϵ}_n,$$

where $v_n\in (0,1)$ for all $n\in {\mathbb{Z}}^{+}$ with ${\sum }_{n=0}^{\infty }{v}_n=\infty$. When $\underset{n\to \infty }{lim}\frac{{ϵ}_n}{v_n}=0$, then $\underset{n\to \infty }{lim}{u}_n=0$.

Definition 2

([27]). Let $\mathcal{B}$ be a Banach space and $\left\{{\tau }_n\right\}$ be a weakly convergent sequence to $x\in \mathcal{B}$, then $\mathcal{B}$ satisfies Opial’s property when:

$$\underset{n\to \infty }{lim}inf\parallel {\tau }_n-x\parallel <\underset{n\to \infty }{lim}inf\parallel {\tau }_n-y\parallel$$

holds for all $y\in \mathcal{B}$ with $y\ne x$.

Example 1.

All Hilbert spaces and ${\ell }^p(1<p<\infty )$ spaces satisfy Opial’s property, while $L^p[0,2\pi ](1<p\ne 2)$ spaces do not satisfy Opial’s property.

Definition 3

([28]). An operator $\mathcal{G}:\mathcal{S}\to \mathcal{S}$ satisfies condition $\left(I\right)$ when a non-decreasing function $\psi :[0,\infty )\to [0,\infty )$ exists with $\psi \left(0\right)=0$ and $\psi \left(y\right)>0$, $\forall y>0$, such that $\parallel y-\mathcal{G}y\parallel \ge \psi \left(d\right(y,F\left(\mathcal{G}\right)\left)\right)$ and $\forall y\in \mathcal{S}$, where $F\left(\mathcal{G}\right)=\{t\in \mathcal{S}:\mathcal{G}t=t\}$ and $d(y,F(\mathcal{G}\left)\right)=inf\{\parallel y-t\parallel :t\in F(\mathcal{G}\left)\right\}$.

Definition 4

([29]). Let $\mathcal{S}$ be a non-empty subset of a Banach space $\mathcal{B}$. The two sequences $\left\{{\tau }_n\right\}$ and $\left\{t_n\right\}$ in $\mathcal{S}$ are said be equivalent when:

$$\underset{n\to \infty }{lim}\parallel {\tau }_n-t{}_n\parallel =0.$$

Definition 5

([30]). Let $\mathcal{S}$ be a non-empty subset of a Banach space $\mathcal{B}$, let $\mathcal{G}:\mathcal{S}\to \mathcal{S}$ be a mapping with at least one fixed point, i.e., t, and let $\left\{{\tau }_n\right\}$ be a sequence defined by:

$$\left\{\begin{array}{c}{\tau }_0\in \mathcal{S},\hfill \\ {\tau }_{n+1}=h(\mathcal{G},{\tau }_n),n\in {\mathbb{Z}}^{+},\hfill \end{array}\right.$$

where h is a function of $\mathcal{G}$ and ${\tau }_n$. Assume that the sequence $\left\{{\tau }_n\right\}$ converges to a fixed point of $\mathcal{G}$ and $\left\{t_n\right\}$ is an equivalent sequence of $\left\{{\tau }_n\right\}$ in $\mathcal{S}$. When:

$$\underset{n\to \infty }{lim}\parallel t_{n+1}-h(\mathcal{G},t_n)\parallel =0\Rightarrow \underset{n\to \infty }{lim}{t}_n=t,$$

then the iterative sequence $\left\{{\tau }_n\right\}$ is called weakly $w^2$-stable with respect to $\mathcal{G}$.

Definition 6.

Let $\mathcal{S}$ be a non-empty, closed and convex subset of $\mathcal{B}$. Let $\left\{{\tau }_n\right\}$ be a bounded sequence in $\mathcal{B}$ and for $x\in \mathcal{S}$:

$$r(x,\left\{{\tau }_n\right\})=\underset{n\to \infty }{lim}sup\parallel {\tau }_n-x\parallel .$$

The asymptotic radius and asymptotic center of $\left\{{\tau }_n\right\}$ relative to $\mathcal{S}$ are defined, respectively, by:

$$r(\mathcal{S},\left\{{\tau }_n\right\})=inf\{r(x,\left\{{\tau }_n\right\}):x\in \mathcal{S}\}.$$

$$A(\mathcal{S},\left\{{\tau }_n\right\})=\{x\in \mathcal{S}:r(x,\left\{{\tau }_n\right\})=r(\mathcal{S},\left\{{\tau }_n\right\})\}.$$

When $\mathcal{B}$ is a uniformly convex Banach space, then the set $A(\mathcal{S},\left\{{\tau }_n\right\})$ is a singleton.

Lemma 2

([31]). Assume $\mathcal{B}$ is a uniformly convex Banach space and $0<a\le s_n\le b<1$, $\forall n\ge 1$. Let $\left\{{\tau }_n\right\}$ and $\left\{{\sigma }_n\right\}$ be two sequences in $\mathcal{B}$ that satisfy $\underset{n\to \infty }{lim}sup\parallel {\tau }_n\parallel \le w$, $\underset{n\to \infty }{lim}sup\parallel {\sigma }_n\parallel \le w$ and $\underset{n\to \infty }{lim}\parallel s_n{\tau }_n+(1-s_n){\sigma }_n\parallel =w$ holds for $w\ge 0$. Then, $\underset{n\to \infty }{lim}\parallel {\tau }_n-{\sigma }_n\parallel =0$.

Lemma 3

([7]). Let $\mathcal{S}$ be a non-empty, closed and convex subset of a uniformly convex Banach space $\mathcal{B}$ that satisfies Opial’s property. Let $\mathcal{G}:\mathcal{S}\to \mathcal{B}$ be an operator that satisfies condition $\left(E\right)$. When the sequence $\left\{{\tau }_n\right\}$ converges weakly to t and $\underset{n\to \infty }{lim}\parallel {\tau }_n-\mathcal{G}{\tau }_n\parallel =0$, then $t\in F\left(\mathcal{G}\right)$.

3. Weak ${\mathit{w}}^{\mathbf{2}}$-Stability of the JF Iterative Algorithm

The purpose of this section is to prove the convergence and stability results for the JF iterative algorithm with respect to almost contractions in an arbitrary Banach space. The following theorem shows the convergence and stability of the iterative algorithm (4) for almost contractions.

Theorem 2.

Let $\mathcal{S}$ be a non-empty, closed and convex subset of a Banach space $\mathcal{B}$ and let $\mathcal{G}:\mathcal{S}\to \mathcal{S}$ be an almost contraction that satisfies inequality (2). Then, the sequence $\left\{{\tau }_n\right\}$ defined by the iterative algorithm (4) converges to a unique fixed point of $\mathcal{G}$. Moreover, the iterative sequence $\left\{{\tau }_n\right\}$ is weakly $w^2$-stable with respect to the almost contraction.

Proof. 

Since $\mathcal{G}$ is an almost contraction that satisfies inequality (2), a constant $\beta \in [0,1)$ exists in such a way that for all $x\in \mathcal{S}$ and $t\in F\left(\mathcal{G}\right)=\{t\in \mathcal{S}:\mathcal{G}t=t\}$:

$$\parallel \mathcal{G}x-\mathcal{G}t\parallel =\parallel \mathcal{G}x-t\parallel \le \beta \parallel x-t\parallel .$$

Using iterative algorithm (4), we obtain:

$$\begin{array}{ccc}\hfill \parallel {\xi }_n-t\parallel & =& \parallel \mathcal{G}((1-{\theta }_n){\tau }_n+{\theta }_n\mathcal{G}{\tau }_n)-t\parallel \hfill \\ \hfill & \le & \beta \parallel (1-{\theta }_n){\tau }_n+{\theta }_n\mathcal{G}{\tau }_n-t\parallel \hfill \\ \hfill & \le & \beta ((1-{\theta }_n)\parallel {\tau }_n-t\parallel +{\theta }_n\parallel \mathcal{G}{\tau }_n-t\parallel )\hfill \\ \hfill & \le & \beta ((1-{\theta }_n)\parallel {\tau }_n-t\parallel +\beta {\theta }_n\parallel {\tau }_n-t\parallel )\hfill \\ \hfill & =& \beta (1-(1-\beta ){\theta }_n)\parallel {\tau }_n-t\parallel .\hfill \end{array}$$

Since $0\le \beta <1$ and ${\theta }_n\in (0,1)$ and using the fact that $0<(1-(1-\beta ){\theta }_n)\le 1$, we obtain:

$$\parallel {\xi }_n-t\parallel \le \beta \parallel {\tau }_n-t\parallel .$$

(5)

Using Equation (5), we obtain:

$$\begin{array}{ccc}\hfill \parallel {\sigma }_n-t\parallel & =& \parallel \mathcal{G}{\xi }_n-t\parallel \hfill \\ \hfill & \le & \beta \parallel {\xi }_n-t\parallel \hfill \\ & \le & {\beta }^2\parallel {\tau }_n-t\parallel .\hfill \end{array}$$

(6)

Using Equation (6), we obtain:

$$\begin{array}{ccc}\hfill \parallel {\tau }_{n+1}-t\parallel & =& \parallel \mathcal{G}((1-{\mu }_n){\sigma }_n+{\mu }_n\mathcal{G}{\sigma }_n)-t\parallel \hfill \\ \hfill & \le & \beta \parallel (1-{\mu }_n){\sigma }_n+{\mu }_n\mathcal{G}{\sigma }_n-t\parallel \hfill \\ \hfill & \le & \beta ((1-{\mu }_n)\parallel {\sigma }_n-t\parallel +{\mu }_n\parallel \mathcal{G}{\sigma }_n-t\parallel )\hfill \\ \hfill & \le & \beta ((1-{\mu }_n)\parallel {\sigma }_n-t\parallel +\beta {\mu }_n\parallel {\sigma }_n-t\parallel )\hfill \\ \hfill & \le & \beta (1-(1-\beta ){\mu }_n)\parallel {\sigma }_n-t\parallel \hfill \\ & \le & {\beta }^3\parallel {\tau }_n-t\parallel .\hfill \end{array}$$

(7)

Inductively, we then obtain:

$$\parallel {\tau }_{n+1}-t\parallel \le {\beta }^{3(n+1)}\parallel {\tau }_0-t\parallel .$$

(8)

Since $0\le \beta <1$, it can be concluded that $\left\{{\tau }_n\right\}$ converges to t.

Now, we aim to prove the stability of the iterative algorithm (4). Let $\left\{t_n\right\}$ be an equivalent sequence of $\left\{{\tau }_n\right\}$ in $\mathcal{S}$, let the sequence that is defined by the iterative algorithm (4) be ${\tau }_{n+1}=h(\mathcal{G},{\tau }_n)$ and assume ${ϵ}_n=\parallel t_{n+1}-h(\mathcal{G},t_n)\parallel ,n\in {\mathbb{Z}}^{+}$. Now, we can show that $\underset{n\to \infty }{lim}{ϵ}_n=0\Rightarrow \underset{n\to \infty }{lim}{t}_n=t$.

Let $\underset{n\to \infty }{lim}{ϵ}_n=0$. Then, using the iterative algorithm (4), we obtain:

$$\begin{array}{ccc}\hfill \parallel t_{n+1}-t\parallel & \le & \parallel t_{n+1}-h(\mathcal{G},t_n)\parallel +\parallel h(\mathcal{G},t_n)-t\parallel \hfill \\ \hfill & =& {ϵ}_n+\parallel h(\mathcal{G},t_n)-t\parallel \hfill \\ \hfill & \le & {ϵ}_n+{\beta }^3(1-(1-\beta ){\mu }_n)\parallel t_n-t\parallel .\hfill \end{array}$$

By defining $u_n=\parallel t_n-t\parallel$ and $v_n=(1-\beta ){\mu }_n\in (0,1)$, then:

$$u_{n+1}\le {\beta }^3(1-v_n)u_n+{ϵ}_n.$$

Since $\underset{n\to \infty }{lim}{ϵ}_n=0$, then $\frac{{ϵ}_n}{v_n}\to 0$ as $n\to \infty$. Thus, according to Lemma 1, $\underset{n\to \infty }{lim}{u}_n=0$, i.e., $\underset{n\to \infty }{lim}{t}_n=t$. Thus, the iterative sequence that is defined by the algorithm (4) is weakly $w^2$-stable with respect to the almost contraction. □

4. Convergence Results for the Non-linear Operator (E)

The purpose of this section is to prove convergence results for the operator that satisfies condition $\left(E\right)$ in uniformly convex Banach spaces. First, we aim to prove the following fruitful lemmas that helped us to obtain the these results. Throughout this section, it is assumed that $\mathcal{S}$ is a non-empty, closed and convex subset of a uniformly convex Banach space $\mathcal{B}$, $\mathcal{G}:\mathcal{S}\to \mathcal{S}$ is an operator that satisfies condition $\left(E\right)$ and $F\left(\mathcal{G}\right)=\{t\in \mathcal{S}:\mathcal{G}t=t\}$.

Lemma 4.

Assume that $F\left(\mathcal{G}\right)\ne \varnothing$ and let $\left\{{\tau }_n\right\}$ be a sequence that is developed by the iterative algorithm (4), then $\underset{n\to \infty }{lim}\parallel {\tau }_n-t\parallel$ exists for all $t\in F\left(\mathcal{G}\right)$.

Proof. 

As the operator $\mathcal{G}$ satisfies condition $\left(E\right)$ and $F\left(\mathcal{G}\right)\ne \varnothing$, for $t\in F\left(\mathcal{G}\right)$, we obtain:

$$\begin{array}{ccc}\hfill \parallel \mathcal{G}{\tau }_n-t\parallel & \le & \parallel {\tau }_n-t\parallel ,\hfill \end{array}$$

for all ${\tau }_n\in \mathcal{S}$. Using the iterative algorithm (4), we obtain:

$$\begin{array}{ccc}\hfill \parallel {\xi }_n-t\parallel & =& \parallel \mathcal{G}((1-{\theta }_n){\tau }_n+{\theta }_n\mathcal{G}{\tau }_n)-t\parallel \hfill \\ \hfill & \le & \parallel (1-{\theta }_n){\tau }_n+{\theta }_n\mathcal{G}{\tau }_n-t\parallel \hfill \\ \hfill & \le & (1-{\theta }_n)\parallel {\tau }_n-t\parallel +{\theta }_n\parallel \mathcal{G}{\tau }_n-t\parallel \hfill \\ \hfill & \le & (1-{\theta }_n)\parallel {\tau }_n-t\parallel +{\theta }_n\parallel {\tau }_n-t\parallel \hfill \\ & \le & \parallel {\tau }_n-t\parallel .\hfill \end{array}$$

(9)

Using Equation (9), we obtain:

$$\begin{array}{ccc}\hfill \parallel {\sigma }_n-t\parallel & =& \parallel \mathcal{G}{\xi }_n-t\parallel \hfill \\ \hfill & \le & \parallel {\xi }_n-t\parallel \hfill \\ & \le & \parallel {\tau }_n-t\parallel .\hfill \end{array}$$

(10)

Using Equation (10), we obtain:

$$\begin{array}{ccc}\hfill \parallel {\tau }_{n+1}-t\parallel & =& \parallel \mathcal{G}((1-{\mu }_n){\sigma }_n+{\mu }_n\mathcal{G}{\sigma }_n)-t\parallel \hfill \\ \hfill & \le & \parallel (1-{\mu }_n){\sigma }_n+{\mu }_n\mathcal{G}{\sigma }_n-t\parallel \hfill \\ \hfill & \le & (1-{\mu }_n)\parallel {\sigma }_n-t\parallel +{\mu }_n\parallel \mathcal{G}{\sigma }_n-t\parallel \hfill \\ \hfill & \le & (1-{\mu }_n)\parallel {\sigma }_n-t\parallel +{\mu }_n\parallel {\sigma }_n-t\parallel \hfill \\ \hfill & \le & (1-{\mu }_n)\parallel {\tau }_n-t\parallel +{\mu }_n\parallel {\tau }_n-t\parallel \hfill \\ & =& \parallel {\tau }_n-t\parallel .\hfill \end{array}$$

(11)

This shows that the sequence $\{\parallel {\tau }_n-t\parallel \}$ is non-increasing and bounded below $\forall t\in F\left(\mathcal{G}\right)$. Thus, $\underset{n\to \infty }{lim}\parallel {\tau }_n-t\parallel$ exists. □

Lemma 5.

Let $\left\{{\tau }_n\right\}$ be a sequence that is developed by the iterative algorithm (4). Then, $F\left(\mathcal{G}\right)\ne \varnothing$ when, and only when, $\left\{{\tau }_n\right\}$ is bounded and $\underset{n\to \infty }{lim}\parallel {\tau }_n-\mathcal{G}{\tau }_n\parallel =0$.

Proof. 

Presume that $F\left(\mathcal{G}\right)\ne \varnothing$ and $t\in F\left(\mathcal{G}\right)$. Then, $\underset{n\to \infty }{lim}\parallel {\tau }_n-t\parallel$ exists according to Lemma 4 and $\left\{{\tau }_n\right\}$ is bounded. Presume that:

$$\underset{n\to \infty }{lim}\parallel {\tau }_n-t\parallel =\alpha .$$

(12)

From Equations (9), (10) and (12), we obtain:

$$\begin{array}{c}\hfill \underset{n\to \infty }{lim}sup\parallel {\xi }_n-t\parallel \le \underset{n\to \infty }{lim}sup\parallel {\tau }_n-t\parallel \le \alpha .\end{array}$$

(13)

$$\begin{array}{c}\hfill \underset{n\to \infty }{lim}sup\parallel {\sigma }_n-t\parallel \le \underset{n\to \infty }{lim}sup\parallel {\tau }_n-t\parallel \le \alpha .\end{array}$$

(14)

Since $\mathcal{G}$ satisfies condition $\left(E\right)$, we obtain:

$$\parallel \mathcal{G}{\tau }_n-t\parallel \le \parallel {\tau }_n-t\parallel$$

$$\begin{array}{ccc}\iff \underset{n\to \infty }{lim}sup\parallel \mathcal{G}{\tau }_n-t\parallel \hfill & \le & \underset{n\to \infty }{lim}sup\parallel {\tau }_n-t\parallel \le \alpha .\end{array}$$

(15)

Now:

$$\begin{array}{ccc}\hfill \parallel {\tau }_{n+1}-t\parallel & =& \parallel \mathcal{G}((1-{\mu }_n){\sigma }_n+{\mu }_n\mathcal{G}{\sigma }_n)-t\parallel \hfill \\ \hfill & \le & \parallel (1-{\mu }_n){\sigma }_n+{\mu }_n\mathcal{G}{\sigma }_n-t\parallel \hfill \\ \hfill & \le & (1-{\mu }_n)\parallel {\sigma }_n-t\parallel +{\mu }_n\parallel \mathcal{G}{\sigma }_n-t\parallel \hfill \\ \hfill & \le & (1-{\mu }_n)\parallel {\sigma }_n-t\parallel +{\mu }_n\parallel {\sigma }_n-t\parallel \hfill \\ \hfill & =& \parallel {\sigma }_n-t\parallel .\hfill \end{array}$$

Taking $\underset{n\to \infty }{lim}$ on both sides, we obtain:

$$\begin{array}{ccc}\hfill \alpha & =& \underset{n\to \infty }{lim}inf\parallel {\tau }_{n+1}-t\parallel \le \underset{n\to \infty }{lim}inf\parallel {\sigma }_n-t\parallel .\hfill \end{array}$$

(16)

So, it follows from (14) and (16) that:

$$\begin{array}{ccc}\hfill \alpha \le \underset{n\to \infty }{lim}inf\parallel {\sigma }_n-t\parallel & \le & \underset{n\to \infty }{lim}sup\parallel {\sigma }_n-t\parallel \le \alpha \hfill \\ \hfill \iff \underset{n\to \infty }{lim}\parallel {\sigma }_n-t\parallel & =& \alpha .\hfill \end{array}$$

(17)

Additionally:

$$\begin{array}{ccc}\hfill \parallel {\sigma }_n-t\parallel & =& \parallel \mathcal{G}{\xi }_n-t\parallel \hfill \\ \hfill & \le & \parallel {\xi }_n-t\parallel .\hfill \end{array}$$

Taking $\underset{n\to \infty }{lim}$ on both sides, we obtain:

$$\begin{array}{ccc}\hfill \alpha & =& \underset{n\to \infty }{lim}inf\parallel {\sigma }_n-t\parallel \le \underset{n\to \infty }{lim}inf\parallel {\xi }_n-t\parallel .\hfill \end{array}$$

(18)

So, it follows from (13) and (18) that:

$$\begin{array}{ccc}\hfill \alpha \le \underset{n\to \infty }{lim}inf\parallel {\xi }_n-t\parallel & \le & \underset{n\to \infty }{lim}sup\parallel {\xi }_n-t\parallel \le \alpha \hfill \\ \hfill \iff \underset{n\to \infty }{lim}\parallel {\xi }_n-t\parallel & =& \alpha .\hfill \end{array}$$

(19)

Thus:

$$\begin{array}{ccc}\hfill \alpha & =& \underset{n\to \infty }{lim}\parallel {\xi }_n-t\parallel =\underset{n\to \infty }{lim}\parallel \mathcal{G}((1-{\theta }_n){\tau }_n+{\theta }_n\mathcal{G}{\tau }_n)-t\parallel \hfill \\ \hfill & \le & \underset{n\to \infty }{lim}\parallel (1-{\theta }_n){\tau }_n+{\theta }_n\mathcal{G}{\tau }_n-t\parallel \hfill \\ \hfill & =& \underset{n\to \infty }{lim}\parallel (1-{\theta }_n)({\tau }_n-t)+{\theta }_n(\mathcal{G}{\tau }_n-t)\parallel \hfill \\ \hfill & \le & \underset{n\to \infty }{lim}((1-{\theta }_n)\parallel {\tau }_n-t\parallel +{\theta }_n\parallel \mathcal{G}{\tau }_n-t\parallel )\hfill \\ \hfill & \le & \underset{n\to \infty }{lim}((1-{\theta }_n)\parallel {\tau }_n-t\parallel +{\theta }_n\parallel {\tau }_n-t\parallel )\hfill \\ \hfill & \le & \alpha .\hfill \end{array}$$

Hence:

$$\underset{n\to \infty }{lim}\parallel (1-{\theta }_n)({\tau }_n-t)+{\theta }_n(\mathcal{G}{\tau }_n-t)\parallel =\alpha .$$

(20)

From (13), (15) and (20) and using Lemma 2, we obtain:

$$\underset{n\to \infty }{lim}\parallel {\tau }_n-\mathcal{G}{\tau }_n\parallel =0.$$

Conversely, assume that $\left\{{\tau }_n\right\}$ is bounded and $\underset{n\to \infty }{lim}\parallel {\tau }_n-\mathcal{G}{\tau }_n\parallel =0$. Let $t\in A(\mathcal{S},\left\{{\tau }_n\right\})$, then we obtain:

$$\begin{array}{ccc}\hfill r(\mathcal{G}t,\left\{{\tau }_n\right\})& =& \underset{n\to \infty }{lim}sup\parallel {\tau }_n-\mathcal{G}t\parallel \hfill \\ \hfill & \le & \underset{n\to \infty }{lim}sup(\parallel {\tau }_n-t\parallel +\mu \parallel \mathcal{G}{\tau }_n-{\tau }_n\parallel )\hfill \\ \hfill & =& \underset{n\to \infty }{lim}sup\parallel {\tau }_n-t\parallel \hfill \\ \hfill & =& r(t,\left\{{\tau }_n\right\})=r(\mathcal{S},\left\{{\tau }_n\right\}).\hfill \end{array}$$

This implies that $\mathcal{G}t\in A(\mathcal{S},\left\{{\tau }_n\right\})$. Since $\mathcal{B}$ is uniformly convex, $A(\mathcal{S},\left\{{\tau }_n\right\})$ is a singleton, which implies that $\mathcal{G}t=t$. □

Now, we aim to prove the following weak convergence theorem for the operators that satisfy condition $\left(E\right)$ using the iterative algorithm (4).

Theorem 3.

Presume that $F\left(\mathcal{G}\right)\ne \varnothing$ and $\mathcal{B}$ satisfies Opial’s property, then the sequence $\left\{{\tau }_n\right\}$ that is defined by the iterative algorithm (4) converges weakly to a fixed point of the operator $\mathcal{G}$.

Proof. 

In Lemma 4, we demonstrated that $\underset{n\to \infty }{lim}\parallel {\tau }_n-t\parallel$ exists. Now, we have to show that $\left\{{\tau }_n\right\}$ has a unique weak subsequential limit in $F\left(\mathcal{G}\right)$. Let t and q be two weak limits of $\left\{{\tau }_{n_j}\right\}$ and $\left\{{\tau }_{n_k}\right\}$, respectively, where $\left\{{\tau }_{n_j}\right\}$ and $\left\{{\tau }_{n_k}\right\}$ are subsequences of $\left\{{\tau }_n\right\}$. According to Lemma 5, $\underset{n\to \infty }{lim}\parallel {\tau }_n-\mathcal{G}{\tau }_n\parallel =0$ and therefore, using Lemma 3, $t\in F\left(\mathcal{G}\right)$ and similarly, $q\in F\left(\mathcal{G}\right)$.

Now, our aim is to show that $t=q$. When $t\ne q$, then using Opial’s property, we obtain:

$$\begin{array}{ccc}\hfill \underset{n\to \infty }{lim}\parallel {\tau }_n-t\parallel & =& \underset{j\to \infty }{lim}\parallel {\tau }_{n_j}-t\parallel \hfill \\ \hfill & <& \underset{j\to \infty }{lim}\parallel {\tau }_{n_j}-q\parallel \hfill \\ \hfill & =& \underset{n\to \infty }{lim}\parallel {\tau }_n-q\parallel \hfill \\ \hfill & =& \underset{k\to \infty }{lim}\parallel {\tau }_{n_k}-q\parallel \hfill \\ \hfill & <& \underset{k\to \infty }{lim}\parallel {\tau }_{n_k}-t\parallel \hfill \\ \hfill & =& \underset{n\to \infty }{lim}\parallel {\tau }_n-t\parallel .\hfill \end{array}$$

which is not possible and hence, $t=q$. It can be deduced that $\left\{{\tau }_n\right\}$ converges weakly to $t\in F\left(\mathcal{G}\right)$. □

Theorem 4.

The sequence $\left\{{\tau }_n\right\}$ that is defined by the iterative algorithm (4) converges strongly to $t\in F\left(\mathcal{G}\right)$ when, and only when, $\underset{n\to \infty }{lim}infd({\tau }_n,F\left(\mathcal{G}\right))=0$, where $d({\tau }_n,F\left(\mathcal{G}\right))=inf\{\parallel {\tau }_n-t\parallel :t\in F\left(\mathcal{G}\right)\}$.

Proof. 

The first part is trivial. Now, we aim to prove the converse part. Presume that $\underset{n\to \infty }{lim}infd({\tau }_n,F\left(\mathcal{G}\right))=0$. According to Lemma 4, $\underset{n\to \infty }{lim}\parallel {\tau }_n-t\parallel$ exists for all $t\in F\left(\mathcal{G}\right)$; therefore, it can be hypothesized that $\underset{n\to \infty }{lim}d({\tau }_n,F\left(\mathcal{G}\right))=0$.

Now, our claim is that $\left\{{\tau }_n\right\}$ is a Cauchy sequence in $\mathcal{S}$. Since $\underset{n\to \infty }{lim}d({\tau }_n,F\left(\mathcal{G}\right))=0$ for a given $\eta >0$, $M\in \mathbb{N}$ exists in such a way that for all $n\ge M$:

$$\begin{array}{ccc}\hfill d({\tau }_n,F\left(\mathcal{G}\right))& <& \frac{\eta }{2}\hfill \\ \hfill \Rightarrow inf\{\parallel {\tau }_n-t\parallel :t\in F\left(\mathcal{G}\right)\}& <& \frac{\eta }{2}.\hfill \end{array}$$

In particular, $inf\{\parallel {\tau }_M-t\parallel :t\in F\left(\mathcal{G}\right)\}<\frac{\eta }{2}$. Therefore, $t\in F\left(\mathcal{G}\right)$ exists in such a way that:

$$\parallel {\tau }_M-t\parallel <\frac{\eta }{2}.$$

Now, for $m,n\ge M$:

$$\begin{array}{ccc}\hfill \parallel {\tau }_{n+m}-{\tau }_n\parallel & \le & \parallel {\tau }_{n+m}-t\parallel +\parallel {\tau }_n-t\parallel \hfill \\ \hfill & \le & \parallel {\tau }_M-t\parallel +\parallel {\tau }_M-t\parallel \hfill \\ \hfill & =& 2\parallel {\tau }_M-t\parallel <\eta .\hfill \end{array}$$

This implies that $\left\{{\tau }_n\right\}$ is a Cauchy sequence in $\mathcal{S}$, so there is an element $\ell \in \mathcal{S}$ such that $\underset{n\to \infty }{lim}{\tau }_n=\ell$. Since $\underset{n\to \infty }{lim}d({\tau }_n,F\left(\mathcal{G}\right))=0$, it follows that $d(\ell ,F(\mathcal{G}\left)\right)=0$ and thus, we obtain $\ell \in F\left(\mathcal{G}\right)$. □

We now aim to prove the following strong convergence result by applying condition $\left(I\right)$.

Theorem 5.

Assume that $F\left(\mathcal{G}\right)\ne \varnothing$ and the operator $\mathcal{G}$ satisfies condition $\left(I\right)$. Then, the sequence $\left\{{\tau }_n\right\}$ that is defined by the iterative algorithm (4) converges strongly to a fixed point of $\mathcal{G}$.

Proof. 

We demonstrated in Lemma 5 that:

$$\underset{n\to \infty }{lim}\parallel {\tau }_n-\mathcal{G}{\tau }_n\parallel =0.$$

(21)

By applying condition $\left(I\right)$ and Equation (21), we obtain:

$$\begin{array}{ccc}\hfill 0\le \underset{n\to \infty }{lim}\psi \left(d({\tau }_n,F\left(\mathcal{G}\right))\right)& \le & \underset{n\to \infty }{lim}\parallel {\tau }_n-\mathcal{G}{\tau }_n\parallel =0\hfill \\ \hfill \Rightarrow \underset{n\to \infty }{lim}\psi \left(d({\tau }_n,F\left(\mathcal{G}\right))\right)& =& 0.\hfill \end{array}$$

It then follows that:

$$\underset{n\to \infty }{lim}\left(d({\tau }_n,F\left(\mathcal{G}\right))\right)=0.$$

Hence, using Theorem 4, the sequence $\left\{{\tau }_n\right\}$ converges strongly to a fixed point of $\mathcal{G}$. □

Now, we present the following example to support Theorem 5.

Example 2.

Let $\mathcal{B}=\mathbb{R}$ be a Banach space with respect to the usual norm and $\mathcal{S}=[-2,\infty )$ be a non-empty, closed and convex subset of $\mathcal{B}$. Let $\mathcal{G}:\mathcal{S}\to \mathcal{S}$ be an operator that is defined by:

$$\mathcal{G}\left(x\right)=\left\{\begin{array}{c}\frac{x}{4},ifx\in [-2,\frac{1}{2}],\hfill \\ \frac{x}{5},ifx\in (\frac{1}{2},\infty ).\hfill \end{array}\right.$$

Since $\mathcal{G}$ is discontinuous at $x=\frac{1}{2}$ and we know that every non-expansive mapping is continuous, it follows that $\mathcal{G}$ is not a non-expansive mapping. Now, we verify that $\mathcal{G}$ satisfies condition $\left(E\right)$. For this, the following cases arise:

Case-I. When $x,y\in [-2,\frac{1}{2}]$, then we obtain:

$$\begin{array}{ccc}\hfill \parallel x-\mathcal{G}y\parallel & =& \parallel x-\frac{y}{4}\parallel \hfill \\ \hfill & =& \parallel x-\frac{x}{4}+\frac{x}{4}-\frac{y}{4}\parallel \hfill \\ \hfill & \le & \parallel x-\frac{x}{4}\parallel +\frac{1}{4}\parallel x-y\parallel \hfill \\ \hfill & \le & \frac{16}{15}\parallel x-\mathcal{G}x\parallel +\parallel x-y\parallel .\hfill \end{array}$$

Case-II. When $x,y\in (\frac{1}{2},\infty )$, then we obtain:

$$\begin{array}{ccc}\hfill \parallel x-\mathcal{G}y\parallel & =& \parallel x-\frac{y}{5}\parallel \hfill \\ \hfill & =& \parallel x-\frac{x}{5}+\frac{x}{5}-\frac{y}{5}\parallel \hfill \\ \hfill & \le & \parallel x-\frac{x}{5}\parallel +\frac{1}{5}\parallel x-y\parallel \hfill \\ \hfill & \le & \frac{16}{15}\parallel x-\mathcal{G}x\parallel +\parallel x-y\parallel .\hfill \end{array}$$

Case-III. When $x\in [-2,\frac{1}{2}]$ and $y\in (\frac{1}{2},\infty )$, then we obtain:

$$\begin{array}{ccc}\hfill \parallel x-\mathcal{G}y\parallel & =& \parallel x-\frac{y}{5}\parallel \hfill \\ \hfill & =& \parallel x-\frac{x}{5}+\frac{x}{5}-\frac{y}{5}\parallel \hfill \\ \hfill & \le & \parallel x-\frac{x}{5}\parallel +\frac{1}{5}\parallel x-y\parallel \hfill \\ \hfill & \le & \parallel x-\frac{x}{4}+\frac{x}{4}-\frac{x}{5}\parallel +\parallel x-y\parallel \hfill \\ \hfill & =& \parallel \left(x-\frac{x}{4}\right)+\frac{1}{15}\left(x-\frac{x}{4}\right)\parallel +\parallel x-y\parallel \hfill \\ \hfill & =& \frac{16}{15}\parallel x-\frac{x}{4}\parallel +\parallel x-y\parallel \hfill \\ \hfill & =& \frac{16}{15}\parallel x-\mathcal{G}x\parallel +\parallel x-y\parallel .\hfill \end{array}$$

Case-IV. When $x\in (\frac{1}{2},\infty )$ and $y\in [-2,\frac{1}{2}]$, then we obtain:

$$\begin{array}{ccc}\hfill \parallel x-\mathcal{G}y\parallel & =& \parallel x-\frac{y}{4}\parallel \hfill \\ \hfill & =& \parallel x-\frac{x}{4}+\frac{x}{4}-\frac{y}{4}\parallel \hfill \\ \hfill & \le & \parallel x-\frac{x}{4}\parallel +\frac{1}{4}\parallel x-y\parallel \hfill \\ \hfill & \le & \parallel x-\frac{x}{5}+\frac{x}{5}-\frac{x}{4}\parallel +\parallel x-y\parallel \hfill \\ \hfill & =& \parallel \left(x-\frac{x}{5}\right)-\frac{1}{16}\left(x-\frac{x}{5}\right)\parallel +\parallel x-y\parallel \hfill \\ \hfill & =& \frac{15}{16}\parallel x-\frac{x}{5}\parallel +\parallel x-y\parallel \hfill \\ \hfill & \le & \frac{16}{15}\parallel x-\mathcal{G}x\parallel +\parallel x-y\parallel .\hfill \end{array}$$

Hence, for all of the above cases, $\mathcal{G}$ satisfies condition $\left(E\right)$ with $\mu =\frac{16}{15}$ and $\mathcal{G}$ has a fixed point $t=0$. Thus, $F\left(\mathcal{G}\right)=\left\{0\right\}\ne \varnothing$. Now, we consider a function $\psi \left(x\right)=\frac{x}{3}$, where $x\in (0,\infty )$, which is non-decreasing and satisfies $\psi \left(0\right)=0$ and $\psi \left(x\right)>0$ for all $x\in (0,\infty )$. Now:

$$\begin{array}{ccc}\hfill d(x,F(\mathcal{G}\left)\right)& =& \underset{t\in F\left(\mathcal{G}\right)}{inf}\parallel x-t\parallel \hfill \\ \hfill & =& inf\parallel x-0\parallel \hfill \\ \hfill & =& inf\parallel x\parallel \hfill \\ \hfill & =& \left\{\begin{array}{c}0,ifx\in [-2,\frac{1}{2}],\hfill \\ \frac{1}{2},ifx\in (\frac{1}{2},\infty ).\hfill \end{array}\right.\hfill \\ \hfill \Rightarrow \psi \left(d(x,F(\mathcal{G}\left)\right)\right)& =& \left\{\begin{array}{c}0,ifx\in [-2,\frac{1}{2}],\hfill \\ \frac{1}{6},ifx\in (\frac{1}{2},\infty ).\hfill \end{array}\right.\hfill \end{array}$$

Now, we have the following cases:

Case-I. When $x\in [-2,\frac{1}{2}]$, then we obtain:

$$\parallel x-\mathcal{G}x\parallel =\parallel x-\frac{x}{4}\parallel =\frac{3}{4}\parallel x\parallel \ge 0=\psi \left(d(x,F(\mathcal{G}\left)\right)\right).$$

Case-II. When $x\in (\frac{1}{2},\infty )$, then we obtain:

$$\parallel x-\mathcal{G}x\parallel =\parallel x-\frac{x}{5}\parallel =\frac{4}{5}\parallel x\parallel \ge \frac{1}{6}=\psi \left(d(x,F(\mathcal{G}\left)\right)\right).$$

Hence, from both the cases, we obtain:

$$\parallel x-\mathcal{G}x\parallel \ge \psi \left(d(x,F(\mathcal{G}\left)\right)\right).$$

Thus, the operator $\mathcal{G}$ satisfies condition $\left(I\right)$. Now, all of the assumptions of Theorem 5 are satisfied. Hence, using Theorem 5, the sequence that is defined by the JF iterative algorithm converges strongly to the fixed point $t=0$ of $\mathcal{G}$.

Now, we extend the following example to compare the rate of convergence of the JF iterative algorithm to some other well-known iterative algorithms for operators that satisfy condition $\left(E\right)$.

Example 3.

Let $\mathcal{B}=\mathbb{R}$ be a Banach space with respect to the usual norm and let $\mathcal{S}=[-1,1]$ be a subset of $\mathcal{B}$. Let $\mathcal{G}:\mathcal{S}\to \mathcal{S}$ be defined by:

$$\mathcal{G}\left(x\right)=\left\{\begin{array}{c}-x,ifx\in [0,\frac{3}{4})\bigcup (\frac{3}{4},1],\hfill \\ \frac{1}{2}sinx,ifx\in [-1,0),\hfill \\ 0,ifx=\frac{3}{4}.\hfill \end{array}\right.$$

It can easily be seen that the operator $\mathcal{G}$ satisfies condition $\left(E\right)$ with $\mu =4$.

Now, we choose control sequences ${\mu }_n=0.22$, ${\theta }_n=0.65$ and ${\eta }_n=0.95$ for all $n\in {\mathbb{Z}}^{+}$ with the initial estimate of ${\tau }_0=0.5$ to numerically compare the rate of convergence of remarkable iterative algorithms.

Using MATLAB 2015a, we demonstrate that the proposed iterative algorithm (4) converges to the fixed point $t=0$ of the operator $\mathcal{G}$ faster than Mann, Ishikawa, S, Picard-S, Noor and SP iterative algorithms, which can easily be seen in

Table 1. A comparison of the rate of convergence of well-known iterative algorithms.

Iter.	Mann	Ishikawa	S	Picard-S	Noor	SP	JF
1	0.500000	0.500000	0.500000	0.500000	0.500000	0.500000	0.500000
2	0.280000	0.423000	–0.357000	0.357000	0.287150	0.110880	0.084000
⋮	⋮	⋮	⋮	⋮	⋮	⋮	⋮
9	0.004836	0.131200	0.033772	0.033772	0.005917	0.000003	0.000000
10	0.002708	0.110995	–0.024113	0.024113	0.003398	0.000001	0.000000
11	0.001517	0.093902	0.017217	0.017217	0.001951	0.000000	0.000000
⋮	⋮	⋮	⋮	⋮	⋮	⋮	⋮
25	0.000000	0.009034	0.000154	0.000154	0.000001	0.000000	0.000000
26	0.000000	0.007642	–0.000110	0.000110	0.000000	0.000000	0.000000
⋮	⋮	⋮	⋮	⋮	⋮	⋮	⋮
41	0.000000	0.000622	0.000001	0.000001	0.000000	0.000000	0.000000
42	0.000000	0.000526	–0.000001	0.000001	0.000000	0.000000	0.000000
43	0.000000	0.000445	0.000000	0.000000	0.000000	0.000000	0.000000
⋮	⋮	⋮	⋮	⋮	⋮	⋮	⋮
84	0.000000	0.000000	0.000000	0.000000	0.000000	0.000000	0.000000

and Figure 1.

5. Application

The purpose of this section is to estimate the solution of a mixed Volterra–Fredholm functional non-linear integral equation using the iterative algorithm (4).

We considered the following non-linear integral equation (see [32]):

$$x\left(z\right)=T\left(z,x\left(z\right),{\int }_{c_1}^{z_1}\dots {\int }_{c_n}^{z_n}K(z,s,x\left(s\right))ds,{\int }_{c_1}^{d_1}\dots {\int }_{c_n}^{d_n}H(z,s,x\left(s\right))ds\right),$$

(22)

where $[c_1,d_1]\times ...\times [c_n,d_n]$ is an interval in ${\mathbb{R}}^n$, $z=(z_1,z_2\dots z_n),s=(s_1,s_2,\dots s_n)\in [c_1,d_1]\times ...\times [c_n,d_n]$, $K,H:[c_1,d_1]\times ...\times [c_n,d_n]\times [c_1,d_1]\times ...\times [c_n,d_n]\times \mathbb{R}\to \mathbb{R}$ are continuous functions and $T:[c_1,d_1]\times ...\times [c_n,d_n]\times {\mathbb{R}}^3\to \mathbb{R}$.

Assume that the following prerequisites are satisfied:

$\left(D_1\right)K,H\in C([c_1,d_1]\times \dots \times [c_n,d_n]\times [c_1,d_1]\times \dots \times [c_n,d_n]\times \mathbb{R})$;

$\left(D_2\right)T\in C([c_1,d_1]\times \dots \times [c_n,d_n]\times {\mathbb{R}}^3)$;

$\left(D_3\right)$ constants $\alpha ,\beta ,\gamma \ge 0$ exist in such a way that:

$$|T(z,u_1,u_2,u_3)-T(z,v_1,v_2,v_3)|\le \alpha |u_1-v_1|+\beta |u_2-v_2|+\gamma |u_3-v_3|,$$

for all $z\in [c_1,d_1]\times ...\times [c_n,d_n]$, $u_i,v_i\in \mathbb{R},i=1,2,3$;

$\left(D_4\right)$ constants $L_K\ge 0$ and $L_H\ge 0$ exist in such a way that:

$$|K(z,s,u)-K(z,s,v)|\le L_K|u-v|,$$

$$|H(z,s,u)-H(z,s,v)|\le L_H|u-v|,$$

for all $z,s\in [c_1,d_1]\times ...\times [c_n,d_n],andu,v\in \mathbb{R}$;

$\left(D_5\right)\alpha +(\beta L_K+\gamma L_H)(d_1-c_1)...(d_n-c_n)<1$.

Using the solution to problem (22), we obtain a function $x_{*}\in C([c_1,d_1]\times \dots \times [c_n,d_n])$.

The following existence result for problem (22) was proved by Crăciun and Şerban [32].

Theorem 6.

Assume that prerequisites $\left(D_1\right)-\left(D_5\right)$ are satisfied. Then, problem (22) has a unique solution of $x_{*}\in C([c_1,d_1]\times ...\times [c_n,d_n])$.

We now demonstrate the main result of this section using the iterative algorithm (4).

Theorem 7.

Let $\mathcal{B}=C([c_1,d_1]\times ...\times [c_n,d_n],\parallel .\parallel )$ be a Banach space with Chebyshev’s norm. Let $\left\{{\tau }_n\right\}$ be a sequence that is defined by the iterative algorithm (4) for the operator $\mathcal{G}:\mathcal{B}\to \mathcal{B}$, which is defined as:

$$\mathcal{G}x\left(z\right)=T\left(z,x\left(z\right),{\int }_{c_1}^{z_1}...{\int }_{c_n}^{z_n}K(z,s,x\left(s\right))ds,{\int }_{c_1}^{d_1}...{\int }_{c_n}^{d_n}H(z,s,x\left(s\right))ds\right),$$

(23)

where T, K and H are defined as above. Assume that prerequisites $\left(D_1\right)-\left(D_5\right)$ are satisfied. Then, the iterative algorithm (4) converges to the unique solution, i.e., $x_{*}\in C([c_1,d_1]\times ...\times [c_n,d_n])$ of problem (22).

Proof. 

In Theorem 6, we saw that problem (22) has a unique solution, so let us assume that $x_{*}$ is the fixed point of $\mathcal{G}$. Now, we aim to show that the sequence $\left\{{\tau }_n\right\}$ that is defined by the JF iterative algorithm (4) converges to the solution of problem (22), i.e., $x_{*}$. First, we need to show that the operator $\mathcal{G}$ that is defined in (23) is an almost contraction.

Presume that the prerequisites $\left(D_1\right)-\left(D_4\right)$ are satisfied. Then:

$$\begin{array}{ccc}\hfill \parallel \mathcal{G}x-\mathcal{G}{x}_{*}\parallel & =& \parallel \mathcal{G}x-x_{*}\parallel =|\mathcal{G}x\left(z\right)-\mathcal{G}{x}_{*}\left(z\right)|\hfill \\ \hfill & =& |T\left(z,x\left(z\right),{\int }_{c_1}^{z_1}...{\int }_{c_n}^{z_n}K(z,s,x\left(s\right))ds,{\int }_{c_1}^{d_1}...{\int }_{c_n}^{d_n}H(z,s,x\left(s\right))ds\right)\hfill \\ \hfill & -& T\left(z,x_{*}\left(z\right),{\int }_{c_1}^{z_1}...{\int }_{c_n}^{z_n}K(z,s,x_{*}\left(s\right))ds,{\int }_{c_1}^{d_1}...{\int }_{c_n}^{d_n}H(z,s,x_{*}\left(s\right))ds\right)|\hfill \\ \hfill & \le & \alpha |x\left(z\right)-x_{*}\left(z\right)|\hfill \\ \hfill & +& \beta |{\int }_{c_1}^{z_1}...{\int }_{c_n}^{z_n}K(z,s,x\left(s\right))ds-{\int }_{c_1}^{z_1}...{\int }_{c_n}^{z_n}K(z,s,x_{*}\left(s\right))ds|\hfill \\ \hfill & +& \gamma |{\int }_{c_1}^{d_1}...{\int }_{c_n}^{d_n}H(z,s,x\left(s\right))ds-{\int }_{c_1}^{d_1}...{\int }_{c_n}^{d_n}H(z,s,x_{*}\left(s\right))ds|\hfill \\ \hfill & \le & \alpha |x\left(z\right)-x_{*}\left(z\right)|\hfill \\ \hfill & +& \beta {\int }_{c_1}^{z_1}...{\int }_{c_n}^{z_n}|K(z,s,x\left(s\right))-K(z,s,x_{*}\left(s\right))|ds\hfill \\ \hfill & +& \gamma {\int }_{c_1}^{d_1}...{\int }_{c_n}^{d_n}|H(z,s,x\left(s\right))-H(z,s,x_{*}\left(s\right))|ds\hfill \\ \hfill & \le & \alpha |x\left(z\right)-x_{*}\left(z\right)|+\beta {\int }_{c_1}^{z_1}...{\int }_{c_n}^{z_n}{L}_K|x\left(s\right)-x_{*}\left(s\right)|ds\hfill \\ \hfill & +& \gamma {\int }_{c_1}^{d_1}...{\int }_{c_n}^{d_n}{L}_H|x\left(s\right)-x_{*}\left(s\right)|ds\hfill \\ \hfill & \le & \alpha \parallel x-x_{*}\parallel +\beta {\int }_{c_1}^{z_1}...{\int }_{c_n}^{z_n}{L}_K\parallel x-x_{*}\parallel ds\hfill \\ \hfill & +& \gamma {\int }_{c_1}^{d_1}...{\int }_{c_n}^{d_n}{L}_H\parallel x-x_{*}\parallel ds\hfill \\ \hfill & =& \alpha \parallel x-x_{*}\parallel +\beta L_K(z_1-c_1)...(z_n-c_n)\parallel x-x_{*}\parallel \hfill \\ \hfill & +& \gamma L_H(d_1-c_1)...(d_n-a_n)\parallel x-x_{*}\parallel .\hfill \end{array}$$

$$\Rightarrow \parallel \mathcal{G}x-\mathcal{G}{x}_{*}\parallel \le [\alpha +(\beta L_K+\gamma L_H)(d_1-c_1)...(d_n-c_n)]\parallel x-x_{*}\parallel .$$

(24)

By using condition $\left(D_5\right)$ and defining $\delta :=\alpha +(\beta L_K+\gamma L_H)(d_1-c_1)\dots (d_n-c_n)<1$, then for any $L\ge 0$ Equation (24) becomes:

$$\parallel \mathcal{G}x-\mathcal{G}{x}_{*}\parallel \le \delta \parallel x-x_{*}\parallel +L\parallel x-\mathcal{G}x\parallel .$$

This shows that $\mathcal{G}$ is an almost contraction. Hence, using Theorem 2, the sequence $\left\{{\tau }_n\right\}$ that is defined by the JF iterative algorithm (4) converges to the solution of problem (22). This completes the proof. □

6. Conclusions

The purpose of this manuscript was to study a well-known and effective iterative algorithm to approximate the fixed points of non-linear operators that satisfy condition $\left(E\right)$ within the contest of Banach spaces. It is well known that the class of operators that satisfy condition $\left(E\right)$ includes the classes of mappings that satisfy Suzuki’s condition $\left(C\right)$, Hardy and Rogers mappings, generalized $\alpha$ non-expansive mappings, Reich–Suzuki generalized non-expansive mappings, etc. Therefore, the results of the present manuscript generalize and extend the relevant results in existing literature (see, for example, [8,9,18,20,23]). It is also shown here that the JF iterative algorithm is weakly $w^2$-stable with respect to almost contractions. The JF iterative algorithm can be successfully implemented to approximate the solutions of non-linear integral equations. Thus, the results of the current manuscript are very useful and interesting.