Abstract
We study the semi-local convergence of a three-step Newton-type method for solving nonlinear equations under the classical Lipschitz conditions for first-order derivatives. To develop a convergence analysis, we use the approach of restricted convergence regions in combination with majorizing scalar sequences and our technique of recurrent functions. Finally, a numerical example is given.
1. Introduction
Let us consider an equation
Here, is a nonlinear Fréchet-differentiable operator, X and Y are Banach spaces, is an open convex subset of X. To find the approximate solution of (1), iterative methods are used very often. The most popular is the quadratically convergent Newton method [1,2,3]. To increase the order of convergence, multi-step methods have been developed [4,5,6,7,8,9,10,11,12]. Multipoint iterative methods for solving the nonlinear equation have advantages over one-point methods because they have higher orders of convergence and computational efficiency. Furthermore, some methods need to compute only one derivative or divided difference per one iteration.
In this article, we consider the method with the fifth-order convergent
where . It was proposed in [9]. However, the local convergence was shown using Taylor expansions and required the existence of six-order derivatives not used on (2) in the proof of the main result. The semi-local convergence has not been studied. This is the purpose of this paper. We also only use the first derivative, which only appears in (2). To study the multi-step method, it is often required that the operator F be a sufficiently differentiable function in a neighborhood of solutions. This restricts the applicability of methods. Let us consider the function
where , . This function has zero and . Obviously, is not bounded on . Therefore, the convergence of Method (2) is not guaranteed by the analysis in the previous paper. That is why we develop a semi-local convergence analysis of Method (2) under classical Lipschitz conditions for first-order derivatives only. Hence, we extend the applicability of the method. There is a plethora of single, two-step, three-step, and multi-step methods whose convergence has been shown using the second or higher-order derivatives or divided differences [1,2,3,5,6,7,8,9,10,12].
2. Majorizing Sequence
Let , L and be positive parameters. Define scalar sequences , and by
where
Sequence (3) shall be shown to be majorizing for Method (2) in Section 3. However, first, we present some convergence results for Method (2).
Lemma 1.
Assume
Then, Sequence (3) is bounded from above by , nondecreasing and , where is the unique least upper bound of sequence satisfying .
Proof.
It follows by the definition of sequence and (4) that it is bounded from above by and non-decreasing, so it converges to . □
Next, we present stronger convergence criteria than (4) that are easier to verify. Define polynomials on the interval by
and
It follows that , , and . Consequently, these polynomials have zeros in . Denote minimal such zeros by , and . Moreover, define
and
Lemma 2.
Assume
Then, sequence is bounded from above by , nondecreasing and , where is the least upper bound satisfying .
Proof.
Items
- ():
- ():
- ():
shall be shown using mathematical induction on i. These items are true for by (5). It follows from Definition (3) and (), () and () that
Assume items (), () and () are true for all values of i smaller or equal to . Then, we use
and
It follows
since
Then, evidently, () certainly holds if
or if
where recurrent polynomials are defined on the interval
A connection between two consecutive polynomials is needed
In particular, one obtains
Define the function on the interval by
Then, by (8), one has
Similarly, instead of (), one can show
()′: since .
Then, () holds if
or if
where
This time one obtains
In particular, one has
Define the function on the interval by
Similarly, () holds if
where we also used
As in (8), one obtains
In particular, one obtains that
Define the function on the interval by
We also used
which is true since
and by (5). The induction for items ()–() is completed. It follows that sequence is bounded from above by and in non-decreasing, and as such, it converges to . □
3. Semi-Local Convergence
The hypotheses (H) are needed. Assume:
Hypothesis 1.
There exist and such that and .
Hypothesis 2.
Center Lipschitz condition holds for all and some .
Let .
Hypothesis 3.
Restricted Lipschitz condition holds for all and some .
Hypothesis 4.
Hypotheses of Lemma 1 or Lemma 2 hold.
Hypothesis 5.
(or ).
The main Semi-local result for Method (2) is shown next using the hypotheses (H).
Theorem 1.
Assume hypotheses hold. Then, sequence produced by Method (2) exists in and stays in , and so that and
Proof.
Items
- ():
- ():
- ():
shall be shown using the induction of k.
By (H1), one obtains
so and () holds. Let . Then, it follows from (H1) and (H2) that
so and
follow by a Lemma on linear invertible operators due to Banach [3,13]. Notice also that is well-defined by the third substep of Method (2) for since .
Next, the linear operator is shown to be invertible. Indeed, one obtains by (H2):
so
In particular, is well-defined by the second substep of Method (2) for . Moreover, we can write
This shows () for .
Moreover, one has
so .
Hence, by (3), (31) (for ), and (35),
which shows (). Using the third subset of Method (2), one has
so by (H3), (31) (for ), and the induction hypotheses
The following have also been used
and
so .
Hence, the induction for items ()–() is completed. Moreover, because of , sequence is fundamental since X is a Banach space. Therefore, there exists such that . By (37), one obtains
It follows that , where the continuity of G is also used.
Let . Then, from the estimate
one obtains (30) by letting . □
A uniqueness of the solution result follows next.
Theorem 2.
Assume:
- (i)
- The point is a simple solution of equation in .
- (ii)
- There exists such that
Let . Then, the only solution of Equation (1) in the region is .
Proof.
Let with . Set . Then, in view of (H2) and (41), one obtains
so is obtained from the invertibility of M and . □
4. Numerical Example
Let us consider following system of nonlinear equations. Let , and
The solution of system is . Since, for each
we have
Here, , and denotes the diagonal element of matrix . Let us choose and . Then, we obtain , , , and . The majorizing sequences
converge to . Therefore, the conditions of Lemma 1 are satisfied.
Table 1 gives error estimates (30), and ()–(). The solution is obtained at three iterations for . Therefore, the conditions of Theorem 1 are satisfied, and converges to .
Table 1.
Error estimates.
Let us estimate the order of convergence using the computational order of convergence (COC) and the approximate computational order of convergence (ACOC) [1,9], which can be used given, respectively, by
, for each and , for each . We use the stopping criterion . If then , . If then . The method converges to a solution at seven iterations. Therefore, the computational order of convergence coincides with the theoretical one.
5. Conclusions
A semi-local convergence analysis of the Newton-type method that is fifth-order convergent is provided under the classical Lipschitz conditions for first-order derivatives. The regions of convergence and uniqueness of the solution are established. The results of a numerical experiment are given.
Author Contributions
Conceptualization, I.K.A.; methodology, I.K.A.; investigation, I.K.A., C.I.A., S.S. and H.Y. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Argyros, I.K.; Magreñán, A.A. Iterative Methods and Their Dynamics with Applications: A Contemporary Study; CRC Press: Boca Raton, FL, USA, 2017. [Google Scholar]
- Dennis, J.E., Jr.; Schnabel, R.B. Numerical Methods for Unconstrained Optimization and Nonlinear Equations; Prentice-Hall: Englewood Cliffs, NJ, USA, 1983. [Google Scholar]
- Ortega, J.M.; Rheinboldt, W.C. Iterative Solution of Nonlinear Equations in Several Variables; Academic Press: New York, NY, USA, 1970. [Google Scholar]
- Amat, S.; Argyros, I.K.; Busquier, S.; Hernández-Verón, M.A. On two high-order families of frozen Newton-type methods. Numer. Linear Algebra Appl. 2018, 25, e2126. [Google Scholar] [CrossRef]
- Amat, S.; Bermudez, C.; Hernandez, M.A.; Martinez, E. On an efficient k-step iterative method for nonlinear equations. J. Comput. Appl. Math. 2016, 302, 258–271. [Google Scholar] [CrossRef] [Green Version]
- Argyros, I.K.; George, S. On the complexity of extending the convergence region for Traub’s method. J. Complex. 2020, 56, 101423. [Google Scholar] [CrossRef]
- Argyros, I.K.; George, S. On a two-step Kurchatov-type method in Banach space. Mediterr. J. Math. 2019, 16, 21. [Google Scholar] [CrossRef]
- Argyros, I.K.; Shakhno, S. Extended Two-Step-Kurchatov Method for Solving Banach Space Valued Nondifferentiable Equations. Int. J. Appl. Comput. Math. 2020, 6, 32. [Google Scholar] [CrossRef]
- 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] [Green Version]
- Cordero, A.; Martínez, E.; Torregrosa, J.R. Iterative methods of order four and five for systems of nonlinear equations. J. Comput. Appl. Math. 2009, 231, 541–551. [Google Scholar] [CrossRef] [Green Version]
- Shakhno, S.M. On an iterative algorithm with superquadratic convergence for solving nonlinear operator equations. J. Comput. Appl. Math. 2009, 231, 222–235. [Google Scholar] [CrossRef] [Green Version]
- Shakhno, S.M.; Iakymchuk, R.P.; Yarmola, H.P. Convergence of a two-step method for the nonlinear least squares problem with decomposition of operator. J. Numer. Appl. Math. 2018, 2, 82–95. [Google Scholar]
- Kantorovich, L.V.; Akilov, G.P. Functional Analysis; Pergamon Press: Oxford, UK, 1982. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).