Abstract
We study semi-local convergence of two-step Jarratt-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 to majorizing scalar sequences and our technique of recurrent functions. Finally, the numerical example is given.
1. Introduction
Let us consider an equation
where is a nonlinear Fréchet-differentiable operator, X and Y are Banach spaces, D is an open convex subset of X. To find the approximate solution of (1) very often the Newton method is used [1,2]:
The method (2) has quadratic order of convergence. To increase the convergence order multi-step schemes had been developed [3,4,5,6,7,8,9,10,11,12]. Some of them are based on Newton schemes. Such algorithms require more evaluations of function and its derivatives per iteration. For example, Jarratt [11] examined a fourth order algorithm which required to compute one function and two derivative per iteration. Sharma and Arora [11] studied forth and six order Jarratt-like methods, which use one and two function, respectively, two derivatives and one matrix inversion per iteration. Jarratt-, King-, Ostrowski-type methods contain real parameters. The order of convergence depends on the values of these parameters.
In this article, we consider Jarratt-type scheme
where are nonzero scalar parameters, and . Similar scheme was proposed in [11] and local convergence was studied. In this article, we develop a semi-local convergence analysis of method (3) under classical Lipschitz conditions only for first-order derivatives. The results can certainly be extended further along the same lines if instead of the Lipschitz condition we use the Hölderian one.
2. Majorizing Sequence
Let , L and be positive parameters. We shall show in Section 3 that scalar sequence defined for by
where is majorizing for scheme (3).
Next, we provide two results for the convergence of sequence (4).
Lemma 1.
Assume that for each
Then, sequence generated by (4) is strictly increasing, bounded from above by and converges to its unique least upper bound .
Proof.
By the definition of sequence and (4) the conclusions immediately follow. □
The next result uses stronger convergence conditions but easier to verify. Let us first define polynomials on the interval by
and
By these definitions , , , . It follows that and have roots in by the intermediate value theorem. Denote smallest such roots by and , respectively. Let
and
It is worth noticing that all these parameters depend on the minimal data , L and . Then, we can show the second result on majorizing sequence for scheme (3).
Lemma 2.
Assume
and
or
where and . Then, the sequence converges to .
Proof.
Induction shall be used to show
- ():
- ():
- ():
These items are true for by the definition of sequence and (6). Then, it also follows
Assume
Evidently, () holds provided
By this definition the following relationship between two consecutive polynomials can be found:
In particular, (11) gives
Define function on the interval by
Similarly, () holds if we show instead
where we also used
or if
where polynomials are defined on the interval by
By this definition one obtains
so,
It follows that sequence is increasing an bounded from above by and such it converge to . □
3. Semi-Local Convergence
The conditions (A) shall be used. Assume:
- (A1)
- There exist and such that and, .
- (A2)
- for each and some .Let .
- (A3)
- for each and some .
- (A4)
- Conditions of Lemma 1 or Lemma 2 hold.
- (A5)
- .
The semi-local convergence analysis is based on conditions (A).
Theorem 1.
Assume conditions (A) hold. Then, sequence generated by scheme (3) exists in , stays in for each and converges to a solution of equation .
Proof.
Items
and
shall be proved using induction.
By (A1) one has
so (21) holds for , and . Suppose it holds for all values of m smaller or equal to Let . Then, in view of (A1) and (A2) one obtains
leading to and
by the Lemma on invertible linear operators due to Banach [2,13]. Then, one has
and
so
so
It them follows from (3), (4), (23) for , and (26) that
where we also used. The following have also be used
so . Notice also that
so .
The induction for (21) and (22) is completed. It follows that sequence is Cauchy in a Banach space X and, as such, it converges to some (since is a closed set).
By letting in (26) and using the continuity of F we conclude .
□
The parameters or given in closed form can replace in Theorem 1.
A uniqueness of the solution result follows next.
Proposition 1.
Assume:
- (i)
- The point is a solution of equation in D;
- (ii)
- Condition (A2) holds.
Then, the only solution of Equation (1) in the region is .
Proof.
Let with . Set . Then, in view of (A2) one obtains
so is obtained from the invertibility of M and . □
4. Numerical Example
Let us consider the nonlinear equation
where a function F is defined on and . Let . Then, we obtain
If we choose then
Now, verify conditions of Lemma 1 and Theorem 1 for , . Majorizing sequences
converge to . Moreover, condition (5) holds for each k.
Table 1 gives error estimates (21) and (22). The solution is obtained at three iterations for . Therefore, conditions of Theorem 1 are satisfied and converge to .
Table 1.
Error estimates.
5. Conclusions
Method (3) has been used extensively for solving equations. The local convergence analysis of method (3) has been given under various conditions. However, the semi-local which is more interesting has not been given. That is why we presented it in this study using majorizing sequences, Lipschitz conditions, and recurrent functions. The results can certainly be extended further along the same lines if instead of the Lipschitz condition we use the Hölderian one. Our technique is very general, so it can be used to provide results on the semi-local convergence of other higher-order convergent methods along the same lines. The theoretical results are also justified by examples.
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. Unified Convergence Criteria for Iterative Banach Space Valued Methods with Applications. Mathematics 2021, 9, 1942. [Google Scholar] [CrossRef]
- Ortega, J.M.; Rheinboldt, W.C. Iterative Solution of Nonlinear Equations in Several Variables; Academic Press: New York, USA, 1970. [Google Scholar]
- Argyros, I.K.; Shakhno, S.; Yarmola, H. Method of Third-Order Convergence with Approximation of Inverse Operator for Large Scale Systems. Symmetry 2020, 12, 978. [Google Scholar] [CrossRef]
- Argyros, I.K.; Shakhno, S.; Yarmola, H. Two-step solver for nonlinear equations. Symmetry 2019, 11, 128. [Google Scholar] [CrossRef] [Green Version]
- Cordero, A.; Garcìa, J.; Torregrosa, J.R.; Vassileva, M.P.; Vindel, P. Chaos in King’s iterative family. Appl. Math. Lett. 2013, 26, 842–848. [Google Scholar] [CrossRef] [Green Version]
- Jarratt, P. Some fourth order multipoint iterative methods for solving equations. Math. Comput. 1966, 20, 434–437. [Google Scholar] [CrossRef]
- Kansal, M.; Cordero, A.; Bhalla, S.; Torregrosa, J.R. New fourth- and sixth-order classes of iterative methods for solving systems of nonlinear equations and their stability analysis. Numer. Algorithms 2021, 87, 1017–1060. [Google Scholar] [CrossRef]
- Magreñán, A.A.; Argyros, I.K. Two step Newton methods. J. Complex. 2014, 30, 533–553. [Google Scholar] [CrossRef]
- Ostrowski, A.M. Solution of Equations and Systems of Equations; Prentice-Hall: Englewood Cliffs, NJ, USA, 1964. [Google Scholar]
- Shakhno, S.M. On a two-step iterative process under generalized Lipschitz conditions for first-order divided differences. J. Math. Sci. 2010, 168, 576–584. [Google Scholar] [CrossRef]
- Sharma, J.R.; Arora, H. Efficient Jarratt-like methods for solving systems of nonlinear equations. Calcolo 2014, 51, 193–210. [Google Scholar] [CrossRef]
- Traub, J.F. Iterative Methods for the Solution of Equations; Chelsea Publishing Company: New York, NY, USA, 1982. [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/).