Abstract
This paper introduces a novel fast iterative process designed for approximating fixed points of contraction and weak contraction mappings. The study presents strong convergence results for this newly proposed iterative process, and proving its efficiency. Analytical and numerical evidences are provided to establish that the proposed iterative method converges more rapidly than several existing processes. Furthermore, stability results and dependence analysis are presented for the newly developed iterative process, enhancing its practical applicability and robustness.
Similar content being viewed by others
Introduction
Fixed point theory is a crucial concept in mathematics and various sciences. It involves expressing problems as equations involving operators and finding solutions by identifying the fixed points of these operators. This theory combines functional analysis, topological theory, and geometry to simplify real-world or theoretical problems into fixed-point problems. Fixed point theory is especially useful in determining whether or not solutions to differential and integral equations exist because these equations govern the behavior of a variety of real-world problems, and the presence of a solution is critical. A fixed point of a mapping is a value that remains unchanged when the mapping is applied to it. In other words, if F is a function, a fixed point x satisfies \(F(x) = x\).
Banach proved a fixed point theorem known as the contraction mapping principle in 19221, which guarantees the presence and uniqueness of a fixed point on a complete metric space. We assume that D is a nonempty subset of a Banach space X. Let F be a self-mapping on D. If there exists \(\mu \in [0,1)\) such that
F is called a contraction condition. Numerous articles have been published to enhance the fundamental principle above, leading to its generalization. The majority of these contributions have focused on generalizing the contraction condition within metric spaces. However, once the occurrence of a fixed point for a given mapping is established, determining that fixed point becomes a challenging task. Addressing this challenge effectively involves the utilization of iterative strategies. Therefore, the endeavor to approximate fixed points under diverse contraction conditions is of both theoretical and practical significance. Developing an iterative process with a high convergence rate is crucial for approximating solutions to nonlinear equations. Over the years, many researchers have dedicated their efforts to establishing iterative processes with accelerated convergence rates, specifically within real-valued metric and Banach spaces. We have listed below some one-step iterative processes, namely Picard2, Krasnoselskii3, and Mann4, respectively.
where \(\{a_n\}\) & \(\gamma\) are in (0, 1). Two-step iterative processes named Ishikawa5, S-iterative6, Picard Mann hybrid (PMH)7, and Picard Krasnoselskii hybrid (PKH)8 are detailed below.
where \(\{a_n\}\), \(\{b_n\}\) & \(\gamma\) are in (0, 1). In 2009, Agarwal et al.6 defined the S-iterative method, which approaches faster than Picard, Krasnoselskii, Mann, and Ishikawa iterative methods. In 2013, Khan7 defined the PMH iterative process and also proved that the iterative scheme which tends toward faster than all of the Picard, Mann, and Ishikawa processes in the sense of Berinde9 for contraction mapping. In8, authors proved that the PKH iterative process converges quicker than Picard, Mann, Krasnoselskii, and Ishikawa iterative methods. Next, we give the following three-step iterative process, namely the Picard-Ishikawa hybrid (PIH) whcih is defined in10.
where \(\{a_n\}\) & \(\{b_n\}\) are in (0, 1). In10, the author proved that his iterative method converges faster than widely recognized methods such as Picard, Mann, Ishikawa, Krasnoselskii, Picard Mann hybrid, and Picard Krasnoselskii hybrid iterations, as per the criteria outlined by Berinde9. Likewise, in11 Faik Gursoy et al. introduced the three-step iterative process named Picard-S hybrid (PSH) method that converges faster than the other iteration methods in the literature existing. In12, Julee Srivastava used the three-step iterative process namely Picard-S hybrid (PSH), establishing its quicker convergence compared to various other iterative methods like Picard, Mann, Krasnoselskii, Ishikawa, S-iterate, PMH, PKH, and PIH for contraction conditions on real-valued normed linear spaces, for \(\{x_n\}\) on real-valued normed linear space, and it is
where \(\{a_n\}\) & \(\{b_n\}\) are sequences of real numbers in (0, 1). Austine Efut Ofem et al. introduced the three steps \(A^{**}\) iteration method in13, which is a more efficient method for approximating the fixed points of almost contraction mappings and generalized \(\alpha\)-nonexpansive mappings. For another type of three steps iteration method, see14. The authors of15 provided the AH iterative scheme, a four-step iterative scheme for approximating fixed points of contractive-like mappings, and Reich-Suzuki-type nonexpansive mappings. For additional information regarding four-step iterative schemes, please refer to16,17.
Wasfi Shatanawi et al.18 introduced the four-step iterative process, namely \(SBT_n\), and proved numerically that the iterative process converges faster than Sintunavarat et al.19, Agarwal et al., Mann, and Ishikawa iterative processes.
where \(\{a_n\}, \{b_n\}\), \(\{c_n\}\) and \(\{d_n\}\) are sequences of real numbers in \([a, 1-a], [b, 1-b], [c, 1-c], [d, 1-d]\) respectively. Hammad et al.20 introduced the four-step iterative process named HR, which converges faster than the \(K^{*}\) iterative process21, S iterative process, Picard-S iterative process, and Thakur iterative process.
where \(\{a_n\}, \{b_n\}\) and \(\{c_n\}\)\(\subset\) [0, 1]. Recently, Hammad et al.22 introduced another four-step iterative process named \(HR^{*}\) and proved analytically that their iterative processes converge faster than existing iterative processes named JK in23.
where \(\{a_n\}, \{b_n\}\) and \(\{c_n\}\) are sequences of real numbers in (0, 1). In the diverse landscape of pure and applied sciences, spanning domains such as biology, physics, and computer science, the exploration of metric spaces has emerged as a pivotal focus. In 2011, Azam et al.24, defined the concept of complex valued metric spaces. His novel concept has assisted researchers in overcoming the disadvantage of being unable to define rational form in cone metric spaces, and it can be used to create complex valued normed spaces as well as complex valued inner product spaces, both of which provide a wealth of potential research topics. More results on complex valued metric spaces have been discussed in24,25. However, a conspicuous gap persists in understanding the approximation of fixed points of nonlinear mappings within real-valued metric spaces and real-valued Banach spaces26,27,28,31. To bridge this void, Okeke, in32, introduced the concept of complex valued Banach spaces. Leveraging the iterative techniques proposed by8,10, Okeke successfully approximated the fixed points of contraction conditions within these complex valued Banach spaces. Moreover, the PMH iteration and the PKH iteration have been shown to have the same rate of convergence both analytically and numerically.
Motivated by these authors, we propose a new iterative process to approximate fixed points for contraction and weak contraction conditions on complex-valued Banach spaces. We show that the new iterative process converges faster than other iterative processes named S-iterative, Picard Mann hybrid, Picard Krasnoselskii hybrid iterative, Picard Ishikawa hybrid, Picard-S hybrid, HR-iterative, and \(HR^{*}\)-iterative processes. Also, we prove that the new iterative process is strongly convergent on complex-valued Banach spaces. The obtained results are proven both analytically and numerically with examples and visualized for the speed of convergence using Matlab tools for contraction and weak contraction conditions. We prove a small result for nonexpansive mapping using our new iterative process. We discuss the stability of our novel iterative technique and its impact on data dependence for contraction.
Lemmas and definitions
The purpose of this section is to provide the reader with certain definitions and lemmas that will ensure that they have a better comprehension of our content and will be beneficial in the subsequent section. Let A be a linear space over a field \({\mathbb {K}}\), where \({\mathbb {K}} = {\mathbb {R}}\) or \({\mathbb {K}} = {\mathbb {C}}\).
Lemma 2.1
32 Let (A, ||.||) be a complex valued Banach space, and let \(\{p_n\}\) be a sequence in A. Then \(\{p_n\}\) converges to p if and only if \(\left| {\Vert {p_n-p} \Vert }\right| \rightarrow 0\) as \(n \rightarrow \infty\).
Lemma 2.2
32 Let (A, ||.||) be a complex valued Banach space and \(\{p_n\}\) be a sequence in A. Then \(\{p_n\}\) is a Cauchy sequence if and only if \(\left| {\Vert {p_n-p_{n+m}} \Vert }\right| \rightarrow 0\) as \(n \rightarrow \infty\).
Definition 2.1
9 Let \(\{\ell _n\}, \{m_n\}\) be two sequences of positive numbers that converge to \(\ell\) and m, respectively. Suppose that \(\exists\) a constant c such that \(\displaystyle \lim _{n\rightarrow \infty } \dfrac{||\ell _n-\ell ||}{||m_n-m||} = c\). If
-
1.
\(c = 0\), then \(\{\ell _n\}\) converges to \(\ell\) faster than \(\{m_n\}\) to m.
-
2.
\(0<c<\infty\), then \(\{\ell _n\}_{n = 0}^{\infty }\) and \(\{m_n\}_{n = 0}^{\infty }\) have the same rate of convergence.
For more details on the following, one can refer to9,33,34,38.
Definition 2.2
Let \(F, \overset{\sim }{F}\) be two self operators on \(B \subseteq A\). We define \(\overset{\sim }{F}\) as an approximate operator of F if, for any \(a \in B\) and a given fixed \(\epsilon > 0\), the condition \(||Fa-\overset{\sim }{F}a|| \le \epsilon\) holds.
Definition 2.3
Let \(B \subseteq A\) and S be self-mapping on B. Assume that \(p_1 \in B\) and \(p_{n+1} = f(S, p_n)\) defines an iterative process that produces a sequence \(\{p_n\} \subset B\) and \(\{p_n\}\) converges strongly to \(a \in F (S) \ne \emptyset\) where F(S) is the set of all the fixed points of S. Let \(\{q_n\}\) be any sequence of bounded in B, and choose \(\epsilon _n = ||q_{n+1}-f(S, q_{n})||\). Then
-
1.
The iterative process \(\{p_n\}_{n=0}^{\infty }\) defined by \(p_{n+1} = f(S, p_n)\) is said to be S-stable on B if \(\lim _{n\rightarrow \infty } \epsilon _n\) = 0, \(\implies\)\(\lim _{n\rightarrow \infty } q_n = a\).
-
2.
The iterative process \(\{p_n\}_{n=0}^{\infty }\) defined by \(p_{n+1} = f(S, p_n)\) is said to be at-most S-stable on B if \(\displaystyle \sum _{n=1}^{\infty } \epsilon _n < \infty\), \(\implies\)\(\lim _{n\rightarrow \infty } q_n = a\).
Lemma 2.3
9 Let \(\sigma\) be a real number in the range \(0 \le \sigma < 1\), and consider a sequence of positive numbers \(\{\epsilon _n\}_{n=0}^{\infty }\) such that \(\displaystyle \lim _{n \rightarrow \infty }\)\(\epsilon _n = 0\). Then, for the sequence of positive numbers \(\{p_n\}_{n=0}^{\infty }\) satisfying the condition \(p_{n+1} \le \sigma p_n + \epsilon _n\) for all \(n \ge 0\), we have \(\lim _{n \rightarrow \infty } p_n = 0.\)
.
Lemma 2.4
39 Let \(\{q_n\}\) and \(\{\rho _n\}\) be non-negative real sequences satisfying \(q_{n+1} \le (1-\mu _n)q_{n} +\rho _{n}\), where \(\mu _n \in (0,1), \forall n\ge n_0\), \(\displaystyle \sum _{n=1}^{\infty } \mu _n = \infty\) and \(\frac{\rho _n}{\mu _n} \rightarrow 0\) as \(n \rightarrow \infty\), then \(\displaystyle \lim _{n\rightarrow \infty }q_n = 0\).
Lemma 2.5
40 Let \(\{q_n\}_{n=0}^{\infty }\) denote a non-negative real sequence that adheres to the inequality:
\( q_{n+1} \le (1-\nu _n) q_{n} +\nu _{n}\delta _n\),
where \(\nu _n \in (0,1) \forall n \in {\mathbb {N}}\), \(\sum _{n=1}^{\infty } \nu _n = \infty\), and \(\delta _n \ge 0\)\(\forall\)\(n \in {\mathbb {N}}\). Given that there exists \(n_0 \in {\mathbb {N}}\) such that \(n \ge n_0\), it follows that \(0 \le \displaystyle \limsup _{n\rightarrow \infty }{q_n} \le \displaystyle \limsup _{n\rightarrow \infty }{\delta _n}\).
Let (A, ||.||) be a complex valued Banach space, and F be a self-mapping on \(B \subseteq A\). If \(\exists\)\(\mu \in (0,1)\) such that
F is called a contraction condition. On a complete metric space, weak contraction type conditions are discussed in41,42. Here we define the weak contraction on a complex valued Banach space. If there exists \(\mu \in (0,1)\) and \(\nu \ge 0\) such that
for all \(h_{1}, h_{2} \in B \subseteq A\), F is called a weak contraction or almost weak contraction condition.
Main results
In this section, we propose the following new iterative process for a sequence \(\{\ell _n\}\) such that:
where \(\{a_n\}, \{b_n\}\) and \(\{c_n\}\) are sequences in [0, 1]. This iterative process given by (15) can be called the M-Fast iterative process. In this main result, we first discuss the rate of convergence of a new iterative process named M-Fast for contraction and weak contraction conditions on complex valued metric spaces. Then we prove analytically and with numerical examples that our new four-step iterative method converges faster than other three-step iterative methods (named S-iterative, PMH, PKH, PIH, and Picard-S hybrid) and four-step iterative methods (named HR-iterative and \(HR^{*}\)-iterative). Furthermore, the stability of our new iterative method and the data dependence found for contraction conditions by employing our new iterative method are also discussed.
Convergence analysis
Strong convergence results for our new iterative process
We initiate this section with the subsequent convergence result of the M-Fast iterative method for contraction conditions on a complex valued Banach space.
Theorem 3.1
Let B be a nonempty closed convex subset of a complex-valued Banach space (A, ||.||). Suppose F is a self-mapping on B satisfying the condition (13) and possessing a fixed point. Consider the iterative sequence \(\{\ell _n\}\) generated by (15), where the sequences \(\{a_n\}, \{b_n\}, \{c_n\}\) are real and lie within the closed interval [0, 1] such that \(\sum _{n=1}^{\infty } a_n = \infty\). Then, the sequence \(\{\ell _n \}\) converges strongly to a unique fixed point \(\varkappa\) of the mapping F.
Proof
Let \(\varkappa\) be a unique fixed point of the mapping F. Using (13) and (15), we have
Using (16), (17) and (18), we have
Since \(0< \mu < 1\) and \(b_n\) and \(c_n\)\(\in [0,1]\)\(\forall\)\(n\ge 1,\)\((1-b_n(1-\mu ))\)\((1-c_n(1-\mu ))\)\(< 1\). Thus the above equation (19) reduces to
where \((1-a_n(1-\mu ))\) is in (0, 1). As \(\mu \in (0, 1)\) and \(a_n\)\(\in [0,1]\) for all \(n\ge 1\), we obtain
Therefore we have
Using the classical result, \(1-x \le e^{-x}\) for all \(x \in [0, 1]\) in the above inequality, we get
\(||\ell _{n+1}-\varkappa || \preceq \dfrac{||\ell _{1}-\varkappa || \mu ^{4(n+1)}}{e^{(1-\mu ) \sum _{k=1}^{n} (a_k)}}\) and \(\displaystyle \lim _{n\rightarrow \infty } |||\ell _{n+1}-\varkappa ||| \le \dfrac{||\ell _{1}-\varkappa || \mu ^{4(n+1)}}{e^{(1-\mu ) \sum _{k=1}^{n} (a_k)}} \rightarrow 0\) as \(n\rightarrow \infty\).
\(\implies \ell _n \rightarrow \varkappa\) as \(n\rightarrow \infty .\)
\(\square\)
Using the aforementioned theorem technique, we provide the following result for the weak contraction condition.
Theorem 3.2
Let (A, ||.||) be a complex-valued Banach space. Given a nonempty closed convex subset \(B \subseteq A\), consider a self-mapping \(F: B \rightarrow B\) that satisfies condition (14). Let \({\ell _n}\) be an iterative sequence generated by (15), with real sequences \(\{a_n\}, \{b_n\}, \{c_n\}\) in [0, 1] such that \(\sum _{n=1}^{\infty } a_n = \infty\). Then, the sequence \(\{\ell _n\}\) converges strongly to a unique fixed point \(\varkappa\) of the mapping F.
Speed of convergence of our iterative process with other two- and three-step iterative processes
The following theorem shows that our new iterative process converges faster than the S-iterative, PMH, PKH , PIH, and Picard-S hybrid iterative processes.
Theorem 3.3
Let (A, ||.||) be a complex-valued normed space with B being a nonempty closed convex subset. Consider a self-mapping \(F: B \rightarrow B\) satisfying condition (13). Assume that each iterative process defined by equations (5), (6), (7), (8), (9), and (15) converges to the same fixed point \(\varkappa\) of F. Here, the sequences \(\{a_n\}\), \(\{b_n\}\), and \(\{c_n\}\) are real with \(0<\rho \le \gamma , a_n, b_n, c_n <1\) for all \(n \in {\mathbb {N}}\). Then, the M-Fast iterative process (15) exhibits a faster convergence rate compared to all other iterative processes mentioned.
Proof
Let \(F(\varkappa ) = \varkappa\). Use S-iterative process (5) in the contraction condition (13), by usual technique we have,
Thus
\(||p_{n+1}-\varkappa ||\preceq \mu (1-(1-\mu )\rho ^2) ||p_{n}-\varkappa || ...\preceq \mu ^{n+1}(1-(1-\mu )\rho ^2)^{n+1}||p_{1}-\varkappa ||\). We let \(A_n = (\mu (1-(1-\mu )\rho ^2))^{n+1}||p_{1}-\varkappa ||.\)
From Picard Mann hybrid process (6) and contraction condition (13), we have
\(\implies\)\(||u_{n+1}-\varkappa || \preceq (\mu (1 - (1-\mu )\rho ^2))^{n+1}||u_{1}-\varkappa ||\). Let \(B_n=(\mu (1 - (1-\mu )\rho ^2))^{n+1}||u_{1}-\varkappa ||\).
From Picard Krasnoselskii hybrid iterative (7) and (13), we have
Since \(||v_{n+1}-\varkappa || \preceq \mu (1-(1- \mu )\rho ^2) ||v_{n}-\varkappa || \preceq ....\preceq \mu ^{n+1} (1-(1- \mu )\rho ^2)^{n+1} ||v_{1}-\varkappa ||\).
Let \(C_n = (\mu (1-(1- \mu )\rho ^2))^{n+1} ||v_{1}-\varkappa ||.\)
From Picard Ishikawa hybrid (8) and (13),
Thus
We have \(||\omega _{n+1}-\varkappa || \preceq \mu (1-(1- \mu )\rho ^2)||\omega _{n}-\varkappa ||\preceq ....\preceq \mu ^{n+1} (1-(1- \mu )\rho ^2)^{n+1}||\omega _{1}-\varkappa ||\). Let \(D_n = (\mu (1-(1- \mu )\rho ^2))^{n+1}||\omega _{1}-\varkappa ||\).
From Picard-S hybrid iterative process (9) and the condition (13),
Therefore,
\(||x_{n+1}-\varkappa ||\preceq \mu ^2(1- (1-\mu )\rho ^2)||x_{n}-\varkappa ||\preceq ...\preceq \mu {^{2(n+1)}} (1- (1-\mu )\rho ^2))^{n+1}||x_{1}-\varkappa ||\). So Let \(E_n = \mu ^{2(n+1)}(1- (1-\mu )\rho ^2)^{n+1}||x_{1}-\varkappa ||\).
For M-Fast iterative process (15) and the contraction condition (13), it follows from the equation (20)
\(||\ell _{n+1}-\varkappa ||\preceq \mu ^4(1- (1-\mu )\rho ^2) ||\ell _{n}-\varkappa ||\preceq ...\preceq \mu ^{4(n+1)}(1- (1-\mu )\rho ^2)^{n+1}||\ell _{1}-\varkappa ||\).
Let \(F_n = (\mu ^4(1- (1-\mu )\rho ^2))^{n+1}||\ell _{1}-\varkappa ||\).
Now we show that rate of convergence. Since \((\mu (1- (1-\mu )\rho ^2)) < 1\) and \(\mu \in (0, 1)\),
we observe the following,
Letting \(n\rightarrow \infty\), we have \(\lim _{n\rightarrow \infty }\frac{F_n}{A_n} = 0\). Thus M-Fast iterative process (15) converges to \(\varkappa\) faster than S-iterative process (5).
As \(n\rightarrow \infty\), we have \(\lim _{n\rightarrow \infty }\frac{F_n}{B_n} = 0\). Thus M-Fast iterative process (15) converges to \(\varkappa\) faster than Picard Mann hybrid process (6).
Letting \(n\rightarrow \infty\), we have \(\lim _{n\rightarrow \infty }\frac{F_n}{C_n} = 0\). Thus M-Fast iterative process (15) converges to \(\varkappa\) faster Picard Krasnoselskii hybrid iterative (7).
As \(n\rightarrow \infty\), we have \(\lim _{n\rightarrow \infty }\frac{F_n}{D_n} = 0\). Thus M-Fast iterative process (15) converges to \(\varkappa\) faster Picard Ishikawa hybrid iterative (8).
Letting \(n\rightarrow \infty\), we have \(\lim _{n\rightarrow \infty }\frac{F_n}{E_n} = 0\). Thus M-Fast iterative process (15) converges to \(\varkappa\) faster Picard-S hybrid (PSH) iterative process (9). Therefore \(\{\ell _n\}\) converges faster than \(\{p_n\}\), \(\{u_n\}\), \(\{v_n\}\)\(\{w_n\}\) and \(\{x_n\}\). That is the M-Fast iterative process (15) exhibits a faster convergence rate compared to all other iterative processes mentioned. \(\square\)
Based on the technique mentioned earlier, we prove the following theorem under the condition of weak contraction.
Theorem 3.4
Let (A, ||.||) a complex valued normed space and B be a nonempty closed convex subset of (A, ||.||). Let F be a mapping from B to B satisfying condition (14). Assume that each iterative process in (5), (6), (7), (8), (9) and (15) converges to the same fixed point \(\varkappa\) of F where \(\{a_n\}, \{b_n\}\) and \(\{c_n\}\) are the real sequences in \(0<\rho \le \gamma , a_n, b_n, c_n <1\)\(\forall n \in {\mathbb {N}}\). Then M-Fast iterative process (15) exhibits a faster convergence rate compared to all other iterative processes mentioned.
Here we provide the following example to ensure that the analytical proof in the above theorem is valid.
Example 1
Let \(A = {\mathbb {R}}\) and \(B = [1, 10]\). Let \(F: [1, 10] \rightarrow [1, 10]\) be a self operator which is defined by
\(F(x) = \root 4 \of {7x+2}\), \(\forall x \in B\).
Taking \(\gamma = a_n = b_n = c_n = \frac{1}{2}\) for \(n\in {\mathbb {N}}\), with initial values \(x_0 = 5\), it satisfies condition (13) for \(\mu = \frac{1}{\root 4 \of {2}}\) and also condition (14) when \(\nu = 0.\) Therefore, it has a unique fixed point \(\varkappa =2\). From Table 1 and Fig. 1, we can see that the M-Fast iterative process (15) exhibits a faster convergence rate compared to all other iterative processes mentioned.
Speed of convergence of M-Fast iterative process with other four- step iterative processes
Now, we prove that the new iterative process converges faster than the other four-step iterative processes, namely HR and \(HR^*\), on a complex valued normed space.
Theorem 3.5
Let F be a self-mapping on a nonempty closed convex subset B of a complex valued normed space (A, ||.||) that satisfies the condition (13). Assume that each iterative process in (11), (12), and (15) converges to the same fixed point \(\varkappa\) of F, where \(\{a_n\}, \{b_n\}\), and \(\{c_n\}\) are the real sequences with \(0<\rho \le a_n, b_n, c_n <1\)\(\forall\)\(n \in {\mathbb {N}}\). Then the M-Fast iterative process (15) exhibits a faster convergence rate compared to all other iterative processes mentioned.
Proof
For M-Fast iterative process (15) and the contraction condition (13), it follows from the equation (21) together with \(0<\rho \le a_n <1\), \(n \in {\mathbb {N}}\),
Let \(F_n = (\mu ^4(1- (1-\mu )\rho ))^{n+1}||\ell _{1}-\varkappa ||\).
For HR iterative process (11) and the contraction condition (13),
Similarly, we have \(||y_{n}-\varkappa || \preceq \mu (1-c_n+\mu c_n)||x_{n}-\varkappa ||,\)\(||x_{n}-\varkappa || \preceq \mu (1-b_n+\mu b_n)||\kappa _{n}-\varkappa ||\). Thus
Since \(\mu\) in (0, 1) and \(b_n\), \(c_n\) are in [0, 1] \(\forall n \in {\mathbb {N}}\), we get \((1-b_n(1-\mu ))\)\((1-c_n(1-\mu ))\)\(< 1\). Thus above inequality (22) reduces to
where \((1-a_n(1-\mu ))\) is in (0, 1). Since \(\mu \in (0, 1)\) and \(a_n\)\(\in [0,1]\) for all \(n \in {\mathbb {N}}\), we obtain
It follows from equation (24) together with \(0<\rho \le a_n <1\)\(\forall n \in {\mathbb {N}}\),
Let \(G_n = (\mu ^3(1- (1-\mu )\rho ))^{n+1}||z_{1}-\varkappa ||\).
For \(HR^*\) iterative process (12) and the contraction condition (13), we got \(||\kappa _{n}-\varkappa ||\preceq (1-a_n+\mu a_n)||o_{n}-\varkappa ||\) and \(|x_{n}-\varkappa || \preceq \mu (1-b_n+\mu b_n)||\kappa _{n}-\varkappa ||.\)
Thus
where \((1-a_n(1-\mu ))\) is in (0, 1). As \(\mu \in (0, 1)\) and \(a_n\)\(\in [0,1]\)\(\forall n \in {\mathbb {N}}\), we find
It follows from the equation (25) together with \(0<\rho \le a_n <1\)\(\forall n \in {\mathbb {N}}\),
Let \(H_n = (\mu ^3(1- (1-\mu )\rho ))^{n+1}||o_{1}-\varkappa ||\). While checking the rate of convergence, we observe the following,
since \((\mu (1- (1-\mu )\rho )) < 1\) and \(\mu \in (0, 1)\) Letting \(n\rightarrow \infty\), we have \(\lim _{n\rightarrow \infty }\frac{F_n}{G_n} = 0\). Similarly,
Letting \(n\rightarrow \infty\), we have \(\lim _{n\rightarrow \infty }\frac{F_n}{H_n} = 0\). Thus M-Fast iterative process (15) converges to \(\varkappa\) faster than HR-iterative process (11) and \(HR^*\)-iterative process (12). \(\square\)
The following theorem, which pertains to the condition of the weak contraction, has been proved by us, using the technique that has been discussed earlier.
Theorem 3.6
Let (A, ||.||) be a complex-valued normed space with B as a nonempty closed convex subset. Consider a self-mapping \(F: B \rightarrow B\) satisfying condition (14). Suppose that every iterative process defined by equations (11), (12), and (15) converges to the same fixed point \(\varkappa\) of F, where \(\{a_n\}\), \(\{b_n\}\), and \(\{c_n\}\) are real sequences such that \(0< \rho \le a_n, b_n, c_n < 1\)\(\forall\)\(n \in {\mathbb {N}}\). Then, the M-Fast iterative process (15) achieves a faster rate of convergence compared to all other iterations.
In order to show the validity of the analytical proof presented in the above Theorem, we provide a numerical illustration as follows.
Example 2
Let \(A = {\mathbb {R}}\) and \(B = [1, 50]\). Let \(F: [1, 50] \rightarrow [1, 50]\) be a self operator which is defined by \(F(x) = \sqrt{x^2-8x+40}\), \(\forall x \in B\). Taking \(a_n = b_n = c_n = \frac{1}{2}\) for \(n\in {\mathbb {N}}\), with initial values \(x_0 = 50\), it satisfies condition (13) and also (14) condition when \(\nu = 0.\) Therefore, it has a unique fixed point \(\varkappa =5\). From Table 2 and Fig. 2, we can see that the M-Fast iterative process (15) converges faster than all the other iterations.
Next, we provide a small result of nonexpansive mapping for the M-Fast iterative process on a complex valued banach space.
Theorem 3.7
Let F be a nonexpansive self-mapping from a nonempty closed convex subset of a complex valued Banach space (A, ||.||) to itself. Assume that \(\{\ell _n\}_{n=0}^{\infty }\) is generated by process(15), then \(\displaystyle \lim _{n\rightarrow \infty }\Vert {\ell _n-\varkappa } \Vert\) exist \(\forall \varkappa \in F(F)\).
Proof
Suppose \(\varkappa \in F(F)\).
Thus
Take \(_n = \ell _n-\varkappa\) for all n \(\in {\mathbb {N}}\), as \(\Vert {S_{n+1}} \Vert \preceq \Vert {S_{n}} \Vert\), \(\displaystyle \lim _{n\rightarrow \infty }\Vert {\ell _n-\varkappa } \Vert\) exist \(\forall \varkappa \in F(F)\). \(\square\)
Stability results for our new iterative process in complex valued banach spaces
In this part, we prove the stability of the M-Fast iteration procedures for contraction mapping on a complex-valued Banach space.
Theorem 3.8
Let \((A, \Vert {.} \Vert )\) be a complex valued Banach space and \(F: B \subseteq A \rightarrow B\) be a mapping that satisfies the contraction condition (13). Assume that there exists \(\varkappa\) in F(F) and the sequence \(\{\ell _n\}\) of (15) converges to \(\varkappa\) with \(\displaystyle \sum _{n=1}^{\infty } a_n = \infty\) and real sequences \(0< \rho \le a_n, b_n, c_n <1\) for all \(n \in {\mathbb {N}}\). Then the M-Fast iterative process is F-stable and almost F-stable.
Proof
Suppose \(\{\ell _n\}_{n=0}^{\infty }\) in B is a bounded sequence and put \(\epsilon _n = \Vert {\ell _{n+1}-f(F, \ell _n)} \Vert\), where
Let \(\displaystyle \lim _{n\rightarrow \infty }\epsilon _n = 0\). Using (13) and (15), we have
By our assumption, we have \(1-(1 - \mu ) \rho <1\). From Lemma 2.3, \(\displaystyle \lim _{n\rightarrow \infty }\ell _n =\varkappa\). And then conversely
Therefore \(\displaystyle \lim _{n\rightarrow \infty }\epsilon _n = 0\), so the M-Fast iterative process is F-stable . We find that the process is almost F-stable. Suppose \(\displaystyle \sum _{n=1}^{\infty }\epsilon _n < \infty\). Using (26) we have
\(\Vert {\ell _{n+1}-\varkappa } \Vert \preceq \epsilon _n+\mu ^4(1-\rho +\mu \rho )^3|| \ell _{n}-\varkappa ||.\)
By Lemma (2.1) and (2.4), we get \(\ell _{n}\rightarrow \varkappa\) as n \(\rightarrow \infty\).
Conversely, suppose that \(\displaystyle \lim _{n\rightarrow \infty }\ell _n = \varkappa\). From (27), we have
we obtain, \(\epsilon _{n}\rightarrow 0\) as n \(\rightarrow \infty\). Hence the proof.
\(\square\)
Example 3
Let \(F: [0, 1] \rightarrow [0, 1]\) be a self mapping defined by \(||x-y|| = i ||x-y||\) such that \(F(x) = \frac{x}{2}\). It can be checked that the condition (13) is satisfied for \(\mu = \frac{1}{2}\) and \(\varkappa = 0\). Suppose \(\ell _{n} = \frac{1}{n}\) with \(a_{n} = b_{n} = c_{n} = \frac{1}{\sqrt{2}}\).
Using (26), we have
Using (27),
\(\displaystyle \lim _{n\rightarrow \infty }\epsilon _n = 0\). Therefore, the M-Fast iterative process is F-stable and also almost F-stable.
In the same line, we prove the stability of the M-Fast iteration procedures for weak contraction mapping on a complex-valued Banach space.
Theorem 3.9
Let \((A, \Vert {.} \Vert )\) be a complex valued Banach space and \(F: B \subseteq A \rightarrow B\) be a mapping that satisfies the contraction condition (14). Assume that \(\exists\)\(\varkappa\) in F(F), such that the sequence \(\{\ell _n\}\) of (15) converges to \(\varkappa\) with \(\displaystyle \sum _{n=1}^{\infty } a_n = \infty\) and real sequences \(0< \rho \le a_n, b_n, c_n <1\)\(\forall n \in {\mathbb {N}}\), then the M-Fast iterative process is F-stable and almost F-stable.
Data dependence result for our new iterative process in complex valued banach spaces
In this section, we prove the data dependence result of M- Fast iterative process for contraction mapping on a complex valued banach space.
Theorem 3.10
Let \(\overset{\sim }{F}\) be an approximate operator on B for a map F satisfying condition (13). Suppose \(\{\ell _n\}\) generated by (15) for F and \(\{\overset{\sim }{\ell _n}\}\) is defined as
with real sequences \(\{a_n\}, \{b_n\}\) and \(\{c_n\} \in [0,1]\) satisfying \(\displaystyle \sum _{n=1}^{\infty } a_n =\infty\) and \(\frac{1}{2} \le a_n\). If \(F\varkappa = \varkappa\) and \(\overset{\sim }{F}\overset{\sim }{\varkappa }= \overset{\sim }{\varkappa }\) such that \(\displaystyle \lim _{n\rightarrow \infty }\overset{\sim }{\ell }_{n} = \overset{\sim }{\varkappa }\), then we have \(\left| {\Vert {\varkappa -\overset{\sim }{\varkappa }} \Vert }\right| \le \dfrac{13\varepsilon }{1-\mu }\) where \(\varepsilon\) is fixed.
Proof
Using (13), (15) and (28), we got,
Thus
For \(\mu \in (0, 1)\) and \(a_n, b_n\) and \(c_n\) are in [0, 1] \(\forall n \in {\mathbb {N}}\), then we have the following observations \((1-a_n(1-\mu ))< 1, (1-b_n(1-\mu ))< 1, (1-c_n(1-\mu ))< 1, \mu , \mu ^2, \mu ^3, \mu ^4< 1, (\mu -1) < 0\) and \(\mu ^3 a_n, \mu ^3 b_n, \mu ^3 c_n, \mu ^4 c_n < 1.\) Since our assumption that \(\frac{1}{2}\le a_n\), we have \(1-a_n \le a_n.\) Using the above observations together with (29), we get
Let \(p_n = \Vert {\ell _{n}-\overset{\sim }{\ell }_{n}} \Vert , \delta _n = \frac{13}{1-\mu }\varepsilon , \nu _n = a_n(1-\mu )\). Using lemma (2.5) together with (30), we get
By Theorem (3.1), \(\{\ell _n\}\) converges to \(\varkappa\) of mapping F and the assumption that \(\{\overset{\sim }{\ell _n}\}\) converges to a \(\overset{\sim }{\varkappa }\) of mapping \(\overset{\sim }{F},\) we obtain \(\Vert {\varkappa -\overset{\sim }{\varkappa }} \Vert \le \dfrac{13\varepsilon }{1-\mu }\). \(\square\)
Conclusion
In this work, we have proposed a new iterative process for approximating fixed points in complex-valued Banach spaces under contraction and weak contraction conditions. Through our analysis, we have demonstrated that our novel iterative approach achieves faster convergence rates compared to several existing methods, including the S-iterative, PMH, PKH, PIH, PSH, HR-iterative, and \(HR^{*}\)-iterative processes. Additionally, we have established the strong convergence of our new iterative process in complex-valued Banach spaces. Our findings are supported by both analytical proofs and numerical examples, and visualized the speed of convergence using MATLAB. Furthermore, we have extended our investigation to include a small result concerning non-expansive mapping using our proposed iterative technique. Finally, we have discussed the stability of our novel approach and its implications for data dependence under contraction conditions.
We can apply our fast iterative processes across various fields and industries. Some common areas where fast iterative algorithms find application include:
Optimization: Fast iterative algorithms are widely used in optimization problems across diverse domains such as engineering, finance, logistics, and machine learning. They help in finding optimal solutions to complex problems efficiently.
Signal Processing: In areas like image processing, audio signal processing, and communication systems, fast iterative algorithms are employed for tasks such as denoising, compression, filtering, and equalization.
Machine Learning and Data Mining: Iterative algorithms play a crucial role in training machine learning models, such as gradient descent-based optimization in neural networks, clustering algorithms like k-means, and dimensionality reduction techniques like principal component analysis (PCA).
Scientific Computing: Many scientific simulations and computations rely on fast iterative methods to solve differential equations, linear algebra problems, and optimization tasks arising from physics, chemistry, biology, and other scientific disciplines.
Finance and Economics: Iterative algorithms are used for portfolio optimization, risk management, option pricing, algorithmic trading, and other financial applications.
Computer Graphics and Vision: Fast iterative techniques are utilized in rendering algorithms, computer vision tasks like object detection and recognition, 3D reconstruction, and motion tracking.
Operations Research: In fields such as transportation, scheduling, and resource allocation, fast iterative methods are applied to solve complex optimization problems and improve decision-making processes.
Healthcare and Bioinformatics: Iterative algorithms find application in medical imaging, genome sequencing, drug discovery, and personalized medicine, aiding in data analysis, pattern recognition, and predictive modeling.
Data availability
The authors affirm that the data underpinning the results of this investigation are provided within the article itself.
References
Banach, S. Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales. Fund. Math. 3, 133–181 (1922).
Picard, E. Memoire surla theorie des equations aux derivees partielles et la methode des approximations successives. J. Math. Pures Appl. 6, 145–210 (1890).
Krasnoselskii, M. A. Two observations about the method of successive approximation. Usp Mat Nauk. 10, 123–27 (1955).
Mann, W. R. Mean value methods in iteration. Proc. Am. Math. Soc. 4, 506–70 (1953).
Ishikawa, S. Fixed points by a new iteration method. Proc. Am. Math. Soc. 44, 147–50 (1974).
Agarwal, R. P., O’Regan, D. & Sahu, D. R. Fixed Point Theory for Lipschitzion-Type Mappings with Applications (Springer, 2009).
Khan, S. H. A Picard-Mann Hybrid iterative process. Fixed Point Theory Appl. 2013; Article number: 69 (2013).
Okeke, G. A. & Abbas, M. A solution of delay differential equation via Picard-Krasnoselskii hybrid iterative process. Arab. J. Math. 6, 21–9 (2017).
Berinde, V. Iterative approximation of fixed points, Lecture Notes in Mathematics, (Springer, 2007).
Okeke, G. A. Convergence analysis of the Picard-Ishikawa hybrid iterative process with applications. Afrika Mathematica 30, 817–35 (2019).
Gursoy, F., Karakaya, V. A Picard-S hybrid type iteration method for solving a differential equation with retarded argument, arXiv preprint arXiv:1403.2546. (2014).
Srivastava, J. Introduction of new Picard-S hybrid iteration with application and some results for nonexpansive mappings. Arab J. Math. Sci. 28(1), 61–76 (2022).
Ofem, A. E. et al. Solving fractional Volterra-Fredholm integro-differential equations via \(A^{**}\) iteration method. Axioms. 11(9), 470 (2022).
Okeke, G. A., Ofem, A. E., Abdeljawad, T., Alqudah, M. A. & Khan, A. A solution of a nonlinear Volterra integral equation with delay via a faster iteration method. AIMS Math. 8(1), 102–24 (2023).
Ofem, A. E., Işık, H., Ali, F. & Ahmad, J. A new iterative approximation scheme for Reich-Suzuki-type nonexpansive operators with an application. J. Inequal. Appl. 2022(1), 28 (2022).
Ofem, A. E. et al. A mixed-type Picard-s iterative method for estimating common fixed point in hyperbolic spaces. J. Appl. Anal. Comput. 14(3), 1302–29 (2024).
Ofem, A. E., Abuchu, J. A., Ugwunnadi, G. C., Işik, H. & Narain, O. K. On a four-step iterative algorithm and its application to delay integral equations in hyperbolic spaces. Rendiconti del Circolo Matematico di Palermo Series 2 73(1), 189–224 (2024).
Shatanawi, W., Bataihah, A. & Tallafha, A. Four-step iteration scheme to approximate fixed point for weak contractions. Comput. Mater. Contin. 1(64), 1491–504 (2020).
Sintunavarat, W. & Pitea, A. On a new iteration scheme for numerical reckoning fixed points of Berinde mappings with convergence analysis. J. Nonlinear Sci. Appl. 9(5), 2553–2562 (2016).
Hammad, H. A., Rehman, H. U. & Zayed, M. Applying faster algorithm for obtaining convergence, stability, and data dependence results with application to functional-integral equations. AIMS Math. 1(7), 19026–56 (2022).
Ullah, K. & Arshad, M. New three-step iteration process and fixed point approximation in Banach spaces. J. Linear Topol. Algebra 7, 87–100 (2018).
Hammad, H. A., Rehman, H. U. & De la Sen, M. A new four-step iterative procedure for approximating fixed points with application to 2D Volterra integral equations. Mathematics 10(22), 4257 (2022).
Ahmad, J., Ullah, K., Arshad, M. & Ma, Z. A new iterative method for Suzuki mappings in Banach spaces. J. Math. 2021, 6622931 (2021).
Azam, A., Fisher, B. & Khan, M. Common fixed point theorems in complex valued metric spaces. Numer. Funct. Anal. Optim 32(3), 243–253 (2011).
Hussain, N., Azam, A., Ahmad, J. & Arshad, M. Common fixed point results in complex valued metric spaces with application to integral equations. Filomat 28(7), 1363–1380 (2014).
Dass, B. K. & Gupta, S. An extension of Banach contraction principle through rational expression. Indian J. Pure Appl. Math. 6, 1455–1458 (1975).
Craciun, C. & Serban, M. A. A nonlinear integral equation via Picard operators. Fixed Point Theory 12(1), 57–70 (2011).
Gursoy, F. Applications of normal S-iterative method to a nonlinear integral equation. Sci. World J. 2014, 943127 (2014).
Okeke, G. A. & Abbas, M. A solution of delay differential equations via Picard-Krasnoselskii hybrid iterative process. Arab. J. Math. 6, 21–29 (2017).
Villasana, M. & Radunskaya, A. A delay differential equation model for tumor growth. J. Math. Biol. 47(3), 270–294 (2003).
Zhao, T. Global periodic solutions for a differential delay system modeling a microbial population in the chemostat. J. Math. Anal. Appl. 193, 329–352 (1995).
Okeke, G. A. Iterative approximation of fixed points of contraction mappings in complex valued Banach spaces. Arab J. Math. Sci. 25(1), 83–105 (2019).
Harder, A. M. Fixed Point Theory and Stability Results for Fixed Point Iteration Procedures (Ph.D. Thesis), University of Missouri-Rolla, (1987).
Harder, A. M. & Hicks, T. L. A stable iteration procedure for nonexpansive mappings. Math. Jpn. 33, 687–692 (1988).
Harder, A. M. & Hicks, T. L. Stability results for fixed point iteration procedures. Math. Jpn. 33, 693–706 (1988).
Okeke, G. A. & Abbas, M. Convergence and almost T -stability for a random iterative sequence generated by a generalized random operator. J. Inequal. Appl. 146, 11 (2015).
Akewe, H. & Okeke, G. A. Convergence and stability theorems for the Picard-Mann hybrid iterative scheme for a general class of contractive-like operators. Fixed Point Theory Appl. 2015 (2015) 66, 8 pages Sciences Vol. 28 No. 1, 61–76 (2022).
Berinde, V. Summable almost stability of fixed point iteration procedures. Carpathian J. Math. 19(2), 81–88 (2003).
Weng, X. Fixed point iteration for local strictly pseudocontractive mapping. Proc. Am. Math. Soc. 113, 727–731 (1991).
Soltuz, S. M. & Grosan, T. Data dependence for Ishikawa iteration when dealing with contractive like operators. Fixed Point Theory Appl.1—-7, 242916 (2008).
Berinde, V. Approximating fixed points of weak contractions using the Picard iteration. Nonlinear Anal. Forum 9(1), 43–54.
Berinde, V. On the approximation of fixed points of weak contractive mapping. Carpathian J. Math. 19, 7–22 (2003).
Funding
Open access funding provided by Vellore Institute of Technology.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Competing interests
The authors declare no competing interests.
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Murali, A., Muthunagai, K. Disquisition on convergence, stability, and data dependence for a new fast iterative process. Sci Rep 14, 22712 (2024). https://doi.org/10.1038/s41598-024-73261-7
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41598-024-73261-7