Next Article in Journal
An Adaptive Learning Algorithm Based on Spiking Neural Network for Global Optimization
Previous Article in Journal
Symmetry and Asymmetry in Pre-Trained Transformer Models: A Comparative Study of TinyBERT, BERT, and RoBERTa for Chinese Educational Text Classification
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Expansion of Convergence Domain of a Parameter-Based Iteration Scheme for Equations in Banach Spaces

by
Eulalia Martínez
1,*,† and
Debasis Sharma
2,†
1
Instituto Universitario de Matemática Multidisciplinar, Universitat Politècnica de València, 46022 València, Spain
2
Department of Mathematics, Model Degree College, Rayagada 765017, Odisha, India
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Symmetry 2025, 17(11), 1813; https://doi.org/10.3390/sym17111813
Submission received: 14 September 2025 / Revised: 8 October 2025 / Accepted: 14 October 2025 / Published: 28 October 2025

Abstract

The performance of iterative schemes used to solve nonlinear operator equations is strongly influenced by the initial guess. Therefore, it is essential to accurately determine convergence radii and develop theoretical strategies to broaden the region where convergence is guaranteed in order to enhance the reliability and efficiency of these methods. A crucial tool for this purpose is local convergence analysis, which investigates behavior near the true solution to establish convergence criteria. This work is dedicated to extending the convergence region of a parameter-based iteration scheme of the fifth-order. We carry out a comprehensive local convergence study within the framework of Banach spaces and derive precise formulas for the convergence radius, error estimates, and convergence zones associated with the method. A notable advantage of our approach is that it relies solely on the first derivative and avoids the need for additional conditions, making it easier to apply and significantly expanding the convergence region relative to earlier approaches. The theoretical contributions are further validated through a series of numerical experiments applied to diverse classes of nonlinear equations. Furthermore, the examination of the basins of attraction and their symmetry provides a deeper understanding of the method’s dynamic characteristics, robustness, and effectiveness in tackling complex-valued polynomial equations.

1. Introduction

A central challenge in Numerical Functional Analysis is solving nonlinear operator equations in Banach spaces. This becomes particularly crucial because the mathematical models that capture the essential characteristics of physical phenomena across various domains, such as science, engineering, and related fields, are typically nonlinear in nature. These models represent complex systems and behaviors through a set of mathematical equations that describe the relationships between multiple variables. In mathematical terms, a nonlinear model is generally formulated as follows:
ϑ ^ ( q ) = 0 ,
where ϑ ^ : Y ˜ Y ˜ 1 Y ˜ 2 is a continuously Fréchet differentiable operator; Y ˜ k ’s are Banach spaces for k = 1 , 2 ; and Y ˜ Y ˜ 1 is both open and convex. In order to analyze the behavior of a given physical phenomenon under a wide range of conditions, it is crucial to solve the corresponding nonlinear model. However, due to the nonlinear nature of the models, analytical or closed-form solutions to such equations is typically not attainable through direct analytical techniques. In these cases, finding explicit solutions becomes an intractable task. As a result, numerical schemes are employed to obtain approximate solutions. These schemes utilize iterative techniques to offer numerical solutions with the desired accuracy. Among these methods, Newton’s scheme (NS) is one of the most prominent and renowned techniques used to solve Equation (1). This technique approximates the solution to (1) in the following manner.
q t + 1 = q t ϑ ^ ( q t ) 1 ϑ ^ ( q t ) , t N { 0 } .
NS is particularly valued for its computational efficacy and simple iterative formula, making it a cornerstone in the development of higher-order iterative methods. Over time, a variety of iterative techniques [1,2,3,4,5,6,7,8,9] have been developed to improve the performance of NS, often by introducing more functional evaluations or incorporating additional Jacobian evaluations. In [3], by combining an iterative procedure of order α with a Newton-type modification involving just one additional function evaluation, the authors derived a method of order α + 2 . Modifications of NS achieving third and fourth-order convergence are presented in [4] and [5]. The method of our interest is the following fourth- and fifth-order parameter-based iteration scheme (PBIS) created by Xiao and Yin [1].
μ t = q t a ϑ ^ ( q t ) 1 ϑ ^ ( q t ) , δ t = μ t ϑ ^ ( q t ) 1 ϑ ^ ( μ t ) , q t + 1 = δ t 1 a ϑ ^ ( μ t ) 1 + 1 1 a ϑ ^ ( q t ) 1 ϑ ^ ( δ t ) , t N { 0 } ,
where a R { 0 } . This scheme, for a = ± 1 , has a convergence order equal to five.
In recent developments, there has been a marked shift towards eliminating the dependence on Taylor series expansions in the convergence analysis of iterative algorithms. Researchers such as Amat et al. [10], Argyros et al. [11,12,13,14,15], Cordero et al. [16], Hernández-Verón et al. [17], and George et al. [18], and others [19,20,21,22] have made substantial contributions to developing convergence theories independent of higher-order derivatives. In particular, they have extensively studied the local and semi-local convergence behaviors of iterative techniques, particularly those achieving third-order or higher convergence. Similarly, several works [23,24] have contributed to enhancing the practical applicability of PBIS by conducting local convergence analyses, relying on the Lipschitz and Hölder continuity properties of ϑ ^ . Martínez et al. [23] enlarged its domain of convergence utilizing the local convergence tool. They used Lipschitz continuity of ϑ ^ and also removed the additional condition on the boundedness of ϑ ^ . Later, to enhance the productiveness of this iteration, Singh et al. [24] used Hölder continuity of ϑ ^ in Banach spaces and established its convergence. Their work expanded the utility of PBIS to address the problems for which the Lipschitz criterion does not hold.
In the context of iterative schemes, one of the primary difficulties encountered is determining the exact region where the method achieves convergence. Often, this region is constrained and may be relatively small. Therefore, broadening the convergence area, without adding extra assumptions, becomes a significant objective. Another essential concern is achieving accurate error estimates at each iteration for assessing the performance of the method. In response to these challenges, we focus on extending the convergence domain of the PBIS [1] through a robust analytical framework. In particular, a detailed local convergence analysis is carried out in the framework of Banach spaces, where we derive explicit expressions for the convergence radius, error estimates, and the associated regions of convergence for PBIS. This analysis is based on generalized Lipschitz-Hölder-type continuity of ϑ ^ , alongside suitable auxiliary functions to support the theoretical framework. The theoretical contributions are substantiated by a series of carefully designed numerical experiments covering a diverse set of nonlinear problems, confirming the robustness and applicability of the approach.
The analytical contributions of this study are particularly significant because they rely exclusively on the generalized Lipschitz-Hölder-type continuity of ϑ ^ , avoiding the imposition of additional restrictive conditions on the boundedness of the first derivative that are often necessary in previous works. This simplification not only enhances the computational efficiency but also significantly broadens the convergence domain of PBIS compared to existing analytical techniques [23,24]. Moreover, a graphical analysis of the basins of attraction provides a deeper insight into the method’s dynamic behavior, robustness, and its potential for solving complex-valued polynomial equations.
The remainder of the paper is structured as follows. In Section 2, we provide a comprehensive theoretical framework for the local convergence of PBIS within Banach spaces, emphasizing the derivation of convergence radius and error estimates. Section 3 presents a graphical investigation of the basins of attraction to analyze the stability and convergence properties of PBIS. In Section 4, we report the results of extensive numerical experiments that validate the analytical findings and highlight the practical advantages of our approach. Finally, Section 5 concludes the paper by summarizing the contributions.

2. Analysis of Local Convergence of PBIS

We thoroughly investigate the local convergence of the PBIS in this section, beginning with the introduction of the following notations. Let D : = [ 0 , ) , L ^ B ( Y ˜ 1 , Y ˜ 2 ) : = { H ¯ : Y ˜ 1 Y ˜ 2 | H ¯ is bounded and linear}, ζ ( δ , c * ) : = { q Y ˜ 1 | | | δ q | | < c * } , and ζ [ δ , c * ] : = { q Y ˜ 1 | | | δ q | | c * } , where δ Y ˜ 1 and c * > 0 .
  • Let the operator ϑ ^ : Y ˜ Y ˜ 1 Y ˜ 2 be such that it fulfills the following conditions:
(Y1)
ϑ ^ is continuously Fréchet derivable;
(Y2)
there exists p ^ * Y ˜ , such that ϑ ^ ( p ^ * ) = 0 ;
(Y3)
ϑ ^ ( p ^ * ) 1 L ^ B ( Y ˜ 2 , Y ˜ 1 ) ;
(Y4)
| | ϑ ^ ( p ^ * ) 1 ( ϑ ^ ( q ) ϑ ^ ( p ^ * ) ) | | A ^ 0 ( | | q p ^ * | | ) , q Y ˜ ;
(Y5)
| | ϑ ^ ( p ^ * ) 1 ( ϑ ^ ( q ) ϑ ^ ( δ ) ) | | A ^ ( | | q δ | | ) , q , δ Y ˜ 0 : = Y ˜ ζ ( p ^ * , τ 0 ) .
  • Here, the functions A ^ : D D and A ^ 0 : D D meet the following criteria:
( χ 1 )
A ^ and A ^ 0 are continuous functions;
( χ 2 )
if ϱ 1 < ϱ 2 , then A ^ ( ϱ 1 ) A ^ ( ϱ 2 ) and A ^ 0 ( ϱ 1 ) A ^ 0 ( ϱ 2 ) ;
( χ 3 )
A ^ ( 0 ) = A ^ 0 ( 0 ) = 0 ;
( χ 4 )
the least real number, τ 0 > 0 , satisfying the equation A ^ 0 ( ϱ ) 1 = 0 does exist.
Let us now construct the following auxiliary functions on [ 0 , τ 0 ) to be utilized in the convergence theorem.
η ^ 1 ( ϱ ) = 0 1 A ^ ( ( 1 φ ) ϱ ) d φ 1 A ^ 0 ( ϱ ) + | 1 a | ( 1 + A ^ 0 ( ϱ ) ) ( 1 A ^ 0 ( ϱ ) ) ,
η ^ 2 ( ϱ ) = A ^ 0 ( η ^ 1 ( ϱ ) ϱ ) ,
η ^ 3 ( ϱ ) = 0 1 A ^ ( ϱ + φ η ^ 1 ( ϱ ) ϱ ) d φ η ^ 1 ( ϱ ) 1 A ^ 0 ( ϱ ) ,
and
U ^ k ( ϱ ) = η ^ k ( ϱ ) 1 , k = 1 , 2 , 3 .
From the above equation, we obtain that lim ϱ τ 0 U ^ 1 ( ϱ ) = + and U ^ 1 ( 0 ) = | 1 a | 1 < 0 for 0 < a < 2 . Consequently, ( 0 , τ 0 ) contains a real number that solves U ^ 1 ( ϱ ) = 0 . Let U ^ 2 ( ϱ ) has a zero in ( 0 , τ 0 ) . We also have from (7) that lim ϱ τ 0 U ^ 3 ( ϱ ) = + and U ^ 3 ( 0 ) = 1 < 0 . Suppose that τ k ( 0 , τ 0 ) is the least real number, such that U ^ k ( τ k ) = 0 for k = 1 , 2 , 3 . Lastly, let us introduce η ^ 4 and U ^ 4 on [ 0 , τ 2 ) by
η ^ 4 ( ϱ ) = 0 1 A ^ ( ϱ + φ η ^ 3 ( ϱ ) ϱ ) d φ ( 1 A ^ 0 ( ϱ ) ) + 1 | a | 1 ( 1 A ^ 0 ( ϱ ) ) + 1 ( 1 η ^ 2 ( ϱ ) ) ( 1 + A ^ 0 ( η ^ 3 ( ϱ ) ϱ ) ) × η ^ 3 ( ϱ ) ,
and
U ^ 4 ( ϱ ) = η ^ 4 ( ϱ ) 1 .
The definition of U ^ 4 ( ϱ ) immediately implies that lim ϱ τ 2 U ^ 4 ( ϱ ) = + and U ^ 4 ( 0 ) = 1 < 0 . As a consequence, the minimal solution τ 4 of U ^ 4 ( ϱ ) = 0 belongs to ( 0 , τ 2 ) . Now, we have
0 η ^ k ( ϱ ) < 1 ,
where ϱ [ 0 , R ˇ * ) , k = 1 , 2 , , 4 , and the radius R ˇ * is defined as
R ˇ * = m i n { τ 1 , τ 3 , τ 4 } .
Next, we derive the subsequent result to be used in the convergence theorem.
Lemma 1. 
Let ζ [ p ^ * , R ˇ * ] Y and the operator ϑ ^ : Y Y 1 Y 2 possesses (Y1)–(Y4). Then, q ζ ( p ^ * , R ˇ * ) , we have
| | ϑ ^ ( p ^ * ) 1 ϑ ^ ( q ) | | ( 1 + A ^ 0 ( | | q p ^ * | | ) ) | | q p ^ * | | .
Proof. 
It is established by (Y4) that
| | ϑ ^ ( p ^ * ) 1 ϑ ^ ( q ) | | 1 + | | ϑ ^ ( p ^ * ) 1 ( ϑ ^ ( q ) ϑ ^ ( p ^ * ) ) | | 1 + A ^ 0 ( | | q p ^ * | | ) .
Now, (13) gives us
| | ϑ ^ ( p ^ * ) 1 ϑ ^ ( p ^ * + φ ( q p ^ * ) ) | | 1 + A ^ 0 ( φ | | q p ^ * | | ) 1 + A ^ 0 ( | | q p ^ * | | ) ,
where φ [ 0 , 1 ] . Thus, we deduce the inequality
| | ϑ ^ ( p ^ * ) 1 ϑ ^ ( q ) | | = | | ϑ ^ ( p ^ * ) 1 ( ϑ ^ ( q ) ϑ ^ ( p ^ * ) ) | | | | ϑ ^ ( p ^ * ) 1 ϑ ^ ( p ^ * + φ ( q p ^ * ) ) ( q p ^ * ) | | ( 1 + A ^ 0 ( | | q p ^ * | | ) ) | | q p ^ * | | ,
by utilizing (14) and the mean value theorem. □
We now proceed to state and prove Theorem 1, which establishes the local convergence of PBIS.
Theorem 1. 
Let us consider the operator ϑ ^ : Y ˜ Y ˜ 1 Y ˜ 2 under the assumption that conditions (Y1)–(Y5) are satisfied. Suppose that ζ [ p ^ * , R ˇ * ] Y ˜ , a ( 0 , 2 ) , and 0 1 A ^ 0 ( φ R ^ ) d φ < 1 for some R ^ R ˇ * . Let { q t } be the sequence formed by PBIS beginning with q 0 ζ ( p ^ * , R ˇ * ) . Then, { q t } is well defined and satisfies the following properties:
(i) 
{ q t } ζ ( p ^ * , R ˇ * ) ;
(ii) 
lim t q t = p ^ * .
  • Furthermore, for t N { 0 } , we deduce that
| | μ t p ^ * | | η ^ 1 ( | | q t p ^ * | | ) | | q t p ^ * | | < | | q t p ^ * | | < R ˇ * ,
| | δ t p ^ * | | η ^ 3 ( | | q t p ^ * | | ) | | q t p ^ * | | < | | q t p ^ * | | < R ˇ * ,
and
| | q t + 1 p ^ * | | η ^ 4 ( | | q t p ^ * | | ) | | q t p ^ * | | < | | q t p ^ * | | < R ˇ * ,
where η ^ 1 , η ^ 3 , η ^ 4 , and R ˇ * are listed in (4), (6), (8), and (11), respectively. Additionally, p ^ * is the only possible solution of (1) in ζ [ p ^ * , R ^ ] Y ˜ .
Proof. 
We aim to establish (15)–(17) in the case t = 0 . The assumption q 0 ζ ( p ^ * , R ˇ * ) , combined with condition (Y4) and Equation (11), implies that
| | ϑ ^ ( p ^ * ) 1 ( ϑ ^ ( q 0 ) ϑ ^ ( p ^ * ) ) | | A ^ 0 ( | | q 0 p ^ * | | ) < A ^ 0 ( R ˇ * ) < 1 .
We utilize Banach’s lemma on invertible operators [2,25] to conclude that ϑ ^ ( q 0 ) 1 L ^ B ( Y ˜ 2 , Y ˜ 1 ) . We also obtain that
| | ϑ ^ ( q 0 ) 1 ϑ ^ ( p ^ * ) | | 1 1 A ^ 0 ( | | q 0 p ^ * | | ) < 1 1 A ^ 0 ( R ˇ * ) .
Consequently, putting t = 0 in (3), we ensure the existence of μ 0 and δ 0 . Furthermore, substituting t = 0 into the first equation μ t = q t ϑ ^ ( q t ) 1 ϑ ^ ( q t ) of (3), yields
μ 0 p ^ * = q 0 p ^ * a ϑ ^ ( q 0 ) 1 ϑ ^ ( q 0 ) = ϑ ^ ( q 0 ) 1 ϑ ^ ( p ^ * ) 0 1 ϑ ^ ( p ^ * ) 1 ( ϑ ^ ( p ^ * + φ ( q 0 p ^ * ) ) ϑ ^ ( q 0 ) ) ( q 0 p ^ * ) d φ + ( 1 a ) ϑ ^ ( q 0 ) 1 ϑ ^ ( q 0 ) .
Now, we establish (15) for t = 0 , by employing (Y5), (4), (10), (11), (12), and (19) in (20) as follows:
| | μ 0 p ^ * | | | | ϑ ^ ( q 0 ) 1 ϑ ^ ( p ^ * ) | | | | 0 1 ϑ ^ ( p ^ * ) 1 ( ϑ ^ ( p ^ * + φ ( q 0 p ^ * ) ) ϑ ^ ( q 0 ) ) ( q 0 p ^ * ) d φ | | + | 1 a | | | ϑ ^ ( q 0 ) 1 ϑ ^ ( q 0 ) | | 0 1 A ^ ( ( 1 φ ) | | q 0 p ^ * | | ) d φ | | q 0 p ^ * | | ( 1 A ^ 0 ( | | q 0 p ^ * | | ) ) + | 1 a | ( 1 + A ^ 0 ( | | q 0 p ^ * | | ) ) | | q 0 p ^ * | | ( 1 A ^ 0 ( | | q 0 p ^ * | | ) ) = η ^ 1 ( | | q 0 p ^ * | | ) | | q 0 p ^ * | | < | | q 0 p ^ * | | < R ˇ * .
Next, we shall ensure the existence of ϑ ^ ( μ 0 ) 1 . From (Y4), (5), (10), (11), and (21), we get
| | ϑ ^ ( p ^ * ) 1 ( ϑ ^ ( μ 0 ) ϑ ^ ( p ^ * ) ) | | A ^ 0 ( | | μ 0 p ^ * | | ) A ^ 0 ( η ^ 1 ( | | q 0 p ^ * | | ) | | q 0 p ^ * | | ) = η ^ 2 ( | | q 0 p ^ * | | ) < η ^ 2 ( R ˇ * ) < 1 .
This inequality yields ϑ ^ ( μ 0 ) 1 L ^ B ( Y ˜ 2 , Y ˜ 1 ) and
| | ϑ ^ ( μ 0 ) 1 ϑ ^ ( p ^ * ) | | 1 1 η ^ 2 ( | | q 0 p ^ * | | ) .
As a result, q 1 exists. We put t = 0 in the second equation of (3) to obtain
δ 0 p ^ * = μ 0 p ^ * ϑ ^ ( q 0 ) 1 ϑ ^ ( μ 0 ) = ϑ ^ ( q 0 ) 1 ϑ ^ ( p ^ * ) 0 1 ϑ ^ ( p ^ * ) 1 ( ϑ ^ ( p ^ * + φ ( μ 0 p ^ * ) ) ϑ ^ ( q 0 ) ) ( μ 0 p ^ * ) d φ .
We use (Y5), (6), (10), (11), (19), (21), and (24) to produce
| | δ 0 p ^ * | | | | ϑ ^ ( q 0 ) 1 ϑ ^ ( p ^ * ) | | | | 0 1 ϑ ^ ( p ^ * ) 1 ( ϑ ^ ( p ^ * + φ ( μ 0 p ^ * ) ) ϑ ^ ( q 0 ) ) ( μ 0 p ^ * ) d φ | | 0 1 A ^ ( | | q 0 p ^ * | | + φ | | μ 0 p ^ * | | ) d φ | | μ 0 p ^ * | | ( 1 A ^ 0 ( | | q 0 p ^ * | | ) ) 0 1 A ^ ( | | q 0 p ^ * | | + φ η ^ 1 ( | | q 0 p ^ * | | ) | | q 0 p ^ * | | ) d φ η ^ 1 ( | | q 0 p ^ * | | ) | | q 0 p ^ * | | ( 1 A ^ 0 ( | | q 0 p ^ * | | ) ) = η ^ 3 ( | | q 0 p ^ * | | ) | | q 0 p ^ * | | < | | q 0 p ^ * | | < R ˇ * .
Hence, (16) holds true for t = 0 . Finally, to establish (17), we set t = 0 in the last equation q t + 1 = δ t ϑ ^ ( μ t ) 1 ϑ ^ ( δ t ) of (3) and yield
q 1 p ^ * = δ 0 p ^ * ϑ ^ ( q 0 ) 1 ϑ ^ ( δ 0 ) 1 a ϑ ^ ( μ 0 ) 1 1 a ϑ ^ ( q 0 ) 1 ϑ ^ ( δ 0 ) = ϑ ^ ( q 0 ) 1 ϑ ^ ( p ^ * ) 0 1 ϑ ^ ( p ^ * ) 1 ( ϑ ^ ( p ^ * + φ ( δ 0 p ^ * ) ) ϑ ^ ( q 0 ) ) ( δ 0 p ^ * ) d φ + 1 a ϑ ^ ( q 0 ) 1 ϑ ^ ( μ 0 ) 1 ϑ ^ ( δ 0 ) .
Therefore, we derive, using (Y5), (8), (10), (11), (12), (19), (21), (23), (25), and (26), that
| | q 1 p ^ * | | | | ϑ ^ ( q 0 ) 1 ϑ ^ ( p ^ * ) | | | | 0 1 ϑ ^ ( p ^ * ) 1 ( ϑ ^ ( p ^ * + φ ( δ 0 p ^ * ) ) ϑ ^ ( q 0 ) ) ( δ 0 p ^ * ) d φ | | + 1 | a | | | ϑ ^ ( q 0 ) 1 ϑ ^ ( p ^ * ) | | + | | ϑ ^ ( μ 0 ) 1 ϑ ^ ( p ^ * ) | | | | ϑ ^ ( p ^ * ) 1 ϑ ^ ( δ 0 ) | | 0 1 A ^ ( | | q 0 p ^ * | | + φ | | δ 0 p ^ * | | ) d φ | | δ 0 p ^ * | | ( 1 A ^ 0 ( | | q 0 p ^ * | | ) ) + 1 | a | 1 ( 1 A ^ 0 ( | | q 0 p ^ * | | ) ) + 1 ( 1 η ^ 2 ( | | q 0 p ^ * | | ) ) ( 1 + A ^ 0 ( | | δ 0 p ^ * | | ) ) | | δ 0 p ^ * | | = [ 0 1 A ^ ( | | q 0 p ^ * | | + φ | | δ 0 p ^ * | | ) d φ ( 1 A ^ 0 ( | | q 0 p ^ * | | ) ) + 1 | a | 1 ( 1 A ^ 0 ( | | q 0 p ^ * | | ) ) + 1 ( 1 η ^ 2 ( | | q 0 p ^ * | | ) ) ( 1 + A ^ 0 ( | | δ 0 p ^ * | | ) ) ] | | δ 0 p ^ * | | [ 0 1 A ^ ( | | q 0 p ^ * | | + φ η ^ 3 ( | | q 0 p ^ * | | ) | | q 0 p ^ * | | ) d φ ( 1 A ^ 0 ( | | q 0 p ^ * | | ) ) + 1 | a | 1 ( 1 A ^ 0 ( | | q 0 p ^ * | | ) ) + 1 ( 1 η ^ 2 ( | | q 0 p ^ * | | ) ) ( 1 + A ^ 0 ( η ^ 3 ( | | q 0 p ^ * | | ) | | q 0 p ^ * | | ) ) ] × η ^ 3 ( | | q 0 p ^ * | | ) | | q 0 p ^ * | | = η ^ 4 ( | | q 0 p ^ * | | ) | | q 0 p ^ * | | < | | q 0 p ^ * | | < R ˇ * .
The above result ensures that (17) holds for t = 0 . Thus, for t = 0 , (15)–(17), are true. To extend (15)–(17) for t 1 , we replace the terms q 0 , μ 0 , δ 0 , and q 1 by q t , μ t , δ t , and q t + 1 , respectively, in the earlier derivations, and then utilize mathematical induction. Moreover, the inequality | | q t + 1 p ^ * | | η ^ 4 ( R ˇ * ) | | q t p ^ * | | < R ˇ * , along with (10), implies that q t + 1 ζ ( p ^ * , R ˇ * ) and q t p ^ * as t .
We proceed to verify the uniqueness of p ^ * by assuming that ϑ ^ ( b ¯ * ) = 0 , where b ¯ * ζ [ p ^ * , R ^ ] Y ˜ . It is easy to observe that
ϑ ^ ( p ^ * ) ϑ ^ ( b ¯ * ) = S ^ ( p ^ * b ¯ * ) = 0 ,
where S ^ = 0 1 ϑ ^ ( p ^ * + φ ( b ¯ * p ^ * ) ) . Now, we deduce, utilizing (Y4), that
| | ϑ ^ ( p ^ * ) 1 ( S ^ ϑ ^ ( p ^ * ) ) | | 0 1 A ^ 0 ( | | p ^ * + φ ( b ¯ * p ^ * ) p ^ * | | ) d φ = 0 1 A ^ 0 ( φ | | b ¯ * p ^ * | | ) d φ 0 1 A ^ 0 ( φ R ^ ) d φ < 1 ,
and hence,
S ^ 1 L ^ B ( Y ˜ 2 , Y ˜ 1 ) .
Thus, based on (28) and (29), we arrive at the conclusion that p ^ * = b ¯ * . □

3. Stability Study of PBIS Through Basins of Attraction

This section delves into the convergence dynamics and stability characteristics of PBIS by investigating its basins of attraction via graphical simulations. The basin of attraction, also known as the Fatou set, is formally defined as the set F : = { σ 0 C : σ k σ * a s k } , where Ω ^ : C C represents a polynomial, σ * denotes one of its roots, and { σ k } k = 0 refers to the sequence created by PBIS, initiated from the initial point σ 0 C . F c is referred to as the Julia set. Martínez et al. [23] investigated the complex dynamical behavior of PBIS on an arbitrary quadratic complex-valued polynomial equation. Here, we study the dynamics of PBIS on specific higher-degree polynomials.
To visualize the regions of attraction, a domain E = [ 4 , 4 ] × [ 4 , 4 ] C is considered, which is discretized into a 400 × 400 grid. This grid provides a framework for visually representing the convergence domains of PBIS when applied to various complex-valued polynomial functions, ensuring that all roots lie within the chosen region E .
Each point on the grid serves as an initial point for PBIS, which is then applied to eight different functions, outlined in Examples 1 and 2. If the sequence formed by PBIS converges to a specific root, that point is classified within the corresponding basin of attraction and painted accordingly. The intensity of the color, ranging from light to dark, indicates the number of iterations needed to approximate the root. Points where PBIS fails to converge within the set criteria are color-coded in black. The iteration process is limited to 500 iterations or terminates earlier if the error in approximation is less than 10 6 . We have considered five members of PBIS using a = 1 , 0.85 , 0.95 , 1.24 , and 1 . The white asterisks (*) indicate the roots in the figures. All graphical representations are created using MATLAB 2019a, providing a comprehensive view of the convergence properties and dynamics of PBIS in different regions of the complex plane.
Example 1. 
The structure of basins of attraction is explored for the following of polynomials of degree three and four.
(i) 
Ω ^ 1 ( σ ) = σ 3 + 1 .
(ii) 
Ω ^ 2 ( σ ) = 4 σ 3 3 σ .
(iii) 
Ω ^ 3 ( σ ) = σ 4 3 σ 3 + 3 σ 2 3 σ + 2 .
(iv) 
Ω ^ 4 ( σ ) = 8 σ 4 8 σ 2 + 1 .
  • The visual representations of the attraction basins for the roots of Ω ^ 1 ( σ ) , Ω ^ 2 ( σ ) , Ω ^ 3 ( σ ) , and Ω ^ 4 ( σ ) are given in Figure 1a–e, Figure 2a–e, Figure 3a–e and Figure 4a–e, respectively. Each figure illustrates the complex dynamical behavior of PBIS applied to these polynomials and highlights the distinct regions in the complex plane that converge to different solutions. In particular, Figure 1a–e display the basins of attraction for the solutions of Ω ^ 1 ( σ ) = 0 , where the regions shaded in yellow, green, and purple are linked to the solutions 1 + 3 i 2 , 1 , and 1 3 i 2 , respectively. Similarly, in Figure 2a–e, the attraction regions associated with the solutions 3 2 , 3 2 , and 0 of Ω ^ 2 ( σ ) = 0 are painted in orange, purple, and green, respectively. Figure 3a–e depict the basins of attraction for the solutions of Ω ^ 3 ( σ ) = 0 . The points in the purple, orange, blue, and green areas converge to the solutions 1, 2, i, and i , respectively. The points leading to the solutions 2 + 2 4 , 2 2 4 , 2 + 2 4 , and 2 2 4 of Ω ^ 4 ( σ ) = 0 are highlighted in cyan, purple, orange, and green, respectively, in Figure 4a–e. Notice that the Figure 2a–e and Figure 4a–e reveal basin structures that are symmetric with respect to the real axis. From these figures, it is evident that the black regions, representing the Julia set, are considerably smaller for Ω ^ k ( σ ) , k = 1 , 2 , 3 , 4 . This observation indicates that PBIS exhibits better stability when applied to solving these equations.
Example 2. 
The configuration of attraction basins is investigated for the following fifth- and sixth-degree polynomials.
(i) 
Ω ^ 5 ( σ ) = σ 5 2 σ 4 ( 1 + 2 i ) σ 3 + ( 2 + 4 i ) σ 2 + 2 i σ 4 i .
(ii) 
Ω ^ 6 ( σ ) = 16 σ 5 20 σ 3 + 5 σ .
(iii) 
Ω ^ 7 ( σ ) = σ 6 0.5 σ 5 + ( 11 ( 1 + i ) ) 4 σ 4 ( 31 i + 19 ) 4 σ 3 + ( 51 i + 11 ) 4 σ 2 ( 11 + i ) 4 σ + 1.5 3 i .
(iv) 
Ω ^ 8 ( σ ) = 32 σ 6 48 σ 4 + 18 σ 2 1 .
  • The graphical illustration of the attraction basins for the roots of Ω ^ 5 ( σ ) , Ω ^ 6 ( σ ) , Ω ^ 7 ( σ ) , and Ω ^ 8 ( σ ) are given in Figure 5a–e, Figure 6a–e, Figure 7a–e and Figure 8a–e, respectively. In Figure 5a–e, the regions marked in yellow, blue, purple, red, and green are the basins of attraction related to the solutions 1 , 1, ( 1 + i ) , 2, and 1 + i of Ω ^ 5 ( σ ) = 0 , respectively. Similarly, the basins of attraction for the solutions of Ω ^ 6 ( σ ) = 0 are illustrated in Figure 6a–e. In this case, the attraction regions corresponding to 5 + 5 8 , 5 5 8 , 0, 5 + 5 8 , and 5 5 8 of Ω ^ 6 ( σ ) = 0 are highlighted in orange, blue, green, purple, and red, respectively. The orange, green, red, blue, purple, and cyan areas in Figure 7a–e are linked to the attraction basins of the solutions 1 + i 2 , 1 + 2 i , 3 i 2 , i, 1, and 1 i of Ω ^ 7 ( σ ) = 0 , respectively. For the polynomial Ω ^ 8 ( σ ) , the corresponding basins are shown in Figure 8a–e. The attraction regions are color-coded as follows: Cyan corresponds to 2 + 3 2 , blue to 2 3 2 , red to 2 2 , purple to 2 3 2 , orange to 2 + 3 2 , and green to 2 2 . It is noticed that the basin patterns in Figure 6a–e and Figure 8a–e maintain symmetry about the real axis. Furthermore, a close inspection of the plots reveals that the black regions, representing the Julia set, are notably smaller for Ω ^ k ( σ ) , k = 5 , 6 , 7 , 8 . This observation suggests that PBIS exhibits strong convergence characteristics and enhanced numerical stability when applied to solving these polynomial equations.
Figure 1. Basins of attraction associated with Example 1(i), where PBIS is applied for different values of a.
Figure 1. Basins of attraction associated with Example 1(i), where PBIS is applied for different values of a.
Symmetry 17 01813 g001
Figure 2. Basins of attraction associated with Example 1(ii), where PBIS is applied for different values of a.
Figure 2. Basins of attraction associated with Example 1(ii), where PBIS is applied for different values of a.
Symmetry 17 01813 g002
Figure 3. Basins of attraction associated with Example 1(iii), where PBIS is applied for different values of a.
Figure 3. Basins of attraction associated with Example 1(iii), where PBIS is applied for different values of a.
Symmetry 17 01813 g003
Figure 4. Basins of attraction associated with Example 1(iv), where PBIS is applied for different values of a.
Figure 4. Basins of attraction associated with Example 1(iv), where PBIS is applied for different values of a.
Symmetry 17 01813 g004
Figure 5. Basins of attraction associated with Example 2(i), where PBIS is applied for different values of a.
Figure 5. Basins of attraction associated with Example 2(i), where PBIS is applied for different values of a.
Symmetry 17 01813 g005
Figure 6. Basins of attraction associated with Example 2(ii), where PBIS is applied for different values of a.
Figure 6. Basins of attraction associated with Example 2(ii), where PBIS is applied for different values of a.
Symmetry 17 01813 g006
Figure 7. Basins of attraction associated with Example 2(iii), where PBIS is applied for different values of a.
Figure 7. Basins of attraction associated with Example 2(iii), where PBIS is applied for different values of a.
Symmetry 17 01813 g007
Figure 8. Basins of attraction associated with Example 2(iv), where PBIS is applied for different values of a.
Figure 8. Basins of attraction associated with Example 2(iv), where PBIS is applied for different values of a.
Symmetry 17 01813 g008

4. Computational Verification of the Presented Analysis

To substantiate the analytical outcomes derived in Section 2, this section deals with a comprehensive set of computational experiments. Specifically, for Problems 1 through 6, we implement the proposed analytical procedure to determine the radii associated with PBIS. The computation process involves the functions η ^ k , where k = 1 , 2 , , 4 , which are essential in determining the radii values. In Problem 4, we set a = 0.9870 , while for the remaining problems, we adopt a = 1 . Additionally, we conduct a comparative analysis of the PBIS radii for different values of the parameter a. Specifically for a = 0.85 , 0.95 , and 1.24 , the radii of PBIS are calculated and then compared with the existing results [23,24]. The numerical results from these experiments are systematically organized and presented in Table 1, Table 2, Table 3, Table 4, Table 5, Table 6, Table 7, Table 8, Table 9, Table 10, Table 11 and Table 12. The results clearly highlight that the radii of PBIS, as computed using our proposed technique, are remarkably larger than those reported in earlier research [23,24]. In Table 9, Table 10, Table 11 and Table 12, the symbol indicates that the corresponding parameter could not be determined, as the Lipschitz condition is not satisfied in these cases. In these tables, the parameters and radii are represented by r 1 , r 2 , and r as used in [23], while in [24], the corresponding notations are ρ 1 , ρ 2 , and ρ . In Table 13 and Table 14, we provide a summary of improvements in the radii for PBIS in comparison to those obtained by Martínez et al. [23] and Singh et al. [24], respectively. Furthermore, Figure 9, Figure 10, Figure 11, Figure 12, Figure 13 and Figure 14 display the functions η ^ k for k = 1 , 2 , , 4 , providing a graphical representation that confirms the inequality 0 η ^ k ( ϱ ) < 1 within the interval ϱ ( 0 , R ˇ ) .
To further validate the convergence radii established for PBIS in this study, we perform a detailed comparison between PBIS and the classical Newton’s scheme (NS) on Problems 1, 2, and 3. For the integral equation in Problem 2, we apply the composite trapezoidal rule. The starting points are chosen based on the convergence balls for PBIS, using the radii values provided in Table 1, Table 3 and Table 5. We use MATLAB to execute the numerical experiments with variable precision arithmetic set to 2000 digits. We set the following stopping condition for each problem.
| | ϑ ^ ( q t + 1 ) | | + | | q t + 1 q t | | < 10 200 .
The numerical results, presented in Table 15, Table 16 and Table 17, include the number of iterations (NI) required to reach the desired accuracy, the norm | | ϑ ^ ( q t + 1 ) | | , and the approximate computational order of convergence (ACOC) [22], which is computed using the following expression.
A C O C = l n ( | | q t + 1 q t | | / | | q t q t 1 | | ) l n ( | | q t q t 1 | | / | | q t 1 q t 2 | | ) .
The results clearly demonstrate that PBIS consistently surpasses NS in terms of iteration efficacy, accuracy, and ACOC. Thus, the convergence of PBIS is successfully validated through the careful selection of initial points based on the radii derived analytically in our approach.
Problem 1 
([23,24]). Suppose that Y ˜ 1 = Y ˜ 2 = R and Y ˜ = [ 1 2 , 3 2 ] . Then, for ϑ ^ : Y ˜ R , defined by
ϑ ^ ( q ) = q 3 ln ( q 2 ) + q 5 q 4 , if q 0 0 , if q = 0 ,
we have a solution p ^ * = 1 of ϑ ^ ( q ) = 0 . In this problem, A ^ 0 ( ϱ ) = A ^ ( ϱ ) = 96.6629073 ϱ . The parameters R ˇ * and τ k , k = 1 , 3 , 4 , are listed in Table 1 and Table 2.
Table 1. Radius of PBIS for Problem 1 with a = 1 .
Table 1. Radius of PBIS for Problem 1 with a = 1 .
Proposed RadiusRadius by Martínez et al. [23]Radius by Singh et al. [24]
τ 1 = 0.00689682 r 1 = 0.006897 ρ 1 = 0.006896
τ 3 = 0.00571870 r 2 = 0.004206 ρ 2 = 0.004205
τ 4 = 0.00413608 r = 0.002818 ρ = 0.002818
R ˇ * = 0.00413608 R ˇ * = r = 0.002818 R ˇ * = ρ = 0.002818
Table 2. Radii of PBIS for Problem 1 with different values of a.
Table 2. Radii of PBIS for Problem 1 with different values of a.
Values of aProposed RadiusRadius by
Martínez et al. [23]
Radius by
Singh et al. [24]
a = 0.85 R ˇ * = 0.00310602 R ˇ * = 6.07 × 10 4 R ˇ * = 0.00060706
a = 0.95 R ˇ * = 0.00374090 R ˇ * = 1.999 × 10 3 R ˇ * = 0.00199932
a = 1.24 R ˇ * = 0.00302422 R ˇ * = 8.2 × 10 5 R ˇ * = 0.00008241
Figure 9. η ^ k , k = 1 , 2 , , 4 , for Problem 1.
Figure 9. η ^ k , k = 1 , 2 , , 4 , for Problem 1.
Symmetry 17 01813 g009
Problem 2 
([13,22,23]). We define ϑ ^ by taking Y ˜ 1 = Y ˜ 2 = C [ 0 , 1 ] and Y ˜ = ζ [ p ^ * , 1 ] as follows:
ϑ ^ ( q ) ( ϱ ) = q ( ϱ ) 5 0 1 ϱ υ q ( υ ) 3 d υ .
Nonlinear equations, involving integral operators of the form ϑ ^ ( q ) ( ϱ ) = 0 , belong to the class of Hammerstein-type equations, which are extensively used in modeling motion-related phenomena. These equations frequently arise in numerous scientific fields, encompassing applications such as traffic flow modeling, kinetic gas theory, problem of radiative transfer, neutron transport problem, biological system dynamics, electromagnetic fluid dynamics, queueing theory, and the modeling of chemical reactor processes [17].
For the considered equation, we have p ^ * = 0 , A ^ 0 ( ϱ ) = 7.5 ϱ , and A ^ ( ϱ ) = 15 ϱ . Table 3 and Table 4 contain the values of R ˇ * and τ k , k = 1 , 3 , 4 .
Table 3. Radius of PBIS for Problem 2 with a = 1 .
Table 3. Radius of PBIS for Problem 2 with a = 1 .
Proposed RadiusRadius by Martínez et al. [23]Radius by Singh et al. [24]
τ 1 = 0.06666667 r 1 = 0.066667 ρ 1 = 0.06667
τ 3 = 0.05092880 r 2 = 0.037592 ρ 2 = 0.037592
τ 4 = 0.03467596 r = 0.023064 ρ = 0.023064
R ˇ * = 0.03467596 R ˇ * = r = 0.023064 R ˇ * = ρ = 0.023064
Table 4. Radii of PBIS for Problem 2 with different values of a.
Table 4. Radii of PBIS for Problem 2 with different values of a.
Values of aProposed RadiusRadius by
Martínez et al. [23]
Radius by
Singh et al. [24]
a = 0.85 R ˇ * = 0.026385133 R ˇ * = 5.307 × 10 3 R ˇ * = 0.00530668
a = 0.95 R ˇ * = 0.03162727 R ˇ * = 1.6789 × 10 2 R ˇ * = 0.01678978
a = 1.24 R ˇ * = 0.02607984 R ˇ * = 7.59 × 10 4 R ˇ * = 0.00075926
Figure 10. η ^ k , k = 1 , 2 , , 4 , for Problem 2.
Figure 10. η ^ k , k = 1 , 2 , , 4 , for Problem 2.
Symmetry 17 01813 g010
Problem 3 
([23,24]). Let Y ˜ 1 = Y ˜ 2 = R 3 and Y ˜ = ζ [ p ^ * , 1 ] . Define ϑ ^ for q = ( q 1 , q 2 , q 3 ) T Y ˜ by
ϑ ^ ( q ) = ( e q 1 1 , e 1 2 q 2 2 + q 2 , q 3 ) T .
For ϑ ^ ( q ) = 0 , the solution is p ^ * = ( 0 , 0 , 0 ) T . We obtain A ^ 0 ( ϱ ) = 1.718281828 ϱ and A ^ ( ϱ ) = 1.789572397 ϱ . In Table 5 and Table 6, the parameters R ˇ * and τ k , k = 1 , 3 , 4 , are listed.
Table 5. Radius of PBIS for Problem 3 with a = 1 .
Table 5. Radius of PBIS for Problem 3 with a = 1 .
Proposed RadiusRadius by Martínez et al. [23]Radius by Singh et al. [24]
τ 1 = 0.38269191 r 1 = 0.324947 ρ 1 = 0.32495
τ 3 = 0.31584836 r 2 = 0.187710 ρ 2 = 0.187710
τ 4 = 0.22754201 r = 0.118532 ρ = 0.118532
R ˇ * = 0.22754201 R ˇ * = r = 0.118532 R ˇ * = ρ = 0.118532
Table 6. Radii of PBIS for Problem 3 with different values of a.
Table 6. Radii of PBIS for Problem 3 with different values of a.
Values of aProposed RadiusRadius by
Martínez et al. [23]
Radius by
Singh et al. [24]
a = 0.85 R ˇ * = 0.17099947 R ˇ * = 2.6752 × 10 2 R ˇ * = 0.02675297
a = 0.95 R ˇ * = 0.20591125 R ˇ * = 8.5657 × 10 2 R ˇ * = 0.08565724
a = 1.24 R ˇ * = 0.16663974 R ˇ * = 3.762 × 10 3 R ˇ * = 0.00376247
Problem 4 
([23,24]). Assume that Y ˜ 1 = Y ˜ 2 = R and Y ˜ = [ 1 , 3 ] . Then, for ϑ ^ : Y ˜ R defined by
ϑ ^ ( q ) = 2 3 q 3 2 q ,
p ^ * = 9 4 is a solution of ϑ ^ ( q ) = 0 . We get A ^ 0 ( ϱ ) = A ^ ( ϱ ) = ϱ for this problem. The parameters R ˇ * and τ k , k = 1 , 3 , 4 , are listed in Table 7 and Table 8.
Figure 11. η ^ k , k = 1 , 2 , , 4 , for Problem 3.
Figure 11. η ^ k , k = 1 , 2 , , 4 , for Problem 3.
Symmetry 17 01813 g011
Table 7. Radius of PBIS for Problem 4 with a = 0.9870 .
Table 7. Radius of PBIS for Problem 4 with a = 0.9870 .
Proposed RadiusRadius by Martínez et al. [23]Radius by Singh et al. [24]
τ 1 = 0.65234633 r 1 = 0.652346 ρ 1 = 0.176951
τ 3 = 0.54301646 r 2 = 0.390015 ρ 2 = 0.050026
τ 4 = 0.38922896 r = 0.250885 ρ = 0.015674
R ˇ * = 0.38922896 R ˇ * = r = 0.250885 R ˇ * = ρ = 0.015674
Table 8. Radii of PBIS for Problem 4 with different values of a.
Table 8. Radii of PBIS for Problem 4 with different values of a.
Values of aProposed RadiusRadius by
Martínez et al. [23]
Radius by
Singh et al. [24]
a = 0.85 R ˇ * = 0.30023731 R ˇ * = 5.8680 × 10 2 R ˇ * = 0.00099551
a = 0.95 R ˇ * = 0.36160642 R ˇ * = 0.193260 R ˇ * = 0.00974643
a = 1.24 R ˇ * = 0.29232972 R ˇ * = 7.966 × 10 3 R ˇ * = 0.00002121
Figure 12. η ^ k , k = 1 , 2 , , 4 , for Problem 4.
Figure 12. η ^ k , k = 1 , 2 , , 4 , for Problem 4.
Symmetry 17 01813 g012
Problem 5 
([24]). We define ϑ ^ by
ϑ ^ ( q ) ( ϱ ) = q ( ϱ ) 3 0 1 F ˜ ( ϱ , υ ) q ( υ ) 5 4 d υ ,
where Y ˜ 1 = Y ˜ 2 = C [ 0 , 1 ] , Y ˜ = ζ [ p ^ * , 1 ] , q ( ϱ ) Y ˜ , and the Green’s function F ˜ ( ϱ , υ ) is defined on [ 0 , 1 ] × [ 0 , 1 ] by F ˜ ( ϱ , υ ) = ( 1 ϱ ) υ , if υ ϱ ϱ ( 1 υ ) , if ϱ υ . Here, p ^ * = 0 is a solution of ϑ ^ ( q ) = 0 . We derive that A ^ 0 ( ϱ ) = A ^ ( ϱ ) = 15 32 ϱ 1 4 . In Table 9 and Table 10, R ˇ * and τ k , k = 1 , 3 , 4 are summarized.
Table 9. Radius of PBIS for Problem 5 with a = 1 .
Table 9. Radius of PBIS for Problem 5 with a = 1 .
Proposed RadiusRadius by Martínez et al. [23]Radius by Singh et al. [24]
τ 1 = 1.97308074 r 1 = ** ρ 1 = 1.97308074
τ 3 = 1.48098228 r 2 = ** ρ 2 = 0.18915476
τ 4 = 0.30370090 r = ** ρ = 0.02453367
R ˇ * = 0.30370090 R ˇ * = r = ** R ˇ * = ρ = 0.02453367
Table 10. Radii of PBIS for Problem 5 with different values of a.
Table 10. Radii of PBIS for Problem 5 with different values of a.
Values of aProposed RadiusRadius by
Martínez et al. [23]
Radius by
Singh et al. [24]
a = 0.85 R ˇ * = 0.12613301 R ˇ * = ** R ˇ * = 0.00006192
a = 0.95 R ˇ * = 0.22461431 R ˇ * = ** R ˇ * = 0.00661895
a = 1.24 R ˇ * = 0.13546678 R ˇ * = ** R ˇ * = 2.4789 × 10 8
Figure 13. η ^ k , k = 1 , 2 , , 4 , for Problem 5.
Figure 13. η ^ k , k = 1 , 2 , , 4 , for Problem 5.
Symmetry 17 01813 g013
Problem 6 
([24]). Let us take Y ˜ 1 = Y ˜ 2 = C [ 0 , 1 ] and Y ˜ = ζ [ p ^ * , 1 ] , and the equation governed by an integral operator as follows:
ϑ ^ ( q ) ( ϱ ) = q ( ϱ ) 5 0 1 ϱ υ q ( υ ) 3 2 d υ .
Here, p ^ * = 0 , A ^ 0 ( ϱ ) = A ^ ( ϱ ) = 15 4 ϱ 1 2 . The radius R ˇ * and τ k , k = 1 , 3 , 4 , are placed in Table 11 and Table 12.
Table 11. Radius of PBIS for Problem 6 with a = 1 .
Table 11. Radius of PBIS for Problem 6 with a = 1 .
Proposed RadiusRadius by Martínez et al. [23]Radius by Singh et al. [24]
τ 1 = 0.02560 r 1 = ** ρ 1 = 0.025599
τ 3 = 0.02005256 r 2 = ** ρ 2 = 0.008489
τ 4 = 0.01038988 r = ** ρ = 0.003342
R ˇ * = 0.01038988 R ˇ * = r = ** R ˇ * = ρ = 0.003342
Table 12. Radii of PBIS for Problem 6 with different values of a.
Table 12. Radii of PBIS for Problem 6 with different values of a.
Values of aProposed RadiusRadius by
Martínez et al. [23]
Radius by
Singh et al. [24]
a = 0.85 R ˇ * = 0.00593269 R ˇ * = ** R ˇ * = 0.00016265
a = 0.95 R ˇ * = 0.00816090 R ˇ * = ** R ˇ * = 0.00171463
a = 1.24 R ˇ * = 0.00593851 R ˇ * = ** R ˇ * = 3.1454 × 10 6
Table 13. Summary of improvements in the radii for PBIS compared to those obtained by Martínez et al. [23] across the test problems.
Table 13. Summary of improvements in the radii for PBIS compared to those obtained by Martínez et al. [23] across the test problems.
Test ProblemsProposed RadiiRadii by
Martínez et al. [23]
Improvements in the
Radii
Problem 1 R ˇ * = 0.00413608 R ˇ * = 0.002818 0.00131808
Problem 2 R ˇ * = 0.03467596 R ˇ * = 0.023064 0.01161196
Problem 3 R ˇ * = 0.22754201 R ˇ * = 0.118532 0.10901001
Problem 4 R ˇ * = 0.38922896 R ˇ * = 0.250885 0.13834396
Problem 5 R ˇ * = 0.30370090 R ˇ * = * * 0.30370090
Problem 6 R ˇ * = 0.01038988 R ˇ * = * * 0.01038988
Table 14. Summary of improvements in the radii for PBIS compared to those obtained by Singh et al. [24] across the test problems.
Table 14. Summary of improvements in the radii for PBIS compared to those obtained by Singh et al. [24] across the test problems.
Test ProblemsProposed RadiiRadii by
Singh et al. [24]
Improvements in the
Radii
Problem 1 R ˇ * = 0.00413608 R ˇ * = 0.002818 0.00131808
Problem 2 R ˇ * = 0.03467596 R ˇ * = 0.023064 0.01161196
Problem 3 R ˇ * = 0.22754201 R ˇ * = 0.118532 0.10901001
Problem 4 R ˇ * = 0.38922896 R ˇ * = 0.015674 0.37355496
Problem 5 R ˇ * = 0.30370090 R ˇ * = 0.02453367 0.27916723
Problem 6 R ˇ * = 0.01038988 R ˇ * = 0.003342 0.00704788
Table 15. Comparison of PBIS with NS for Problem 1.
Table 15. Comparison of PBIS with NS for Problem 1.
q 0 MethodsNI | | ϑ ^ ( q t + 1 ) | | ACOC
0.996    NS
PBIS
7
3
3.67 × 10 246
1.94 × 10 221
2.0000
5.0000
1.004    NS
PBIS
7
3
5.10 × 10 247
7.02 × 10 223
2.0000
4.9999
Figure 14. η ^ k , k = 1 , 2 , , 4 , for Problem 6.
Figure 14. η ^ k , k = 1 , 2 , , 4 , for Problem 6.
Symmetry 17 01813 g014
Table 16. Comparison of PBIS with NS for Problem 2.
Table 16. Comparison of PBIS with NS for Problem 2.
q 0 MethodsNI | | ϑ ^ ( q t + 1 ) | | ACOC
[ 0.012 , 0.012 , 0.012 , 0.012 , 0.012 ] T NS
PBIS
5
3
5.92 × 10 397
2.31 × 10 2129
3.0000
11.0000
[ 0.015 , 0.015 , 0.015 , 0.015 , 0.015 ] T NS
PBIS
5
3
2.17 × 10 373
2.75 × 10 2000
3.0000
11.0000
Table 17. Comparison of PBIS with NS for Problem 3.
Table 17. Comparison of PBIS with NS for Problem 3.
q 0 MethodsNI | | ϑ ^ ( q t + 1 ) | | ACOC
[ 0.11 , 0.11 , 0.11 ] T NS
PBIS
8
4
6.61 × 10 252
9.49 × 10 505
2.0000
5.0000
[ 0.12 , 0.12 , 0.12 ] T NS
PBIS
8
4
3.53 × 10 264
6.01 × 10 562
2.0000
4.9999

5. Conclusions

The analysis presented in this work leads to a significant advancement in the convergence behavior of the parameter-based iteration scheme (PBIS), expanding its convergence domain while avoiding the imposition of additional restrictive conditions. The method’s enhanced effectiveness is substantiated through an extensive theoretical framework and corroborated by numerical experiments, demonstrating its superior performance in solving nonlinear equations, particularly within Banach spaces. Furthermore, the exploration of attraction basins offers additional confirmation of the scheme’s stability and robustness, highlighting its promising potential for applications to complex-valued equations. Because of its generality, the analytical approach presented in this article can be applied to other iterative schemes [10,17,18,19], which will be explored in our future research.

Author Contributions

Conceptualization, E.M. and D.S.; methodology, E.M. and D.S.; software, E.M. and D.S.; validation, E.M. and D.S.; formal analysis, E.M. and D.S.; investigation, E.M. and D.S.; resources, E.M. and D.S.; data curation, E.M. and D.S.; writing—original draft preparation, E.M. and D.S.; writing—review and editing, E.M. and D.S.; visualization, E.M. and D.S.; supervision, E.M. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Data is contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Xiao, X.Y.; Yin, H.W. Increasing the order of convergence for iterative methods to solve nonlinear systems. Calcolo 2016, 53, 285–300. [Google Scholar] [CrossRef]
  2. Argyros, I.K.; Cho, Y.J.; Hilout, S. Numerical Methods for Equations and Its Applications; Taylor & Francis: Abingdon, UK; CRC Press: New York, NY, USA, 2012. [Google Scholar]
  3. Cordero, A.; Hueso, J.L.; Martínez, E.; Torregrosa, J.R. Increasing the convergence order of an iterative method for nonlinear systems. Appl. Math. Lett. 2012, 25, 2369–2374. [Google Scholar] [CrossRef]
  4. Kou, J.; Li, Y.; Wang, X. A composite fourth-order iterative method for solving non-linear equations. Appl. Math. Comput. 2007, 184, 471–475. [Google Scholar] [CrossRef]
  5. Özban, A.Y. Some new variants of Newton’s method. Appl. Math. Lett. 2004, 17, 677–682. [Google Scholar] [CrossRef]
  6. Petković, M.S.; Neta, B.; Petković, L.; Dz̃unić, D. Multipoint Methods for Solving Nonlinear Equations; Elsevier: Amsterdam, The Netherlands, 2013. [Google Scholar]
  7. Potra, F.A.; Ptak, V. Nondiscrete Induction and Iterative Processes; Research Notes in Mathematics; Pitman Publ.: Boston, MA, USA, 1984; Volume 103. [Google Scholar]
  8. Scott, M.; Neta, B.; Chun, C. Basin attractors for various methods. Appl. Math. Comput. 2011, 218, 2584–2599. [Google Scholar] [CrossRef]
  9. Traub, J.F. Iterative Methods for the Solution of Equations; Prentice-Hall: Englewood Cliffs, NJ, USA, 1964. [Google Scholar]
  10. Amat, S.; Argyros, I.K.; Busquier, S.; Hernández-Verón, M.A.; Martínez, E. On the local convergence study for an efficient k-step iterative method. J. Comput. Appl. Math. 2018, 343, 753–761. [Google Scholar] [CrossRef]
  11. Argyros, I.K.; Behl, R.; Motsa, S.S. Unifying semilocal and local convergence of Newton’s method on Banach space with a convergence structure. Appl. Numer. Math. 2017, 115, 225–234. [Google Scholar] [CrossRef]
  12. Argyros, I.K.; Magreñán, Á.A. Local convergence for multi-point-parametric Chebyshev-Halley-type methods of higher convergence order. J. Comput. Appl. Math. 2015, 282, 215–224. [Google Scholar] [CrossRef]
  13. Argyros, I.K.; George, S. Local convergence for an almost sixth order method for solving equations under weak conditions. SeMA J. 2017, 75, 163–171. [Google Scholar] [CrossRef]
  14. Argyros, I.K.; Magreñán, Á.A. A study on the local convergence and the dynamics of Chebyshev-Halley-type methods free from second derivative. Numer. Algor. 2015, 71, 1–23. [Google Scholar] [CrossRef]
  15. Argyros, I.K.; Sharma, D.; Argyros, C.I.; Parhi, S.K.; Sunanda, S.K. Extending the applicability and convergence domain of a higher-order iterative algorithm under ω condition. Rend. Circ. Mat. Palermo II Ser. 2022, 71, 469–482. [Google Scholar] [CrossRef]
  16. Cordero, A.; Ezquerro, J.A.; Hernández-Verón, M.A.; Torregrosa, J.R. On the local convergence of a fifth-order iterative method in Banach spaces. Appl. Math. Comput. 2015, 251, 396–403. [Google Scholar] [CrossRef]
  17. Hernández-Verón, M.A.; Martínez, E. On the semilocal convergence of a three steps Newton-type iterative process under mild convergence conditions. Numer. Algorithms 2015, 70, 377–392. [Google Scholar] [CrossRef]
  18. George, S.; Muniyasamy, M.; Gopal, M.; Chandhini, G.; Argyros, I.K. A procedure for increasing the convergence order of iterative methods from p to 5p for solving nonlinear system. J. Complex. 2025, 87, 101921. [Google Scholar] [CrossRef]
  19. Chang, C.W.; Qureshi, S.; Argyros, I.K.; Chicharro, F.I.; Soomro, A. A modified two-step optimal iterative method for solving nonlinear models in one and higher dimensions. Math. Comput. Simul. 2025, 229, 448–467. [Google Scholar] [CrossRef]
  20. Regmi, S.; Argyros, I.K.; Argyros, C.I.; Sharma, D. Extended Comparison between Two Derivative-Free Methods of Order Six for Equations under the Same Conditions. Fractal Fract. 2022, 6, 634. [Google Scholar] [CrossRef]
  21. Sharma, D.; Parhi, S.K. Extending the Applicability of a Newton-Simpson-Like Method. Int. J. Appl. Comput. Math. 2020, 6, 79. [Google Scholar] [CrossRef]
  22. Sharma, J.R.; Argyros, I.K. Local convergence of a Newton-Traub composition in Banach spaces. SeMA J. 2017, 75, 57–68. [Google Scholar] [CrossRef]
  23. Martínez, E.; Singh, S.; Hueso, J.L.; Gupta, D.K. Enlarging the convergence domain in local convergence studies for iterative methods in Banach spaces. Appl. Math. Comput. 2016, 281, 252–265. [Google Scholar] [CrossRef]
  24. Singh, S.; Gupta, D.K.; Badoni, R.P.; Martínez, E.; Hueso, J.L. Local convergence of a parameter based iteration with Hölder continuous derivative in Banach spaces. Calcolo 2017, 54, 527–539. [Google Scholar] [CrossRef]
  25. Argyros, I.K. Convergence and Application of Newton-Type Iterations; Springer: Berlin/Heidelberg, Germany, 2008. [Google Scholar]
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.

Share and Cite

MDPI and ACS Style

Martínez, E.; Sharma, D. Expansion of Convergence Domain of a Parameter-Based Iteration Scheme for Equations in Banach Spaces. Symmetry 2025, 17, 1813. https://doi.org/10.3390/sym17111813

AMA Style

Martínez E, Sharma D. Expansion of Convergence Domain of a Parameter-Based Iteration Scheme for Equations in Banach Spaces. Symmetry. 2025; 17(11):1813. https://doi.org/10.3390/sym17111813

Chicago/Turabian Style

Martínez, Eulalia, and Debasis Sharma. 2025. "Expansion of Convergence Domain of a Parameter-Based Iteration Scheme for Equations in Banach Spaces" Symmetry 17, no. 11: 1813. https://doi.org/10.3390/sym17111813

APA Style

Martínez, E., & Sharma, D. (2025). Expansion of Convergence Domain of a Parameter-Based Iteration Scheme for Equations in Banach Spaces. Symmetry, 17(11), 1813. https://doi.org/10.3390/sym17111813

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop