Modified Z-algorithms for reckoning fixed points with application to nonlinear integral equations Habib ur Rehman, Hasanen A Hammad, Manal Elzain Mohamed Abdalla ABSTRACT In this paper, we investigate the existence of common fixed points for C−α nonexpansive mappings. We propose a novel four-step iterative scheme, referred to as the Z-iteration, which is specifically developed for handling pairs of such mappings. Using this algorithm, we establish several weak and strong convergence results that guarantee the existence of common fixed points. To substantiate the theoretical results, we present constructive examples. Moreover, the practical utility of the proposed method is demonstrated by applying it to approximate solutions of a specific class of nonlinear integral equations in Banach spaces, with a representative example provided to validate its effectiveness. 1 Introduction and preliminaries The theory concerning the existence of fixed points (FPs) plays a central role in mathematical analysis, particularly in establishing the existence of solutions to equations or transformations without necessarily providing a means of constructing them. A foundational result in this area is the Banach FP theorem, also known as the contraction mapping (CAM) principle, which ensures both the existence and uniqueness of a FP for a contraction mapping in a complete metric space and offers an iterative procedure for its approximation [ 1 , 2 ]. Beyond contractive mappings, other landmark results include the Brouwer FP theorem for continuous self-maps on compact and convex subsets of Euclidean space and its generalization to infinite-dimensional Banach spaces (BSs) via the Schauder FP theorem [ 2 , 3 ]. These theorems are particularly valuable in settings where uniqueness is not guaranteed, but existence is still of interest. In addition, the topological degree theory, an extension of the classical winding number, provides a powerful framework for estimating the number of solutions to nonlinear equations. This theory is closely connected to fixed point analysis and serves as a crucial tool in proving the existence of solutions for various classes of analytical and differential equations [ 4 ]. Collectively, these foundational results support a wide range of applications across differential equations, integral equations, and optimization by establishing the theoretical groundwork for solution existence. The existence theory for nonexpansive mappings was independently initiated by Browder [ 5 ], Göhde [ 6 ], and Kirk [ 7 ]. Their pioneering contributions have since inspired substantial research interest, leading to numerous developments, extensions, and generalizations of this fundamental concept. For an in-depth overview of such advancements, the reader is referred to [ 8 – 13 ]. Let Ω be a nonempty subset of a BS ( Ξ , ‖ · ‖ ) . For all ω , υ ∈ Ξ , a mapping ℜ : Ω → Ω is said to be: (i) a contraction if ‖ ℜ ω − ℜ υ ‖ ≤ ς ‖ ω − υ ‖ , for some ς ∈ [ 0 , 1 ) ; (ii) nonexpansive (NE) if ‖ ℜ ω − ℜ υ ‖ ≤ ‖ ω − υ ‖ ; (iii) quasi-nonexpansive (quasi-NE) if Fix ( ℜ ) ≠ ∅ and ‖ ℜ ω − η ‖ ≤ ‖ ω − η ‖ , for all η ∈ Fix ( ℜ ) , where Fix ( ℜ ) denotes the set of FPs of ℜ . It is worth noting that any NE mapping with a FP is necessarily quasi-NE. Building upon this observation, Suzuki [ 14 ] introduced a broader class of NE mappings that satisfy a relaxed condition, referred to as Condition (C) . A self-mapping ℜ on Ω is said to be a Suzuki generalized NE mapping (i.e., ℜ satisfies Condition (C)) if 1 2 ‖ ω − ℜ ω ‖ ≤ ‖ ω − υ ‖ ⟹ ‖ ℜ ω − ℜ υ ‖ ≤ ‖ ω − υ ‖ , holds for all ω , υ ∈ Ξ . Following these developments, Aoyama and Kohsaka [ 15 ] introduced the notion of α -NE mappings, representing a significant extension of the existing framework. A self-mapping ℜ on Ω is called α -NE if ‖ ℜ ω − ℜ υ ‖ 2 ≤ α ‖ ℜ ω − υ ‖ 2 + α ‖ ℜ υ − ω ‖ 2 + ( 1 − 2 α ) ‖ ω − υ ‖ 2 for all ω , υ ∈ Ξ , with α ∈ [ 0 , 1 ) . Clearly, every NE mapping is an 0-NE mapping. It is also important to observe that while NE mappings are inherently continuous, the generalized NE mappings introduced by Suzuki and the α -NE mappings may not be continuous in general. More recently, Pant and Shukla [ 16 ] proposed a further generalization, termed generalized α -NE mappings . A self-mapping ℜ on Ω is said to be generalized α -NE if 1 2 ‖ ω − ℜ ω ‖ ≤ ‖ ω − υ ‖ ⟹ ‖ ℜ ω − ℜ υ ‖ ≤ α ‖ ℜ ω − υ ‖ + α ‖ ℜ υ − ω ‖ + ( 1 − 2 α ) ‖ ω − υ ‖ holds for all ω , υ ∈ Ξ , with α ∈ [ 0 , 1 ) . The class introduced in [ 16 ] does not fully contain the α -NE mappings. To address this gap, the same authors later introduced a more inclusive class known as C- α -NE mappings [ 17 ], which properly encompasses the α -NE class. We now recall the definition of a C - α -NE mapping as follows: Definition 1 ([ 17 ]). Assume that Ω is a nonempty subset of a Banach space Ξ . A self-mapping ℜ on Ω is called a C- α -NE if the following implication holds: 1 2 ‖ ω − ℜ ω ‖ ≤ ‖ ω − υ ‖ ⟹ ‖ ℜ ω − ℜ υ ‖ 2 ≤ α ‖ ℜ ω − υ ‖ 2 + α ‖ ℜ υ − ω ‖ 2 + ( 1 − 2 α ) ‖ ω − υ ‖ 2 , (1) for all ω , υ ∈ Ξ and α ∈ [ 0 , 1 ) . Since the basic Picard iteration ω n + 1 = ℜ ω n often fails to converge to a FP when applied to NE mappings, a wide variety of more advanced iterative schemes have been proposed. These methods aim to more effectively approximate FPs or common FPs for various classes of NE mappings. Among the most notable iterations, particularly for their balance between simplicity and convergence efficiency are those developed by Ishikawa [ 18 ], Agarwal et al. [ 19 ], Abbas and Nazir [ 20 ], Noor [ 21 ], and Ali et al. [ 22 ]. For further examples of widely adopted and well-studied iterative methods, the reader is referred to [ 23 – 28 ]. We now recall the concept of the Opial property, which plays an important role in convergence analysis. Definition 2 ([ 29 ]). A BS Ξ is said to possess the Opial property if, for every weakly convergent sequence { ζ n } in Ξ with weak limit ζ , the inequality lim inf n → ∞ ‖ ζ n − η ‖ > lim inf n → ∞ ‖ ζ n − ζ ‖ holds for all η ∈ Ξ such that η ≠ ζ . The following lemma will be instrumental in our subsequent analysis. Lemma 1 ([ 30 ]). Let Ξ be a uniformly convex BS, and let { ϕ n } be a sequence satisfying 0 < k ≤ ϕ n ≤ n < 1 for all n ∈ ℕ . Suppose that { γ n } and { ζ n } are two sequences in Ξ such that lim sup n → ∞ ‖ γ n ‖ ≤ σ , lim sup n → ∞ ‖ ζ n ‖ ≤ σ , and lim n → ∞ ‖ ϕ n γ n + ( 1 − ϕ n ) ζ n ‖ = σ for some σ ≥ 0 . Then it follows that lim n → ∞ ‖ γ n − ζ n ‖ = 0 . Definition 3 ([ 31 ]). Let Ω be a nonempty subset of a uniformly convex BS Ξ , and let { ω n } ⊂ Ξ . For any ω ∈ Ξ , define s ( ω , { ω n } ) : = lim sup n → ∞ ‖ ω n − ω ‖ . The asymptotic radius of the sequence { ω n } relative to Ω is given by s ( Ω , { ω n } ) : = inf { s ( ω , { ω n } ) : ω ∈ Ω } . The asymptotic center of { ω n } relative to Ω is defined by R ( Ω , { ω n } ) : = { ω ∈ Ω : s ( ω , { ω n } ) = s ( Ω , { ω n } ) } . It is a standard result that, in a uniformly convex Banach space, the asymptotic center R ( Ω , { ω n } ) is a singleton. Definition 4 ([ 32 ]). Let Ω be a nonempty, bounded, closed, and convex subset of a BS Ξ . A sequence { ω n } is said to be an asymptotic center for a mapping ℜ : Ω → Ξ if lim sup n → ∞ ‖ ℜ ω − ω n ‖ ≤ lim sup n → ∞ ‖ ω n − ω ‖ , for all ω ∈ Ω . Definition 5 ([ 33 ]). Let { θ n } and { ℏ n } be two iterative schemes for FP approximation, both converging to the same fixed point η . Suppose their respective error estimates satisfy ‖ θ n − η ‖ ≤ b n and ‖ ℏ n − η ‖ ≤ c n , where { b n } and { c n } are sequences of positive real numbers converging to zero. If lim n → ∞ b n c n = 0 , then the sequence { θ n } is said to converge to η faster than { ℏ n } . Definition 6 ([ 33 ]). Let { ℏ n } and { φ n } be two sequences generated by iterative algorithms that converge to a common FP η . The sequence { ℏ n } is said to converge to η faster than { φ n } if lim n → ∞ ‖ ℏ n − η ‖ ‖ φ n − η ‖ = 0 . Modified Z -algorithms are effectively utilized in solving physical problems that can be reduced to one-dimensional pattern recognition or sequence analysis. A prominent area is signal processing, where these algorithms can be adapted for faster detection of specific patterns, transients, or anomalies within large time-series data, such as finding a particular waveform signature or seismic signal for diagnosis or event localization. They are also conceptually applied in bioinformatics. The core utility lies in their linear-time complexity for finding all occurrences of a pattern and its longest prefixes that match a prefix of the text, offering a computational efficiency crucial for handling the immense datasets typical of modern physical and biological sensing systems. Motivated by recent developments and powerful concepts in FP theory, this work investigates the convergence behavior of C - α -NE mappings in uniformly convex BSs. To this end, we employ a modified four-step iterative scheme, referred to as the modified Z-iteration (abbreviated as MZI), in conjunction with several auxiliary results to analyze convergence properties. Theoretical results are supported by meaningful numerical examples, including detailed tabular and graphical illustrations. Furthermore, we demonstrate the practical utility of the proposed method by applying it to a specific class of Volterra-Fredholm integral equations (VFIEs), for which we provide approximate solutions. Our paper is organized as follows: Section 2 is dedicated to an investigation of the convergence rate of the proposed algorithm, achieved through the statement and proof of several auxiliary lemmas and two theorems. In Section 3 , we analyze and compare convergence rates, focusing on how the proposed algorithm’s performance measures up against several established iterative methods. In Section 4 , we provide examples that illustrate and validate our findings. The numerical performance of the proposed iterative scheme is assessed in Section 5 . Section 6 applies the established results to investigate the existence of solutions for a general class of VFIEs with a deviating argument in a BS. The paper concludes in Section 7 , where we summarize our findings and suggest promising directions for future research. For reference, a list of abbreviations is provided in Section 8. 2 Convergence rate of Z − Iterative methods Throughout this paper, we denote by ℕ the set of natural numbers and by ℝ the set of real numbers. We begin by stating a fundamental lemma regarding the properties of the set of common FPs. Lemma 2. Let Ω be a nonempty, bounded, closed, and convex subset of a BS Ξ . Suppose that ℜ 1 , ℜ 2 , ℜ 3 : Ω → Ω are three C- α -NE mappings satisfying condition (1) . Then the set ℵ : = Fix ( ℜ 1 ) ∩ Fix ( ℜ 2 ) ∩ Fix ( ℜ 3 ) is nonempty and closed. Moreover, if Ξ is strictly convex, then ℵ is also convex. Proof. Consider a sequence { ν n } in ℵ = f i x ( ℜ 1 ) ∩ f i x ( ℜ 2 ) ∩ f i x ( ℜ 3 ) converging to ν ∈ Ω . As { ν n } is a sequence in both f i x ( ℜ 1 ) , f i x ( ℜ 2 ) , and f i x ( ℜ 3 ) , and acknowledging that ℜ 1 , ℜ 2 and ℜ 3 are C − α − NE mappings, it follows that 1 2 ‖ ν n − ℜ 1 ν n ‖ = 0 ≤ ‖ ν n − ν ‖ , implies for n ∈ ℕ , lim n → ∞ ‖ ν n − ℜ 1 ν ‖ = lim n → ∞ ‖ ℜ 1 ν n − ℜ 1 ν ‖ 2 ≤ lim n → ∞ [ α ‖ ℜ 1 ν n − ν ‖ 2 + α ‖ ν n − ℜ 1 ν ‖ 2 + ( 1 − 2 α ) ‖ ν n − ν ‖ 2 ] = lim n → ∞ [ α ‖ ν n − ν ‖ 2 + α ‖ ν n − ℜ 1 ν ‖ 2 + ( 1 − 2 α ) ‖ ν n − ν ‖ 2 ] . Hence, ( 1 − α ) lim n → ∞ ‖ ν n − ℜ 1 ν ‖ ≤ lim n → ∞ [ ( 1 − α ) ‖ ν n − ν ‖ 2 ] . Since 1 − α > 0 , one has lim n → ∞ ‖ ν n − ℜ 1 ν ‖ ≤ lim n → ∞ ‖ ν n − ν ‖ 2 = 0 , which implies that { ν n } converges to ℜ 1 ν , that is, ν = ℜ 1 ν and ν ∈ f i x ( ℜ 1 ) . By following a similar procedure, we establish that ν ∈ f i x ( ℜ 2 ) and ν ∈ f i x ( ℜ 3 ) . This implies that ν ∈ ℵ , which in turn demonstrates that ℵ is closed. Next, consider the case where Ξ is strictly convex and Ω is convex. Fix λ ∈ ( 0 , 1 ) and ω , τ ∈ ℵ such that ω ≠ τ and set ν = γ ω + ( 1 − γ ) τ ∈ Ω . Given that ℜ 1 , ℜ 2 and ℜ 3 are C − α − NE mappings, we begin by observing 1 2 ‖ ω − ℜ 1 ω ‖ = 0 ≤ ‖ ω − ν ‖ , and applying (1) , one can write ‖ ℜ 1 ω − ℜ 1 ν ‖ 2 ≤ α ‖ ℜ 1 ω − ν ‖ 2 + α ‖ ω − ℜ 1 ν ‖ 2 + ( 1 − 2 α ) ‖ ω − ν ‖ 2 = α ‖ ω − ν ‖ 2 + α ‖ ω − ℜ 1 ν ‖ 2 + ( 1 − 2 α ) ‖ ω − ν ‖ 2 = α ‖ ω − ℜ 1 ν ‖ 2 + ( 1 − α ) ‖ ω − ν ‖ 2 = α ‖ ℜ 1 ω − ℜ 1 ν ‖ 2 + ( 1 − α ) ‖ ω − ν ‖ 2 , it follows that ( 1 − α ) ‖ ℜ 1 ω − ℜ 1 ν ‖ 2 ≤ ( 1 − α ) ‖ ω − ν ‖ 2 . Since 1 − α > 0 , one has ‖ ℜ 1 ω − ℜ 1 ν ‖ 2 ≤ ‖ ω − ν ‖ 2 ⟹ ‖ ℜ 1 ω − ℜ 1 ν ‖ ≤ ‖ ω − ν ‖ . Additionally, ν = γ ω + ( 1 − γ ) τ = γ ω + ( 1 − γ ) τ + ( 1 − γ ) ω − ( 1 − γ ) ω = − ( 1 − γ ) ( ω − τ ) + ω . Hence, ω − ν = ( 1 − γ ) ( ω − τ ) . The norm of both sides of the expression above leads to ‖ ω − ν ‖ = ( 1 − γ ) ‖ ω − τ ‖ . (2) Analogously, for τ ∈ ℵ , one has ‖ ℜ 1 τ − ℜ 1 ν ‖ 2 ≤ ‖ τ − ν ‖ 2 ⟹ ‖ ℜ 1 τ − ℜ 1 ν ‖ ≤ ‖ τ − ν ‖ . (3) Since Ξ is strictly convex, there is ς ∈ ( 0 , 1 ) such that ℜ 1 ν = ς ω + ( 1 − ς ) τ = ς ω + ( 1 − ς ) τ + ( 1 − ς ) ω − ( 1 − ς ) ω = − ( 1 − ς ) ( ω − τ ) + ω , which implies that ( ω − ℜ 1 ν ) = ( ℜ 1 ω − ℜ 1 ν ) = ( 1 − ς ) ( ω − τ ) . The norm of both sides of the expression above leads to ‖ ℜ 1 ω − ℜ 1 ν ‖ = ( 1 − ς ) ‖ ω − τ ‖ . (4) From (2) in (4) , we get ( 1 − ς ) ‖ ω − τ ‖ = ‖ ℜ 1 ω − ℜ 1 ν ‖ ≤ ‖ ω − ν ‖ = ( 1 − γ ) ‖ ω − τ ‖ . (5) A similar calculation, incorporating (3), yields: ς ‖ ω − τ ‖ = ‖ ℜ 1 τ − ℜ 1 ν ‖ ≤ ‖ τ − ν ‖ = γ ‖ ω − τ ‖ . (6) It follows from (5) and (6) that ( 1 − ς ) ≤ ( 1 − γ ) and ς ≤ γ . This is valid only if ς = γ . Therefore, ν ∈ f i x ( ℜ 1 ) . Through analogous calculations, it can further be demonstrated that ν ∈ f i x ( ℜ 2 ) and ν ∈ f i x ( ℜ 3 ) . This leads to the conclusion that ν ∈ ℵ , establishing the convexity of ℵ . □ Further in this section, we establish convergence results for a pair of C - α -NE mappings. Before proceeding, we introduce a novel four-step iterative algorithm involving three mappings ℜ 1 , ℜ 2 , ℜ 3 : Ω → Ω , where Ω is a nonempty subset of a BS Ξ . The algorithm is defined as follows: { ω 0 ∈ Ω , ν n = ( 1 − ρ n ) τ n + ρ n ℜ 1 τ n , τ n = ( 1 − ξ n ) κ n + ξ n ℜ 2 κ n , κ n = ℜ 3 [ ( 1 − λ n ) ω n + λ n ℜ 3 ω n ] , ω n + 1 = ℜ 3 ν n , (7) for all n = 0 , 1 , 2 , … , where the sequences { ρ n } , { ξ n } , and { λ n } are chosen from the interval (0,1). We refer to this iterative process as the MZI. In the sequel, we present a fundamental result associated with this method. Lemma 3. Let Ω be a nonempty, bounded, closed, and convex subset of a Banach space Ξ . Suppose that ℜ 1 , ℜ 2 , ℜ 3 : Ω → Ω are three C- α -NE mappings with a nonempty common FP set ℵ : = Fix ( ℜ 1 ) ∩ Fix ( ℜ 2 ) ∩ Fix ( ℜ 3 ) . If η ∈ ℵ and { ω n } is the sequence generated by the MZI scheme (7) , then the limit lim n → ∞ ‖ ω n − η ‖ exists for every η ∈ ℵ . Proof. Since ℜ 1 , ℜ 2 , ℜ 3 : Ω → Ω are three C − α − NE mappings, one has ‖ ℜ 1 ω − η ‖ ≤ ‖ ω − η ‖ , ‖ ℜ 2 ω − η ‖ ≤ ‖ ω − η ‖ , and ‖ ℜ 3 ω − η ‖ ≤ ‖ ω − η ‖ , for each η ∈ ℵ . As ℜ 1 , ℜ 2 and ℜ 3 are quasi-NE maps, then by the algorithm (7) , we have ‖ ω n + 1 − η ‖ = ‖ ℜ 3 ν n − η ‖ ≤ ‖ ν n − η ‖ = ‖ ( 1 − ρ n ) τ n + ρ n ℜ 1 τ n − η ‖ = ‖ ( 1 − ρ n ) ( τ n − η ) + ρ n ( ℜ 1 τ n − η ) ‖ ≤ ( 1 − ρ n ) ‖ τ n − η ‖ + ρ n ‖ ℜ 1 τ n − η ‖ ≤ ( 1 − ρ n ) ‖ τ n − η ‖ + ρ n ‖ τ n − η ‖ = ‖ τ n − η ‖ = ‖ ( 1 − ξ n ) κ n + ξ n ℜ 2 κ n − η ‖ ≤ ( 1 − ξ n ) ‖ κ n − η ‖ + ξ n ‖ ℜ 2 κ n − η ‖ ≤ ( 1 − ξ n ) ‖ κ n − η ‖ + ξ n ‖ κ n − η ‖ = ‖ κ n − η ‖ = ‖ ℜ 3 [ ( 1 − λ n ) ω n + λ n ℜ 3 ω n ] − η ‖ ≤ ‖ ( 1 − λ n ) ω n + λ n ℜ 3 ω n − η ‖ ≤ ( 1 − λ n ) ‖ ω n − η ‖ + λ n ‖ ℜ 3 ω n − η ‖ ≤ ( 1 − λ n ) ‖ ω n − η ‖ + λ n ‖ ℜ 3 ω n − η ‖ = ‖ ω n − η ‖ . This implies that { ‖ ω n − η ‖ } is a non-increasing sequence and is also bounded below for every η ∈ ℵ . Therefore lim n → ∞ ‖ ω n − η ‖ exists. □ Now, we apply Lemma 2.2 to establish a necessary and sufficient condition for the existence of a common FP. This condition applies specifically to a set of three C - α -NE mappings. Theorem 2.3. Let Ω ≠ ∅ be a bounded, closed, and convex subset of a uniformly convex BS Ξ . Suppose that ℜ 1 , ℜ 2 , ℜ 3 : Ω → Ω are three C- α -NE mappings, and let { ω n } be the sequence generated by the MZI scheme (7) . Then the common FP set ℵ : = Fix ( ℜ 1 ) ∩ Fix ( ℜ 2 ) ∩ Fix ( ℜ 3 ) is nonempty if and only if lim n → ∞ ‖ ℜ 1 ω n − ω n ‖ = 0 , lim n → ∞ ‖ ℜ 2 ω n − ω n ‖ = 0 , and lim n → ∞ ‖ ℜ 3 ω n − ω n ‖ = 0 . Proof. For η ∈ ℵ , it follows from Lemma 2.2 that, lim n → ∞ ‖ ω n − η ‖ exists. We can therefore define υ = lim n → ∞ ‖ ω n − η ‖ , where υ is a non-negative real number. Because ℜ 1 , ℜ 2 , and ℜ 3 are C − α − NE mappings, we get lim sup n → ∞ ‖ ℜ 1 ω n − ξ ‖ ≤ υ , lim sup n → ∞ ‖ ℜ 2 ω n − ξ ‖ ≤ υ , and lim sup n → ∞ ‖ ℜ 3 ω n − ξ ‖ ≤ υ . Moreover, ‖ κ n − η ‖ = ‖ ℜ 3 [ ( 1 − λ n ) ω n + λ n ℜ 3 ω n ] − η ‖ ≤ ‖ ( 1 − λ n ) ω n + λ n ℜ 3 ω n − η ‖ = ‖ ( 1 − λ n ) ( ω n − η ) + λ n ( ℜ 3 ω n − η ) ‖ ≤ ( 1 − λ n ) ‖ ω n − η ‖ + λ n ‖ ℜ 3 ω n − η ‖ ≤ ( 1 − λ n ) ‖ ω n − η ‖ + λ n ‖ ω n − η ‖ = ‖ ω n − η ‖ , and, we have lim sup n → ∞ ‖ κ n − η ‖ ≤ lim sup n → ∞ ‖ ω n − η ‖ ≤ υ . (8) In addition to, one has lim sup n → ∞ ‖ ℜ 2 κ n − η ‖ ≤ lim sup n → ∞ ‖ ℜ 2 ω n − η ‖ ≤ υ . (9) Analogously, application of (8) leads to lim sup n → ∞ ‖ ℜ 2 τ n − η ‖ ≤ lim sup n → ∞ ‖ τ n − η ‖ = lim sup n → ∞ ‖ ( 1 − ξ n ) κ n + ξ n ℜ 2 κ n − η ‖ ≤ ( 1 − ξ n ) lim sup n → ∞ ‖ κ n − η ‖ + ξ n lim sup n → ∞ ‖ ℜ 2 κ n − η ‖ ≤ lim sup n → ∞ ‖ κ n − η ‖ ≤ υ , lim sup n → ∞ ‖ ℜ 1 ν n − η ‖ ≤ lim sup n → ∞ ‖ ν n − η ‖ = lim sup n → ∞ ‖ ( 1 − ρ n ) τ n + ρ n ℜ 1 τ n − η ‖ ≤ ( 1 − ρ n ) lim sup n → ∞ ‖ τ n − η ‖ + ρ n lim sup n → ∞ ‖ ℜ 1 τ n − η ‖ ≤ lim sup n → ∞ ‖ κ n − η ‖ ≤ υ , and υ = lim n → ∞ ‖ ω n + 1 − η ‖ = lim n → ∞ ‖ ℜ 3 ν n − η ‖ ≤ lim n → ∞ ‖ ν n − η ‖ ≤ lim n → ∞ ‖ τ n − η ‖ = lim n → ∞ ‖ ( 1 − ξ n ) κ n + ξ n ℜ 2 κ n − η ‖ = lim n → ∞ ‖ ( 1 − ξ n ) ( κ n − η ) + ξ n ( ℜ 2 κ n − η ) ‖ ≤ ( 1 − ξ n ) lim n → ∞ ‖ ( κ n − η ) ‖ + ξ n lim n → ∞ ‖ κ n − η ‖ = lim n → ∞ ‖ κ n − η ‖ ≤ υ . Hence, lim n → ∞ ‖ ( 1 − ξ n ) ( κ n − η ) + ξ n ( ℜ 2 κ n − η ) ‖ = υ . (10) It follows from (9) , (10) , and Lemma 1.3 that lim n → ∞ ‖ κ n − ℜ 2 κ n ‖ = 0 . (11) Similarly, lim n → ∞ ‖ τ n − ℜ 1 τ n ‖ = 0 . (12) Now, ‖ ω n + 1 − η ‖ = ‖ ℜ 3 ν n − η ‖ ≤ ‖ ν n − η ‖ = ‖ ( 1 − ρ n ) τ n + ρ n ℜ 1 τ n − η ‖ ≤ ‖ τ n − η ‖ = ‖ ( 1 − ξ n ) κ n + ξ n ℜ 2 κ n − η ‖ ≤ ‖ κ n − η ‖ , which implies that υ ≤ lim sup n → ∞ ‖ κ n − η ‖ . (13) Using (9) and (13) , we have lim n → ∞ ‖ κ n − η ‖ = υ . Again υ = lim n → ∞ ‖ κ n − η ‖ = lim n → ∞ ‖ ℜ 3 [ ( 1 − λ n ) ω n + λ n ℜ 3 ω n ] − η ‖ ≤ lim n → ∞ ‖ ( 1 − λ n ) ( ω n − η ) + λ n ( ℜ 3 ω n − η ) ‖ ≤ ( 1 − λ n ) lim n → ∞ ‖ ω n − η ‖ + λ n ‖ ω n − η ‖ ≤ υ . Hence, lim n → ∞ ‖ ( 1 − λ n ) ( ω n − η ) + λ n ( ℜ 3 ω n − η ) ‖ = υ . (14) Applying Lemma 1.3 on (14) , one has lim n → ∞ ‖ ω n − ℜ 3 ω n ‖ = 0 . (15) Hence, ‖ ω n − ℜ 3 κ n ‖ ≤ ‖ ω n − ℜ 3 ω n ‖ + ‖ ℜ 3 ω n − ℜ 3 κ n ‖ ≤ ‖ ω n − ℜ 3 ω n ‖ + ‖ ω n − κ n ‖ = ‖ ω n − ℜ 3 ω n ‖ + ‖ ℜ 3 [ ( 1 − λ n ) ω n + λ n ℜ 3 ω n ] − ω n ‖ ≤ ‖ ω n − ℜ 3 ω n ‖ + ‖ ( 1 − λ n ) ω n + λ n ℜ 3 ω n − ω n ‖ = ‖ ω n − ℜ 3 ω n ‖ + λ n ‖ ℜ 3 ω n − ω n ‖ = ( 1 + λ n ) ‖ ℜ 3 ω n − ω n ‖ → 0 as n → ∞ . (16) Additionally ‖ κ n − ℜ 3 ω n ‖ = ‖ ℜ 3 [ ( 1 − λ n ) ω n + λ n ℜ 3 ω n ] − ℜ 3 ω n ‖ ≤ ‖ ( 1 − λ n ) ω n + λ n ℜ 3 ω n − ω n ‖ ≤ λ n ‖ ℜ 3 ω n − ω n ‖ . Using (15) , we have lim n → ∞ ‖ κ n − ℜ 3 ω n ‖ = 0 . (17) On the other hand, ‖ ω n − ℜ 1 τ n ‖ = ‖ ℜ 1 τ n − ω n ‖ ≤ ‖ ℜ 1 τ n − τ n ‖ + ‖ τ n − ω n ‖ = ‖ ℜ 1 τ n − τ n ‖ + ‖ ( 1 − ξ n ) κ n + ξ n ℜ 2 κ n − ω n ‖ ≤ ‖ ℜ 1 τ n − τ n ‖ + ‖ ( κ n − ω n ) − ξ n ( κ n − ℜ 2 κ n ) ‖ ≤ ‖ ℜ 1 τ n − τ n ‖ + ξ n ‖ κ n − ℜ 2 κ n ‖ + ‖ κ n − ω n ‖ = ‖ ℜ 1 τ n − τ n ‖ + ξ n ‖ κ n − ℜ 2 κ n ‖ + ‖ ℜ 3 [ ( 1 − λ n ) ω n + λ n ℜ 3 ω n ] − ω n ‖ ≤ ‖ ℜ 1 τ n − τ n ‖ + ξ n ‖ κ n − ℜ 2 κ n ‖ + ‖ ( 1 − λ n ) ω n + λ n ℜ 3 ω n − ω n ‖ ≤ ‖ ℜ 1 τ n − τ n ‖ + ξ n ‖ κ n − ℜ 2 κ n ‖ + λ n ‖ ℜ 3 ω n − ω n ‖ . Using (11) , (12) and (15) , we have lim n → ∞ ‖ ω n − ℜ 1 τ n ‖ = 0 . (18) Also, ‖ τ n − ℜ 2 κ n ‖ = ‖ ( 1 − ξ n ) κ n − ( 1 − ξ n ) ℜ 2 κ n ‖ = ( 1 − ξ n ) ‖ κ n − ℜ 2 κ n ‖ . From (11) , we have lim n → ∞ ‖ τ n − ℜ 2 κ n ‖ = 0 . (19) Moreover, ‖ τ n − ω n ‖ = ‖ τ n − ℜ 1 τ n + ℜ 1 τ n − ω n ‖ ≤ ‖ τ n − ℜ 1 τ n ‖ + ‖ ℜ 1 τ n − ω n ‖ . Applying (12) and (19) , we have lim n → ∞ ‖ τ n − ω n ‖ = 0 . (20) Utilizing Definition 1.1, one can write ‖ ℜ 1 ω n − ω n ‖ 2 = ‖ ω n − ℜ 1 ω n ‖ 2 ≤ [ ‖ ω n − ℜ 1 τ n ‖ + ‖ ℜ 1 τ n − ℜ 1 ω n ‖ ] 2 = ‖ ω n − ℜ 1 τ n ‖ 2 + ‖ ℜ 1 τ n − ℜ 1 ω n ‖ 2 + 2 ‖ ω n − ℜ 1 τ n ‖ . ‖ ℜ 1 τ n − ℜ 1 ω n ‖ ≤ ‖ ω n − ℜ 1 τ n ‖ 2 + α ‖ ℜ 1 τ n − ω n ‖ 2 + α ‖ τ n − ℜ 1 ω n ‖ 2 + ( 1 − 2 α ) ‖ τ n − ω n ‖ 2 + 2 ‖ ω n − ℜ 1 τ n ‖ . ‖ ℜ 1 τ n − ℜ 1 ω n ‖ ≤ ( 1 + α ) ‖ ω n − ℜ 1 τ n ‖ 2 + α [ ‖ τ n − ℜ 2 κ n + ℜ 2 κ n − ℜ 1 ω n ‖ 2 ] + ( 1 − 2 α ) ‖ τ n − ω n ‖ 2 + 2 ‖ ω n − ℜ 1 τ n ‖ . ‖ ℜ 1 τ n − ℜ 1 ω n ‖ ≤ ( 1 + α ) ‖ ω n − ℜ 1 τ n ‖ 2 + α ‖ τ n − ℜ 2 κ n ‖ 2 + α ‖ ℜ 2 κ n − ℜ 1 ω n ‖ 2 + 2 α ‖ τ n − ℜ 2 κ n ‖ . ‖ ℜ 2 κ n − ℜ 1 ω n ‖ + ( 1 − 2 α ) ‖ τ n − ω n ‖ 2 + 2 ‖ ω n − ℜ 1 τ n ‖ . ‖ ℜ 1 τ n − ℜ 1 ω n ‖ ≤ ( 1 + α ) ‖ ω n − ℜ 1 τ n ‖ 2 + α ‖ τ n − ℜ 2 κ n ‖ 2 + α [ ‖ ℜ 2 κ n − τ n + τ n − ℜ 1 ω n ‖ 2 ] + 2 α ‖ τ n − ℜ 2 κ n ‖ . ‖ ℜ 2 κ n − ℜ 1 ω n ‖ + ( 1 − 2 α ) ‖ τ n − ℜ 1 τ n + ℜ 1 τ n − ω n ‖ 2 + 2 ‖ ω n − ℜ 1 τ n ‖ . ‖ ℜ 1 τ n − ℜ 1 ω n ‖ ≤ ( 1 + α ) ‖ ω n − ℜ 1 τ n ‖ 2 + 2 α ‖ τ n − ℜ 2 κ n ‖ 2 + α ‖ τ n − ℜ 1 ω n ‖ 2 + 2 α ‖ τ n − ℜ 2 κ n ‖ ‖ τ n − ℜ 1 ω n ‖ + 2 α ‖ τ n − ℜ 2 κ n ‖ . ‖ ℜ 2 κ n − ℜ 1 ω n ‖ + ( 1 − 2 α ) [ ‖ τ n − ℜ 1 τ n ‖ 2 + ‖ ℜ 1 τ n − ω n ‖ 2 + 2 ‖ τ n − ℜ 1 τ n ‖ ‖ ℜ 1 τ n − ω n ‖ ] + 2 ‖ ω n − ℜ 1 τ n ‖ . ‖ ℜ 1 τ n − ℜ 1 ω n ‖ ≤ ( 1 + α ) ‖ ω n − ℜ 1 τ n ‖ 2 + 2 α ‖ τ n − ℜ 2 κ n ‖ 2 + α ‖ τ n − ω n + ω n − ℜ 1 ω n ‖ 2 + 2 α ‖ τ n − ℜ 2 κ n ‖ ‖ τ n − ℜ 1 ω n ‖ + 2 α ‖ τ n − ℜ 2 κ n ‖ . ‖ ℜ 2 κ n − ℜ 1 ω n ‖ + ( 1 − 2 α ) [ ‖ τ n − ℜ 1 τ n ‖ 2 + ‖ ℜ 1 τ n − ω n ‖ 2 + 2 ‖ τ n − ℜ 1 τ n ‖ ‖ ℜ 1 τ n − ω n ‖ ] + 2 ‖ ω n − ℜ 1 τ n ‖ . ‖ ℜ 1 τ n − ℜ 1 ω n ‖ ≤ ( 1 + α ) ‖ ω n − ℜ 1 τ n ‖ 2 + 2 α ‖ τ n − ℜ 2 κ n ‖ 2 + α [ ‖ τ n − ω n ‖ 2 + ‖ ω n − ℜ 1 ω n ‖ 2 + 2 ‖ τ n − ω n ‖ ‖ ω n − ℜ 1 ω n ‖ ] + 2 α [ ‖ τ n − ℜ 2 κ n ‖ ‖ τ n − ℜ 1 ω n ‖ + ‖ τ n − ℜ 2 κ n ‖ . ‖ ℜ 2 κ n − ℜ 1 ω n ‖ ] + ( 1 − 2 α ) [ ‖ τ n − ℜ 1 τ n ‖ 2 + ‖ ℜ 1 τ n − ω n ‖ 2 + 2 ‖ τ n − ℜ 1 τ n ‖ ‖ ℜ 1 τ n − ω n ‖ ] + 2 ‖ ω n − ℜ 1 τ n ‖ . ‖ ℜ 1 τ n − ℜ 1 ω n ‖ . Hence, ( 1 − α ) ‖ ℜ 1 ω n − ω n ‖ 2 ≤ ( 1 + α ) ‖ ω n − ℜ 1 τ n ‖ 2 + 2 α ‖ τ n − ℜ 2 κ n ‖ 2 + α [ ‖ τ n − ω n ‖ 2 + 2 ‖ τ n − ω n ‖ ‖ ω n − ℜ 1 ω n ‖ ] + 2 α [ ‖ τ n − ℜ 2 κ n ‖ ‖ τ n − ℜ 1 ω n ‖ + ‖ τ n − ℜ 2 κ n ‖ . ‖ ℜ 2 κ n − ℜ 1 ω n ‖ ] + ( 1 − 2 α ) [ ‖ τ n − ℜ 1 τ n ‖ 2 + ‖ ℜ 1 τ n − ω n ‖ 2 + 2 ‖ τ n − ℜ 1 τ n ‖ ‖ ℜ 1 τ n − ω n ‖ ] + 2 ‖ ω n − ℜ 1 τ n ‖ . ‖ ℜ 1 τ n − ℜ 1 ω n ‖ . (21) Applying (12) , (18) , (19) and (20) on (21) , we conclude that lim n → ∞ ‖ ℜ 1 ω n − ω n ‖ = 0 . (22) Moreover ‖ ℜ 2 ω n − ω n ‖ ≤ ‖ ω n − τ n + τ n − ℜ 2 κ n + ℜ 2 κ n − ℜ 2 ω n ‖ ≤ ‖ ω n − τ n ‖ + ‖ τ n − ℜ 2 κ n ‖ + ‖ ℜ 2 κ n − ℜ 2 ω n ‖ ≤ ‖ ω n − τ n ‖ + ‖ τ n − ℜ 2 κ n ‖ + ‖ κ n − ω n ‖ ≤ ‖ ω n − τ n ‖ + ‖ τ n − ℜ 2 κ n ‖ + ‖ ℜ 3 [ ( 1 − λ n ) ω n + λ n ℜ 3 ω n ] − ω n ‖ ≤ ‖ ω n − τ n ‖ + ‖ τ n − ℜ 2 κ n ‖ + ‖ ( 1 − λ n ) ω n + λ n ℜ 3 ω n − ω n ‖ ≤ ‖ ω n − τ n ‖ + ‖ τ n − ℜ 2 κ n ‖ + λ n ‖ ℜ 3 ω n − ω n ‖ . Using (15) , (19) and (20) , we get lim n → ∞ ‖ ℜ 2 ω n − ω n ‖ = 0 . (23) It follows from (15) , (22) and (23) that lim n → ∞ ‖ ℜ 1 ω n − ω n ‖ = 0 , lim n → ∞ ‖ ℜ 2 ω n − ω n ‖ = 0 , and lim n → ∞ ‖ ℜ 3 ω n − ω n ‖ = 0 . (24) Conversely, assume that { ω n } is bounded such that (24) holds. Suppose also that η ∈ R ( Ω , { ω n } ) . Because lim n → ∞ ‖ ℜ 1 ω n − ω n ‖ = 0 , there exists n 0 ∈ ℕ such that 1 2 ‖ ω n − ℜ 1 ω n ‖ ≤ ‖ ω n − η ‖ , ∀ n ≥ n 0 . By the triangle inequality and Definition 1.1, we find that ‖ ℜ 1 η − ω n ‖ 2 ≤ ‖ ℜ 1 η − ℜ 1 ω n + ℜ 1 ω n − ω n ‖ 2 = ‖ ℜ 1 η − ℜ 1 ω n ‖ 2 + ‖ ℜ 1 ω n − ω n ‖ 2 + 2 ‖ ℜ 1 η − ℜ 1 ω n ‖ ‖ ℜ 1 ω n − ω n ‖ = α ‖ ℜ 1 ω n − η ‖ 2 + α ‖ ω n − ℜ 1 η ‖ 2 + ( 1 − 2 α ) ‖ ω n − η ‖ 2 + ‖ ℜ 1 ω n − ω n ‖ 2 + 2 ‖ ℜ 1 η − ℜ 1 ω n ‖ ‖ ℜ 1 ω n − ω n ‖ . Hence ( 1 − α ) ‖ ℜ 1 η − ω n ‖ 2 ≤ α ‖ ℜ 1 ω n − η ‖ 2 + ( 1 − 2 α ) ‖ ω n − η ‖ 2 + ‖ ℜ 1 ω n − ω n ‖ 2 + 2 ‖ ℜ 1 η − ℜ 1 ω n ‖ ‖ ℜ 1 ω n − ω n ‖ = α ‖ ℜ 1 ω n − ω n + ω n − η ‖ 2 + ( 1 − 2 α ) ‖ ω n − η ‖ 2 + ‖ ℜ 1 ω n − ω n ‖ 2 + 2 ‖ ℜ 1 η − ℜ 1 ω n ‖ ‖ ℜ 1 ω n − ω n ‖ = α [ ‖ ω n − η ‖ 2 + ‖ ω n − ℜ 1 ω n ‖ 2 + 2 ‖ ω n − η ‖ ‖ ω n − ℜ 1 ω n ‖ ] + ( 1 − 2 α ) ‖ ω n − η ‖ 2 + ‖ ℜ 1 ω n − ω n ‖ 2 + 2 ‖ ℜ 1 η − ℜ 1 ω n ‖ ‖ ℜ 1 ω n − ω n ‖ . Therefore ‖ ℜ 1 η − ω n ‖ 2 ≤ ( 1 − α ) ( 1 − α ) ‖ ω n − η ‖ 2 + ( 1 + α ) ( 1 − α ) ‖ ω n − ℜ 1 ω n ‖ 2 + 2 α ( 1 − α ) ‖ ω n − η ‖ ‖ ω n − ℜ 1 ω n ‖ + 2 ( 1 − α ) ‖ ℜ 1 η − ℜ 1 ω n ‖ ‖ ℜ 1 ω n − ω n ‖ . (25) Taking the lim sup of both sides of inequality (25) yields lim sup n → ∞ ‖ ℜ 1 η − ω n ‖ 2 ≤ lim sup n → ∞ ‖ η − ω n ‖ 2 , implies lim sup n → ∞ ‖ ℜ 1 η − ω n ‖ ≤ lim sup n → ∞ ‖ η − ω n ‖ . (26) Utilizing inequality (25) and Definitions 1.4 and 1.5, we deduce that s ( ℜ 1 η , { ω n } ) = lim sup n → ∞ ‖ ℜ 1 η − ω n ‖ ≤ lim sup n → ∞ ‖ η − ω n ‖ = s ( η , { ω n } ) = s ( Ω , { ω n } ) . Hence, ℜ 1 η ∈ R ( Ω , { ω n } ) . The uniform convexity of Ξ ensures that R ( Ω , { ω n } ) is a singleton set. Hence, we obtain ℜ 1 η = η . A similar argument leads to ℜ 2 η = η and ℜ 3 η = η . Therefore, η ∈ ℵ , thereby providing additional confirmation that ℵ ≠ ∅ . □ We now turn to establishing the weak convergence of the MZI scheme (7) toward a common FP of the mappings ℜ 1 , ℜ 2 , and ℜ 3 . Theorem 2.4. Assume that Ξ is a uniformly convex BS endowed with the Opial property. Let Ω , ℜ 1 , ℜ 2 , and ℜ 3 be as defined in Theorem 2.3. Then the sequence { ω n } generated by the MZI scheme (7) converges weakly to a common FP of ℜ 1 , ℜ 2 , and ℜ 3 , provided that ℵ : = Fix ( ℜ 1 ) ∩ Fix ( ℜ 2 ) ∩ Fix ( ℜ 3 ) is nonempty. Proof. It follows from [ 17 , Theorem 4.1] that, in a uniformly convex BS Ξ with the Opial property, the operators I − ℜ 1 , I − ℜ 2 , and I − ℜ 3 are demiclosed at zero, provided that ℜ 1 , ℜ 2 , ℜ 3 : Ω → Ω are C - α -NE mappings. The remainder of the proof proceeds along the same lines as in [ 31 , Theorem 3.4]. □ It is worth noting that the Opial property does not hold in many uniformly convex BSs. Therefore, in the subsequent analysis, we adopt an alternative approach by utilizing the existence of a Fréchet differentiable norm and develop a different line of reasoning to replace reliance on the Opial property. Theorem 2.5. In Theorem 2.4, replace the assumption that Ξ has the Opial property with the condition that Ξ admits a Fréchet differentiable norm. Additionally, assume that the limit lim n → ∞ ‖ s ω n + ( 1 − s ) ϱ − ϰ ‖ exists for all ϱ , ϰ ∈ ℵ and for some fixed s ∈ ( 0 , 1 ) , and that the operators I − ℜ 1 , I − ℜ 2 , and I − ℜ 3 are demiclosed at zero. Then the sequence { ω n } generated by the MZI scheme (7) converges weakly to a common FP of ℜ 1 , ℜ 2 , and ℜ 3 . Proof. The result follows by applying the argument used in the proof of [ 31 , Theorem 3.5]. □ We now generalize the results of Bera et al. [ 31 ] and Chidume and Ali [ 34 ] by introducing the following condition, denoted as ( B ′ ) . We say that the mappings ℜ 1 , ℜ 2 , ℜ 3 : Ω → Ω satisfy Condition ( B ′ ) with ℵ ≠ ∅ if there exists a nondecreasing function h : [ 0 , ∞ ) → [ 0 , ∞ ) such that h (0) = 0 and h ( ϑ ) > 0 for all ϑ ∈ ( 0 , ∞ ) , and for all ω ∈ Ω , the following inequality holds: max { ‖ ω − ℜ 1 ω ‖ , ‖ ω − ℜ 2 ω ‖ , ‖ ω − ℜ 3 ω ‖ } ≥ h ( d ( ω , ℵ ) ) , where d ( ω , ℵ ) : = inf η ∈ ℵ ‖ ω − η ‖ . Lemma 4 ([ 31 ]). Let { γ n } and { ϖ n } be sequences of nonnegative real numbers such that γ n + 1 ≤ γ n + ϖ n for all n ∈ ℕ , and suppose that ∑ n = 0 ∞ ϖ n < ∞ . Then the limit lim n → ∞ γ n exists. Using the above lemma, we now establish a strong convergence result for the MZI scheme. Theorem 2.7. Let Ω ≠ ∅ be a bounded, closed, and convex subset of a uniformly convex BS Ξ . Suppose that ℜ 1 , ℜ 2 , ℜ 3 : Ω → Ω are three C- α -NE mappings with ℵ : = Fix ( ℜ 1 ) ∩ Fix ( ℜ 2 ) ∩ Fix ( ℜ 3 ) ≠ ∅ , and let { ω n } be the sequence generated by the MZI scheme (7) . Then { ω n } converges strongly to a common FP of ℜ 1 , ℜ 2 , and ℜ 3 , provided that the mappings satisfy Condition ( B ′ ) . Proof. Assume that η ∈ ℵ . Thanks to Lemma 2.2, lim n → ∞ ‖ ω n − η ‖ exists. Also, ‖ ω n + 1 − η ‖ ≤ ‖ ω n − η ‖ for all n = 0 , 1 , 2 , ⋯ . It follows that d ( ω n + 1 , ℵ ) ≤ d ( ω n , ℵ ) . Consequently, Lemma 2.6 guarantees the existence of lim n → ∞ d ( ω n , ℵ ) In addition, we know from Theorem 2.3 that (24) holds. The adherence of ℜ 1 , ℜ 2 , and ℜ 3 to Condition ( B ′ ) directly implies that lim n → ∞ h ( d ( ω n , ℵ ) ) = 0 , for a nondecreasing function h . This result then leads to lim n → ∞ d ( ω n , ℵ ) = 0 . Consequently, we can select a subsequence { ω n i } of { ω n } and a corresponding sequence { η i } in ℵ such that ‖ ω n i − η i ‖ < ε 2 for all i ∈ ℕ and any given ε > 0 . To show that { ω n } is Cauchy, we consider n , ϑ ≥ i . In this case, we get ‖ ω n + ϑ − ω n ‖ ≤ ‖ ω n + ϑ − η i ‖ + ‖ η i − ω n ‖ ≤ ‖ ω n + ϑ − 1 − η i ‖ + ‖ η i − ω n ‖ ≤ ‖ ω n + ϑ − 2 − η i ‖ + ‖ η i − ω n ‖ ⋮ ≤ 2 ‖ η i − ω n ‖ = 2 ‖ ω n i − ω n ‖ < ϵ . Therefore { ω n } is Cauchy sequence in Ω . Since Ω is closed in Ξ , we know that lim n → ∞ ω n = δ for any δ ∈ Ω . The fact that ℵ is closed and lim n → ∞ d ( ω n , ℵ ) = 0 then leads directly to the conclusion that δ ∈ ℵ . This completes the proof. □ Remark 1. Since the class of C- α -NE mappings properly contains the class of α -NE mappings, the results presented in this work constitute a meaningful extension of the existing literature. In particular, our findings refine, complement, and generalize the results of Muangchoo-in et al. [ 35 ] and Naraghirad [ 11 ] in Banach spaces, while also extending the work of Pant and Shukla [ 19 ] . 3 Practical comparisons This section presents a comparative analysis of convergence rates. Specifically, we compare the performance of the proposed Z -iterative scheme (7) with several established iterative methods, namely those of Noor [ 36 ], S [ 37 ], Ishikawa [ 18 ], Abbas–Nazir [ 20 ], and HR [ 38 ]. The setting is a BS Ξ , where ℜ 1 and ℜ 2 are contraction mappings (CAMs) defined on a nonempty, closed, and convex subset Ω ⊂ Ξ . We assume that the sequences { ρ n } , { ξ n } , and { λ n } are chosen from the interval (0,1). Starting from arbitrary initial points ϖ 0 , s 0 , ϑ 0 , g 0 , ϱ 0 ∈ Ω , the iterative schemes are defined as follows: Noor iteration [ 36 ]: { ϖ 0 ∈ Ω , κ n = ( 1 − λ n ) ϖ n + λ n ℜ 1 ω n , τ n = ( 1 − ξ n ) ϖ n + ξ n ℜ 2 κ n , ϖ n + 1 = ( 1 − ρ n ) ϖ n + ρ n ℜ 1 τ n . (27) S-iteration [ 37 ]: { s 0 ∈ Ω , κ n = ( 1 − λ n ) s n + λ n ℜ 1 s n , τ n = ( 1 − ξ n ) κ n + ξ n ℜ 2 κ n , s n + 1 = ( 1 − ρ n ) ℜ 1 s n + ρ n ℜ 2 τ n . (28) Ishikawa iteration [ 18 ]: { ϑ 0 ∈ Ω , τ n = ( 1 − ξ n ) ϑ n + ξ n ℜ 2 ϑ n , ϑ n + 1 = ( 1 − ρ n ) ϑ n + ρ n ℜ 1 τ n . (29) Abbas-Nazir iteration [ 20 ]: { g 0 ∈ Ω , κ n = ( 1 − λ n ) g n + λ n ℜ 1 g n , τ n = ( 1 − ξ n ) g n + ξ n ℜ 2 κ n , g n + 1 = ( 1 − ρ n ) ℜ 1 τ n + ρ n ℜ 2 κ n . (30) HR-iteration [ 38 ]: { ϱ 0 ∈ Ω , ω n = ( 1 − ρ n ) ϱ n + ρ n ℜ 1 ϱ n , τ n = ℜ 2 [ ( 1 − ξ n ) ω n + ξ n ℜ 2 ω n ] , κ n = ℜ 2 [ ( 1 − λ n ) τ n + λ n ℜ 2 τ n ] , ϱ n + 1 = ℜ 2 κ n , (31) for all n = 0 , 1 , 2 , … . In the following, we analyze the convergence behavior of the MZI scheme (7) when applied to three contraction mappings (CAMs). Theorem 3.1. Let Ω ≠ ∅ be a closed convex subset of a Banach space Ξ . Suppose that ℜ 1 , ℜ 2 , ℜ 3 : Ω → Ω are three CAMs with a nonempty common FP set ℵ : = Fix ( ℜ 1 ) ∩ Fix ( ℜ 2 ) ∩ Fix ( ℜ 3 ) ≠ ∅ , and let { ω n } be the sequence generated by the MZI scheme (7) , where the control sequences { ρ n } , { ξ n } , and { λ n } are in (0,1). Let η ∈ ℵ be a common FP of ℜ 1 , ℜ 2 , and ℜ 3 . Then { ω n } converges strongly to the unique common FP of ℜ 1 , ℜ 2 , and ℜ 3 provided that the following conditions are satisfied: (i) ∑ n = 0 ∞ ρ n = ∞ \ ) , ∑ n = 0 ∞ ξ n = ∞ \ ) , ∑ n = 0 ∞ λ n = ∞ \ ) , (ii) ∑ n = 0 ∞ λ n ξ n ρ n = ∞ \ ) . Proof. From the MZI (7) , we get ‖ ν n − η ‖ = ‖ ( 1 − ρ n ) τ n + ρ n ℜ 1 τ n − η ‖ ≤ ( 1 − ρ n ) ‖ τ n − η ‖ + ρ n ‖ ℜ 1 τ n − ℜ 1 η ‖ ≤ ( 1 − ρ n ) ‖ τ n − η ‖ + ρ n ς ‖ τ n − η ‖ = ( 1 − ρ n + ρ n ς ) ‖ τ n − η ‖ = [ 1 − ρ n ( 1 − ς ) ] ‖ τ n − η ‖ , (32) ‖ τ n − η ‖ = ‖ ( 1 − ξ n ) κ n + ξ n ℜ 2 κ n − η ‖ ≤ ( 1 − ξ n ) ‖ κ n − η ‖ + ξ n ‖ ℜ 2 κ n − ℜ 2 η ‖ ≤ [ 1 − ξ n ( 1 − ς ) ] ‖ κ n − η ‖ , (33) and ‖ κ n − η ‖ = ‖ ℜ 3 [ ( 1 − λ n ) ω n + λ n ℜ 3 ω n ] − ℜ 3 η ‖ ≤ ς ‖ ( 1 − λ n ) ω n + λ n ℜ 3 ω n − η ‖ ≤ ς ( 1 − λ n ) ‖ ω n − η ‖ + ς λ n ‖ ℜ 3 ω n − ℜ 3 η ‖ ≤ ς ( 1 − λ n ) ‖ ω n − η ‖ + ς 2 λ n ‖ ω n − η ‖ = [ ς − ς λ n + ς 2 λ n ] ‖ ω n − η ‖ = ς [ 1 − λ n ( 1 − ς ) ] ‖ ω n − η ‖ . (34) It follows from (32) , (33) and (34) that ‖ ω n + 1 − η ‖ = ‖ ℜ 3 ν n − η ‖ = ‖ ℜ 3 ν n − ℜ 3 η ‖ ≤ ς ‖ ν n − η ‖ ≤ ς [ 1 − ρ n ( 1 − ς ) ] ‖ τ n − η ‖ ≤ ς [ 1 − ρ n ( 1 − ς ) ] [ 1 − ξ n ( 1 − ς ) ] ‖ κ n − η ‖ ≤ ς [ 1 − ρ n ( 1 − ς ) ] [ 1 − ξ n ( 1 − ς ) ] [ 1 − λ n ( 1 − ς ) ] ‖ ω n − η ‖ . Therefore, for ς ∈ ( 0 , 1 ) , we have ‖ ω n + 1 − η ‖ ≤ ς 2 [ 1 − [ ρ n + ξ n + λ n − ( ξ n λ n + [ ρ n λ n + ρ n ξ n ] ( 1 − ς ) ) − ρ n ξ n λ n ( 1 − ς ) 2 ] ( 1 − ς ) ] ‖ ω n − η ‖ . Following these steps iteratively, we find that ‖ ω n − η ‖ ≤ ς 2 [ 1 − { ρ n − 1 + ξ n − 1 + λ n − 1 − ( ξ n − 1 λ n − 1 + [ ρ n − 1 λ n − 1 + ρ n − 1 ξ n − 1 ] ( 1 − ς ) ) − ρ n − 1 ξ n − 1 λ n − 1 ( 1 − ς ) 2 } ( 1 − ς ) ] ‖ ω n − 1 − η ‖ , which implies that ‖ ω n − 1 − η ‖ ≤ ς 2 [ 1 − { ρ n − 2 + ξ n − 2 + λ n − 2 − ( ξ n − 2 λ n − 2 + [ ρ n − 2 λ n − 2 + ρ n − 2 ξ n − 2 ] ( 1 − ς ) ) − ρ n − 2 ξ n − 2 λ n − 2 ( 1 − ς ) 2 } ( 1 − ς ) ] ‖ ω n − 2 − η ‖ , ⋮ ‖ ω 1 − η ‖ ≤ ς 2 [ 1 − { ρ 0 + ξ 0 + λ 0 − ( ξ 0 λ 0 + [ ρ 0 λ 0 + ρ 0 ξ 0 ] ( 1 − ς ) ) − ρ 0 ξ 0 λ 0 ( 1 − ς ) 2 } ( 1 − ς ) ] ‖ ω 0 − η ‖ , it follows inductively that ‖ ω n + 1 − η ‖ ≤ ς 2 ( n + 1 ) ∏ j = 0 n [ 1 − { ρ j + ξ j + λ j − ( ξ j λ j + [ ρ j λ j + ρ j ξ j ] ( 1 − ς ) ) − ρ j ξ j λ j ( 1 − ς ) 2 } ( 1 − ς ) ] ‖ ω 0 − η ‖ . (35) Using the fact that 1 − ω ≤ e − ω , we have ‖ ω n + 1 − η ‖ ≤ ς 2 e − ( 1 − ς ) ∑ j = 0 ∞ ( ρ j + ξ j + λ j − ( ξ j λ j + [ ρ j λ j + ρ j ξ j ] ( 1 − ς ) ) − ρ j ξ j λ j ( 1 − ς ) 2 ) ‖ ω 0 − η ‖ . Applying the assumptions i), and ii) of Theorem 3.1 and passing n → ∞ , we conclude that lim n → ∞ ‖ ω n − η ‖ = 0 . Since ς 2 < ς < 1 , the sequence { ω n } converges strongly to η . □ We now provide an analytical comparison of convergence rates for CAMs, thereby highlighting the superior performance of the proposed MZI scheme (7) relative to several well-established iterative methods. Theorem 3.2. Let Ω ≠ ∅ be a closed convex subset of a BS Ξ , and let ℜ 1 , ℜ 2 , ℜ 3 : Ω → Ω be CAMs such that the common FP set ℵ : = Fix ( ℜ 1 ) ∩ Fix ( ℜ 2 ) ∩ Fix ( ℜ 3 ) is nonempty. Let η ∈ ℵ be a common FP of ℜ 1 , ℜ 2 , and ℜ 3 . Consider the sequences { ω n } , { ϖ n } , { s n } , { ϑ n } , { g n } , and { ϱ n } generated by the MZI scheme (7), and the Noor (27), S (28), Ishikawa (29), Abbas–Nazir (30), and HR (31) schemes, respectively. Suppose the control sequences { ρ n } , { ξ n } , and { λ n } lie in (0,1) and satisfy lim n → ∞ ρ n = 0 , lim n → ∞ ξ n = 0 , and lim n → ∞ λ n = 0 . Then, the MZI scheme (7) converges to η faster than each of the Noor (27), S (28), Ishikawa (29), Abbas–Nazir (30), and HR (31) iterative schemes. Proof. Applying the same calculation method as in Theorem 2.3, we derive the following estimates for the Noor iterative scheme (27): ‖ κ n − η ‖ = ‖ ( 1 − λ n ) ϖ n + λ n ℜ 1 ω n − η ‖ ≤ ( 1 − λ n ) ‖ ϖ n − η ‖ + λ n ‖ ℜ 1 ω n − η ‖ ≤ ( 1 − λ n ) ‖ ϖ n − η ‖ + λ n ς ‖ ω n − η ‖ = ( 1 − λ n ( 1 − ς ) ) ‖ ω n − η ‖ , ‖ τ n − η ‖ = ‖ ( 1 − ξ n ) ϖ n + ξ n ℜ 2 κ n − η ‖ ≤ ( 1 − ξ n ) ‖ ϖ n − η ‖ + ξ n ‖ ℜ 1 κ n − η ‖ ≤ ( 1 − ξ n ) ‖ ϖ n − η ‖ + ξ n ς ‖ κ n − η ‖ ≤ ( 1 − ξ n ) ‖ ϖ n − η ‖ + ξ n ς ( 1 − λ n ( 1 − ς ) ) ‖ ω n − η ‖ ≤ [ 1 − ξ n ( 1 − ς ( 1 − λ n ( 1 − ς ) ) ) ] ‖ ω n − η ‖ , and ‖ ϖ n + 1 − η ‖ = ‖ ( 1 − ρ n ) ϖ n + ρ n ℜ 1 τ n − η ‖ = ‖ ( 1 − ρ n ) ( ϖ n − η ) + ρ n ( ℜ 1 τ n − η ) ‖ ≥ ‖ ( 1 − ρ n ) ( ϖ n − η ) − ρ n ( ℜ 1 τ n − η ) ‖ ≥ | ( 1 − ρ n ) ‖ ϖ n − η ‖ − ρ n ς ‖ τ n − η ‖ | ≥ | ( 1 − ρ n ) ‖ ϖ n − η ‖ − ρ n ς [ 1 − ξ n ( 1 − ς ( 1 − λ n ( 1 − ς ) ) ) ] ‖ ω n − η ‖ | = | 1 − ρ n ( 1 + ς ( 1 − ξ n ( 1 − ς ( 1 − λ n ( 1 − ς ) ) ) ) ) ‖ ω n − η ‖ | ≥ | 1 − ρ n ( 1 + ς ) | ‖ ω n − η ‖ = ∏ j = 0 n ( 1 − ρ j ( 1 + ς ) ) ‖ ω 0 − η ‖ . For the Noor iterative scheme, we therefore obtain the following estimate: ‖ ϖ n + 1 − η ‖ ≥ ∏ j = 0 n ( 1 − ρ j ( 1 + ς ) ) ‖ ϖ 0 − η ‖ . (36) Similar to the calculations performed for the MZI (7) in (35) and the Noor iteration (27) in (36) , estimates for the S (28) , Ishikawa (29) , Abbas–Nazir (30) , and HR (31) iterative schemes can be determined. These are detailed below. ‖ s n + 1 − η ‖ ≥ ς ( 1 + n ) ∏ j = 0 n [ 1 − ρ j ( 1 + ρ j ( 1 − ξ j ( 1 − ς ) ) ( 1 − λ j ( 1 − ς ) ) ) ] ‖ s 0 − η ‖ , (37) ‖ ϑ n + 1 − η ‖ ≥ ∏ j = 0 n [ 1 − ρ j ( 1 + ς ) ] ‖ ϑ 0 − η ‖ , (38) ‖ g n + 1 − η ‖ ≤ ς ( 1 + n ) ∏ j = 0 n [ 1 − ρ j ξ j λ j ( 1 − ς ) ] ‖ g 0 − η ‖ , (39) and ‖ ϱ n + 1 − η ‖ ≤ ς ( 1 + n ) ∏ j = 0 n [ 1 − λ j ( 1 − ς ) ] ‖ ϱ 0 − η ‖ . (40) Now, utilizing (35) with (36) - (40) , respectively and selecting ω 0 = ϖ 0 = s 0 = ϑ 0 , one has 0 ≤ ‖ ω n + 1 − η ‖ ‖ ϖ n + 1 − η ‖ ≤ ς 2 ( n + 1 ) ∏ j = 0 n [ 1 − { ρ j + ξ j + λ j − ( ξ j λ j + [ ρ j λ j + ρ j ξ j ] ( 1 − ς ) ) − ρ j ξ j λ j ( 1 − ς ) 2 } ( 1 − ς ) ] ∏ j = 0 n ( 1 − ρ j ( 1 + ς ) ) , 0 ≤ ‖ ω n + 1 − η ‖ ‖ s n + 1 − η ‖ ≤ ς 2 ( n + 1 ) ∏ j = 0 n [ 1 − { ρ j + ξ j + λ j − ( ξ j λ j + [ ρ j λ j + ρ j ξ j ] ( 1 − ς ) ) − ρ j ξ j λ j ( 1 − ς ) 2 } ( 1 − ς ) ] ς ( 1 + n ) ∏ j = 0 n [ 1 − ρ j ( 1 + ρ j ( 1 − ξ j ( 1 − ς ) ) ( 1 − λ j ( 1 − ς ) ) ) ] , and 0 ≤ ‖ ω n + 1 − η ‖ ‖ ϑ n + 1 − η ‖ ≤ ς 2 ( n + 1 ) ∏ j = 0 n [ 1 − { ρ j + ξ j + λ j − ( ξ j λ j + [ ρ j λ j + ρ j ξ j ] ( 1 − ς ) ) − ρ j ξ j λ j ( 1 − ς ) 2 } ( 1 − ς ) ] ∏ j = 0 n [ 1 − ρ j ( 1 + ς ) ] . Now, we put ψ n = ς 2 ( n + 1 ) ∏ j = 0 n [ 1 − { ρ j + ξ j + λ j − ( ξ j λ j + [ ρ j λ j + ρ j ξ j ] ( 1 − ς ) ) − ρ j ξ j λ j ( 1 − ς ) 2 } ( 1 − ς ) ] ∏ j = 0 n ( 1 − ρ j ( 1 + ς ) ) , φ n = ς 2 ( n + 1 ) ∏ j = 0 n [ 1 − { ρ j + ξ j + λ j − ( ξ j λ j + [ ρ j λ j + ρ j ξ j ] ( 1 − ς ) ) − ρ j ξ j λ j ( 1 − ς ) 2 } ( 1 − ς ) ] ς ( 1 + n ) ∏ j = 0 n [ 1 − ρ j ( 1 + ρ j ( 1 − ξ j ( 1 − ς ) ) ( 1 − λ j ( 1 − ς ) ) ) ] , and ℧ n = ς 2 ( n + 1 ) ∏ j = 0 n [ 1 − { ρ j + ξ j + λ j − ( ξ j λ j + [ ρ j λ j + ρ j ξ j ] ( 1 − ς ) ) − ρ j ξ j λ j ( 1 − ς ) 2 } ( 1 − ς ) ] ∏ j = 0 n [ 1 − ρ j ( 1 + ς ) ] , then by the ratio test, we can write ψ n + 1 ψ n = ς 2 [ 1 − { ρ n + 1 + ξ n + 1 + λ n + 1 − ( ξ n + 1 λ n + 1 + [ ρ n + 1 λ n + 1 + ρ n + 1 ξ n + 1 ] ( 1 − ς ) ) − ρ n + 1 ξ n + 1 λ n + 1 ( 1 − ς ) 2 } ( 1 − ς ) ] ( 1 − ρ n + 1 ( 1 + ς ) ) , φ n + 1 φ n = ς [ 1 − { ρ n + 1 + ξ n + 1 + λ n + 1 − ( ξ n + 1 λ n + 1 + [ ρ n + 1 λ n + 1 + ρ n + 1 ξ n + 1 ] ( 1 − ς ) ) − ρ n + 1 ξ n + 1 λ n + 1 ( 1 − ς ) 2 } ( 1 − ς ) ] [ 1 − ρ n + 1 ( 1 + ρ n + 1 j ( 1 − ξ n + 1 ( 1 − ς ) ) ( 1 − λ n + 1 ( 1 − ς ) ) ) ] , and ℧ n + 1 ℧ n = ς 2 [ 1 − { ρ n + 1 + ξ n + 1 + λ n + 1 − ( ξ n + 1 λ n + 1 + [ ρ n + 1 λ n + 1 + ρ n + 1 ξ n + 1 ] ( 1 − ς ) ) − ρ n + 1 ξ n + 1 λ n + 1 ( 1 − ς ) 2 } ( 1 − ς ) ] [ 1 − ρ n + 1 ( 1 + ς ) ] . Under the conditions lim n → ∞ ρ n = 0 , lim n → ∞ ξ n = 0 , and lim n → ∞ λ n = 0 , we derive ℓ 1 = lim n → ∞ ψ n + 1 ψ n = ς 2 < ς < 1 , ℓ 2 = lim n → ∞ φ n + 1 φ n = ς < 1 , and ℓ 3 = lim n → ∞ ℧ n + 1 ℧ n = ς 2 < ς < 1 . The fact that ℓ 1 , ℓ 2 , ℓ 3 < 1 allows us to apply the ratio test, confirming the convergence of the series ∑ n = 0 ∞ ψ n , ∑ n = 0 ∞ φ n and ∑ n = 0 ∞ ℧ n . From the convergence of these series, it necessarily follows that lim n → ∞ ψ n = 0 , lim n → ∞ φ n = 0 , and lim n → ∞ ℧ n = 0 . Hence, lim n → ∞ ‖ ω n + 1 − η ‖ ‖ ϖ n + 1 − η ‖ = lim n → ∞ ‖ ω n + 1 − η ‖ ‖ s n + 1 − η ‖ = lim n → ∞ ‖ ω n + 1 − η ‖ ‖ ϑ n + 1 − η ‖ = 0 . Therefore, based on Definition 1.7, we can analytically conclude that { ω n } achieves convergence to a FP η at a faster rate than { ϖ n } , { s n } , and { ϑ n } . A distinct approach is utilized to demonstrate the faster convergence rate of { g n } and { ϱ n } . By setting ω 0 = g 0 = ϱ 0 and denoting the right-hand sides of (35) , (39) and (40) as b n , c n , and d n , respectively, we obtain that b n c n = ς 2 ( n + 1 ) ∏ j = 0 n [ 1 − { ρ j + ξ j + λ j − ( ξ j λ j + [ ρ j λ j + ρ j ξ j ] ( 1 − ς ) ) − ρ j ξ j λ j ( 1 − ς ) 2 } ( 1 − ς ) ] ς ( 1 + n ) ∏ j = 0 n [ 1 − ρ j ξ j λ j ( 1 − ς ) ] , → 0 as n → ∞ , and b n d n = ς 2 ( n + 1 ) ∏ j = 0 n [ 1 − { ρ j + ξ j + λ j − ( ξ j λ j + [ ρ j λ j + ρ j ξ j ] ( 1 − ς ) ) − ρ j ξ j λ j ( 1 − ς ) 2 } ( 1 − ς ) ] ς ( 1 + n ) ∏ j = 0 n [ 1 − λ j ( 1 − ς ) ] ‖ ϱ 0 − η ‖ → 0 as n → ∞ . In accordance with Definition 1.6, it is concluded that the sequence { ω n } converges to a FP η at a faster rate than sequences { g n } and { ϱ n } analytically. 4 Illustrative examples In this section, we present illustration examples to validate our results. Example 1. Consider the BS ( ℓ 2 , ‖ . ‖ 2 ) of square-summable sequences, equipped with its usual norm. Let ( e n ) denote the standard basis of ℓ 2 . Describe Ω = { γ e 4 : γ ∈ [ 0 , 1 ] } . Define three mapping ℜ 1 , ℜ 2 , ℜ 3 : Ω → Ω by ℜ 1 ( γ e 4 ) = { e 4 3 , γ = 1 , e 4 8 , o t h e r w i s e , ℜ 2 ( γ e 4 ) = { e 4 9 , γ = 1 , e 4 8 , o t h e r w i s e , and ℜ 3 ( γ e 4 ) = { e 4 15 , γ = 1 , e 4 8 , o t h e r w i s e . First, we proceed to verify that ℜ 1 , ℜ 2 and ℜ 3 are not NE. Fix ω = e 4 and υ = 14 15 e 4 , then ‖ ℜ 1 ω − ℜ 1 υ ‖ = ‖ ℜ 1 ( e 4 ) − ℜ 1 ( 14 15 e 4 ) ‖ = ‖ e 4 3 − e 4 8 ‖ = 5 24 > 1 15 = ‖ ω − υ ‖ . Again, take ω = e 4 and υ = 49 50 e 4 , then ‖ ℜ 2 ω − ℜ 2 υ ‖ = ‖ ℜ 2 ( e 4 ) − ℜ 2 ( 49 50 e 4 ) ‖ = ‖ e 4 15 − e 4 8 ‖ = 1 72 > 1 50 = ‖ ω − υ ‖ . Also, take ω = e 4 and υ = 99 100 e 4 , then ‖ ℜ 3 ω − ℜ 3 υ ‖ = ‖ ℜ 3 ( e 4 ) − ℜ 3 ( 99 100 e 4 ) ‖ = ‖ e 4 9 − e 4 8 ‖ = 7 120 > 1 100 = ‖ ω − υ ‖ . Thus, having established that ℜ 1 , ℜ 2 and ℜ 3 are not NE. Next, we demonstrate that ℜ 1 , ℜ 2 and ℜ 3 are C − α − NE mappings. We consider the following two options for ℜ 1 : Op. 1: If ω = γ 1 e 4 , υ = e 4 , and γ 1 ∈ [ 0 , 1 ) , we have α ‖ ℜ 1 ω − υ ‖ 2 + α ‖ ℜ 1 υ − ω ‖ 2 + ( 1 − 2 α ) ‖ ω − υ ‖ 2 = α ‖ e 4 8 − e 4 ‖ 2 + α ‖ e 4 3 − γ 1 e 4 ‖ 2 + ( 1 − 2 α ) ‖ γ 1 e 4 − e 4 ‖ 2 = 49 64 α + α ( 1 3 − γ 1 ) 2 + ( 1 − 2 α ) ( γ 1 − 1 ) 2 ≥ 49 128 , for α = 1 2 > ( 5 24 ) 2 = ‖ ℜ 1 ω − ℜ 1 υ ‖ 2 . Hence, ‖ ℜ 1 ω − ℜ 1 υ ‖ 2 ≤ α ‖ ℜ 1 ω − υ ‖ 2 + α ‖ ℜ 1 υ − ω ‖ 2 + ( 1 − 2 α ) ‖ ω − υ ‖ 2 , is true for α = 1 2 . Op. 2: If ω = γ 1 e 4 , υ = γ 2 e 4 , and γ 1 , γ 2 ∈ [ 0 , 1 ) , we have ‖ ℜ 1 ω − ℜ 1 υ ‖ 2 = 0 ≤ α ‖ ℜ 1 ω − υ ‖ 2 + α ‖ ℜ 1 υ − ω ‖ 2 + ( 1 − 2 α ) ‖ ω − υ ‖ 2 , this is true for α ∈ [ 0 , 1 ) , and consequently for α = 1 2 . The following two options concern ℜ 2 : Op. 3: If we take ω = γ 2 e 4 , υ = e 4 , and γ 1 ∈ [ 0 , 1 ) , we get α ‖ ℜ 2 ω − υ ‖ 2 + α ‖ ℜ 2 υ − ω ‖ 2 + ( 1 − 2 α ) ‖ ω − υ ‖ 2 = α ‖ e 4 8 − e 4 ‖ 2 + α ‖ e 4 9 − γ 2 e 4 ‖ 2 + ( 1 − 2 α ) ‖ γ 2 e 4 − e 4 ‖ 2 = 49 64 α + α ( 1 9 − γ 2 ) 2 + ( 1 − 2 α ) ( γ 2 − 1 ) 2 ≥ 49 128 , for α = 1 2 > ( 1 72 ) 2 = ‖ ℜ 2 ω − ℜ 2 υ ‖ 2 . Hence, ‖ ℜ 2 ω − ℜ 2 υ ‖ 2 ≤ α ‖ ℜ 2 ω − υ ‖ 2 + α ‖ ℜ 2 υ − ω ‖ 2 + ( 1 − 2 α ) ‖ ω − υ ‖ 2 , holds for α = 1 2 . Op. 4: If we take ω = γ 1 e 4 , υ = γ 2 e 4 , and γ 1 , γ 2 ∈ [ 0 , 1 ) . This aligns with (Op. 2), as discussed previously. The following two options concern ℜ 3 : Op. 5: If we set ω = γ 3 e 4 , υ = e 4 , and γ 3 ∈ [ 0 , 1 ) , we have α ‖ ℜ 3 ω − υ ‖ 2 + α ‖ ℜ 3 υ − ω ‖ 2 + ( 1 − 2 α ) ‖ ω − υ ‖ 2 = α ‖ e 4 8 − e 4 ‖ 2 + α ‖ e 4 15 − γ 3 e 4 ‖ 2 + ( 1 − 2 α ) ‖ γ 3 e 4 − e 4 ‖ 2 = 49 64 α + α ( 1 15 − γ 3 ) 2 + ( 1 − 2 α ) ( γ 3 − 1 ) 2 ≥ 49 128 , for α = 1 2 > ( 7 120 ) 2 = ‖ ℜ 3 ω − ℜ 3 υ ‖ 2 . Hence, ‖ ℜ 3 ω − ℜ 3 υ ‖ 2 ≤ α ‖ ℜ 3 ω − υ ‖ 2 + α ‖ ℜ 3 υ − ω ‖ 2 + ( 1 − 2 α ) ‖ ω − υ ‖ 2 , holds for α = 1 2 . Op. 6: If we set ω = γ 1 e 4 , υ = γ 3 e 4 , and γ 1 , γ 3 ∈ [ 0 , 1 ) . This is similar to Op. 2, discussed above. Therefore, the mappings ℜ 1 , ℜ 2 and ℜ 3 are C − 1 2 − NE mappings. Furthermore, it is evident that f i x ( ℜ 1 ) = f i x ( ℜ 2 ) = f i x ( ℜ 3 ) = e 4 8 , and thus ℵ ≠ ∅ . Describe h ( ϑ ) = ϑ , which is nondecreasing, satisfies h ( 0 ) = 0 and h ( ϑ ) > 0 for ϑ ∈ ( 0 , ∞ ) . Then, we deduce that d ( ω , ℵ ) = inf ‖ ω − e 4 8 ‖ = inf ‖ ( 0 , 0 , 0 , γ 1 − 1 8 , 0 , 0 , ⋯ ) ‖ = ( γ 1 − 1 8 ) 2 . Consequently, d ( ω , ℵ ) = { 0 , \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ γ 1 = 1 8 , ( γ 1 − 1 8 ) 2 , o t h e r w i s e . Thus, h ( d ( ω , ℵ ) ) = { 0 , \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ γ 1 = 1 8 , ( γ 1 − 1 8 ) 2 , o t h e r w i s e . It is clear that ‖ ℜ 1 ω − ω ‖ = { 2 3 , \ \ \ \ \ \ \ \ \ γ 1 = 1 , | 1 8 − γ 1 | , γ 1 ≠ 1 , ‖ ℜ 2 ω − ω ‖ = { 7 9 , \ \ \ \ \ \ \ \ \ γ 1 = 1 , | 1 8 − γ 1 | , γ 1 ≠ 1 , and ‖ ℜ 3 ω − ω ‖ = { 14 15 , \ \ \ \ \ \ \ \ \ γ 1 = 1 , | 1 8 − γ 1 | , γ 1 ≠ 1 , which implies that max { ‖ ℜ 1 ω − ω ‖ , ‖ ℜ 2 ω − ω ‖ , ‖ ℜ 3 ω − ω ‖ } ≥ h ( d ( ω , ℵ ) ) . Therefore ℜ 1 , ℜ 2 and ℜ 3 fulfill Condition ( B ′ ) . Thus, all requirements of Theorem 2.7 are satisfied and the mappings have a common FP e 4 8 . Example 2. Consider Ξ = ℝ as a BS equipped with its standard norm and Ω = [ − 2 , ∞ ) . We define the mappings ℜ 1 , ℜ 2 , ℜ 3 : Ω → Ω as follows: ℜ 1 ( ω ) = { ω 6 , ω ∈ [ − 2 , 1 2 ] ω 7 , o t h e r w i s e , ℜ 2 ( ω ) = { ω 7 , ω ∈ [ − 2 , 1 2 ] ω 10 , o t h e r w i s e , and ℜ 3 ( ω ) = { ω 10 , ω ∈ [ − 2 , 1 2 ] ω 12 , o t h e r w i s e . It’s easy to see that both mappings, ℜ 1 , ℜ 2 and ℜ 3 , are not NE due to their discontinuity at ω = 1 2 . Additionally, similar to the previous example’s calculations, it can be readily confirmed that both ℜ 1 , ℜ 2 and ℜ 3 are C − α − N E for α = 1 20 . Clearly, f i x ( ℜ 1 ) = f i x ( ℜ 2 ) = f i x ( ℜ 3 ) = 0 , this claim that ℵ = f i x ( ℜ 1 ) ∩ f i x ( ℜ 2 ) ∩ f i x ( ℜ 3 ) ≠ ∅ . Consider the nondecreasing function h ( ϑ ) = ϑ 4 with h ( 0 ) = 0 and h ( ϑ ) > 0 for ϑ ∈ ( 0 , ∞ ) . Consequently, we have d ( ω , ℵ ) = inf ‖ ω − η ‖ = inf ‖ ω − 0 ‖ = inf ‖ ω ‖ . Obviously d ( ω , ℵ ) = { 0 , ω ∈ [ − 2 , 1 2 ] , 1 2 , o t h e r w i s e , and h ( d ( ω , ℵ ) ) = { 0 , ω ∈ [ − 2 , 1 2 ] , 1 8 , o t h e r w i s e . Now, we discuss the following cases: Ca 1: If ω ∈ [ − 2 , 1 2 ] , we have ‖ ℜ 1 ω − ω ‖ = | ω 6 − ω | = | 5 ω 6 | ‖ ℜ 2 ω − ω ‖ = | ω 7 − ω | = | 6 ω 7 | , and ‖ ℜ 3 ω − ω ‖ = | ω 10 − ω | = | 9 ω 10 | . Hence max { ‖ ℜ 1 ω − ω ‖ , ‖ ℜ 2 ω − ω ‖ , ‖ ℜ 3 ω − ω ‖ } ≥ h ( d ( ω , ℵ ) ) . Ca. 2: If ω ∈ ( 1 2 , ∞ ) , one has ‖ ℜ 1 ω − ω ‖ = | ω 7 − ω | = | 6 ω 7 | , ‖ ℜ 2 ω − ω ‖ = | ω 10 − ω | = | 9 ω 10 | , and ‖ ℜ 3 ω − ω ‖ = | ω 12 − ω | = | 11 ω 12 | . Hence max { ‖ ℜ 1 ω − ω ‖ , ‖ ℜ 2 ω − ω ‖ , ‖ ℜ 3 ω − ω ‖ } ≥ h ( d ( ω , ℵ ) ) . Therefore, both ℜ 1 , ℜ 2 and ℜ 3 satisfy Condition ( B ′ ) , meaning the hypotheses of Theorem 2.7 are fulfilled. Thus, both mappings share the common FP of ω = 0 . 5 Numerical results In this section, we assess the numerical performance of the proposed iterative scheme (7), hereafter referred to as the Proposed MZI Method , through a series of computational experiments. The method is applied in both scalar and Hilbert space frameworks, specifically using Examples 4.1 and 4.2. For comparative analysis, we implement and evaluate the following five established iterative schemes: the Noor iteration scheme (27) ( Noor ), the S-iteration scheme (28) ( S-Iteration ), the Ishikawa iteration scheme (29) ( Ishikawa ), the Abbas–Nazir iteration scheme (30) ( Abbas–Nazir ), the HR iteration scheme (31) ( HR ). For each method, unless explicitly stated otherwise, the initial point and associated control parameters namely the sequences { ρ n } , { ξ n } , and { λ n } are randomly selected from the open interval (0,1). The experimental results highlight the efficiency and enhanced convergence characteristics of the proposed method in comparison with the aforementioned algorithms. 5.1 Experiment 1 This experiment is carried out using Example 4.1, which is defined in the infinite-dimensional Hilbert space ℓ 2 , with the feasible set restricted to scalar multiples of the standard basis vector e 4 . The objective is to evaluate the numerical performance of the Proposed MZI Method in comparison with five classical iterative schemes: Noor, S-Iteration, Ishikawa, Abbas–Nazir, and HR. To ensure a comprehensive and unbiased comparison, each method is tested under six distinct initial conditions of the form ω 0 = γ 0 e 4 , where γ 0 ∈ [ 0 , 1 ] is chosen to span representative values. These include the FP, boundary values, and intermediate scalars, thereby enabling a detailed examination of each method’s sensitivity to the initial guess. For every initial point, we record both the number of iterations required to achieve convergence (up to a specified tolerance of 10 −9 ) and the corresponding CPU time measured in seconds. This experimental setup enables a detailed comparison of convergence speed and computational efficiency across all algorithms. The six initial values used in Experiment 1 are given by ω 0 = γ 0 e 4 , where γ 0 ∈ { 1 10 , 1 6 , 0.25 , 0.5 , 0.75 , 1 } . 5.1.1 Interpretation of results. Table 1 , together with Figs 1 and 2 , presents a comparative analysis of the convergence behavior and computational efficiency of the proposed MZI method relative to five well-known iterative schemes: Ishikawa, Noor, S-Iteration, Abbas–Nazir (AN), and HR. The performance is assessed using six representative initial values γ 0 ∈ { 1 10 , 1 6 , 0.25 , 0.5 , 0.75 , 1 } . 10.1371/journal.pone.0346021.t001 Table 1 Performance of the proposed MZI method vs. five classical methods for Example 4.1 using six initial points. Iterations and CPU times correspond to Figs 1 and 2 . Initial Point γ 0 Ishikawa-Iteration Noor-Iteration S-Iteration AN-Iteration HR-Iteration MZI-Iteration Iter Time (s) Iter Time (s) Iter Time (s) Iter Time (s) Iter Time (s) Iter Time (s) 1 10 41 0.0003 39 0.0053 25 0.0029 21 0.0036 14 0.0038 5 0.0090 1 6 43 0.0023 40 0.0029 26 0.0041 21 0.0069 14 0.0028 5 0.0039 0.25 45 0.0029 42 0.0032 27 0.0031 23 0.0031 15 0.0030 5 0.0038 0.5 48 0.0038 45 0.0029 29 0.0030 24 0.0036 16 0.0018 5 0.0042 0.75 49 0.0035 46 0.0031 30 0.0039 24 0.0042 16 0.0042 5 0.0041 1 50 0.0028 47 0.0032 30 0.0032 25 0.0028 16 0.0028 5 0.0037 10.1371/journal.pone.0346021.g001 Fig 1 Convergence behavior of the Proposed MZI Method and five classical methods for Example 4.1. Panels (a) – (c) show the error versus the iteration count ( k ) for γ 0 = 1 10 , γ 0 = 1 6 , and γ 0 = 0.25 , respectively. Panels (d) – (f) show the error versus CPU time ( t ) for γ 0 = 1 10 , γ 0 = 1 6 , and γ 0 = 0.25 , respectively. 10.1371/journal.pone.0346021.g002 Fig 2 Convergence behavior of the Proposed MZI Method and five classical methods for Example 4.1. Panels (a) – (c) show the error versus the iteration count ( k ) for γ 0 = 0.5 , γ 0 = 0.75 , and γ 0 = 1 , respectively. Panels (d) – (f) show the error versus CPU time ( t ) for γ 0 = 0.5 , γ 0 = 0.75 , and γ 0 = 1 , respectively. A clear and consistent trend is observed across all methods: as the value of γ 0 increases, both the iteration count and the computational time generally increase. Among the classical methods, the Ishikawa and Noor schemes exhibit the slowest convergence, requiring between 41 and 50 iterations, and 39–47 iterations, respectively. In contrast, the proposed MZI method achieves significantly faster convergence, completing in only 5 iterations across all initial values tested. While the HR method demonstrates a notable improvement over the other classical schemes, requiring between 14 and 16 iterations, it still remains outperformed by the MZI approach. In terms of CPU time, the MZI method maintains consistently low execution times always below 0.009 seconds despite its superior convergence properties. For smaller initial values (e.g., γ 0 = 1 10 and 1 6 ), its advantage in both speed and efficiency becomes even more pronounced. Although the AN and HR methods occasionally exhibit moderate improvements over the Noor and Ishikawa schemes, they are neither as stable nor as efficient as the proposed MZI method. Overall, the numerical findings strongly support the robustness and efficiency of the proposed MZI method. Its independence from the initial condition, rapid convergence, and minimal computational overhead emphasize its effectiveness compared to conventional fixed-point iterative schemes, particularly in infinite-dimensional Hilbert space settings. 5.2 Experiment 2 This experiment is based on Example 4.2, which is defined on the real BS ℝ over the domain Ω = [ − 2 , ∞ ) . The operator involved is piecewise-defined and exhibits discontinuity at ω = 1 2 , making the convergence dynamics of iterative methods particularly noteworthy. Similar to Experiment 1, the performance of the proposed MZI Method is compared against five classical iterative schemes: Noor, S-Iteration, Ishikawa, Abbas–Nazir (AN), and HR. To ensure a comprehensive evaluation, each method is tested using six distinct initial points selected to span various regions of the domain including negative values, points near the discontinuity, and values in the positive range. This choice facilitates analysis of each method’s robustness, sensitivity to initialization, and efficiency in the presence of operator non-smoothness. For each initial point, the number of iterations required for convergence (with tolerance 10 −6 ) and the corresponding CPU execution time (in seconds) are recorded. The initial values used in Experiment 2 are given by: ω 0 ∈ { − 1.5 , 0 , 0.25 , 0.5 , 1 , 2 } . 5.2.1 Interpretation of results. Table 2 , supported by Figs 3 and 4 , presents a comparative analysis of six iterative schemes applied to Example 4.2, where the operator is piecewise-defined and non-smooth. The results highlight trends in iteration count and CPU time across initial points ω 0 ∈ { − 2.00 , − 1.50 , − 0.50 , 0.25 , 1.20 , 1.80 } . 10.1371/journal.pone.0346021.t002 Table 2 Comparison of iteration counts and execution times for the Proposed MZI Method and five classical methods on Example 4.2, using six initial points. Results correspond to Figs 3 and 4 . Initial Point ω 0 Ishikawa-Iteration Noor-Iteration S-Iteration AN-Iteration HR-Iteration MZI-Iteration Iter Time (s) Iter Time (s) Iter Time (s) Iter Time (s) Iter Time (s) Iter Time (s) –2.00 40 0.0009 39 0.0024 18 0.0021 15 0.0040 8 0.0041 4 0.0013 –1.50 39 0.0018 38 0.0027 17 0.0022 15 0.0039 8 0.0030 4 0.0014 –0.50 36 0.0035 35 0.0024 16 0.0027 14 0.0043 8 0.0033 4 0.0013 0.25 34 0.0030 33 0.0030 15 0.0022 13 0.0022 7 0.0030 4 0.0019 1.20 39 0.0038 37 0.0037 17 0.0016 15 0.0040 8 0.0054 4 0.0019 1.80 40 0.0040 38 0.0003 18 0.0046 15 0.0031 8 0.0040 4 0.0003 10.1371/journal.pone.0346021.g003 Fig 3 Convergence behavior of the Proposed MZI Method versus five classical methods for Example 4.2. Panels (a)–(c) show the error versus the iteration count ( k ) for ω 0 = − 2.00 , ω 0 = − 1.50 , and ω 0 = − 0.50 , respectively. Panels (d)–(f) show the error versus CPU time ( t ) for ω 0 = − 2.00 , ω 0 = − 1.50 , and ω 0 = − 0.50 , respectively. 10.1371/journal.pone.0346021.g004 Fig 4 Convergence of the Proposed MZI Method and five classical methods for Example 4.2. Panels (a)–(c) show the error versus the iteration count ( k ) for ω 0 = 0.25 , ω 0 = 1.20 , and ω 0 = 1.80 , respectively. Panels (d)–(f) show the error versus CPU time ( t ) for ω 0 = 0.25 , ω 0 = 1.20 , and ω 0 = 1.80 , respectively. Among the traditional methods, Ishikawa and Noor iterations show consistently higher iteration counts, ranging from 34 to 50, with increased computation times as the initial value approaches or exceeds the discontinuity at ω = 0.5 . The S-Iteration and AN methods demonstrate improved performance but still display sensitivity to the choice of ω 0 , particularly in regions near the discontinuity. The HR method shows a substantial improvement over its predecessors, converging in 7–8 iterations across all cases and maintaining computation times within 0.003 to 0.005 seconds. However, the proposed MZI method outperforms all others by converging in just 4 iterations for every tested value of ω 0 . Furthermore, its CPU time remains remarkably low never exceeding 0.0019 seconds and as low as 0.0003 seconds in some cases. These findings confirm the robustness, speed, and efficiency of the MZI method, which maintains high performance irrespective of operator non-smoothness or the selected initial point. Its insensitivity to initial conditions and superior convergence properties highlight its practical advantage over existing methods in solving nonlinear problems in BSs. 6 Supportive application This section utilizes the obtained results to examine the existence of solutions for a general class of VFIEs with deviating argument in a BS. We first present the MZI for a single mapping: { ω 0 ∈ Ω , ω n + 1 = ℜ ν n , ν n = ( 1 − ρ n ) τ n + ρ n ℜ τ n , τ n = ( 1 − ξ n ) κ n + ξ n ℜ κ n , κ n = ℜ [ ( 1 − λ n ) ω n + λ n ℜ ω n ] , (41) Our starting point is the general nonlinear VFIEs with a deviating argument in BSs, originally introduced by Lungu and Rus [ 39 ]: ϰ ( ζ , δ ) = Ψ ( ζ , δ , z ( ϰ ( ζ , δ ) ) ) + ∫ 0 ζ ∫ 0 δ ℑ ( ζ , δ , b , c , ϰ ( b , c ) ) d b d c , (42) for all ζ , δ ∈ ℝ + . For any BS ( Ξ , ‖ . ‖ ) and ℏ > 0 , it is possible to define Θ ℏ = { ϰ ∈ C ( ℝ + 2 , Ξ ) : there exists N ( ϰ ) > 0 such that | ϰ ( ζ , δ ) | e − ℏ ( ζ + δ ) ≤ N ( ϰ ) } . Considering Bielecki’s norm [ 40 ] on Θ ℏ as ‖ ϰ ‖ ℏ = sup ζ , δ ∈ ℝ + | ϰ ( ζ , δ ) | e − ℏ ( ζ + δ ) . It is known that ( Θ ℏ , ‖ . ‖ ℏ ) forms a BS. Now, the MZI (41) will be considered under the following assertions: (A 1 ) Ψ ∈ C ( ℝ + 2 × Ξ , Ξ ) and ℑ ∈ C ( ℝ + 4 × Ξ , Ξ ) , (A 2 ) z : Θ ℏ → Θ ℏ is such that there is M z > 0 such that | z ( ϰ ( ζ , δ ) ) − z ( ϰ ~ ( ζ , δ ) ) | ≤ M z ‖ ϰ − ϰ ~ ‖ ℏ e ℏ ( ζ + δ ) , for all ζ , δ ∈ ℝ + and ϰ , ϰ ~ ∈ Θ ℏ , (A 3 ) for all ζ , δ ∈ ℝ + and ρ 1 , ρ 2 ∈ Ξ , there exists M Ψ > 0 such that | Ψ ( ζ , δ , ρ 1 ) − Ψ ( ζ , δ , ρ 2 ) | ≤ M Ψ | ρ 1 − ρ 2 | , (A 4 ) for all ζ , δ , b , c ∈ ℝ + and ρ 1 , ρ 2 ∈ Ξ , there exists M ℑ > 0 such that | ℑ ( ζ , δ , b , c , ρ 1 ) − ℑ ( ζ , δ , b , c , ρ 2 ) | ≤ M ℑ ( ζ , δ , b , c ) | ρ 1 − ρ 2 | , (A 5 ) for all ζ , δ ∈ ℝ + , there exists M > 0 such that ∫ 0 ζ ∫ 0 δ M ℑ ( ζ , δ , b , c ) e ℏ ( b + c ) d b d c ≤ M e ℏ ( ζ + δ ) , where M ℑ ∈ C ( ℝ + 4 , ℝ + ) , (A 6 ) M Ψ M z + M < 1 . Moreover, the integral equation (42) has a unique solution ϰ ~ ∈ Θ ℏ , and the sequence of successive approximations ϰ n + 1 ( ζ , δ ) = Ψ ( ζ , δ , z ( ϰ n ( ζ , δ ) ) ) + ∫ 0 ζ ∫ 0 δ ℑ ( ζ , δ , b , c , ϰ n ( b , c ) ) d b d c , (43) converges uniformly to ϰ ~ , for all n = 0 , 1 , 2 , ⋯ . The forthcoming result provides an affirmative demonstration of the existence and uniqueness of the solution for such integral equations. Theorem 6.1. Assume that { ω n } is a sequence produced by the MZI (41) , with control sequences { ρ n } , { ξ n } and { λ n } on (0,1) fulfilling ∑ n = 0 ∞ ρ n = ∞ , ∑ n = 0 ∞ ξ n = ∞ , ∑ n = 0 ∞ λ n = ∞ , and ∑ n = 0 ∞ λ n ξ n ρ n = ∞ . If the assertions (A 1 )-(A 6 ) and (43) are satisfied, then the VFIE (42) admits a unique solution ϰ ~ ∈ Θ ℏ , and the MZI (41) converges strongly to this solution. Proof. Assume the iterative sequence { ω n } induced by the MZI (41) . Describe and operator ℜ : Θ ℏ → Θ ℏ as ℜ ( ϰ ( ζ , δ ) ) = Ψ ( ζ , δ , z ( ϰ ( ζ , δ ) ) ) + ∫ 0 ζ ∫ 0 δ ℑ ( ζ , δ , b , c , ϰ ( b , c ) ) d b d c . We shall prove that ω n → ϰ ~ as n → ∞ . Using the the iteration (41) , we have ‖ ω n + 1 − ϰ ~ ‖ ℏ = ‖ ℜ ν n − ℜ ϰ ~ ‖ ℏ = sup ζ , δ ∈ ℝ + | ℜ ( ν n ( ζ , δ ) ) − ℜ ( ϰ ~ ( ζ , δ ) ) | e − ℏ ( ζ + δ ) . (44) Now, | ℜ ( ν n ( ζ , δ ) ) − ℜ ( ϰ ~ ( ζ , δ ) ) | ≤ | Ψ ( ζ , δ , z ( ν n ( ζ , δ ) ) ) − Ψ ( ζ , δ , z ( ϰ ~ ( ζ , δ ) ) ) | + | ∫ 0 ζ ∫ 0 δ ℑ ( ζ , δ , b , c , ν n ( b , c ) ) d b d c − ∫ 0 ζ ∫ 0 δ ℑ ( ζ , δ , b , c , ϰ ~ ( b , c ) ) d b d c | ≤ M Ψ | z ( ν n ( ζ , δ ) ) − z ( ϰ ~ ( ζ , δ ) ) | + ∫ 0 ζ ∫ 0 δ | ℑ ( ζ , δ , b , c , ν n ( b , c ) ) − ℑ ( ζ , δ , b , c , ϰ ~ ( b , c ) ) | d b d c ≤ M Ψ M z ‖ ν n − ϰ ~ ‖ ℏ e ℏ ( ζ + δ ) + ∫ 0 ζ ∫ 0 δ M ℑ ( ζ , δ , b , c ) | ν n ( b , c ) − ϰ ~ ( b , c ) | d b d c ≤ M Ψ M z ‖ ν n − ϰ ~ ‖ ℏ e ℏ ( ζ + δ ) + M ‖ ν n − ϰ ~ ‖ ℏ e ℏ ( ζ + δ ) = ( M Ψ M z + M ) ‖ ν n − ϰ ~ ‖ ℏ e ℏ ( ζ + δ ) . (45) Applying (45) in (44) , we conclude that ‖ ω n + 1 − ϰ ~ ‖ ℏ ≤ ( M Ψ M z + M ) ‖ ν n − ϰ ~ ‖ ℏ . (46) Again, utilizing the algorithm (41) , we have ‖ ν n − ϰ ~ ‖ ℏ = ‖ ( 1 − ρ n ) τ n + ρ n ℜ τ n − ℜ ϰ ~ ‖ ℏ ≤ ( 1 − ρ n ) ‖ τ n − ℜ ϰ ~ ‖ ℏ + ρ n ‖ ℜ τ n − ℜ ϰ ~ ‖ ℏ . (47) Similar to (44) , we can write ‖ ℜ τ n − ℜ ϰ ~ ‖ ℏ = sup ζ , δ ∈ ℝ + | ℜ ( τ n ( ζ , δ ) ) − ℜ ( ϰ ~ ( ζ , δ ) ) | e − ℏ ( ζ + δ ) . (48) Similar to (45) , one has | ℜ ( τ n ( ζ , δ ) ) − ℜ ( ϰ ~ ( ζ , δ ) ) | ≤ ( M Ψ M z + M ) ‖ τ n − ϰ ~ ‖ ℏ e ℏ ( ζ + δ ) . (49) From (49) in (48) , we can write ‖ ℜ τ n − ℜ ϰ ~ ‖ ℏ ≤ ( M Ψ M z + M ) ‖ τ n − ϰ ~ ‖ ℏ (50) Applying (50) in (47) , we get ‖ ν n − ϰ ~ ‖ ℏ ≤ ( 1 − ρ n ) ‖ τ n − ϰ ~ ‖ ℏ + ρ n ( M Ψ M z + M ) ‖ τ n − ϰ ~ ‖ ℏ = [ 1 − ρ n ( 1 − ( M Ψ M z + M ) ) ] ‖ τ n − ϰ ~ ‖ ℏ . (51) Similarly, by the algorithm (41) , we have ‖ τ n − ϰ ~ ‖ ℏ ≤ ( 1 − ξ n ) ‖ κ n − ϰ ~ ‖ + ξ n ( M Ψ M z + M ) ‖ κ n − ϰ ~ ‖ ℏ = [ 1 − ξ n ( 1 − ( M Ψ M z + M ) ) ] ‖ κ n − ϰ ~ ‖ ℏ . (52) From (52) in (51) , one has ‖ ν n − ϰ ~ ‖ ℏ ≤ [ 1 − ρ n ( 1 − ( M Ψ M z + M ) ) ] [ 1 − ξ n ( 1 − ( M Ψ M z + M ) ) ] ‖ κ n − ϰ ~ ‖ ℏ . (53) Finally, ‖ κ n − ϰ ~ ‖ ℏ = ‖ ℜ [ ( 1 − λ n ) ω n + λ n ℜ ω n ] − ℜ ϰ ~ ‖ ℏ ≤ ‖ ( 1 − λ n ) ω n + λ n ℜ ω n − ϰ ~ ‖ ℏ ≤ ( 1 − λ n ) ‖ ω n − ϰ ~ ‖ + λ n ‖ ℜ ω n − ℜ ϰ ~ ‖ ℏ ≤ ( 1 − λ n ) ‖ ω n − ϰ ~ ‖ + λ n ( M Ψ M z + M ) ‖ ω n − ϰ ~ ‖ ℏ = [ 1 − λ n ( 1 − ( M Ψ M z + M ) ) ] ‖ ω n − ϰ ~ ‖ ℏ . (54) Applying (54) in (53) , we have ‖ ν n − ϰ ~ ‖ ℏ ≤ [ 1 − ρ n ( 1 − ( M Ψ M z + M ) ) ] [ 1 − ξ n ( 1 − ( M Ψ M z + M ) ) ] [ 1 − λ n ( 1 − ( M Ψ M z + M ) ) ] ‖ ω n − ϰ ~ ‖ ℏ . (55) Reflecting (55) in (46) , we obtain that ‖ ω n + 1 − ϰ ~ ‖ ℏ ≤ ( M Ψ M z + M ) 2 { 1 − [ ρ n + ξ n + λ n − ( ξ n λ n + [ ρ n λ n + ρ n ξ n ] ( 1 − ( M Ψ M z + M ) ) ) − ρ n ξ n λ n ( 1 − ( M Ψ M z + M ) 2 ) ] ( 1 − ( M Ψ M z + M ) ) } ‖ ω n − ϰ ~ ‖ ℏ . (56) For simplicity, we consider ℘ n = [ ρ n + ξ n + λ n − ( ξ n λ n + [ ρ n λ n + ρ n ξ n ] ( 1 − ( M Ψ M z + M ) ) ) − ρ n ξ n λ n ( 1 − ( M Ψ M z + M ) 2 ) ] , such that ℘ n ∈ ( 0 , 1 ) . Since ∑ n = 0 ∞ ρ n = ∞ , ∑ n = 0 ∞ ξ n = ∞ , ∑ n = 0 ∞ λ n = ∞ , and ∑ n = 0 ∞ λ n ξ n ρ n = ∞ , we have ∑ n = 0 ∞ ℘ n = ∞ . Further, since M Ψ M z + M < 1 , the inequality (56) reduces to ‖ ω n + 1 − ϰ ~ ‖ ℏ ≤ [ ( 1 − ℘ n ) ( 1 − ( M Ψ M z + M ) ) ] ‖ ω n − ϰ ~ ‖ ℏ . = ( 1 − [ ℘ n ( 1 − ( M Ψ M z + M ) ) − ( M Ψ M z + M ) ] ) ‖ ω n − ϰ ~ ‖ ℏ . Following the same procedure, we get ‖ ω n − ϰ ~ ‖ ℏ ≤ ( 1 − [ ℘ n − 1 ( 1 − ( M Ψ M z + M ) ) − ( M Ψ M z + M ) ] ) ‖ ω n − 1 − ϰ ~ ‖ ℏ ‖ ω n − 1 − ϰ ~ ‖ ℏ ≤ ( 1 − [ ℘ n − 2 ( 1 − ( M Ψ M z + M ) ) − ( M Ψ M z + M ) ] ) ‖ ω n − 2 − ϰ ~ ‖ ℏ ⋮ ‖ ω 1 − ϰ ~ ‖ ℏ ≤ ( 1 − [ ℘ 0 ( 1 − ( M Ψ M z + M ) ) − ( M Ψ M z + M ) ] ) ‖ ω 0 − ϰ ~ ‖ ℏ , and inductively ‖ ω n + 1 − ϰ ~ ‖ ℏ ≤ ‖ ω 0 − ϰ ~ ‖ ℏ ∏ j = 0 n ( 1 − [ ℘ j ( 1 − ( M Ψ M z + M ) ) − ( M Ψ M z + M ) ] ) . (57) Because ρ j , ξ j , λ j , ℘ j ∈ ( 0 , 1 ) and applying the hypotheses (A 6 ), we get ℘ n < 1 and 1 − ( M Ψ M z + M ) < 1 . From the fact that 1 − ω ≤ e − ω , we have ‖ ω n + 1 − ϰ ~ ‖ ℏ ≤ ‖ ω 0 − η ‖ e − ∑ j = 0 ∞ [ ℘ j ( 1 − ( M Ψ M z + M ) ) − ( M Ψ M z + M ) ] . Passing n → ∞ , and using the assumption ∑ n = 0 ∞ ℘ n = ∞ , we have lim n → ∞ ‖ ω n − ϰ ~ ‖ ℏ = 0 . This proves that the MZI (41) converges strongly to a unique solution ϰ ~ . Example 3. Consider the following integral equation: Υ ( ζ , δ ) = ζ δ 3 − ζ 3 δ 3 48 + ∫ 0 ζ ∫ 0 δ ζ δ 4 Υ ( b , c ) d b d c . (58) The unique solution to the problem (58) is Υ ( ζ , δ ) = ζ δ 3 , as can be readily verified for all ζ , δ ∈ [ 0 , 1 ] × [ 0 , 1 ] . Let z ( Υ ( ζ , δ ) ) = Υ ( ζ , δ ) for all ζ , δ ∈ [ 0 , 1 ] × [ 0 , 1 ] and ζ δ ∈ [ 0 , 1 ] . Then, we have Ψ ( ζ , δ , z ( Υ ( ζ , δ ) ) ) = ζ δ 3 ( 1 − ζ 2 δ 2 16 ) , and ℑ ( ζ , δ , b , c , Υ ( b , c ) ) = ζ δ 4 Υ ( b , c ) . Clearly | z ( Υ ( ζ , δ ) ) − z ( ϰ ~ ( ζ , δ ) ) | = 1 . | Υ ( ζ , δ ) − ϰ ~ ( ζ , δ ) | , which leads to M z = 1 . Also, | Ψ ( ζ , δ , z ( Υ ( ζ , δ ) ) ) − Ψ ( ζ , δ , z ( ϰ ~ ( ζ , δ ) ) ) | = | Υ ( ζ , δ ) ( 1 − ζ 2 δ 2 16 ) − ϰ ~ ( ζ , δ ) ( 1 − ζ 2 δ 2 16 ) | = | 1 − ζ 2 δ 2 16 | | Υ ( ζ , δ ) − ϰ ~ ( ζ , δ ) | . For the Lipschitz condition to be satisfied, the term ( 1 − ζ 2 δ 2 16 ) must remain bounded. Its upper bound is achieved when ζ = 1 = δ , yielding ( 1 − ζ 2 δ 2 16 ) ≤ 15 16 , for all ζ , δ ∈ [ 0 , 1 ] . Consequently, | Ψ ( ζ , δ , z ( Υ ( ζ , δ ) ) ) − Ψ ( ζ , δ , z ( ϰ ~ ( ζ , δ ) ) ) | ≤ 15 16 | Υ ( ζ , δ ) − ϰ ~ ( ζ , δ ) | , which implies that M Ψ = 15 16 . Further, | ℑ ( ζ , δ , b , c , z ( Υ ( ζ , δ ) ) ) − ℑ ( ζ , δ , b , c , z ( ϰ ~ ( ζ , δ ) ) ) | ≤ ζ δ 4 | z ( Υ ( ζ , δ ) ) − z ( ϰ ~ ( ζ , δ ) ) | , hence M ℑ ( ζ , δ , b , c ) = ζ δ 4 . Finally, to evaluate M, we have ∫ 0 ζ ∫ 0 δ ζ δ 4 e ℏ ( b + c ) d b d c = ( ζ δ 4 ) ∫ 0 ζ ∫ 0 δ e ℏ ( b + c ) d b d c = ( ζ δ 4 ) ∫ 0 ζ ( e ℏ δ − 1 ℏ ) e ℏ c d c = ( ζ δ 4 ℏ 2 ) ( e ℏ ( δ + ζ ) − e ℏ δ − e ℏ ζ + 1 ) ≤ ( 1 4 ℏ 2 ) ( e ℏ ( δ + ζ ) + 1 ) = ( 1 4 ℏ 2 ) ( 1 + 1 e ℏ ( δ + ζ ) ) e ℏ ( δ + ζ ) ≤ ( 2 4 ℏ 2 ) e ℏ ( δ + ζ ) = ( 1 2 ℏ 2 ) e ℏ ( δ + ζ ) . Thus, M = 1 2 ℏ 2 and M Ψ M z + M = ( 15 16 × 1 + 1 2 ℏ 2 ) = 15 16 + 1 2 ℏ 2 < 1 , this is true when ℏ > 2 2 > 0 . Consequently, all the stipulations (A 1 )-(A 6 ) are fulfilled. Therefore, the integral equation (58) admits a unique solution Υ ( ζ , δ ) = ζ δ 3 , and its Picard sequence of successive approximations converges uniformly to the solution. 7 Conclusion and open problems Iterative schemes are paramount for reckoning FPs, especially when dealing with complex nonlinear integral equations, because direct analytical solutions are often intractable or nonexistent. By transforming a nonlinear integral equation into an equivalent FP problem, iterative methods generate a sequence of successive approximations that, under certain conditions, converge to the unique FP, which in turn represents the solution to the original integral equation. These schemes not only provide a practical means of approximating solutions to otherwise unsolvable problems arising in various scientific and engineering disciplines but also allow for the analysis of convergence rates and stability, facilitating the development of more efficient and robust numerical techniques. So, in this paper, the existence of common FPs for C − α − N E mappings is primarily explored. A novel four-step iterative algorithm, termed the MZI, is introduced as the main contribution, specifically developed for pairs of mappings. This algorithm is then leveraged to derive several weak and strong convergence results, thereby demonstrating the existence of these common FPs. Constructive illustrative examples are provided to validate the theoretical results. Additionally, the practical applicability of the proposed algorithm is showcased by using it to approximate solutions to a certain class of nonlinear VFIEs in BSs, further supported by a relevant integral equation example. Finally, the following points are designated for future research: We can find a common solution to the variational inequality problem by defining a nonlinear self-mapping ℜ in a Hilbert space Ξ (equipped with an inner product) and then applying our iteration (41) . The problem is stated as follows: find ω * ∈ Ξ such that ⟨ ℜ ω * , ω − ω * ⟩ ≥ 0 , ∀ ω ∈ Ξ . Variational inequalities serve as vital modeling instruments in diverse areas like engineering mechanics, transportation, economics, and mathematical programming [ 41 , 42 ]. Generalizing our algorithm to gradient and extra-gradient projection methods is possible. Such methods are highly significant for identifying saddle points and resolving numerous optimization challenges [ 43 ]. We can accelerate the convergence of our proposed algorithm by incorporating shrinking projection and CQ terms. These methods are known to significantly boost algorithm performance and achieve strong convergence [ 44 , 45 ]. By defining the mapping ℜ as α − inverse strongly monotone and adding an inertial term to our algorithm, the inertial proximal point algorithm is obtained. This algorithm is highly applicable in diverse areas like monotone variational inequalities, image restoration problems, convex optimization problems, and split convex feasibility problems [ 46 , 47 ]. More precisely, these problems can be formulated as mathematical models for fields such as machine learning and linear inverse problems. Our algorithm can also be applied to second-order differential equations and fractional differential equations. These can be transformed into integral equations via Green’s function, making them straightforward to handle and solve using the same approach as in last part. The error of our present iteration can be quantified.