Abstract

Translate

Recent developments in fixed-point theory have focused on iterative techniques for approximating solutions, yet there remain important questions about whether different methods are equivalent and how well they resist perturbations. In this study, two recently proposed algorithms, referred to as the DF and AR iteration methods, are shown to be connected by proving that they converge similarly when applied to contraction mappings in Banach spaces, provided that their control sequences meet specific, explicit conditions. This work extends previous research on data dependence by removing restrictive assumptions related to both the perturbed operator and the algorithmic parameters, thereby increasing the range of situations where the results are applicable. Utilizing a non-asymptotic analysis, the authors derive improved error bounds for fixed-point deviations under operator perturbations, achieving a tightening of these estimates by a factor of 3–15 compared to earlier results. A key contribution of this study is the demonstration that small approximation errors lead only to proportionally small deviations from equilibrium, which is formalized in bounds of the form $∥ s^{*} - {\tilde{s}}^{*} ∥ \leq O (ε / (1 - λ))$ . These theoretical findings are validated through applications involving integral equations and examples from function spaces. Overall, this work unifies the convergence analysis of different iterative methods, enhances guarantees regarding stability, and provides practical tools for robust computational methods in areas such as optimization, differential equations, and machine learning. By relaxing structural constraints and offering a detailed sensitivity analysis, this study significantly advances the design and understanding of iterative algorithms in applied mathematics.

Full text

Turn on search term navigation

Translate

1. Introduction and Preliminaries

Throughout the course of this study, $N$ will denote the set of natural numbers. Let $C$ be a non-empty closed and convex subset of the Banach space $B$ equipped with a norm $∥\cdot∥$ . We define $S : C \to C$ as a mapping, and $Fix (S) = \{x \in C : S x = x\}$ as the set encompassing all fixed points of $S$ within $C$ .

Since Banach’s pioneering contribution in 1922 [1], the Banach contraction principle, based on the class of contraction mappings, has attracted significant attention in mathematical research. A mapping $S : C \to C$ on a normed space $(C, ∥ \cdot ∥)$ is called a contraction if there exists a constant $λ \in [0, 1)$ such that

(1) $(\forall x, y \in C) ∥ S x - S y ∥ \leq λ ∥ x - y ∥ .$

Owing to its fundamental properties and strong potential for addressing complex problems across various disciplines, this class of mappings has been extensively studied under different structural frameworks. Consequently, it has emerged as a powerful tool in fixed-point theory. However, recognizing both the strengths and inherent limitations of contraction mappings, researchers have introduced more generalized classes that relax certain constraints while extending their applicability under broader conditions (see [2,3,4,5,6,7,8]). These generalized mappings have been investigated in terms of stability, existence, and uniqueness of fixed points, data dependence, and other qualitative aspects within diverse mathematical settings, including metric, topological, and normed spaces (see [9,10,11,12,13,14,15,16]). Moreover, numerous iterative algorithms have been developed to approximate the fixed points of such mappings, specifically addressing the challenges posed by modern computational problems (see [17,18,19,20,21,22,23,24,25]). While classical fixed-point iterations, such as those of Picard and Krasnoselskij, continue to serve as fundamental methods for solving nonlinear equations, emerging applications in high-dimensional optimization, machine learning, and perturbed dynamical systems expose the limitations of these traditional approaches. These domains require algorithms that offer enhanced stability, accelerated convergence, and robustness to approximation errors. To meet these demands, recent contributions by Filali et al. [26] and Alam and Rohen [27] have introduced two distinct approaches, hereinafter referred to as the “DF iteration algorithm” (Algorithm 1) and “AR iteration algorithm” (Algorithm 2), respectively, which will be examined in detail in the subsequent sections.

Algorithm 1: DF iteration algorithm

Input: A mapping

S

initial point

x_{0} \in C

\{ρ_{n}\}

\{σ_{n}\}

\{τ_{n}\} \subset [0, 1]

and budget N.

1: for

n = 0, 1, 2, \dots, N

w_{n} = S ((1 - τ_{n}) x_{n} + τ_{n} S x_{n})

y_{n} = S^{2} w_{n}

z_{n} = S ((1 - σ_{n}) S y_{n} + σ_{n} S w_{n})

x_{n + 1} = S ((1 - ρ_{n}) S y_{n} + ρ_{n} S z_{n})

3: end for

Output: Approximate solution

x_{N}

Algorithm 2: AR iteration algorithm

Input: A mapping

S

initial point

x_{0} \in C

\{ρ_{n}^{*}\}

\{σ_{n}^{*}\}

\{τ_{n}^{*}\} \subset [0, 1],

and budget N.

1: for

n = 0, 1, 2, \dots, N

w_{n}^{*} = S ((1 - τ_{n}^{*}) x_{n}^{*} + τ_{n}^{*} S x_{n}^{*})

y_{n}^{*} = S ((1 - σ_{n}^{*}) w_{n}^{*} + σ_{n}^{*} S w_{n}^{*})

z_{n}^{*} = S ((1 - ρ_{n}^{* "}) y_{n}^{*} + ρ_{n}^{*} S y_{n}^{*})

x_{n + 1}^{*} = S^{2} z_{n}^{*}

3: end for

Output: Approximate solution

x_{N}^{*}

Both studies presented a range of theoretical results, including convergence and stability analyses, as well as insights into the sensitivity of fixed points with respect to perturbations in contraction mappings. More specifically, the authors derived the following results concerning the data dependence of fixed points:

Theorem 1.

Let $S$ , $\tilde{S} : C \to C$ be two contractions with contractivity constant $λ \in [0, 1)$ and fixed points $s_{*}$ and ${\tilde{s}}_{*}$ , respectively. Suppose that there exists a maximum admissible error $ε > 0$ such that $∥S x - \tilde{S} x∥ \leq ε$ for all $x \in C$ (in this case, $S$ and $\tilde{S}$ are called approximate operators of each other).

(i) ([26], Theorem 5) Let $\{x_{n}\}$ and $\{{\tilde{x}}_{n}\}$ be the iterative sequences generated by the DF iteration algorithm associated with $S$ and $\tilde{S}$ , respectively. If the sequences $\{ρ_{n}\}$ , $\{σ_{n}\}$ , $\{τ_{n}\}$ in the DF iteration algorithm satisfy the conditions $1 / 2 \leq ρ_{n} \leq τ_{n}$ for all $n \in N$ and $\sum_{n = 1}^{\infty} ρ_{n} (1 - λ) = \infty$ , then it holds that

(2) $∥s_{*} - {\tilde{s}}_{*}∥ \leq \frac{15 ε}{1 - λ} .$

(ii) ([27], Theorem 8) Let $\{x_{n}^{*}\}$ and $\{{\tilde{x}}_{n}^{*}\}$ be the iterative sequences generated by the AR iteration algorithm associated with $S$ and $\tilde{S}$ , respectively. If the sequences $\{ρ_{n}^{*}\}$ , $\{σ_{n}^{*}\}$ , $\{τ_{n}^{*}\}$ in the DF iteration algorithm satisfy either of

$\sum_{n = 1}^{\infty} ρ_{n}^{*} (1 - λ) = \infty, \sum_{n = 1}^{\infty} σ_{n}^{*} (1 - λ) = \infty, a n d \sum_{n = 1}^{\infty} τ_{n}^{*} (1 - λ) = \infty,$

then it holds that

(3) $∥s_{*} - {\tilde{s}}_{*}∥ \leq \frac{15 ε}{1 - λ} .$

We should immediately point out that, in both results, the restrictions imposed on the control sequences $\{ρ_{n}\}$ , $\{σ_{n}\}$ , $\{τ_{n}\}$ , $\{ρ_{n}^{*}\}$ , $\{σ_{n}^{*}\}$ , $\{τ_{n}^{*}\} \subset [0, 1]$ and the imposed contraction condition on the mapping $\tilde{S}$ , significantly restrict the applicability of these theories. Indeed, when $S$ and $\tilde{S}$ are approximate operators of each other and $S$ is a $λ -$ contraction, the mapping $\tilde{S}$ satisfies the following condition for all x, $y \in C$ :

(4) $\begin{matrix} ∥\tilde{S} x - \tilde{S} y∥ & \leq ∥\tilde{S} x - S x∥ + ∥S x - S y∥ + ∥S y - \tilde{S} y∥ \\ \leq λ ∥x - y∥ + μ, \end{matrix}$

where

μ = 2 ε

. This demonstrates that

\tilde{S}

inherits a weakened contraction-like property, deviating from strict contractivity by an additive constant

μ

dependent on the approximation error

ε

. As is evident, any contraction mapping satisfies condition (4). However, as the following example illustrates, a mapping

\tilde{S}

that satisfies (4) does not necessarily satisfy the contraction condition given in (1).

Example 1.

Consider the space $C = [0, 1] \subset R$ equipped with the usual absolute value norm. Define the mappings $S, \tilde{S} : C \to C$ as follows:

$S x = \frac{x}{4} and \tilde{S} x = \{\begin{matrix} \frac{1 - x}{4}, & 0 \leq x \leq \frac{1}{2}, \\ \frac{2 - x}{4}, & \frac{1}{2} < x \leq 1 . \end{matrix}$

Then, we have

$|\tilde{S} x - S x| \leq \frac{1}{4} for all x \in C .$

So, we can choose $ε = 1 / 4$ . Since $\tilde{S}$ is discontinuous, it does not qualify as a contraction. However, it possesses a unique fixed point at $1 / 5$ . On the other hand, the mapping $\tilde{S}$ satisfies condition (4) with $λ = 1 / 4$ and $μ = 1 / 2$ . To verify this, we examine the following cases:

Cases 1 and 2: If $x, y \in [0, 1 / 2]$ or $x, y \in (1 / 2, 1]$ , then for any $μ > 0$ , we have

$|\tilde{S} x - \tilde{S} y| \leq \frac{1}{4} |x - y| \leq \frac{1}{4} |x - y| + μ .$

Cases 3 and 4: If $x \in [0, 1 / 2]$ and $y \in (1 / 2, 1]$ (or vice versa), then

$|\tilde{S} x - \tilde{S} y| = |- \frac{1}{4} - (\frac{x}{4} - \frac{y}{4})| \leq \frac{1}{4} |x - y| + \frac{1}{4} .$

Thus, considering all cases together, we conclude that the mapping $\tilde{S}$ satisfies condition (4) with $λ = 1 / 4$ and $μ = 1 / 2$ . (Note that while the theory requires $μ = 2 ε = 1 / 2$ , this example shows that $μ = 1 / 4$ is sufficient for the inequality to hold, indicating a tighter bound for this specific mapping.)

The example provided below illustrates that the condition delineated in (4) lacks sufficiency in ensuring the existence of fixed points for a mapping $\tilde{S}$ .

Example 2.

Let us consider the set $C = [0, 1] \subset R$ , equipped with the norm induced by the usual absolute value metric. Define the mappings $S, \tilde{S} : C \to C$ , as follows:

$S = \frac{8}{49} x and \tilde{S} x = \{\begin{matrix} \frac{x + 2}{x + 3}, & 0 \leq x < \frac{1}{2}, \\ \frac{x + 1}{x + 3}, & \frac{1}{2} \leq x \leq 1 . \end{matrix}$

Then, we have

$|\tilde{S} x - S x| \leq \frac{2}{3} for all x \in C .$

So, we can choose $ε = 2 / 3$ . We now demonstrate that the mapping $\tilde{S}$ satisfies the inequality in (4) under four cases.

Cases 1 and 2: If $x, y \in [0, 1 / 2)$ or $x, y \in [1 / 2, 1]$ , then for any $μ > 0$ , we obtain

$|\tilde{S} x - \tilde{S} y| = |\frac{x - y}{(x + 3) (y + 3)}| \leq \frac{1}{9} |x - y| \leq \frac{1}{9} |x - y| + μ,$

and

$|\tilde{S} x - \tilde{S} y| = |\frac{2 x - 2 y}{(x + 3) (y + 3)}| \leq \frac{8}{49} |x - y| \leq \frac{8}{49} |x - y| + μ,$

respectively. Hence, in both cases, the mapping $\tilde{S}$ satisfies the inequality in (4) for any $λ \in [8 / 49, 1)$ and any $μ > 0$ .

Cases 3 and 4: If $x \in [0, 1 / 2)$ and $y \in [1 / 2, 1]$ (or vice versa), then $\tilde{S} x = (x + 2) / (x + 3)$ and $\tilde{S} y = (y + 1) / (y + 3)$ . It is important to note that for every $x \in [0, 1 / 2)$

$\frac{d \tilde{S}}{d x} = \frac{1}{{(x + 3)}^{2}} > 0,$

and for every $y \in [1 / 2, 1]$

$\frac{d \tilde{S}}{d y} = \frac{2}{{(y + 3)}^{2}} > 0,$

indicating that $\tilde{S} x$ and $\tilde{S} y$ are increasing functions. Consequently,

$|\tilde{S} x - \tilde{S} y| = |\frac{x + 2}{x + 3} - \frac{y + 1}{y + 3}|$

reaches its maximum value when $y = 1 / 2$ and $x = 1 / 2$ . This implies that

$sup_{x \in [0, 1 / 2), y \in [1 / 2, 1]} |\tilde{S} x - \tilde{S} y| = \frac{2}{7},$

meaning that for every $x \in [0, 1 / 2)$ and $y \in [1 / 2, 1]$ , $|\tilde{S} x - \tilde{S} y| \leq 2 / 7$ . On the other hand, employing similar arguments, we obtain

$inf_{x \in [0, 1 / 2), y \in [1 / 2, 1]} |x - y| = 0,$

indicating that for every $x \in [0, 1 / 2)$ and $y \in [1 / 2, 1]$ , $0 \leq |x - y|$ . Thus, if $x \in [0, 1 / 2)$ and $y \in [1 / 2, 1]$ , then for any $λ \in [0, 1)$ and any $μ \geq 2 / 7$ , the following inequality holds:

$|\tilde{S} x - \tilde{S} y| \leq λ |x - y| + μ .$

As a result, for every $x, y \in [0, 1]$ , the mapping $\tilde{S}$ satisfies the inequality in (4) for any $λ \in [8 / 49, 1)$ and for any $μ \geq 2 / 7$ . (Note that while the theory guarantees the inequality for $μ = 2 ε = 4 / 3$ , this example demonstrates that a smaller $μ = 2 / 7$ is sufficient, indicating a tighter bound for this specific mapping). However, upon solving the equation $\tilde{S} x = x$ , we find that for $x \in [0, 1 / 2)$ , $x = - 1 \pm \sqrt{3} \notin [0, 1 / 2)$ , and for $x \in [1 / 2, 1]$ , $x = - 1 \pm \sqrt{2} \notin [1 / 2, 1]$ . Consequently, the mapping $\tilde{S}$ does not possess any fixed points for $x \in [0, 1]$ .

By Banach’s fixed-point theorem, the contraction mapping $S : C \to C$ guarantees the existence of a unique fixed point $s_{*} \in C$ . However, the approximate operator $\tilde{S} : C \to C$ , while satisfying inequality (4) deviates from strict contractivity because of the additive perturbation term $μ = 2 ε > 0$ . Although $\tilde{S}$ , lacks the classical contraction property, its structural proximity to $S$ permits an analysis of fixed-point stability. Specifically, if $μ$ is sufficiently small—as a consequence of the bounded approximation error $ε$ —the fixed points of $\tilde{S}$ , should they exist (say ${\tilde{s}}_{*}$ ), lie within a neighborhood of $s_{*}$ . By utilizing inequality (4) and employing a non-asymptotic approach, we derive a concrete upper bound for $∥s_{*} - {\tilde{s}}_{*}∥$ without relying on asymptotic assumptions, as required in Theorem 1. Specifically, we establish the following bound:

$\begin{matrix} ∥s_{*} - {\tilde{s}}_{*}∥ & \leq ∥S s_{*} - \tilde{S} s_{*}∥ + ∥\tilde{S} s_{*} - \tilde{S} {\tilde{s}}_{*}∥ \\ \leq ε + λ ∥s_{*} - {\tilde{s}}_{*}∥ + 2 ε, \end{matrix}$

which leads to

(5) $∥s_{*} - {\tilde{s}}_{*}∥ \leq \frac{3 ε}{1 - λ} .$

This result formalizes the intuition that small perturbations in the operator propagate controllably to its equilibria. While

\tilde{S}

does not inherently inherit the contraction property, the weakened inequality still enables meaningful conclusions about fixed-point proximity, illustrating the robustness of contraction-based frameworks under bounded approximations. Such insights are pivotal in applied settings, where numerical or modeling errors require tolerance analyses in dynamical systems and iterative algorithms.

The preceding discussions indicate that the applicability of the data-dependence results in parts (i) and (ii) of Theorem 1 can be further extended by relaxing the contraction assumption imposed on the mapping $\tilde{S}$ and instead treating $\tilde{S}$ merely as an approximate operator of the mapping $S$ .

In this study, we establish a convergence-equivalence result between the DF and AR iteration algorithms in approximating the fixed point of a contraction mapping. Moreover, we derive enhanced versions of the data-dependence results in parts (i) and (ii) of Theorem 1 by not only removing the contraction condition imposed on the mapping $\tilde{S}$ but also eliminating the constraints on the control sequences $\{ρ_{n}\}$ , $\{σ_{n}\}$ , $\{τ_{n}\}$ , $\{ρ_{n}^{*}\}$ , $\{σ_{n}^{*}\}$ , $\{τ_{n}^{*}\} \subset [0, 1]$ .

The following lemma plays a key role in establishing our results:

Lemma 1

([28]). Let ${\{Φ_{n}^{i}\}}_{n = 0}^{\infty}$ , $i = 1, 2, 3,$ be three sequences such that $Φ_{n}^{i} \geq 0$ for each $n \in N$ , $i = 1, 2, 3,$ $Φ_{n}^{3} \in (0, 1)$ for all $n \geq n_{0}$ , $\sum_{n = 1}^{\infty} Φ_{n}^{3} = \infty$ , $Φ_{n}^{2} = o (Φ_{n}^{3})$ , and

$(\forall n \in N) Φ_{n + 1}^{1} \leq (1 - Φ_{n}^{3}) Φ_{n}^{1} + Φ_{n}^{2} .$

It then holds that $lim_{n \to \infty} Φ_{n}^{1} = 0$ .

2. Main Results

In this section, we establish our main theoretical findings concerning the convergence behavior of the iterative processes under consideration. In particular, we compare the trajectories generated by the DF iteration and the AR iteration when applied to a contraction mapping. The significance of the following theorem lies in the fact that it provides conditions under which both iterative schemes not only converge to the unique fixed point $s_{*}$ of $S$ , but also approach each other asymptotically. This comparison allows us to assess the relative stability and efficiency of the algorithms, and highlights the robustness of their convergence under mild assumptions on the control sequences. We will now state the results precisely:

Theorem 2.

Let $S : C \to C$ be a λ-contraction mapping with a fixed point $s_{*}$ . Consider the sequences $\{x_{n}\}$ and $\{x_{n}^{*}\}$ , which are generated by the DF and AR iteration algorithms, respectively. The following statements are equivalent:

(i) Define the sequence $\{M_{n}\}$ for all $n \in N$ as

$M_{n} = max \{1 - τ_{n} (1 - λ), [1 - ρ_{n}^{*} (1 - λ)] [1 - σ_{n}^{*} (1 - λ)] [1 - τ_{n}^{*} (1 - λ)]\} .$

If the sequence ${\{\frac{2 λ^{5} M_{n}}{τ_{n} (1 - λ)}\}}_{n = 0}^{\infty}$ is bounded and $\sum_{n = 0}^{\infty} τ_{n} = \infty$ , then the sequence ${\{x_{n} - x_{n}^{*}\}}_{n = 0}^{\infty}$ converges strongly to 0, and ${\{x_{n}\}}_{n = 0}^{\infty}$ converges strongly to $s_{*}$ .

(ii) Define the sequence $\{M_{n}^{'}\}$ for all $n \in N$ as

$\begin{matrix} M_{n}^{'} = max {[1 - & min \{ρ_{n}^{*}, σ_{n}^{*}, τ_{n}^{*}\} (1 - λ)], \\ [1 - ρ_{n} (1 - ((1 - σ_{n}) λ^{2} + σ_{n}))] [1 - τ_{n} (1 - λ)]} . \end{matrix}$

If the sequence ${\{\frac{2 λ^{5} M_{n}^{'}}{min \{ρ_{n}^{*}, σ_{n}^{*}, τ_{n}^{*}\} (1 - λ)}\}}_{n = 0}^{\infty}$ is bounded and $\sum_{n = 0}^{\infty} min \{ρ_{n}^{*}, σ_{n}^{*}, τ_{n}^{*}\} = \infty$ , then the sequence ${\{x_{n}^{*} - x_{n}\}}_{n = 0}^{\infty}$ converges strongly to zero and ${\{x_{n}^{*}\}}_{n = 0}^{\infty}$ converges strongly to $s_{*}$ .

Proof.

(i) Using the inequality in (1) and employing the DF and AR iteration algorithms, we achieve the following for every $n \in N$ :

(6) $\begin{matrix} ∥x_{n + 1} - x_{n + 1}^{*}∥ & = ∥S ((1 - ρ_{n}) S y_{n} + ρ_{n} S z_{n}) - S^{2} z_{n}^{*}∥ \\ \leq λ ∥(1 - ρ_{n}) S y_{n} + ρ_{n} S z_{n} - S z_{n}^{*}∥ \\ \leq λ ∥(1 - ρ_{n}) S y_{n} + ρ_{n} S z_{n} - s_{*}∥ + λ ∥s_{*} - S z_{n}^{*}∥ \\ \leq λ (1 - ρ_{n}) ∥S y_{n} - S s_{*}∥ + λ ρ_{n} ∥S z_{n} - S s_{*}∥ + λ ∥S s_{*} - S z_{n}^{*}∥ \\ \leq λ^{2} (1 - ρ_{n}) ∥y_{n} - s_{*}∥ + λ^{2} ρ_{n} ∥z_{n} - s_{*}∥ + λ^{2} ∥s_{*} - z_{n}^{*}∥ \\ \leq λ^{2} (1 - ρ_{n}) ∥S^{2} w_{n} - s_{*}∥ + λ^{2} ρ_{n} ∥S ((1 - σ_{n}) S y_{n} + σ_{n} S w_{n}) - s_{*}∥ \\ + λ^{2} ∥S ((1 - ρ_{n}^{*}) y_{n}^{*} + ρ_{n}^{*} S y_{n}^{*}) - s_{*}∥ \\ \leq λ^{4} [1 - ρ_{n} + ρ_{n} \{(1 - σ_{n}) λ^{2} + σ_{n}\}] ∥w_{n} - s_{*}∥ \\ + λ^{3} [1 - ρ_{n}^{*} (1 - λ)] ∥y_{n}^{*} - s_{*}∥ \\ \leq λ^{5} [1 - ρ_{n} + ρ_{n} \{(1 - σ_{n}) λ^{2} + σ_{n}\}] [1 - τ_{n} (1 - λ)] ∥x_{n} - s_{*}∥ \\ + λ^{5} [1 - ρ_{n}^{*} (1 - λ)] [1 - σ_{n}^{*} (1 - λ)] [1 - τ_{n}^{*} (1 - λ)] ∥x_{n}^{*} - s_{*}∥ \\ \leq [1 - τ_{n} (1 - λ)] ∥x_{n} - x_{n}^{*}∥ + 2 λ^{5} M_{n} ∥x_{n}^{*} - s_{*}∥ . \end{matrix}$

where

$M_{n} = max \{1 - τ_{n} (1 - λ), [1 - ρ_{n}^{*} (1 - λ)] [1 - σ_{n}^{*} (1 - λ)] [1 - τ_{n}^{*} (1 - λ)]\} .$

Now, we set the following for every

n \in N

$\begin{matrix} Φ_{n}^{1} & : = ∥x_{n} - x_{n}^{*}∥ \geq 0, \\ Φ_{n}^{3} & : = τ_{n} (1 - λ) \in (0, 1), \\ Φ_{n}^{2} & : = 2 λ^{5} M_{n} ∥x_{n}^{*} - s_{*}∥ . \end{matrix}$

Since

{\{\frac{2 λ^{5} M_{n}}{τ_{n} (1 - λ)}\}}_{n = 0}^{\infty}

is bounded, there exists a number

μ > 0

such that for every

n \in N

, the following holds:

$|\frac{2 λ^{5} M_{n}}{τ_{n} (1 - λ)}| < μ .$

Moreover, since

{lim}_{n \to \infty} ∥x_{n}^{*} - s_{*}∥ = 0

according to ([27], Theorem 3), for any given

ε > 0

, there exists an

n_{0} \in N

such that for all

n \geq n_{0}

∥x_{n}^{*} - s_{*}∥ < ε / μ

. Thus, for every

n \geq n_{0}

, we have

$|\frac{2 λ^{5} M_{n}}{τ_{n} (1 - λ)}| ∥x_{n}^{*} - s_{*}∥ < ε$

which implies

lim_{n \to \infty} Φ_{n}^{2} / Φ_{n}^{3} = 0

, i.e.,

Φ_{n}^{2} = o (Φ_{n}^{3})

. Consequently, the inequality in (6) satisfies all the requirements of Lemma 1 and, therefore, we obtain

lim_{n \to \infty} ∥x_{n} - x_{n}^{*}∥ = 0

. On the other hand, since

∥x_{n} - s_{*}∥ \leq ∥x_{n} - x_{n}^{*}∥ + ∥x_{n}^{*} - s_{*}∥

, we can conclude that

lim_{n \to \infty} ∥x_{n} - s_{*}∥ = 0

(ii) Utilizing the inequality in (1) with AR and DF iteration algorithms, we obtain the following for all $n \in N$ :

(7) $\begin{matrix} ∥x_{n + 1}^{*} - x_{n + 1}∥ \leq & ∥S^{2} z_{n}^{*} - s_{*}∥ + ∥s_{*} - S ((1 - ρ_{n}) S y_{n} + ρ_{n} S z_{n})∥ \\ \leq & λ^{2} ∥z_{n}^{*} - s_{*}∥ + λ^{2} \{(1 - ρ_{n}) ∥s_{*} - y_{n}∥ + ρ_{n} ∥s_{*} - z_{n}∥\} \\ \leq & λ^{3} [1 - ρ_{n}^{*} (1 - λ)] ∥y_{n}^{*} - s_{*}∥ \\ + λ^{4} \{(1 - ρ_{n}) ∥s_{*} - w_{n}∥ + ρ_{n} [(1 - σ_{n}) ∥s_{*} - y_{n}∥ + σ_{n} ∥s_{*} - w_{n}∥]\} \\ \leq & λ^{5} [1 - ρ_{n}^{*} (1 - λ)] [1 - σ_{n}^{*} (1 - λ)] [1 - τ_{n}^{*} (1 - λ)] ∥x_{n}^{*} - s_{*}∥ \\ + λ^{5} [1 - ρ_{n} (1 - ((1 - σ_{n}) λ^{2} + σ_{n}))] [1 - τ_{n} (1 - λ)] ∥s_{*} - x_{n}∥ \\ \leq & λ^{5} [1 - ρ_{n}^{*} (1 - λ)] [1 - σ_{n}^{*} (1 - λ)] [1 - τ_{n}^{*} (1 - λ)] ∥x_{n}^{*} - x_{n}∥ \\ + λ^{5} [1 - ρ_{n}^{*} (1 - λ)] [1 - σ_{n}^{*} (1 - λ)] [1 - τ_{n}^{*} (1 - λ)] ∥x_{n} - s_{*}∥ \\ + λ^{5} [1 - ρ_{n} (1 - ((1 - σ_{n}) λ^{2} + σ_{n}))] [1 - τ_{n} (1 - λ)] ∥s_{*} - x_{n}∥ \\ \leq & [1 - min \{ρ_{n}^{*}, σ_{n}^{*}, τ_{n}^{*}\} (1 - λ)] ∥x_{n}^{*} - x_{n}∥ \\ + λ^{5} [1 - min \{ρ_{n}^{*}, σ_{n}^{*}, τ_{n}^{*}\} (1 - λ)] ∥x_{n} - s_{*}∥ \\ + λ^{5} [1 - ρ_{n} (1 - ((1 - σ_{n}) λ^{2} + σ_{n}))] [1 - τ_{n} (1 - λ)] ∥x_{n} - s_{*}∥ \\ \leq & [1 - min \{ρ_{n}^{*}, σ_{n}^{*}, τ_{n}^{*}\} (1 - λ)] ∥x_{n}^{*} - x_{n}∥ + 2 λ^{5} M_{n}^{'} ∥x_{n} - s_{*}∥, \end{matrix}$

where

$M_{n}^{'} = \{[1 - min \{ρ_{n}^{*}, σ_{n}^{*}, τ_{n}^{*}\} (1 - λ)], [1 - ρ_{n} (1 - ((1 - σ_{n}) λ^{2} + σ_{n}))] [1 - τ_{n} (1 - λ)]\} .$

Define the following for all

n \in N

$\begin{matrix} Φ_{n}^{1} & : = ∥x_{n}^{*} - x_{n}∥ \geq 0, \\ Φ_{n}^{3} & : = min \{ρ_{n}^{*}, σ_{n}^{*}, τ_{n}^{*}\} (1 - λ) \in (0, 1), \\ Φ_{n}^{2} & : = 2 λ^{5} M_{n}^{'} ∥x_{n} - s_{*}∥ . \end{matrix}$

Given that

{\{\frac{2 λ^{5} M_{n}^{'}}{min \{ρ_{n}^{*}, σ_{n}^{*}, τ_{n}^{*}\} (1 - λ)}\}}_{n = 0}^{\infty}

is bounded, there exists

μ > 0

such that for all

n \in N

$|\frac{2 λ^{5} M_{n}^{'}}{min \{ρ_{n}^{*}, σ_{n}^{*}, τ_{n}^{*}\} (1 - λ)}| < μ .$

Furthermore, as

lim_{n \to \infty} ∥x_{n} - s_{*}∥ = 0

according to ([26], Theorem 2), for any

ε > 0

, there exists an

n_{0} \in N

such that for all

n \geq n_{0}

∥x_{n} - s_{*}∥ < ε / μ

. Hence, for each

n \geq n_{0}

$|\frac{2 λ^{5} M_{n}^{'}}{min \{ρ_{n}^{*}, σ_{n}^{*}, τ_{n}^{*}\} (1 - λ)}| ∥x_{n} - s_{*}∥ < ε .$

This implies

lim_{n \to \infty} Φ_{n}^{2} / Φ_{n}^{3} = 0

Φ_{n}^{2} = o (Φ_{n}^{3})

. Thus, the inequality in (7) satisfies the conditions of Lemma 1, leading to

lim_{n \to \infty} ∥x_{n}^{*} - x_{n}∥ = 0

. Moreover, since

$∥x_{n}^{*} - s_{*}∥ \leq ∥x_{n}^{*} - x_{n}∥ + ∥x_{n} - s_{*}∥,$

we conclude that

lim_{n \to \infty} ∥x_{n}^{*} - s_{*}∥ = 0

. □

To demonstrate the applicability of Theorem 2, we will now provide an example based on a nonlinear differential equation. This example serves two purposes. First, it shows how an abstract contraction mapping arising from an integral operator can be constructed in a concrete functional setting. Second, it illustrates that the theoretical convergence results established in Theorem 2 can be verified numerically by examining the behavior of the DF and AR iteration schemes. In particular, we consider an initial value problem whose solution can be reformulated as a fixed-point problem, and then show that the corresponding operator is indeed a contraction mapping. This allows us to apply Theorem 2 directly and validate the convergence through numerical simulations.

Example 3.

Let $C^{2} [0, 1]$ denote the set of functions defined on $[0, 1]$ that possess continuous second-order derivatives, equipped with the supremum norm ${∥\cdot∥}_{\infty}$ . It is well known that $B = (C^{2} [0, 1], {∥\cdot∥}_{\infty})$ forms a Banach space. Now, consider the following initial value problem:

(8) $\frac{d^{2}}{d t^{2}} u (t) = \frac{u^{2} (t)}{2} - \frac{u (t)}{2} + \frac{1}{2}, u (0) = 1, \frac{d}{d t} u (0) = 1 .$

A potential solution to this problem can be expressed in the following integral form:

$u (t) = 1 + \int_{0}^{t} [1 + \int_{0}^{s} (\frac{u^{2} (x)}{2} - \frac{u (x)}{2} + \frac{1}{2}) d x] d s .$

Now, let $C = \{u (t) \in B : 0 \leq u (t) \leq 1\} \subset B$ . Then, the operator $S : C \to C$ , defined as

$S (u) (t) = 1 + \int_{0}^{t} [1 + \int_{0}^{s} (\frac{u^{2} (x)}{2} - \frac{u (x)}{2} + \frac{1}{2}) d x] d s,$

is a contraction mapping. Indeed, it satisfies the contraction property

$\begin{matrix} |S (u) - S (v)| = & |\int_{0}^{t} \{\int_{0}^{s} [(\frac{u^{2} (x)}{2} - \frac{u (x)}{2} + \frac{1}{2}) - (\frac{v^{2} (x)}{2} - \frac{v (x)}{2} + \frac{1}{2})] d x\} d s| \\ \leq & |\int_{0}^{t} \{\int_{0}^{s} {∥(\frac{u^{2} (x)}{2} - \frac{u (x)}{2} + \frac{1}{2}) - (\frac{v^{2} (x)}{2} - \frac{v (x)}{2} + \frac{1}{2})∥}_{\infty} d x\} d s| \\ \leq & {∥\int_{0}^{t} \{\int_{0}^{s} d x\} d s∥}_{\infty} {∥(\frac{u^{2} (t)}{2} - \frac{u (t)}{2} + \frac{1}{2}) - (\frac{v^{2} (t)}{2} - \frac{v (t)}{2} + \frac{1}{2})∥}_{\infty} \\ \leq & \frac{3}{10} {∥u (t) - v (t)∥}_{\infty} . \end{matrix}$

Now, for each $n \geq 1$ , we consider the following sequences:

$\begin{matrix} τ_{n} & = 1 - \frac{1}{n + 10}, ρ_{n} = 1 - \frac{1}{{(n + 10)}^{2}}, σ_{n} = 1 - \frac{1}{{(n + 10)}^{2}}, \\ τ_{n}^{*} & = 1 - \frac{1}{n + 10}, ρ_{n}^{*} = 1 - \frac{1}{n + 10}, σ_{n}^{*} = 1 - \frac{1}{n + 10} . \end{matrix}$

As illustrated in Figure 1 (top left), the sequences

${\{\frac{2 M_{n} λ^{5}}{τ_{n} (1 - λ)}\}}_{n \geq 1} a n d {\{\frac{2 M_{n}^{'} λ^{5}}{min \{τ_{n}^{*}, ρ_{n}^{*}, σ_{n}^{*}\} (1 - λ)}\}}_{n \geq 1}$

are both bounded, thereby satisfying the hypotheses of Theorem 2. Let

$RES (t, x_{n}) = |\frac{d^{2}}{d t} x_{n} (t) - (\frac{x_{n}^{2} (t)}{2} - \frac{x_{n} (t)}{2} + \frac{1}{2})|$

be the residual error for $n > 0$ . Figure 1 (top right) shows that, starting with the initial norm ${∥x_{0} - x_{0}^{*}∥}_{\infty} = 0$ , where $x_{0} (t) = x_{0}^{*} (t) = t + 1$ , the sequence ${\{{∥x_{n} - x_{n}^{*}∥}_{\infty}\}}_{n \geq 1}$ converges to 0, while the diagrams below, together with Table 1, illustrate that the sequences ${\{x_{n}\}}_{n \geq 1}$ and ${x_{n}^{*}}_{n \geq 1}$ converge to the fixed point of the mapping $S$ . Numbers in parentheses indicate decimal exponents.

Algorithms 3 and 4 provide theoretical error bounds when the exact operator $S$ is replaced by a perturbed operator $\tilde{S}$ , which can be interpreted as an approximation arising in practical applications. To illustrate the usefulness of this result, we consider a modified nonlinear differential equation. Such an example demonstrates how the admissible error $ε$ can be explicitly quantified in a functional setting, and how the theoretical estimates (9)–(10) compare with the actual numerical deviations observed in practice.

Theorem 3.

Let $S : C \to C$ be a λ-contraction mapping with a fixed point $s_{*}$ , and let $\tilde{S} : C \to C$ be a mapping. Consider the sequences $\{{\tilde{x}}_{n}\}$ and $\{{\tilde{x}}_{n}^{*}\}$ generated by the DF and AR iteration algorithms associated with $\tilde{S}$ , which are defined as follows:

Algorithm 3: DF iteration algorithm for

\tilde{S}

Input: A mapping

\tilde{S}

initial point

x_{0} \in C

\{ρ_{n}\}

\{σ_{n}\}

\{τ_{n}\} \subset [0, 1]

and budget N.

1: for

n = 0, 1, 2 \dots, N

{\tilde{w}}_{n} = \tilde{S} ((1 - τ_{n}) {\tilde{x}}_{n} + τ_{n} \tilde{S} {\tilde{x}}_{n})

{\tilde{y}}_{n} = {\tilde{S}}^{2} {\tilde{w}}_{n}

{\tilde{z}}_{n} = \tilde{S} ((1 - σ_{n}) \tilde{S} {\tilde{y}}_{n} + σ_{n} \tilde{S} {\tilde{w}}_{n})

{\tilde{x}}_{n + 1} = \tilde{S} ((1 - ρ_{n}) \tilde{S} {\tilde{y}}_{n} + ρ_{n} \tilde{S} {\tilde{z}}_{n})

3: end for

Output: Approximate solution

{\tilde{x}}_{N}

Algorithm 4: AR iteration algorithm for

\tilde{S}

Input: A mapping

\tilde{S}

initial point

x_{0} \in C

\{ρ_{n}^{*}\}

\{σ_{n}^{*}\}

\{τ_{n}^{*}\} \subset [0, 1]

and budget N.

1: for

n = 0, 1, 2 \dots, N

{\tilde{w}}_{n}^{*} = \tilde{S} ((1 - τ_{n}^{*}) {\tilde{x}}_{n}^{*} + τ_{n}^{*} \tilde{S} {\tilde{x}}_{n}^{*})

{\tilde{y}}_{n}^{*} = \tilde{S} ((1 - σ_{n}^{*}) {\tilde{w}}_{n}^{*} + σ_{n}^{*} \tilde{S} {\tilde{w}}_{n}^{*})

{\tilde{z}}_{n}^{*} = \tilde{S} ((1 - ρ_{n}^{*}) {\tilde{y}}_{n}^{*} + ρ_{n}^{*} \tilde{S} {\tilde{y}}_{n}^{*})

{\tilde{x}}_{n + 1}^{*} = {\tilde{S}}^{2} {\tilde{z}}_{n}^{*}

3: end for

Output: Approximate solution

{\tilde{x}}_{N}^{*}

Suppose the following conditions hold:

(C1) There exists a maximum admissible error $ε > 0$ such that

$(\forall x \in C) ∥S x - \tilde{S} x∥ \leq ε,$

(C2) There exists ${\tilde{s}}_{*} \in C$ such that $\tilde{S} {\tilde{s}}_{*} = {\tilde{s}}_{*}$ and both iterative sequences $\{{\tilde{x}}_{n}\}$ and $\{{\tilde{x}}_{n}^{*}\}$ converge to ${\tilde{s}}_{*}$ .

Then, the following bounds hold for the iterative sequences $\{{\tilde{x}}_{n}\}$ and $\{{\tilde{x}}_{n}^{*}\}$ , respectively:

(9) $∥s_{*} - {\tilde{s}}_{*}∥ \leq \frac{{(λ^{2} + 1)}^{2} (λ + 1)}{1 - λ^{5}} ε$

and

(10) $∥s_{*} - {\tilde{s}}_{*}∥ \leq \frac{(λ^{4} + λ^{3} + λ^{2} + 1) (λ + 1)}{1 - λ^{5}} ε .$

Proof.

We begin by deriving the bound presented in (9) for the term $∥s_{*} - {\tilde{s}}_{*}∥$ , utilizing the DF iteration algorithms associated with the mappings $S$ and $\tilde{S}$ . Using the contraction property of $S$ , condition (C1), and the DF iteration algorithm for both $S$ and $\tilde{S}$ , we obtain the following estimates:

$\begin{matrix} ∥w_{n} - {\tilde{w}}_{n}∥ & \leq ∥S ((1 - τ_{n}) x_{n} + τ_{n} S x_{n}) - S ((1 - τ_{n}) {\tilde{x}}_{n} + τ_{n} \tilde{S} {\tilde{x}}_{n})∥ \\ + ∥S ((1 - τ_{n}) {\tilde{x}}_{n} + τ_{n} \tilde{S} {\tilde{x}}_{n}) - \tilde{S} ((1 - τ_{n}) {\tilde{x}}_{n} + τ_{n} \tilde{S} {\tilde{x}}_{n})∥ \\ \leq λ ∥((1 - τ_{n}) x_{n} + τ_{n} S x_{n}) - ((1 - τ_{n}) {\tilde{x}}_{n} + τ_{n} \tilde{S} {\tilde{x}}_{n})∥ + ε \\ \leq λ [1 - τ_{n} (1 - λ)] ∥x_{n} - {\tilde{x}}_{n}∥ + λ τ_{n} ε + ε, \\ ∥y_{n} - {\tilde{y}}_{n}∥ & \leq ∥S (S w_{n}) - S (\tilde{S} {\tilde{w}}_{n})∥ + ∥S (\tilde{S} {\tilde{w}}_{n}) - \tilde{S} (\tilde{S} {\tilde{w}}_{n})∥ \\ \leq λ \{∥S w_{n} - S {\tilde{w}}_{n}∥ + ∥S {\tilde{w}}_{n} - \tilde{S} {\tilde{w}}_{n}∥\} + ε \\ \leq λ^{2} ∥w_{n} - {\tilde{w}}_{n}∥ + (λ + 1) ε, \\ ∥z_{n} - {\tilde{z}}_{n}∥ & \leq ∥S ((1 - σ_{n}) S y_{n} + σ_{n} S w_{n}) - S ((1 - σ_{n}) \tilde{S} {\tilde{y}}_{n} + σ_{n} \tilde{S} {\tilde{w}}_{n})∥ \\ + ∥S ((1 - σ_{n}) \tilde{S} {\tilde{y}}_{n} + σ_{n} \tilde{S} {\tilde{w}}_{n}) - \tilde{S} ((1 - σ_{n}) \tilde{S} {\tilde{y}}_{n} + σ_{n} \tilde{S} {\tilde{w}}_{n})∥ \\ \leq λ ∥(1 - σ_{n}) (S y_{n} - \tilde{S} {\tilde{y}}_{n}) + σ_{n} (S w_{n} - \tilde{S} {\tilde{w}}_{n})∥ + ε \\ \leq λ^{2} \{(1 - σ_{n}) ∥y_{n} - {\tilde{y}}_{n}∥ + σ_{n} ∥w_{n} - {\tilde{w}}_{n}∥\} + (λ + 1) ε, \\ ∥x_{n + 1} - {\tilde{x}}_{n + 1}∥ & \leq ∥S ((1 - ρ_{n}) S y_{n} + ρ_{n} S z_{n}) - S ((1 - ρ_{n}) \tilde{S} {\tilde{y}}_{n} + ρ_{n} \tilde{S} {\tilde{z}}_{n})∥ \\ + ∥S ((1 - ρ_{n}) \tilde{S} {\tilde{y}}_{n} + ρ_{n} \tilde{S} {\tilde{z}}_{n}) - \tilde{S} ((1 - ρ_{n}) \tilde{S} {\tilde{y}}_{n} + ρ_{n} \tilde{S} {\tilde{z}}_{n})∥ \\ \leq λ \{(1 - ρ_{n}) \{∥S y_{n} - S {\tilde{y}}_{n}∥ + ε\} + ρ_{n} \{∥S z_{n} - S {\tilde{z}}_{n}∥ + ε\}\} + ε \\ \leq λ^{2} \{(1 - ρ_{n}) ∥y_{n} - {\tilde{y}}_{n}∥ + ρ_{n} ∥z_{n} - {\tilde{z}}_{n}∥\} + (λ + 1) ε, \end{matrix}$

By combining these inequalities, we obtain

(11) $\begin{matrix} ∥x_{n + 1} - {\tilde{x}}_{n + 1}∥ & \leq λ^{5} [(1 - ρ_{n}) + ρ_{n} λ^{2} (1 - σ_{n}) + ρ_{n} σ_{n}] [1 - τ_{n} (1 - λ)] ∥x_{n} - {\tilde{x}}_{n}∥ \\ + λ^{4} [(1 - ρ_{n}) + ρ_{n} λ^{2} (1 - σ_{n}) + ρ_{n} σ_{n}] (λ τ_{n} ε + ε) \\ + λ^{2} [(1 - ρ_{n}) + ρ_{n} λ^{2} (1 - σ_{n})] (λ + 1) ε + λ^{2} ρ_{n} (λ + 1) ε + (λ + 1) ε . \end{matrix}$

Since for every

n \in N

ρ_{n}

σ_{n}

, and

τ_{n} \in [0, 1]

and

λ \in [0, 1)

, we conclude that

$∥x_{n + 1} - {\tilde{x}}_{n + 1}∥ \leq λ^{5} ∥x_{n} - {\tilde{x}}_{n}∥ + (λ^{4} + 2 λ^{2} + 1) (λ + 1) ε .$

From ([26], Theorem 2), we have

lim_{n \to \infty} x_{n} = s_{*}

and under assumption (C2), we also have

lim_{n \to \infty} {\tilde{x}}_{n} = {\tilde{s}}_{*}

. Taking the limit on both sides of the final inequality yields

$∥s_{*} - {\tilde{s}}_{*}∥ \leq \frac{{(λ^{2} + 1)}^{2} (λ + 1)}{1 - λ^{5}} ε .$

Next, we derive the bound specified in (10) for the quantity

∥s_{*} - {\tilde{s}}_{*}∥

by utilizing the AR iteration algorithms associated with the mappings

S

and

\tilde{S}

. By leveraging the contraction property of

S

, assumption (C1), and the AR iteration algorithm for both

S

and

\tilde{S}

, the following estimates can be derived in a manner similar to the previous ones:

$\begin{matrix} ∥w_{n}^{*} - {\tilde{w}}_{n}^{*}∥ \leq & λ [1 - τ_{n}^{*} (1 - λ)] ∥x_{n}^{*} - {\tilde{x}}_{n}^{*}∥ + λ τ_{n}^{*} ε + ε, \\ ∥y_{n}^{*} - {\tilde{y}}_{n}^{*}∥ \leq & λ [1 - σ_{n}^{*} (1 - λ)] ∥w_{n}^{*} - {\tilde{w}}_{n}^{*}∥ + λ σ_{n}^{*} ε + ε, \\ ∥z_{n} - {\tilde{z}}_{n}∥ \leq & λ [1 - ρ_{n}^{*} (1 - λ)] ∥y_{n}^{*} - {\tilde{y}}_{n}^{*}∥ + λ ρ_{n}^{*} ε + ε, \\ ∥x_{n + 1} - {\tilde{x}}_{n + 1}∥ \leq & λ^{2} ∥z_{n}^{*} - {\tilde{z}}_{n}^{*}∥ + (λ + 1) ε . \end{matrix}$

By successively substituting these bounds, we obtain the following:

(12) $\begin{matrix} ∥x_{n + 1} - {\tilde{x}}_{n + 1}∥ & \leq λ^{5} [1 - ρ_{n}^{*} (1 - λ)] [1 - σ_{n}^{*} (1 - λ)] [1 - τ_{n}^{*} (1 - λ)] ∥x_{n}^{*} - {\tilde{x}}_{n}^{*}∥ \\ + λ^{4} [1 - ρ_{n}^{*} (1 - λ)] [1 - σ_{n}^{*} (1 - λ)] (λ τ_{n}^{*} ε + ε) \\ + λ^{3} [1 - ρ_{n}^{*} (1 - λ)] (λ σ_{n}^{*} ε + ε) + λ^{2} (λ ρ_{n}^{*} ε + ε) + (λ + 1) ε . \end{matrix}$

Since for every

n \in N

ρ_{n}^{*}

σ_{n}^{*}

, and

τ_{n}^{*} \in [0, 1]

and

λ \in [0, 1)

, it follows that

$∥x_{n + 1} - {\tilde{x}}_{n + 1}∥ \leq λ^{5} ∥x_{n}^{*} - {\tilde{x}}_{n}^{*}∥ + (λ^{4} + λ^{3} + λ^{2} + 1) (λ + 1) ε .$

From ([27], Theorem 3), we know that

lim_{n \to \infty} x_{n} = s_{*}

, and under assumption (C2), we also have

lim_{n \to \infty} {\tilde{x}}_{n} = {\tilde{s}}_{*}

. Taking limits on both sides of the last inequality, we finally obtain

$∥s_{*} - {\tilde{s}}_{*}∥ \leq \frac{(λ^{4} + λ^{3} + λ^{2} + 1) (λ + 1)}{1 - λ^{5}} ε,$

which completes the proof. □

To clarify the applicability of Theorem 3, we present a concrete example constructed from a nonlinear differential equation. This will allow us to explicitly see how the perturbation of the operator affects the fixed point and how the theoretical error bounds are reflected in practice.

Example 4.

Let $B$ , $C$ , $S$ , $\{ρ_{n}\}$ , $\{σ_{n}\}$ , $\{τ_{n}\}$ , $\{ρ_{n}^{*}\}$ , $\{σ_{n}^{*}\}$ , and $\{τ_{n}^{*}\}$ be defined as in Example 3. We now consider the following second-order initial value problem

$\frac{d^{2}}{d t^{2}} u (t) = \frac{u^{2} (t)}{2} - \frac{u (t)}{2} + \frac{u^{2} (t) - u^{3} (t)}{10^{2}} + \frac{1}{2}, u (0) = 1, \frac{d}{d t} u (0) = 1 .$

A possible solution to this problem can be formulated as an integral equation:

$u (t) = 1 + \int_{0}^{t} (1 + \int_{0}^{s} (\frac{u^{2} (x)}{2} - \frac{u (x)}{2} + \frac{u^{2} (x) - u^{3} (x)}{10^{2}} + \frac{1}{2}) d x) d s .$

Define an operator $\tilde{S} : C \to C$ as follows:

$\tilde{S} (u) (t) = 1 + \int_{0}^{t} (1 + \int_{0}^{s} (\frac{u^{2} (x)}{2} - \frac{u (x)}{2} + \frac{u^{2} (x) - u^{3} (x)}{10^{2}} + \frac{1}{2}) d x) d s .$

Thus, we can establish the following bound:

$\begin{matrix} |S (u) - \tilde{S} (u)| = & | 1 + \int_{0}^{t} (1 + \int_{0}^{s} (\frac{u^{2} (x)}{2} - \frac{u (x)}{2} + \frac{1}{2}) d x) d s \\ - (1 + \int_{0}^{t} (1 + \int_{0}^{s} (\frac{u^{2} (x)}{2} - \frac{u (x)}{2} + \frac{u^{2} (x) - u^{3} (x)}{10^{2}} + \frac{1}{2}) d x) d s) | \\ \leq & |\int_{0}^{t} (\int_{0}^{s} (\frac{u^{2} (x) - u^{3} (x)}{10^{2}} + \frac{1}{2}) d x) d s| \\ \leq & \frac{1}{2} {∥\frac{u^{2} (t) - u^{3} (t)}{10^{2}}∥}_{\infty} < 7.42 \times 10^{- 4} = ε . \end{matrix}$

The obtained value $7.42 \times 10^{- 4}$ represents the admissible tolerance ε, showing that the error in the approximation does not exceed this bound. As in Example 3, we introduce the residual error for the sequence ${{\tilde{x}}_{n}}$ by

$RES (t, {\tilde{x}}_{n}) = |\frac{d^{2}}{d t^{2}} {\tilde{x}}_{n} (t) - (\frac{{\tilde{x}}_{n}^{2} (t)}{2} - \frac{{\tilde{x}}_{n} (t)}{2} + \frac{{\tilde{x}}_{n}^{2} (t) - {\tilde{x}}_{n}^{3} (t)}{10^{2}} + \frac{1}{2})| .$

From Table 2 and Figure 2, starting with the initial function ${\tilde{x}}_{0} (t) = {\tilde{x}}_{0}^{*} (t) = t + 1$ , it is evident that the sequences ${{\tilde{x}}_{n}}_{n \geq 1}$ and ${{\tilde{x}}_{n}^{*}}_{n \geq 1}$ exhibit convergence toward a fixed point of $\tilde{S}$ . As a result, all the conditions of Theorem 3 are satisfied, thereby confirming the validity of the estimates in (9) and (10), as demonstrated below:

${∥s_{*} - {\tilde{s}}_{*}∥}_{\infty} \leq 8.55 \times 10^{- 4} \leq 1.15 \times 10^{- 3} = \frac{{(λ^{2} + 1)}^{2} (λ + 1)}{1 - λ^{5}} ε,$

${∥s_{*} - {\tilde{s}}_{*}∥}_{\infty} \leq 9.678 \times 10^{- 4} \leq 1.38 \times 10^{- 3} = \frac{(λ^{4} + λ^{3} + λ^{2} + 1) (λ + 1)}{1 - λ^{5}} ε .$

The numerical estimates demonstrate that the deviations $| s^{*} - {\tilde{s}}^{*} |_{\infty}$ are bounded by $8.55 \times 10^{- 4}$ and $9.678 \times 10^{- 4}$ , which remain well within the respective theoretical tolerances $\frac{{(λ^{2} + 1)}^{2} (λ + 1)}{1 - λ^{5}} ε$ and $\frac{(λ^{4} + λ^{3} + λ^{2} + 1) (λ + 1)}{1 - λ^{5}} ε$ , thereby confirming both the accuracy of the numerical scheme and the sharpness of the established analytical bounds.

The numerical outcomes presented in Table 2 and Figure 2 highlight two important observations. First, the residual errors decrease rapidly with each iteration, confirming the strong convergence of both DF and AR schemes towards the fixed point of $\tilde{S}$ . Second, the measured deviations between $s_{*}$ and ${\tilde{s}}_{*}$ remain well within the analytical error bounds derived in Theorem 3. This shows that estimates (9) and (10) are not only mathematically valid, but also numerically sharp. Consequently, Example 4 provides concrete evidence of the stability and reliability of the proposed iterative methods when small perturbations are introduced into the underlying operator.

Remark 1.

(1) The estimates provided in Theorem 3 within (9) and (10) for the quantity $∥s_{*} - {\tilde{s}}_{*}∥$ offer substantially more precise approximations than the corresponding ones presented in parts (i) and (ii) of Theorem 1. Additionally, a comparative analysis of the estimates given in (9) and (10) reveals that the bound in (9) exhibits superior accuracy compared to that in (10).

Furthermore, by utilizing the identity

$\frac{1}{1 - λ^{k + 1}} \sum_{i = 0}^{k} λ^{i} = \frac{1}{1 - λ}, for all k \in N,$

we derive the following asymptotic results:

(D1) Taking the limit as $n \to \infty$ under the assumption that $ρ_{n}$ , $σ_{n}$ , $τ_{n} \to 0$ , the inequality given in (11) leads to

(13) $∥s_{*} - {\tilde{s}}_{*}∥ \leq \frac{λ^{4} + λ^{3} + λ^{2} + λ + 1}{1 - λ^{5}} ε = \frac{ε}{1 - λ} .$

(D2) As $n \to \infty$ , assuming $ρ_{n}$ , $σ_{n}$ , $τ_{n} \to 1$ , the inequality from (11) results in

(14) $∥s_{*} - {\tilde{s}}_{*}∥ \leq \frac{λ^{5} + λ^{4} + λ^{3} + λ^{2} + λ + 1}{1 - λ^{6}} ε = \frac{ε}{1 - λ} .$

(D3) Taking the limit as $n \to \infty$ with $ρ_{n}^{*}$ , $σ_{n}^{*}$ , $τ_{n}^{*} \to 0$ , the inequality from (12) yields

(15) $∥s_{*} - {\tilde{s}}_{*}∥ \leq \frac{λ^{4} + λ^{3} + λ^{2} + λ + 1}{1 - λ^{5}} ε = \frac{ε}{1 - λ} .$

(D4) Finally, as $n \to \infty$ under the condition $ρ_{n}^{*}$ , $σ_{n}^{*}$ , $τ_{n}^{*} \to 1$ , applying the limit to the inequality in (12) gives

(16) $∥s_{*} - {\tilde{s}}_{*}∥ \leq \frac{λ^{7} + λ^{6} + λ^{5} + λ^{4} + λ^{3} + λ^{2} + λ + 1}{1 - λ^{8}} ε = \frac{ε}{1 - λ} .$

Based on these results, it follows that in cases (D1) and (D2), the estimates obtained in (13) and (14) are more precise than the bound in (9). Similarly, for cases (D3) and (D4), the estimates in (15) and (16) yield more refined approximations than that in (10).

(2) Let the mappings $S$ and $\tilde{S}$ be as defined in Theorem 3. Then, we observe that

$\begin{matrix} ∥s_{*} - {\tilde{s}}_{*}∥ & = ∥S s_{*} - \tilde{S} {\tilde{s}}_{*}∥ \\ \leq ∥S s_{*} - S {\tilde{s}}_{*}∥ + ∥S {\tilde{s}}_{*} - \tilde{S} {\tilde{s}}_{*}∥ \\ \leq λ ∥s_{*} - {\tilde{s}}_{*}∥ + sup_{x \in C} ∥S x - \tilde{S} x∥, \end{matrix}$

where, due to condition (C1), we have

$sup_{x \in C} ∥S x - \tilde{S} x∥ \leq ε,$

which leads to

(17) $∥s_{*} - {\tilde{s}}_{*}∥ \leq \frac{ε}{1 - λ} .$

Thus, using a more straightforward approach, we obtain a tighter bound for $∥s_{*} - {\tilde{s}}_{*}∥$ compared to those provided in (9) and (10).

(3) Table 3 presents a comparison of the results obtained from the analyses conducted to establish an upper bound for $∥s_{*} - {\tilde{s}}_{*}∥$ :

Example 5.

Let $B$ , $C$ , $S$ , and $\tilde{S}$ be defined as in Example 4.

(D1) Consider the parametrized sequences $\{τ_{n}\}$ , $\{ρ_{n}\}$ , $\{σ_{n}\}$ , prescribed by

$τ_{n} = \frac{1}{n + 10}, ρ_{n} = \frac{1}{{(n + 10)}^{2}}, σ_{n} = \frac{1}{{(n + 10)}^{2}}$

for all $n \geq 1$ . These sequences exhibit asymptotic behavior $τ_{n}, ρ_{n}, σ_{n} \to 0$ as n $\to \infty$ . As empirically validated by Figure 3, the iterative sequence ${x_{n}}_{n \geq 1}$ , starting with the initial $x_{0} (t) = t + 1$ , converges to the fixed point of $S$ , while ${{\tilde{x}}_{n}}_{n \geq 1}$ , starting with the initial ${\tilde{x}}_{0} (t) = t + 1$ , converges to the fixed point of $\tilde{S}$ . A quantitative assessment yields

${∥s_{*} - {\tilde{s}}_{*}∥}_{\infty} \leq 9.55 \times 10^{- 4} \leq 1.05 \times 10^{- 3} = \frac{ε}{1 - λ} .$

(D2) Building on Example 4, define the sequences

$τ_{n} = 1 - \frac{1}{n + 10}, ρ_{n} = 1 - \frac{1}{{(n + 10)}^{2}}, σ_{n} = 1 - \frac{1}{{(n + 10)}^{2}}$

for all $n \geq 1$ . Here, $τ_{n}, ρ_{n}, σ_{n} \to 1$ as $n \to \infty$ . Graphical results in Figure 3 (left and right) confirm that ${x_{n}}_{n \geq 1}$ and ${{\tilde{x}}_{n}}_{n \geq 1}$ , starting with the initial $x_{0} (t) = {\tilde{x}}_{0} (t) = t + 1$ , converge to $s_{*}$ and ${\tilde{s}}_{*}$ , respectively. The error propagation adheres to the bound:

${∥s_{*} - {\tilde{s}}_{*}∥}_{\infty} \leq 8.55 \times 10^{- 4} \leq 1.05 \times 10^{- 3} = \frac{ε}{1 - λ} .$

(D3) Let the sequences $\{τ_{n}^{*}\}$ , $\{ρ_{n}^{*}\}$ , and $\{σ_{n}^{*}\}$ be specified via

$τ_{n}^{*} = \frac{1}{(n + 10)}, ρ_{n}^{*} = \frac{1}{n + 10}, σ_{n}^{*} = \frac{1}{n + 10}$

for all $n \geq 1$ . These sequences satisfy $τ_{n}^{*}$ , $ρ_{n}^{*}$ , $σ_{n}^{*} \to 0$ as n $\to \infty$ . As depicted in Figure 4 (left and right), ${x_{n}^{*}}_{n \geq 1}$ and ${{\tilde{x}}_{n}^{*}}_{n \geq 1}$ , starting with the initial $x_{0}^{*} (t) = {\tilde{x}}_{0}^{*} (t) = t + 1$ , converge to $s_{*}$ and ${\tilde{s}}_{*}$ , respectively. The deviation between fixed points is bounded by

${∥s_{*} - {\tilde{s}}_{*}∥}_{\infty} \leq 8.73 \times 10^{- 4} \leq 1.05 \times 10^{- 3} = \frac{ε}{1 - λ} .$

(D4) Adopting the framework of Example 4, define

$τ_{n}^{*} = 1 - \frac{1}{n + 10}, ρ_{n}^{*} = 1 - \frac{1}{n + 10}, σ_{n}^{*} = 1 - \frac{1}{n + 10}$

for all $n \geq 1$ . Then, $τ_{n}^{*}$ , $ρ_{n}^{*}$ , $σ_{n}^{*} \to 1$ as n $\to \infty$ . Starting with the initial $x_{0}^{*} (t) = {\tilde{x}}_{0}^{*} (t) = t + 1$ , Figure 1 (bottom-right) and Figure 2 (right) illustrate the convergence of ${x_{n}^{*}}_{n \geq 1}$ and ${{\tilde{x}}_{n}^{*}}_{n \geq 1}$ to $s_{*}$ and ${\tilde{s}}_{*}$ , respectively. The empirical error remains well within the theoretical upper limit

${∥s_{*} - {\tilde{s}}_{*}∥}_{\infty} \leq 9.678 \times 10^{- 4} \leq 1.05 \times 10^{- 3} = \frac{ε}{1 - λ} .$

3. Discussion

The equivalence of convergence between the DF and AR algorithms (Theorem 2) underscores a deeper structural symmetry in their iterative mechanisms, which had not been previously recognized. This finding simplifies comparative analyses in applications where algorithm selection is non-trivial. Our data-dependence results (Theorem 3) significantly improve upon the works of Filali et al. [26] and Alam et al. [27], by removing the requirement for $\tilde{S}$ to be a strict contraction, instead permitting it to satisfy a weakened inequality $∥\tilde{S} x - \tilde{S} y∥ \leq λ ∥x - y∥ + μ$ . This generalization is critical for real-world scenarios where numerical approximations or noisy data inherently violate strict contractivity. A notable limitation lies in the assumption of a uniform bound $ε$ on $∥S x - \tilde{S} x∥$ , which may not hold in unbounded domains. Additionally, while our focus on Banach spaces covers a broad class of problems, extending these results to metric spaces with non-linear structures—such as hyperbolic or CAT(0) spaces—remains an open challenge.

4. Conclusions

The primary contribution of this study is the derivation of enhanced data-dependence estimates without imposing stringent contraction conditions on the perturbed operator. By employing a non-asymptotic approach, we establish explicit error bounds on the perturbations of fixed points, given by $∥s_{*} - {\tilde{s}}_{*}∥ \leq O (ε / (1 - λ))$ , and demonstrate that small perturbations in the operator systematically propagate to their corresponding equilibria in a controlled and quantifiable manner. These refined estimates offer stronger theoretical guarantees compared to existing results, thereby improving the robustness of the framework in practical applications where numerical approximations and modeling inaccuracies are unavoidable. Furthermore, we characterize the conditions under which the DF and AR iteration algorithms exhibit equivalent convergence behavior, providing a unified theoretical perspective on their properties. Our analysis reveals that, under specific conditions, both algorithms demonstrate comparable stability and sensitivity characteristics. Additionally, we refine the data-dependence analysis in the context of contraction mappings by relaxing restrictive assumptions on control sequences and underlying mappings, thereby broadening the scope and applicability of asymptotic data-dependence results. These findings are substantiated through rigorous theoretical analysis and illustrative examples. The insights derived from this study contribute to a deeper understanding of fixed-point approximation methods and their sensitivity to perturbations. Future research directions include extending these results to more general classes of contractive mappings and investigating their implications in optimization, differential equations, and machine learning algorithms.

Author Contributions

Conceptualization, E.H., F.G., and G.V.M.; data curation, E.H. and K.D.; methodology, E.H., F.G., and G.V.M.; formal analysis, K.D., E.H., F.G., G.V.M., and M.E.; investigation, K.D., E.H., F.G., G.V.M., and M.E.; resources, K.D., E.H., F.G., G.V.M., and M.E.; writing—original draft preparation, K.D., E.H., and F.G.; writing—review and editing, K.D., E.H., F.G., G.V.M., and M.E.; visualization, K.D., E.H., F.G., and G.V.M.; supervision, E.H., F.G., and G.V.M.; project administration, G.V.M.; funding acquisition, E.H., F.G., G.V.M., and M.E. All authors have read and agreed to the published version of the manuscript.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare that they have no conflicts of interest related to this work. They have no financial, personal, or professional relationships that could be construed as having influenced the research, analysis, or conclusions presented in this paper.

Footnotes

Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Figures and Tables

Figure 1 (top) The first 100 terms of the sequences: $\{\frac{2 M_{n} λ^{5}}{τ_{n} (1 - λ)}\}$ and $\{\frac{2 M_{n}^{'} λ^{5}}{min \{τ_{n}^{*}, ρ_{n}^{*}, σ_{n}^{*}\} (1 - λ)}\}$ (left) and ${x_{n}}$ and ${x_{n}^{*}}$ (right); (bottom) residual errors $RES (t, x_{n})$ (left) and $RES (t, x_{n}^{*})$ (right) for $n = 1$ and 2.

Figure 2 Residual errors $RES (t, {\tilde{x}}_{n})$ (left) and $RES (t, {\tilde{x}}_{n}^{*})$ (right) for $n = 1$ and 2.

Figure 3 The residual errors $RES (t, x_{n}) = |\frac{d^{2}}{d t^{2}} x_{n} (t) - (\frac{x_{n}^{2} (t)}{2} - \frac{x_{n} (t)}{2} + \frac{1}{2})|$ (left) and $RES (t, {\tilde{x}}_{n}) = |\frac{d^{2}}{d t^{2}} {\tilde{x}}_{n} (t) - (\frac{{\tilde{x}}_{n}^{2} (t)}{2} - \frac{{\tilde{x}}_{n} (t)}{2} + \frac{{\tilde{x}}_{n}^{2} (t) - {\tilde{x}}_{n}^{3} (t)}{10^{2}} + \frac{1}{2})|$ (right) for $n = 1$ and 2.

Figure 4 The residual errors $RES (t, {\tilde{x}}_{n}^{*}) = |\frac{d^{2}}{d t^{2}} x_{n}^{*} (t) - (\frac{{(x_{n}^{*})}^{2} (t)}{2} - \frac{x_{n}^{*} (t)}{2} + \frac{1}{2})|$ (left) and $RES (t, {\tilde{x}}_{n}^{*}) = |\frac{d^{2}}{d t^{2}} {\tilde{x}}_{n}^{*} (t) - (\frac{{({\tilde{x}}_{n}^{*})}^{2} (t)}{2} - \frac{{\tilde{x}}_{n}^{*} (t)}{2} + \frac{{({\tilde{x}}_{n}^{*})}^{2} (t) - {({\tilde{x}}_{n}^{*})}^{3} (t)}{10^{2}} + \frac{1}{2})|$ (right) for $n = 1$ and 2.

Table 1

Numerical values of the residual errors $RES (t, x_{n})$ and $RES (t, x_{n}^{*})$ for $n = 1$ and 2.

t	$RES (t, x_{1})$	$RES (t, x_{2})$	$RES (t, x_{1}^{*})$	$RES (t, x_{2}^{*})$
0.	0.	0.	0.	0.
0.1	$6.39 (- 20)$	$2.10 (- 40)$	$2.08 (- 22)$	$2.10 (- 33)$
0.2	$1.14 (- 16)$	$1.53 (- 32)$	$1.89 (- 20)$	$1.53 (- 31)$
0.3	$1.10 (- 14)$	$1.17 (- 27)$	$4.97 (- 19)$	$1.17 (- 30)$
0.4	$3.19 (- 13)$	$4.56 (- 26)$	$1.28 (- 17)$	$4.56 (- 26)$
0.5	$4.72 (- 12)$	$1.28 (- 24)$	$2.15 (- 16)$	$1.28 (- 24)$
0.6	$4.56 (- 11)$	$2.98 (- 19)$	$2.49 (- 15)$	$2.99 (- 23)$
0.7	$3.27 (- 10)$	$6.09 (- 19)$	$2.22 (- 14)$	$6.10 (- 21)$
0.8	$1.89 (- 9)$	$1.13 (- 18)$	$1.63 (- 13)$	$1.13 (- 20)$
0.9	$9.25 (- 9)$	$1.96 (- 17)$	$1.03 (- 12)$	$1.97 (- 18)$
1.	$3.98 (- 8)$	$3.21 (- 17)$	$5.78 (- 12)$	$3.22 (- 17)$

Table 2

Numerical values of the residual errors $RES (t, {\tilde{x}}_{n})$ and $RES (t, {\tilde{x}}_{n}^{*})$ for $n = 1$ and 2.

t	$RES (t, {\tilde{x}}_{1})$	$RES (t, {\tilde{x}}_{2})$	$RES (t, {\tilde{x}}_{1}^{*})$	$RES (t, {\tilde{x}}_{2}^{*})$
0.	0.	0.	0.	0.
0.1	$7.19 (- 20)$	$8.42 (- 40)$	$1.90 (- 24)$	$2.79 (- 37)$
0.2	$1.30 (- 16)$	$1.12 (- 33)$	$4.09 (- 21)$	$3.62 (- 33)$
0.3	$1.27 (- 14)$	$2.00 (- 27)$	$4.38 (- 19)$	$6.26 (- 29)$
0.4	$3.73 (- 13)$	$1.55 (- 26)$	$1.45 (- 17)$	$4.74 (- 25)$
0.5	$5.60 (- 12)$	$7.65 (- 22)$	$2.56 (- 16)$	$2.28 (- 24)$
0.6	$5.49 (- 11)$	$2.82 (- 22)$	$3.06 (- 15)$	$8.25 (- 23)$
0.7	$4.01 (- 10)$	$8.53 (- 20)$	$2.79 (- 14)$	$2.44 (- 21)$
0.8	$2.36 (- 9)$	$2.22 (- 20)$	$2.10 (- 13)$	$6.25 (- 20)$
0.9	$1.18 (- 8)$	$5.15 (- 19)$	$1.36 (- 12)$	$1.43 (- 18)$
1.	$5.19 (- 8)$	$1.08 (- 18)$	$7.90 (- 12)$	$2.99 (- 18)$

Table 3

Comparison of the coefficients of $ε / (1 - λ)$ across these bounds for a typical $λ \in [0, 1)$ .

Bound in	Coefficient	Improvement Factor (vs.Original 15)
(2) or (3)	15	–
(5)	3	$5 \times$
(9)	$\frac{{(λ^{2} + 1)}^{2} (λ + 1)}{λ^{4} + λ^{3} + λ^{2} + λ + 1}$	≈3–6×
(10)	$\frac{(λ^{4} + λ^{3} + λ^{2} + 1) (λ + 1)}{λ^{4} + λ^{3} + λ^{2} + λ + 1}$	≈3–5×
(13)–(16)	1	$15 \times$
(17)	1	$15 \times$

References

1. Banach, S. Sur les opérations dans les ensembles abstraits et leurs applications aux équations intégrales. Fundam. Math.; 1922; 3, pp. 133-181. [DOI: https://dx.doi.org/10.4064/fm-3-1-133-181]

2. Berinde, V. Approximating fixed points of weak contractions using the Picard iteration. Nonlinear Anal. Forum; 2004; 9, pp. 43-53.

3. Chatterjea, S.K. Fixed-point theorems. C. R. Acad. Bulg. Sci.; 1972; 25, pp. 727-730. [DOI: https://dx.doi.org/10.1501/Commua1_0000000548]

4. Ćirić, L.B. A generalization of Banach’s contraction principle. Proc. Am. Math. Soc.; 1974; 45, pp. 267-273. [DOI: https://dx.doi.org/10.1090/S0002-9939-1974-0356011-2]

5. Kannan, R. Some results on fixed points. Bull. Calcutta Math. Soc.; 1968; 60, pp. 71-76.

6. Osilike, M.O. Stability results for fixed point iteration procedures. J. Nigerian Math. Soc.; 1995; 14, pp. 17-29.

7. Popescu, O. A new class of contractive mappings. Acta Math. Hung.; 2021; 164, pp. 570-579. [DOI: https://dx.doi.org/10.1007/s10474-021-01154-6]

8. Rus, I.A. Some fixed point theorems in metric spaces. Rend. Istit. Mat. Univ. Trieste; 1971; 3, pp. 169-172.

9. Abbas, M.; Ali, B.; Butt, A.R. Existence and data dependence of the fixed points of generalized contraction mappings with applications. Rev. Real Acad. Cienc. Exactas Fís. Nat. Ser. A Mat.; 2015; 109, pp. 603-621. [DOI: https://dx.doi.org/10.1007/s13398-014-0204-4]

10. Khan, A.R.; Kumar, V.; Hussain, N. Analytical and numerical treatment of Jungck-type iterative schemes. Appl. Math. Comput.; 2014; 231, pp. 521-535. [DOI: https://dx.doi.org/10.1016/j.amc.2013.12.150]

11. Khatoon, S.; Uddin, I.; Başarır, M. A modified proximal point algorithm for a nearly asymptotically quasi-nonexpansive mapping with an application. Comput. Appl. Math.; 2021; 40, 250. [DOI: https://dx.doi.org/10.1007/s40314-021-01646-9]

12. Rus, I.A.; Petruşel, A.; Petruşel, G. Fixed Point Theory 1950–2000: Romanian Contributions; House of the Book of Science: Cluj-Napoca, Romania, 2002.

13. Şoltuz, Ş.M.; Grosan, T. Data dependence for Ishikawa iteration when dealing with contractive-like operators. Fixed Point Theory Appl.; 2008; 2008, 242916. [DOI: https://dx.doi.org/10.1155/2008/242916]

14. Ullah, K.; Arshad, M. Numerical reckoning fixed points for Suzuki’s generalized nonexpansive mappings via new iteration process. Filomat; 2018; 32, pp. 187-196. [DOI: https://dx.doi.org/10.2298/FIL1801187U]

15. Usurelu, G.; Bejenaru, A.; Postolache, M. Newton-like methods and polynomiographic visualization of modified Thakur processes. Int. J. Comput. Math.; 2021; 98, pp. 1049-1068. [DOI: https://dx.doi.org/10.1080/00207160.2020.1802017]

16. Zaslavski, A.J. Two convergence results for inexact orbits of nonexpansive operators in metric spaces with graphs. Axioms; 2023; 12, 999. [DOI: https://dx.doi.org/10.3390/axioms12100999]

17. Ali, F.; Ali, J. Convergence, stability, and data dependence of a new iterative algorithm with an application. Comput. Appl. Math.; 2020; 39, 267. [DOI: https://dx.doi.org/10.1007/s40314-020-01316-2]

18. Çelik, R.; Şimşek, N. Some convergence, stability, and data dependence results for K* iterative method of quasi-strictly contractive mappings. Turk. J. Math.; 2022; 46, pp. 2819-2833. [DOI: https://dx.doi.org/10.55730/1300-0098.3303]

19. Çopur, A.K. Results of convergence, stability, and data dependency for an iterative algorithm. J. New Theory; 2024; 48, pp. 99-112. [DOI: https://dx.doi.org/10.53570/jnt.1537928]

20. Ertürk, M.; Gürsoy, F. Some convergence, stability and data dependency results for a Picard-S iteration method of quasi-strictly contractive operators. Math. Bohem.; 2019; 144, pp. 69-83. [DOI: https://dx.doi.org/10.21136/MB.2018.0085-17]

21. Gürsoy, F. A robust alternative to examine data dependency of fixed points of quasi-contractive operators: An efficient approach that relies on the collage theorem. Comput. Appl. Math.; 2024; 43, 168. [DOI: https://dx.doi.org/10.1007/s40314-024-02676-9]

22. Hacıoğlu, E.; Gürsoy, F.; Maldar, S.; Atalan, Y.; Milovanović, G.V. Iterative approximation of fixed points and applications to two-point second-order boundary value problems and to machine learning. Appl. Numer. Math.; 2021; 167, pp. 143-172. [DOI: https://dx.doi.org/10.1016/j.apnum.2021.04.020]

23. Karakaya, V.; Atalan, Y.; Doğan, K.; Bouzara, N.E.H. Some fixed point results for a new three steps iteration process in Banach spaces. Fixed Point Theory; 2017; 18, pp. 625-640. [DOI: https://dx.doi.org/10.24193/fpt-ro.2017.2.50]

24. Maldar, S. New parallel fixed point algorithms and their application to a system of variational inequalities. Symmetry; 2022; 14, 1025. [DOI: https://dx.doi.org/10.3390/sym14051025]

25. Micula, S.; Milovanović, G.V. Iterative processes and integral equations of the second kind. Matrix and Operator Equations and Applications; Moslehian, M.S. Springer: Cham, Switzerland, 2023; pp. 661-711. [DOI: https://dx.doi.org/10.1007/16618_2023_59]

26. Filali, D.; Eljaneid, N.H.E.; Alatawi, A.; Alshaban, E.; Ali, M.S.; Khan, F.A. A novel and efficient iterative approach to approximating solutions of fractional differential equations. Mathematics; 2025; 13, 33. [DOI: https://dx.doi.org/10.3390/math13010033]

27. Alam, K.H.; Rohen, Y. Convergence of a refined iterative method and its application to fractional Volterra–Fredholm integro-differential equations. Comput. Appl. Math.; 2025; 44, 2. [DOI: https://dx.doi.org/10.1007/s40314-024-02964-4]

28. Weng, X. Fixed point iteration for local strictly pseudocontractive mapping. Proc. Am. Math. Soc.; 1991; 113, pp. 727-731. [DOI: https://dx.doi.org/10.1090/S0002-9939-1991-1086345-8]

© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.

Convergence-Equivalent DF and AR Iterations with Refined Data Dependence: Non-Asymptotic Error Bounds and Robustness in Fixed-Point Computations

Content area

Abstract

Full text

1. Introduction and Preliminaries

2. Main Results

3. Discussion

4. Conclusions