Next Article in Journal / Special Issue
On the Local Convergence of a (p + 1)-Step Method of Order 2p + 1 for Solving Equations
Previous Article in Journal
Peculiar Features of Molecular Hydrogen Ions Formed by Proton Collisions with Hydrogen Atoms of the Second Flavor
Previous Article in Special Issue
On the Semi-Local Convergence of a Fifth-Order Convergent Method for Solving Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On the Semi-Local Convergence of a Jarratt-Type Family Schemes for Solving Equations

by
Christopher I. Argyros
1,
Ioannis K. Argyros
2,*,
Stepan Shakhno
3 and
Halyna Yarmola
4
1
Department of Computing and Technology, Cameron University, Lawton, OK 73505, USA
2
Department of Mathematical Sciences, Cameron University, Lawton, OK 73505, USA
3
Department of Theory of Optimal Processes, Ivan Franko National University of Lviv, Universytetska Str. 1, 79000 Lviv, Ukraine
4
Department of Computational Mathematics, Ivan Franko National University of Lviv, Universytetska Str. 1, 79000 Lviv, Ukraine
*
Author to whom correspondence should be addressed.
Foundations 2022, 2(1), 234-241; https://doi.org/10.3390/foundations2010017
Submission received: 24 January 2022 / Revised: 10 February 2022 / Accepted: 15 February 2022 / Published: 17 February 2022
(This article belongs to the Special Issue Iterative Methods with Applications in Mathematical Sciences)

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
F ( x ) = 0 ,
where F : D X Y 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 x * D of (1) very often the Newton method is used [1,2]:
x k + 1 = x k F ( x k ) 1 F ( x k ) , k = 0 , 1 , ,
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
y k = x k α F ( x k ) 1 F ( x k ) , x k + 1 = y k γ A k 1 B k ( y k x k ) , k = 0 , 1 , ,
where α , β , γ are nonzero scalar parameters, B k = F ( x k ) 1 ( F ( y k ) F ( x k ) ) and A k = I + β B k . 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 0 , L and μ be positive parameters. We shall show in Section 3 that scalar sequence { t k } defined for k = 0 , 1 , 2 , by
t 0 = 0 , s 0 = μ , t k + 1 = s k + | γ | L ( s k t k ) 2 1 ( L 0 t k + | β | L ( s k t k ) ) , s k + 1 = t k + 1 + | α | L ( t k + 1 t k ) 2 + 2 ( 1 + L 0 t k ) ( t k + 1 s k ) + 2 1 1 α ( 1 + L 0 t k ) ( s k t k ) 2 ( 1 L 0 t k + 1 )
where is majorizing for scheme (3).
Next, we provide two results for the convergence of sequence (4).
Lemma 1.
Assume that for each k = 0 , 1 , 2 ,
L 0 t k + | β | L ( s k t k ) < 1 .
Then, sequence { t k } generated by (4) is strictly increasing, bounded from above by 1 L 0 and converges to its unique least upper bound t * .
Proof. 
By the definition of sequence { t k } 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 [ 0 , 1 ) by
p 1 ( t ) = ( L 0 + | β | L ) t 2 + ( | γ | | β | ) L t | γ | L
and
p 2 ( t ) = | α | L ( 1 + t ) 2 t | α | L ( 1 + t ) 2 + 2 L 0 t 3 .
By these definitions p 1 ( 0 ) = | γ | L , p 1 ( 1 ) = L 0 , p 2 ( 0 ) = | α | L , p 2 ( 1 ) = 2 L 0 . It follows that p 1 and p 2 have roots in ( 0 , 1 ) by the intermediate value theorem. Denote smallest such roots by δ 1 and δ 2 , respectively. Let
a = | γ | L s 0 1 | β | L s 0 , b = | α | L t 1 2 + 2 ( t 1 s 0 ) + 2 1 1 α s 0 2 ( 1 L 0 t 1 ) ,
c = max { a , b } , δ 3 = min { δ 1 , δ 2 } ,
and
δ = max { δ 1 , δ 2 } .
It is worth noticing that all these parameters depend on the minimal data L 0 , L and μ . Then, we can show the second result on majorizing sequence for scheme (3).
Lemma 2.
Assume
0 c δ 3 δ 1 L 0 μ
and
f ( t ) 0 a t t = δ
or
g ( t ) 0 a t t = δ ,
where f ( t ) = t | α | + | α 1 | + L 0 μ t 1 t t and g ( t ) = | α | L μ ( 1 + t ) 2 t + 2 t | α | + 2 | α 1 | + 2 L 0 μ t ( 1 + t + t 2 ) 2 t . Then, the sequence { t k } converges to t * .
Proof. 
Induction shall be used to show
( H k ( 1 ) ):
0 | γ | L ( s k t k ) 1 ( L 0 t k + | β | L ( s k t k ) ) δ ;
( H k ( 2 ) ):
0 | α | L ( t k + 1 t k ) 2 + 2 ( 1 + L 0 t k ) ( t k + 1 s k ) + 2 1 1 α ( 1 + L 0 t k ) ( s k t k ) 2 ( 1 L 0 t k + 1 ) δ ( s k t k ) ;
( H k ( 3 ) ):
t k s k t k + 1 .
These items are true for k = 0 by the definition of sequence { t k } and (6). Then, it also follows
0 s 0 t 0 δ 0 μ , 0 s 1 t 1 δ μ , t 1 s 0 δ μ a n d t 1 ( 1 δ 2 ) 1 δ μ .
Assume
0 s k t k δ k μ , a n d t k ( 1 δ k + 1 ) 1 δ μ .
Evidently, ( H k ( 1 ) ) holds provided
| γ | L δ k μ + L 0 δ ( 1 δ k + 1 ) μ 1 δ + | β | L δ k + 1 μ δ 0 .
This estimate (7) holds if
h k ( 1 ) ( t ) 0 a t t = δ 1 .
where recurrent functions are defined on [ 0 , 1 ) by
h k ( 1 ) ( t ) = | γ | L t k 1 μ + L 0 ( 1 + t + + t k ) μ + | β | L t k μ 1 .
By this definition the following relationship between two consecutive polynomials can be found:
h k + 1 ( 1 ) ( t ) = h k + 1 ( 1 ) ( t ) h k ( 1 ) ( t ) + h k ( 1 ) ( t ) = | γ | L t k μ + L 0 ( 1 + t + + t k + 1 ) μ + | β | L t k + 1 μ 1 + h k ( 1 ) ( t ) | γ | L t k 1 μ L 0 ( 1 + t + + t k ) μ | β | L t k μ + 1 = h k ( 1 ) ( t ) + [ | γ | L t k μ | γ | L t k 1 μ + L 0 t k + 1 μ + | β | L t k + 1 μ | β | L t k μ ] = h k ( 1 ) ( t ) + p 1 ( t ) t k 1 μ .
In particular, (11) gives
h k + 1 ( 1 ) ( δ 1 ) = h k ( 1 ) ( δ 1 ) .
Define function on the interval [ 0 , 1 ) by
h ( 1 ) ( t ) = lim k h k ( 1 ) ( t ) .
It follows from (10) and (13) that
h ( 1 ) ( t ) = L 0 μ 1 t 1 .
So, (9) holds if
L 0 μ 1 t 1 0 a t t = δ 1 ,
which is true by (6).
Similarly, ( H k ( 2 ) ) holds if we show instead
0 | α | L ( 1 + δ ) 2 δ k μ + 2 δ | α | + 2 | α 1 | 2 1 L 0 ( 1 δ k + 2 ) μ 1 δ δ ,
where we also used
0 t k + 1 t k = ( t k + 1 s k ) + ( s k t k ) ( 1 + δ ) ( s k t k )
or if
h k ( 2 ) ( t ) 0 a t t = δ 2 ,
where polynomials h k ( 2 ) are defined on the interval [ 0 , 1 ) by
h k ( 2 ) ( t ) = | α | L ( 1 + t ) 2 t k μ + 2 t | α | + 2 | α 1 | + 2 L 0 t ( 1 + t + + t k + 1 ) μ 2 t .
By this definition one obtains
h k + 1 ( 2 ) ( t ) = h k + 1 ( 2 ) ( t ) + h k ( 2 ) ( t ) h k ( 2 ) ( t ) = | α | L ( 1 + t ) 2 t k + 1 μ + 2 t | α | + 2 | α 1 | + 2 L 0 t ( 1 + t + + t k + 2 ) μ 2 t + h k ( 2 ) ( t ) | α | L ( 1 + t ) 2 t k μ 2 t | α | 2 | α 1 | 2 L 0 t ( 1 + t + + t k + 1 ) μ + 2 t = h k ( 2 ) ( t ) + p 2 ( t ) t k μ ,
so,
h k + 1 ( 2 ) ( δ 2 ) = h k ( 2 ) ( δ 2 ) .
Define function
h ( 2 ) ( t ) = lim k h k ( 2 ) ( t ) ,
so by this definition and (17)
h ( 2 ) ( t ) = 2 t | α | + 2 | α 1 | + 2 L 0 t μ 1 t 2 t ,
so (19) holds if
h ( 2 ) ( δ ) 0 ,
which is true by (7).
If (8) holds instead of (7) then (16) holds if
h 1 ( 2 ) ( t ) = g ( t ) 0 .
It follows that sequence { t k } is increasing an bounded from above by μ 1 δ and such it converge to t * . □

3. Semi-Local Convergence

The conditions (A) shall be used. Assume:
(A1)
There exist x 0 D and μ 0 > 0 such that F ( x 0 ) 1 L ( Y , X ) and
F ( x 0 ) 1 F ( x 0 ) μ 0 , μ = μ 0 | α | .
(A2)
F ( x 0 ) 1 ( F ( z ) F ( x 0 ) ) L 0 z x 0 for each z D and some L 0 > 0 .
Let D 0 = U ( x 0 , 1 L 0 ) D .
(A3)
F ( x 0 ) 1 ( F ( u ) F ( v ) ) L u v for each u , v D 0 and some L > 0 .
(A4)
Conditions of Lemma 1 or Lemma 2 hold.
(A5)
U [ x 0 , t * ] D .
The semi-local convergence analysis is based on conditions (A).
Theorem 1.
Assume conditions (A) hold. Then, sequence { x k } generated by scheme (3) exists in U ( x 0 , t * ) , stays in U ( x 0 , t * ) for each k = 0 , 1 , and converges to a solution x * U [ x 0 , t * ] of equation F ( x ) = 0 .
Proof. 
Items
y m x m s m t m
and
x m + 1 y m t m + 1 s m
shall be proved using induction.
By (A1) one has
y 0 x 0 = | α | F ( x 0 ) 1 F ( x 0 ) | α | μ 0 = μ = s 0 t 0 = s 0 < t * ,
so (21) holds for m = 0 , and y 0 U ( x 0 , t * ) . Suppose it holds for all values of m smaller or equal to k 1 Let v U ( x 0 , t * ) . Then, in view of (A1) and (A2) one obtains
F ( x 0 ) 1 ( F ( v ) F ( x 0 ) ) L 0 v x 0 L 0 t * < 1 ,
leading to F ( v ) 1 L ( Y , X ) and
F ( v ) 1 F ( x 0 ) 1 1 L 0 v x 0
by the Lemma on invertible linear operators due to Banach [2,13]. Then, one has
B m F ( x m ) 1 F ( x 0 ) F ( x 0 ) 1 ( F ( y m ) F ( x m ) ) L y m x m 1 L 0 x m x 0 .
and
β B m | β | L y m x m 1 L 0 x m x 0 | β | L ( s m t m ) 1 L 0 t m < 1 ,
so
A m 1 1 | β | L ( s m t m ) 1 L 0 t m ,
so
x m + 1 y m | γ | A m 1 B m y m x m | γ | 1 L 0 t m 1 L 0 t m | β | L ( s m t m ) L ( s m t m ) 2 1 L 0 t m = t m + 1 s m .
By scheme (3), one can write
F ( x m + 1 ) = F ( x m + 1 ) F ( x m ) + F ( x m ) = F ( x m + 1 ) F ( x m ) F ( x m ) ( x m + 1 x m ) + F ( x m ) ( x m + 1 x m ) 1 α F ( x m ) ( y m x m ) + F ( x m ) ( y m x m ) F ( x m ) ( y m x m ) = 0 1 F ( x m + θ ( x m + 1 x m ) ) F ( x m ) d θ ( x m + 1 x m ) + F ( x m ) ( x m + 1 y m ) F ( x 0 ) ( x m + 1 y m ) + F ( x 0 ) ( x m + 1 y m ) + 1 1 α ( F ( x m ) F ( x 0 ) + F ( x 0 ) ) ( y m x m ) ,
so
| α | F ( x 0 ) 1 F ( x m + 1 ) = | α | L 2 x m + 1 x m + ( 1 + L 0 x m x 0 ) x m + 1 y m + 1 1 α ( 1 + L 0 x m x 0 ) y m x m | α | L 2 ( t m + 1 t m ) 2 + ( 1 + L 0 t m ) ( t m + 1 s m ) + 1 1 α ( 1 + L 0 t m ) ( s m t m ) .
It them follows from (3), (4), (23) for v = x m + 1 , and (26) that
y m + 1 x m + 1 F ( x m + 1 ) 1 F ( x 0 ) | α | F ( x 0 ) 1 F ( x m + 1 ) s m + 1 t m + 1 ,
where we also used. The following have also be used
x m + 1 x 0 x m + 1 y m + y m x 0 t m + 1 s m + s m t 0 = t m + 1 < t *
so x m + 1 U ( x 0 , t * ) . Notice also that
y m + 1 x 0 y m + 1 x m + 1 + x m + 1 x 0 s m + 1 t m + 1 + t m + 1 t 0 = s m + 1 < t * ,
so y m + 1 U ( x 0 , t * ) .
The induction for (21) and (22) is completed. It follows that sequence { x k } is Cauchy in a Banach space X and, as such, it converges to some x * U [ x 0 , t * ] (since U [ x 0 , t * ] is a closed set).
By letting m in (26) and using the continuity of F we conclude F ( x * ) = 0 .
The parameters 1 L 0 or μ 1 δ given in closed form can replace t * in Theorem 1.
A uniqueness of the solution result follows next.
Proposition 1.
Assume:
(i) 
The point x * is a solution of equation F ( x ) = 0 in D;
(ii) 
Condition (A2) holds.
Then, the only solution of Equation (1) in the region D 0 is x * .
Proof. 
Let y D with F ( y ) = 0 . Set M = 0 1 F ( y + θ ( x * y ) ) d θ . Then, in view of (A2) one obtains
F ( x 0 ) 1 ( M F ( x 0 ) ) L 0 2 x * x 0 + y x 0 < L 0 2 2 L 0 = 1 ,
so y = x * is obtained from the invertibility of M and 0 = F ( y ) F ( x * ) = M ( y x * ) . □

4. Numerical Example

Let us consider the nonlinear equation
F ( x ) = x 3 q = 0 ,
where a function F is defined on D = U ( x 0 , 1 q ) and q ( 0 , 1 ) . Let x 0 = 1 . Then, we obtain
μ 0 = 1 q 3 , L 0 = 3 q , L = 2 min 2 q , 1 + 1 L 0 .
If we choose q = 0.85 then
x * = q 3 0.947268237185910 , D = D 0 = ( 0.85 , 1.15 ) , μ 0 = 0.05 , L 0 = 2.15 , L = 2.3 .
Now, verify conditions of Lemma 1 and Theorem 1 for α = 1 , β = γ = 0.5 . Majorizing sequences
t k = { 0 , 0.05305039787798409 , 0.06021265690968219 , 0.06036488186993019 , 0.06036495221495131 , 0.06036495221496634 } , s k = { 0.05 , 0.06014668276179737 , 0.06036485126494786 , 0.06036495221494478 , 0.06036495221496634 , 0.06036495221496634 }
converge to t * < 1 L 0 . Moreover, condition (5) holds for each k.
Table 1 gives error estimates (21) and (22). The solution x * is obtained at three iterations for ε = 10 10 . Therefore, conditions of Theorem 1 are satisfied and { x k } converge to x * U [ x 0 , t * ] .

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

  1. Argyros, I.K. Unified Convergence Criteria for Iterative Banach Space Valued Methods with Applications. Mathematics 2021, 9, 1942. [Google Scholar] [CrossRef]
  2. Ortega, J.M.; Rheinboldt, W.C. Iterative Solution of Nonlinear Equations in Several Variables; Academic Press: New York, USA, 1970. [Google Scholar]
  3. 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]
  4. Argyros, I.K.; Shakhno, S.; Yarmola, H. Two-step solver for nonlinear equations. Symmetry 2019, 11, 128. [Google Scholar] [CrossRef] [Green Version]
  5. 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]
  6. Jarratt, P. Some fourth order multipoint iterative methods for solving equations. Math. Comput. 1966, 20, 434–437. [Google Scholar] [CrossRef]
  7. 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]
  8. Magreñán, A.A.; Argyros, I.K. Two step Newton methods. J. Complex. 2014, 30, 533–553. [Google Scholar] [CrossRef]
  9. Ostrowski, A.M. Solution of Equations and Systems of Equations; Prentice-Hall: Englewood Cliffs, NJ, USA, 1964. [Google Scholar]
  10. 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]
  11. Sharma, J.R.; Arora, H. Efficient Jarratt-like methods for solving systems of nonlinear equations. Calcolo 2014, 51, 193–210. [Google Scholar] [CrossRef]
  12. Traub, J.F. Iterative Methods for the Solution of Equations; Chelsea Publishing Company: New York, NY, USA, 1982. [Google Scholar]
  13. Kantorovich, L.V.; Akilov, G.P. Functional Analysis; Pergamon Press: Oxford, UK, 1982. [Google Scholar]
Table 1. Error estimates.
Table 1. Error estimates.
k x k + 1 | y k x k | s k t k | x k + 1 y k | t k + 1 s k
00.9474375821287785.0000 × 10 2 5.0000 × 10 2 2.5624 × 10 3 3.0504 × 10 3
10.9472682371922211.6931 × 10 4 7.0963 × 10 3 3.0261 × 10 8 6.5974 × 10 5
20.9472682371859106.3117 × 10 12 1.5219 × 10 4 03.0605 × 10 8
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Argyros, C.I.; Argyros, I.K.; Shakhno, S.; Yarmola, H. On the Semi-Local Convergence of a Jarratt-Type Family Schemes for Solving Equations. Foundations 2022, 2, 234-241. https://doi.org/10.3390/foundations2010017

AMA Style

Argyros CI, Argyros IK, Shakhno S, Yarmola H. On the Semi-Local Convergence of a Jarratt-Type Family Schemes for Solving Equations. Foundations. 2022; 2(1):234-241. https://doi.org/10.3390/foundations2010017

Chicago/Turabian Style

Argyros, Christopher I., Ioannis K. Argyros, Stepan Shakhno, and Halyna Yarmola. 2022. "On the Semi-Local Convergence of a Jarratt-Type Family Schemes for Solving Equations" Foundations 2, no. 1: 234-241. https://doi.org/10.3390/foundations2010017

APA Style

Argyros, C. I., Argyros, I. K., Shakhno, S., & Yarmola, H. (2022). On the Semi-Local Convergence of a Jarratt-Type Family Schemes for Solving Equations. Foundations, 2(1), 234-241. https://doi.org/10.3390/foundations2010017

Article Metrics

Back to TopTop