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:
where
is a continuously Fréchet differentiable operator;
’s are Banach spaces for
; and
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.
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
. 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].
where
. This scheme, for
, 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 , is bounded and linear}, , and , where and .
- (Y1)
is continuously Fréchet derivable;
- (Y2)
there exists , such that ;
- (Y3)
;
- (Y4)
;
- (Y5)
.
and are continuous functions;
if , then and ;
;
the least real number, , satisfying the equation does exist.
Let us now construct the following auxiliary functions on
to be utilized in the convergence theorem.
and
From the above equation, we obtain that
and
for
. Consequently,
contains a real number that solves
. Let
has a zero in
. We also have from (
7) that
and
. Suppose that
is the least real number, such that
for
. Lastly, let us introduce
and
on
by
and
The definition of
immediately implies that
and
. As a consequence, the minimal solution
of
belongs to
. Now, we have
where
,
, and the radius
is defined as
Next, we derive the subsequent result to be used in the convergence theorem.
Lemma 1.
Let and the operator possesses (Y1)–(Y4). Then, , we have Proof. It is established by (Y4) that
Now, (
13) gives us
where
. Thus, we deduce the inequality
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 under the assumption that conditions (Y1)–(Y5) are satisfied. Suppose that , , and for some . Let be the sequence formed by PBIS beginning with . Then, is well defined and satisfies the following properties:
- (i)
;
- (ii)
.
andwhere , , , and are listed in (4), (6), (8), and (11), respectively. Additionally, is the only possible solution of (1) in . Proof. We aim to establish (
15)–(
17) in the case
. The assumption
, combined with condition (Y4) and Equation (
11), implies that
We utilize Banach’s lemma on invertible operators [
2,
25] to conclude that
. We also obtain that
Consequently, putting
in (
3), we ensure the existence of
and
. Furthermore, substituting
into the first equation
of (
3), yields
Now, we establish (
15) for
, by employing (Y5), (
4), (
10), (
11), (
12), and (
19) in (
20) as follows:
Next, we shall ensure the existence of
. From (Y4), (
5), (
10), (
11), and (
21), we get
This inequality yields
and
As a result,
exists. We put
in the second equation of (
3) to obtain
We use (Y5), (
6), (
10), (
11), (
19), (
21), and (
24) to produce
Hence, (
16) holds true for
. Finally, to establish (
17), we set
in the last equation
of (
3) and yield
Therefore, we derive, using (Y5), (
8), (
10), (
11), (
12), (
19), (
21), (
23), (
25), and (
26), that
The above result ensures that (
17) holds for
. Thus, for
, (
15)–(
17), are true. To extend (
15)–(
17) for
, we replace the terms
,
,
, and
by
,
,
, and
, respectively, in the earlier derivations, and then utilize mathematical induction. Moreover, the inequality
, along with (
10), implies that
and
as
.
We proceed to verify the uniqueness of
by assuming that
, where
. It is easy to observe that
where
. Now, we deduce, utilizing (Y4), that
and hence,
Thus, based on (
28) and (
29), we arrive at the conclusion that
. □
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
, where
represents a polynomial,
denotes one of its roots, and
refers to the sequence created by PBIS, initiated from the initial point
.
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 is considered, which is discretized into a 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 .
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 . We have considered five members of PBIS using , and . 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)
.
- (ii)
.
- (iii)
.
- (iv)
.
The visual representations of the attraction basins for the roots of , , , and 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 , where the regions shaded in yellow, green, and purple are linked to the solutions , , and , respectively. Similarly, in Figure 2a–e, the attraction regions associated with the solutions , , and 0 of are painted in orange, purple, and green, respectively. Figure 3a–e depict the basins of attraction for the solutions of . The points in the purple, orange, blue, and green areas converge to the solutions 1, 2, i, and , respectively. The points leading to the solutions , , , and of 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 , . 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)
.
- (ii)
.
- (iii)
.
- (iv)
.
The graphical illustration of the attraction basins for the roots of , , , and 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, , 2, and of , respectively. Similarly, the basins of attraction for the solutions of are illustrated in Figure 6a–e. In this case, the attraction regions corresponding to , , 0, , and of 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 , , , i, 1, and of , respectively. For the polynomial , the corresponding basins are shown in Figure 8a–e. The attraction regions are color-coded as follows: Cyan corresponds to , blue to , red to , purple to , orange to , and green to . 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 , . 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.
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.
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.
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.
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.
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.
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.
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.
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
, where
, which are essential in determining the radii values. In Problem 4, we set
, while for the remaining problems, we adopt
. Additionally, we conduct a comparative analysis of the PBIS radii for different values of the parameter
a. Specifically for
,
, and
, 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
,
, and
r as used in [
23], while in [
24], the corresponding notations are
,
, 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
for
, providing a graphical representation that confirms the inequality
within the interval
.
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.
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
, and the approximate computational order of convergence (ACOC) [
22], which is computed using the following expression.
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 and . Then, for , defined bywe have a solution of . In this problem, . The parameters and , are listed in Table 1 and Table 2.
Table 1.
Radius of PBIS for Problem 1 with .
Table 1.
Radius of PBIS for Problem 1 with .
| Proposed Radius | Radius by Martínez et al. [23] | Radius by Singh et al. [24] |
|---|
| | |
| | |
| | |
| | |
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 a | Proposed Radius | Radius by Martínez et al. [23] | Radius by Singh et al. [24] |
|---|
| | | |
| | | |
| | | |
Figure 9.
, , for Problem 1.
Figure 9.
, , for Problem 1.
Problem 2
([
13,
22,
23]).
We define by taking and as follows:Nonlinear equations, involving integral operators of the form , 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 , , and . Table 3 and Table 4 contain the values of and .
Table 3.
Radius of PBIS for Problem 2 with .
Table 3.
Radius of PBIS for Problem 2 with .
| Proposed Radius | Radius by Martínez et al. [23] | Radius by Singh et al. [24] |
|---|
| | |
| | |
| | |
| | |
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 a | Proposed Radius | Radius by Martínez et al. [23] | Radius by Singh et al. [24] |
|---|
| | | |
| | | |
| | | |
Figure 10.
, , for Problem 2.
Figure 10.
, , for Problem 2.
Problem 3
([
23,
24]).
Let and . Define for byFor , the solution is . We obtain and . In Table 5 and Table 6, the parameters and , are listed.
Table 5.
Radius of PBIS for Problem 3 with .
Table 5.
Radius of PBIS for Problem 3 with .
| Proposed Radius | Radius by Martínez et al. [23] | Radius by Singh et al. [24] |
|---|
| | |
| | |
| | |
| | |
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 a | Proposed Radius | Radius by Martínez et al. [23] | Radius by Singh et al. [24] |
|---|
| | | |
| | | |
| | | |
Problem 4
([
23,
24]).
Assume that and . Then, for defined by is a solution of . We get for this problem. The parameters and , are listed in Table 7 and Table 8.
Figure 11.
, , for Problem 3.
Figure 11.
, , for Problem 3.
Table 7.
Radius of PBIS for Problem 4 with .
Table 7.
Radius of PBIS for Problem 4 with .
| Proposed Radius | Radius by Martínez et al. [23] | Radius by Singh et al. [24] |
|---|
| | |
| | |
| | |
| | |
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 a | Proposed Radius | Radius by Martínez et al. [23] | Radius by Singh et al. [24] |
|---|
| | | |
| | | |
| | | |
Figure 12.
, , for Problem 4.
Figure 12.
, , for Problem 4.
Problem 5
([
24]).
We define bywhere , , , and the Green’s function is defined on by . Here, is a solution of . We derive that . In Table 9 and Table 10, and are summarized.
Table 9.
Radius of PBIS for Problem 5 with .
Table 9.
Radius of PBIS for Problem 5 with .
| Proposed Radius | Radius by Martínez et al. [23] | Radius by Singh et al. [24] |
|---|
| = ** | |
| = ** | |
| r = ** | |
| = ** | |
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 a | Proposed Radius | Radius by Martínez et al. [23] | Radius by Singh et al. [24] |
|---|
| | = ** | |
| | = ** | |
| | = ** | |
Figure 13.
, , for Problem 5.
Figure 13.
, , for Problem 5.
Problem 6
([
24]).
Let us take and , and the equation governed by an integral operator as follows:Here, , . The radius and , are placed in Table 11 and Table 12.
Table 11.
Radius of PBIS for Problem 6 with .
Table 11.
Radius of PBIS for Problem 6 with .
| Proposed Radius | Radius by Martínez et al. [23] | Radius by Singh et al. [24] |
|---|
| = ** | |
| = ** | |
| r = ** | |
| = ** | |
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 a | Proposed Radius | Radius by Martínez et al. [23] | Radius by Singh et al. [24] |
|---|
| | = ** | |
| | = ** | |
| | = ** | |
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 Problems | Proposed Radii | Radii by Martínez et al. [23] | Improvements in the Radii |
|---|
| Problem 1 | | | |
| Problem 2 | | | |
| Problem 3 | | | |
| Problem 4 | | | |
| Problem 5 | | | |
| Problem 6 | | | |
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 Problems | Proposed Radii | Radii by Singh et al. [24] | Improvements in the Radii |
|---|
| Problem 1 | | | |
| Problem 2 | | | |
| Problem 3 | | | |
| Problem 4 | | | |
| Problem 5 | | | |
| Problem 6 | | | |
Table 15.
Comparison of PBIS with NS for Problem 1.
Table 15.
Comparison of PBIS with NS for Problem 1.
| Methods | NI | | ACOC |
|---|
| | NS PBIS | 7 3 |
| 2.0000 5.0000 |
| | NS PBIS | 7 3 |
| 2.0000 4.9999 |
Figure 14.
, , for Problem 6.
Figure 14.
, , for Problem 6.
Table 16.
Comparison of PBIS with NS for Problem 2.
Table 16.
Comparison of PBIS with NS for Problem 2.
| Methods | NI | | ACOC |
|---|
| NS PBIS | 5 3 |
| 3.0000 11.0000 |
| NS PBIS | 5 3 |
| 3.0000 11.0000 |
Table 17.
Comparison of PBIS with NS for Problem 3.
Table 17.
Comparison of PBIS with NS for Problem 3.
| Methods | NI | | ACOC |
|---|
| NS PBIS | 8 4 |
| 2.0000 5.0000 |
| NS PBIS | 8 4 |
| 2.0000 4.9999 |