Convergence Analysis
of Iterative Compositions in Nonlinear Modeling:
Exploring Semilocal and Local Convergence Phenomena
Abstract.
In this work, a comprehensive analysis of a multi-step iterative composition for nonlinear equations is performed, providing insights into both local and semilocal convergence properties. At each step three linear systems are solved in the method, but with the same linear operator. The analysis covers a wide range of applications, elucidating the parameters affecting both local and semilocal convergence and offering insightful information for optimizing iterative approaches in nonlinear model-solving tasks. Moreover, we assert the solution’s uniqueness by supplying the necessary standards inside the designated field. Lastly, we apply our theoretical deductions to real-world problems and show the related test results to validate our findings.
Key words and phrases:
Newton-type method, radius of convergence, Banach space, convergence, convergence order.2005 Mathematics Subject Classification:
65Y20, 65H10, 47H17, 41A581. Introduction
The challenges inherent in exploring systems of nonlinear equations within the field of applied mathematics exhibit a remarkable diversity. While the specific methods for attaining analytical solutions vary depending on the problem, iterative approaches [13, 3, 18, 11, 12] commonly find utility in approximating solutions across a wide spectrum of problems. Under some standard assumptions, a typical representation for a nonlinear system takes the mathematical form:
(1) |
where , are Banach spaces, and is an open convex set.
One of the fundamental one-point methods is Newton’s method, which has quadratic convergence and is stated as
where is the starting point and is the first Fŕechet derivative of . Here, denotes the set of bounded linear operators from to . Many improved iterative methods have been presented and their convergence properties tested in Banach spaces (see, e.g., [14, 13, 3, 17, 19, 4, 20, 6, 15, 16, 1, 9, 10] and related references).
A method established in [7] that is defined for each by
(2) | ||||
has received significant attention in this paper. Notice that at each step in method (2) three linear systems are solved, but with the same linear operator. A favorable comparison of this method with several competing methods can be found in [7]. Its convergence order has been shown to be five by establishing the error equation
(3) |
where and , , using the approach of Taylor series expansion. But there are notable restrictions with this approach which limit the applicability of the method. The convergence order five is achieved in [7] for , ( is a natural number), and by assuming the existence of derivatives up to order five which are not used in (2). These conditions restrict the utilization of (2) to operators that are many times differentiable. Thus, there are even scalar equations for which the convergence of (2) cannot be assured. But the method (2) converges. Let us look at an example. Define the function by if , and , if , where , and . It follows by these definitions that the numbers and belong to domain of , and . But the function is not continuous at . Hence, the results in [7] cannot assure that . But (2) converges to if, e.g., , and . This motivational example indicates that the conditions in [7] can be weakened. Moreover, there exist other limitations under with the usage of Taylor series.
In view of above discussion, the main motivation is to achieve the goal with weaker hypotheses rather than relying on earlier strong conditions. In the pursuit of enhancing the convergence characteristics, the present study investigates comprehensively the local and semilocal convergence analyses of (2).
Local convergence: Local convergence specifically addresses the behavior of an iterative method in the immediate vicinity of a solution. It explores the convergence properties within a small neighborhood around a solution point, providing a detailed analysis of how rapidly the iterative process refines its approximations when starting from nearby initial guesses. Understanding local convergence is important for assessing the robustness and effectiveness of an iterative algorithm in practical applications, where solutions are often sought in proximity to known or expected values.
Semilocal convergence: Semilocal convergence, on the other hand, refers to the behavior of an iterative method in a specific region of the solution space. Unlike global convergence, which considers convergence over the entire solution space, semilocal convergence focuses on the behavior of the iterative process within a limited neighborhood of a solution. It provides insights into how quickly the iterative scheme approaches a solution in a local region, offering valuable information about the convergence rate and efficiency near a specific point.
The rest of this article is organized as follows: the local convergence analysis is studied in Section 2, and the semilocal convergence analysis is studied in Section 3. Some special cases and applied problems are presented in Section 4 in order to further certify the theoretical deductions. In the end, the concluding remarks are added in Section 5.
2. Convergence 1: Local
We introduce some scalar functions that play an important role in the local analysis of convergence for the method (2). Set
Suppose :
-
There exists a function which is continuous as well as nondecreasing (FCND) on the interval such that the equation admits a smallest positive solution (SPS) denoted by . Set
-
There exists a FCND Moreover, define functions with domain and range in turn by
and
-
The equation admits SPS in the interval denoted by , respectively. Define the parameter as
(4) This parameter is shown to be a possible radius of convergence for the method (2) in Theorem 2.
The functions and relate to the operators on the method.
-
There exist an invertible operator and a solution such that
Define the domain in
-
for each and
-
The conditions are employed to show the local analysis of convergence for the method (2).
Remark 1.
A usual choice for the identity operator or for an auxiliary point other than or . In the latter case according to the condition the solution is simple. However, this is not necessary the most flexible choice. Our approach proves the convergence of the method (2) to even if the solution is not simple provided that and the equation has only one solution in .
Next, the local analysis of convergence is established under the conditions
Theorem 2.
Suppose that the conditions hold and pick Then, the sequence generated by the method (2) is well defined in the ball , remains in for each and is convergent to . Moreover, the following error estimates hold for each
(5) | ||||
(6) | ||||
(7) | ||||
(8) |
where, , the functions are as previously defined and the radius is given by the formula (4).
Proof.
Assertions (5)–(8) are shown by induction. Pick The application of the condition and (4) give in turn
(9) |
It follows by (9), and the Banach standard Lemma on linear operators [2] having inverses that as well as
(10) |
If , the iterates , , , and are well defined by the four substeps of the method (2), respectively. We shall also show that they belong in the ball in turn as follows:
(11) | ||||
Using (4), (10), estimate (10) (for ), and the definition of the function , we have in turn
(12) | ||||
so the iterate , and the assertion (5) holds if
We need the estimates
(13) |
Hence, by the condition
(14) | ||||
so
(15) | ||||
or
(16) | ||||
Then, we can write from the second substep of the method (2) in turn that
(17) |
By using (10) (for ), (12)–(17), the condition and (4), we get in turn that
Thus, the iterate and the assertion (6) holds if Similarly, by the third substep of the method (2)
(18) | ||||
leading to
(19) | ||||
Hence, the iterate , and the assertion (7) holds if Moreover, by the last substep of the method (2), we have
(20) | ||||
therefore
(21) | ||||
which shows the assertions (5)–(8) for , and But these calculations can be repeated provided we replace by ( a natural number), respectively. Thus, the induction is completed, and for each
Furthermore, it follows from the estimation
(22) |
where that as well as ∎
In the next result we determine a domain that contains only as a solution.
Proposition 3.
Suppose: The condition holds on the ball for some and there exists such that
(23) |
Define the domain Then, the equation is uniquely solvable by in the domain
Proof.
Let us assume that there exists solving the equation Define the linear operator Then, it follows by the condition and (23)
Hence, the linear operator Moreover, from the identity
we deduce ∎
Remark 4.
Clearly, we can choose in Proposition 3.
3. Convergence 2: Semi-local
The roll of and the functions are exchanged by , and the functions respectively.
Suppose:
-
There exists FCND such that the equation has a SPS denoted by
Set
-
There exists FCND Define the sequence for some and each by
(24) and -
There exists such that for each
It follows by this condition and (24) that
and there exists such that Notice that is the least upper bound of the sequence which is unique.
As in the local analysis, we connect the functions and to be operators on the method (2).
-
There exists an invertible operator and a point such that for each Notice that for the definition of and this condition imply
So, the linear operator Hence, we can set Define the domain
-
for each
and
-
Remark 5.
Similar remarks as in Remark 1 follow, and is a possible choice.
In the next result, we develop the semi-local analysis of convergence for the method (2) under the conditions
Theorem 6.
Suppose that the conditions hold. Then, the sequence generated by (2) is well defined in the ball remains in for each and is convergent to a solution of the equation such that
(25) |
Proof.
The following claims are demonstrated using induction
(26) | |||
(27) | |||
(28) |
and
(29) |
The assertions (26)-(29) are shown using induction. By the condition , the definition of , and the first substep of the method (24), we have So, the iterate and the assertion (26) holds in Let
Then, the definition of and the condition imply
thus and
(30) |
Notice that by the existence of the iterates and are well defined by the four substeps of the method (2), respectively. Next, we need in turn the estimates
and by the conditions , (30) (if )
(31) | ||||
Similarly by exchanging by in the previous calculation, and using
we get
(32) | ||||
t where
Hence, the assertions (26)–(29) hold for each and all iterates , , , belong in Moreover, it follows by the condition the sequence is Cauchy as convergent. Then, by the triangle inequality and (26)–(29)
i.e.,
(34) |
The uniqueness ball is determined in the next result.
Proposition 7.
Suppose: There exists a solution of the equation for some The condition holds on the ball and there exists such that
(36) |
Define the domain Then, the only solution of the equation in the domain is
Proof.
Let be such that Define the linear operator It follows by the condition , and (30) that
Then, the identity
we conclude ∎
Remark 8.
-
(i)
In the condition , the limit point can be replaced by .
-
(ii)
In Proposition 7, we can set and under all the conditions of Theorem 6.
4. Numerical results
The numerical tests contribute to a deeper understanding of the convergence properties of iterative compositions, enhancing the practical applicability and theoretical foundation of nonlinear modeling techniques. In view of this, here we verify the theoretical results proven in the preceding sections. Let us consider the following problems:
Example 9.
Consider the equation
(37) |
where , , that comes from Kepler’s [5]. In [5], several options are provided for the values of and . Specifically, the approximate solution to (37) is for and . Let be the initial approximation such that , with being a positive constant. Now, we have
Thus, , we get the approximation,
and
where and
The aforesaid approximations lead to the estimation of parameters utilised in the conditions of Section 2 and Section 3. The parameters listed in are given as
and
Moreover, the parameters defined in are chosen as
and consequently, we obtain the sequence as
which converges to
Example 10.
The norm for every and matrix norm for any . We can take the domain for every .
On a closed interval , define the boundary value problem as
(38) |
Taking into consideration the partitioning of with a sub-interval of length as
in order to convert the equation (38) into a finite dimensional problem.
Denoting and by finite differences
equation (38) reduces into nonlinear system, given by
(39) |
where Now at the Fŕechet derivative is given as follows:
In specifically, we select to find the parameters provided in the Section 2 and Section 3 to convert (39) to a system of equations fulfilling the solution
Furthermore, we choose the initial estimate as , treating the domain with as an open ball for some positive constant . Then, we can determine that
and
where and for any .
The parameters listed in Section 2 under conditions for the local convergence analysis are selected as follows in view of the aforementioned approximations:
and consequently, we have that
Example 11.
Let stand for the continuous function space with norm for each and defined on the domain as a closed unit interval . Let and nonlinear mapping (see [8]) as
(40) |
where , and the kernel is given as
that satisfies the following,
Moreover, the Fréchet derivative of (40) is given by
Note that solution of (40) is and also satisfies Then, for , we have,
where
Furthermore, for the which is given as and the estimation
it is calculated that , provided Therefore, , we get
and
where and
5. Conclusion
Comprehensive analysis is conducted on a fifth-order iterative technique to assess its local and semilocal convergence in Banach Spaces. In contrast to the conventional reliance on Taylor series expansions, this study establishes generalized convergence results based solely on assumptions about first-order derivatives. The presented analysis introduces a fresh perspective for examining the convergence of the iterative method, focusing exclusively on the operators inherent in the given iterative processes. Unlike earlier studies, which incorporated higher-order derivatives not present in the methods under consideration, this approach acknowledges the potential non-existence of such derivatives. Consequently, previous results do not provide a definitive guarantee of convergence, even though it may occur. This innovative approach effectively broadens the applicability of the given method to a more extensive range of problems. Rigorous testing on applied problems lends support to the validity of the developed results. A noteworthy observation is that the analytical technique employed in this study has broader applicability and could be extended to enhance the effectiveness of other methods in a similar manner.
References
-
[1]
A.R. Amiri, A. Cordero, M.T. Darvishi, and J.R. Torregrosa,
Preserving the order of convergence: Low-complexity Jacobian-free iterative schemes for solving nonlinear systems,
J. Comput. Appl. Math., 337 (2018), pp. 87–97.
https://doi.org/10.1016/j.cam.2018.01.004
- [2] I.K. Argyros and Á.A. Magreñán, Iterative Methods and Their Dynamics with Applications, CRC Press, New York, 2017.
- [3] I.K. Argyros, The Theory and Applications of Iteration Methods, CRC Press, New York, 2022.
-
[4]
R. Behl and I.K. Argyros,
Local convergence for multi-step high order solvers under weak conditions,
Mathematics, 8(2020), no. 179.
https://doi.org/10.3390/math8020179
- [5] J.M.A. Danby and T.M. Burkardt, The solution of Kepler’s equation, Celest. Mech., 31 (1983), pp. 95–107.
-
[6]
M.T. Darvishi and A. Barati,
A third-order Newton type method to solve systems of nonlinear equations,
Appl. Math. Comput., 187 (2007), pp. 630–635.
https://doi.org/10.1016/j.amc.2006.08.080
-
[7]
R. Erfanifar and M. Hajarian,
A new multi-step method for solving nonlinear systems with high efficiency indices,
Numer. Algor., 97 (2024), pp. 959–984.
https://doi.org/10.1007/s11075-023-01735-2
-
[8]
J.M. Gutiérrez, Á.A. Magreñán, and N. Romero,
On the semilocal convergence of Newton-Kantorovich method under center-Lipschitz conditions,
Appl. Math. Comput., 221 (2013), pp. 79–88.
https://doi.org/10.1016/j.amc.2013.05.078
-
[9]
H.H.H. Homeier,
On Newton-type methods with cubic convergence,
J. Comput. Appl. Math., 176 (2005), pp. 425–432.
https://doi.org/10.1016/j.cam.2004.07.027
-
[10]
D. Kumar, S. Kumar, J.R. Sharma, and L. Jäntschi,
Convergence analysis and dynamical nature of an efficient iterative method in Banach spaces,
Mathematics, 9 (2021), no. 2510.
https://doi.org/10.3390/math9192510
- [11] Á.A. Magreñán and I.K. Argyros, A contemporary study of iterative methods: convergence dynamics and applications, Academic Press, Elsevier, 2019.
- [12] J.M. Ortega and W.C. Rheinboldt, Iterative Solutions of Nonlinear Equations in Several Variables, Academic Press, New York, 1970.
- [13] A.M. Ostrowski, Solution of Equations and Systems of Equations, Academic Press, New York, 1960.
- [14] P.D. Proinov, Semi-local convergence of two iterative methods for simultaneous computation of polynomial zeros, C. R. Acad. Bulgare Sci., 59 (2006), pp. 705–712.
- [15] W.C. Rheinboldt, An adaptive continuation process for solving systems of nonlinear equations, Banach Center Publ., 3 (1978), pp. 129–142.
-
[16]
S.M. Shakhno,
Convergence of the two-step combined method and uniqueness of the solution of nonlinear operator equations,
J. Comput. Appl. Math., 261 (2014), pp. 378–386.
https://doi.org/10.1016/j.cam.2013.11.018
-
[17]
J.R. Sharma, S. Kumar, and I.K. Argyros,
Generalized Kung-Traub method and its multi-step iteration in Banach spaces,
J. Complexity, 54 (2019), 101400.
https://doi.org/10.1016/j.jco.2019.02.003
- [18] J.F. Traub, Iterative Methods for the Solution of Equations, Chelsea Publishing Company, New York, 1970.
-
[19]
X.Y. Xiao and H. Yin,
Achieving higher order of convergence for solving systems of nonlinear equations,
Appl. Math. Comput., 311 (2017), pp. 251–261.
https://doi.org/10.1016/j.amc.2017.05.033
-
[20]
X.Y. Xiao and H. Yin,
Accelerating the convergence speed of iterative methods for solving nonlinear systems,
Appl. Math. Comput., 333 (2018), pp. 8–19.
https://doi.org/10.1016/j.amc.2018.03.108