Next Article in Journal
An Extended log-Lindley-G Family: Properties and Experiments in Repairable Data
Next Article in Special Issue
Explicit Stable Finite Difference Methods for Diffusion-Reaction Type Equations
Previous Article in Journal
A Comparison of Two-Stage Least Squares (TSLS) and Ordinary Least Squares (OLS) in Estimating the Structural Relationship between After-School Exercise and Academic Performance
Previous Article in Special Issue
A Note on Traub’s Method for Systems of Nonlinear Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Convergence Criteria of Three Step Schemes for Solving Equations

by
Samundra Regmi
1,
Christopher I. Argyros
2,
Ioannis K. Argyros
3,* and
Santhosh George
4
1
Learning Commons, University of North Texas at Dallas, Dallas, TX 75201, USA
2
Department of Computing and Technology, Cameron University, Lawton, OK 73505, USA
3
Department of Mathematical Sciences, Cameron University, Lawton, OK 73505, USA
4
Department of Mathematical and Computational Sciences, National Institute of Technology Karnataka, Mangalore 575 025, India
*
Author to whom correspondence should be addressed.
Mathematics 2021, 9(23), 3106; https://doi.org/10.3390/math9233106
Submission received: 3 November 2021 / Revised: 25 November 2021 / Accepted: 29 November 2021 / Published: 2 December 2021
(This article belongs to the Special Issue Application of Iterative Methods for Solving Nonlinear Equations)

Abstract

:
We develop a unified convergence analysis of three-step iterative schemes for solving nonlinear Banach space valued equations. The local convergence order has been shown before to be five on the finite dimensional Euclidean space assuming Taylor expansions and the existence of the sixth derivative not on these schemes. So, the usage of them is restricted six or higher differentiable mappings. But in our paper only the first Frèchet derivative is utilized to show convergence. Consequently, the scheme is expanded. Numerical applications are also given to test convergence.

1. Introduction

We study the problem of finding a simple solution x * of
F ( x ) = 0 ,
provided F : D E E 1 is an operator acting between Banach spaces E and E 1 with D . Since a closed form solution is not possible in general, iterative schemes are used for solving (1). Many iterative schemes are studied for approximating x * . In this paper, we consider the iterative schemes, developed for each n = 0 , 1 , 2 , , as
y n = x n F ( x n ) 1 F ( x n ) z n = y n A n F ( x n ) 1 F ( y n ) x n + 1 = z n B n F ( x n ) 1 F ( z n ) ,
where A n = A ( x n , y n ) , A : D × D L ( E , E 1 ) , A 1 L ( E 1 , B ) , B n = B ( x n , y n ) , B : D × D L ( E , E 1 ) and B 1 L ( E 1 , E ) .
A plethora of schemes are special cases of (2).
Newton’s Scheme [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23]: Set A n = B n = O to obtain
y n = x n F ( x n ) 1 F ( x n ) .
This scheme is of order two.
Traub’s Scheme [21,24,25,26,27,28,29,30]: Set A n = B n = I to obtain
y n = x n F ( x n ) 1 F ( x n ) z n = y n F ( x n ) 1 F ( y n ) x n + 1 = z n F ( x n ) 1 F ( z n ) .
This scheme is of order five.
Ostrowski Scheme [20]: Set A n = ( 2 [ y n , x n ; F ] F ( x n ) ) F ( x n ) and B n = O to obtain
y n = x n F ( x n ) 1 F ( x n ) x n + 1 = y n ( 2 [ y n , x n ; F ] F ( x n ) ) 1 F ( y n ) .
This scheme is of order four.
Ostrowski-Type Scheme [20]: Set A n = ( [ y n , x n ; F ] 1 F ( x n ) 1 ) F ( x n ) and B n = O to obtain
y n = x n F ( x n ) 1 F ( x n ) x n + 1 = y n ( [ y n , x n ; F ] 1 F ( x n ) 1 ) F ( y n ) .
This scheme is of order four.
Traub, Newton-type, Runge–Kutta and other three step schemes can be seen as special cases of (2) [7,14,20,30]. The local convergence of these schemes and their stability has been given in the aforementioned references using derivatives of order one more than the convergence order. As an example, the existence of the fifth derivative is required for the convergence of the Ostrowski scheme. Notice that convergence can be obtained without the fifth derivative, which does not appear on the scheme. Clearly there is a need to study the convergence of these schemes using a uniform set of criteria. That is why we developed scheme (2).
Let E = E 1 = R , D = [ 0.5 , 1.5 ] . Consider λ on D by
λ ( x ) = x 3 log x 2 + x 5 x 4 i f x 0 0 i f x = 0 .
Then, we get x * = 1 , and
λ ( x ) = 6 log x 2 + 60 x 2 24 x + 22 .
But, λ ( x ) is unbounded on D . So, the convergence of scheme (2) is not assured by the previous analyses. In order to extend the utilization of these schemes, we study the local convergence of scheme (2): in a Banach space, under generalized continuity conditions and using hypotheses only on the operators appearing on these schemes. Notice also that the convergence of most high convergence order schemes was given only on the finite dimensional Euclidean space with no error bounds on x n x * or information about the uniqueness of the solution. However, we give such results in this paper. Moreover, we present the semi-local convergence of these schemes not given before using majorizing sequences. The technique can apply on other single, multipoint, and multistep schemes along the same lines, since it is so general [8,9,16,27,28,29].
In Section 2, Section 3 and Section 4, we present results on majorizing sequences, semi-local and local convergence, respectively. The applications are conclusions can be found in Section 4 and Section 5, respectively.
The analysis is provided in the next three sections followed by the examples and conclusions in the last two sections.

2. Convergence for Majorizing Sequence

We shall use the following definition of a majorizing sequence.
Definition 1.
Let { v ¯ n } be a sequence in E . Then, a sequence { v n } majorizes { v ¯ n } if
v ¯ n + 1 v ¯ n v n + 1 v n for each n = 0 , 1 , 2 , .
In this case, the study of the convergence for sequence { v ¯ n } reduces to that of { v n } [21].
Next, we shall define sequences to be shown to be majorizing for scheme (2). Set T = [ 0 , ) .
Let a : T × T T , a ¯ : T × T T , b : T × T × T T and c : T × T × T × T T be continuous and nondecreasing functions. We denote a ( n ) = a n , b ( n ) = b n and c ( n ) = c n . Let ψ 0 : T T and ψ : T 0 T T be continuous and nondecreasing functions for some subset T 0 of T . Let also η 0 . Define scalar sequences { t n } , { s n } , { u n } by
t 0 = 0 , t 1 = η , u n = s n + a ¯ n ( s n t n ) , t n + 1 = u n + b n ( u n s n ) ,
s n + 1 = t n + 1 + c n ( t n + 1 u n ) 1 ψ 0 ( t n + 1 ) ,
where ψ ¯ = ψ 0 , n = 0 ψ , n = 1 , 2 , .
Next, we present two general results on the convergence of majorant sequence (3).
Lemma 1.
Suppose that there exists d > 0 such that for each n = 0 , 1 , 2 ,
t n d
and
ψ 0 ( d ) < 1 .
Then, sequences { t n } , { s n } , { u n } converge to their unique least upper bound t * [ 0 , d ] .
Proof. 
By the definition of these sequences, it follows that they are nondecreasing bounded from above by d , with t k s k u k t k + 1 , and as such they converge to t * .  □
Lemma 2.
If function ψ 0 is increasing, then conditions (5) and (6) can be replaced by
t n ψ 0 1 ( 1 ) .
Proof. 
Set d = ψ 0 1 ( 1 ) in Lemma 1. □
Remark 1.
Convergence criteria (5)–(7) can be verified only in some special cases, since they are very general. That is why we also provide stronger conditions, but easier to be verify.
Define functions f i , i = 1 , 2 , 3 on the interval [ 0 , 1 ) by
f 1 ( t ) = a ( t ) 0 1 ψ ( θ t 2 η ) d θ t
f 2 ( t ) = b ( t ) t ,
and
f 3 ( t ) = c ( t ) + t ψ 0 ( η 1 t ) t .
Suppose that these functions have smallest zeros μ i ( 0 , 1 ) , respectively. Set
μ = min { μ i } and μ 0 = max { a ¯ 0 , b 0 , c 0 1 ψ 0 ( t 1 ) } .
Then, we can show the third convergence result.
Lemma 3.
Suppose that
0 μ 0 μ .
Then, sequences { t n } , { s n } , { u n } are bounded from above by t * * = η 1 μ , nondecreasing and converge to t * [ η , t * * ] , so that
0 s n t n μ ( t n s n 1 ) μ 2 n η ,
0 u n s n μ ( s n t n ) μ 2 n + 1 η ,
0 t n + 1 u n μ ( u n s n ) μ 2 n + 2 η ,
and
0 t n + 1 1 μ 2 n + 3 1 μ η .
Proof. 
Items (10)–(12) hold, provided
0 a ¯ k μ ,
0 b k μ ,
and
0 c k 1 ψ 0 ( t k + 1 ) μ
for each k = 0 , 1 , 2 , . However, these items are true for k = 0 , by (9). Let us suppose that (14)–(16) are true for k = 0 , 1 , 2 , , n . By induction hypotheses (10)–(12), we get
t k + 1 u k + μ 2 k + 2 η s k + μ 2 k + 1 η + μ 2 k + 2 η t k + μ 2 k η + μ 2 k + 1 η + μ 2 k + 2 η η + μ η + + μ 2 k + 2 η . = 1 μ 2 k + 3 1 μ η η 1 μ = t * * .
Then, (14)–(16) shall be true if
f i ( μ i ) 0 ,
which are true by the definition of f i . So, we deduce lim k t k = lim k s k = lim k u k = t * .  □

3. Semi-Local Convergence

We shall use some functions and parameters.
Suppose that there exists function ψ 0 : T T continuous and nondecreasing such that ψ 0 ( t ) 1 = 0 has a minimal solution ρ T { 0 } . Set T 0 = [ 0 , ρ ) . Suppose function ψ : T 0 T is continuous and nondecreasing.
The following conditions (A) shall be used.
Suppose:
(A1)
There exists x 0 D , η 0 such that F ( x 0 ) 1 L ( E 1 , E ) and
F ( x 0 ) 1 F ( x 0 ) η .
(A2)
For each y D
F ( x 0 ) 1 ( F ( y ) F ( x 0 ) ) ψ 0 ( y x 0 ) .
Set D 0 = B [ x 0 , s ] D , where B ( x 0 , s ) = { y E : y x 0 < s } and B [ x 0 , s ] is the closure of B ( x 0 , s ) .
(A3)
F ( x 0 ) 1 ( F ( w ) F ( w 1 ) ) ψ ( w w 1 ) for all w 1 , w D 0 .
(A4)
For each n = 0 , 1 , 2 ,
A n F ( x n ) 1 F ( x 0 ) = a ¯ n a n a ,
B n F ( x n ) 1 0 1 ( F ( y n + θ ( z n y n ) ) F ( x n ) A n 1 ) d θ = b ¯ n b n b ,
F ( x 0 ) 1 0 1 ( F ( z n + θ ( x n + 1 z n ) ) F ( x n ) B n 1 ) d θ = c ¯ n c n c .
(A5)
Conditions of Lemma 1 or Lemma 2 or Lemma 3 hold.
and
(A6)
B [ x 0 , t * ] D (or B [ x 0 , t * * ] D ).
The semi-local convergence of scheme (2) is shown next.
Theorem 1.
Suppose conditions (A) hold. Then, sequences { x n } , { y n } , { z n } generated by scheme (2) are well defined in B [ x 0 , t * ] , stays in B [ x 0 , t * ] for each n = 0 , 1 , 2 , and converge to a solution x * B [ x 0 , t * ] of equation F ( x ) = 0 , so that for each n = 0 , 1 , 2 ,
x n x * t * t n .
Proof. 
We shall prove assertions
( I k ) y k x k s k t k
( I I k ) z k y k u k s k
( I I I k ) x k + 1 z k t k + 1 u k using mathematical induction on k . By scheme (2) for n = 0 and (A1), we have
y 0 x 0 = F ( x 0 ) 1 F ( x 0 ) η = s 0 t 0 t * ,
so y 0 B [ x 0 , t * ] and ( I 0 ) holds. By (A3), (A4) and the second substep of scheme (2), we have
z k y k = A k F ( x k ) 1 ( F ( y k ) F ( x k ) F ( x k ) ( y k x k ) ) A k F ( x k ) 1 F ( x 0 ) ×   0 1 F ( x 0 ) 1 ( F ( x k + θ ( y k x k ) ) F ( x k ) ) d θ y k x k A k F ( x k ) 1 F ( x 0 ) 0 1 ψ ¯ ( θ y k x k ) d θ y k x k A k F ( x k ) 1 F ( x 0 ) 0 1 ψ ¯ ( θ ( s k t k ) ) d θ ( s k t k ) = u k s k ,
showing ( I I k ). Similarly by the second substep of scheme (2), we obtain in turn
x k + 1 z k = B k F ( x k ) 1 F ( z k ) B k F ( x k ) 1 0 1 ( F ( y k + θ ( z k y k ) ) F ( x k ) A k 1 ) d θ z k y k = b ¯ k z k y k b k u k s k ) = t k + 1 u k ,
and
y k x k F ( x k ) 1 F ( x 0 ) F ( x 0 ) 1 F ( x k ) 0 1 F ( x 0 ) 1 ( F ( z k 1 + θ ( x k z k 1 ) ) F ( x k 1 ) B k 1 1 ) d θ 1 ψ 0 ( x k x 0 ) x k z k 1 = c ¯ k x k z k 1 1 ψ 0 ( x k x 0 ) c k ( t k u k 1 ) 1 ψ 0 ( t k ) = s k t k ,
showing ( I k ) and ( I I I k ), where we also used
F ( x k ) = F ( x k ) F ( z k 1 ) + F ( z k 1 ) = F ( x k ) F ( z k 1 ) F ( x k 1 ) B k 1 1 ( x k z k 1 ) ,
(by the third substep of scheme (2))
F ( z k ) = F ( z k ) F ( y k ) + F ( y k ) = F ( z k ) F ( y k ) F ( x k ) A k 1 ( z k y k ) ,
(by the second substep of scheme (2)),
F ( x 0 ) 1 ( F ( x k ) F ( x 0 ) ) ψ 0 ( x k x 0 ) ψ 0 ( t * ) < 1 ,
so
F ( x k ) 1 F ( x 0 ) 1 1 ψ 0 ( x k x 0 )
by the Banach lemma on invertible operators [17,20]. Suppose ( I k ), ( I I K ), ( I I I K ) hold, y k , z k , x k + 1 B [ x 0 , t * ] . Then, by repeating these calculations with x k + 1 , y k + 1 , z k + 1 , x k + 2 replacing x k , y k , z k , x k + 1 , respectively, we complete the induction. Therefore, sequence { x k } is fundamental in a Banach space E so lim k x k = x * for some x * B [ x 0 , t * ] . If k then by the estimate
F ( x 0 ) 1 F ( x k ) c k ( t k + 1 u k ) c ( t k + 1 u k ) 0 ,
and using the continuity of F, we get F ( x * ) = 0 .  □
Next, the uniqueness result of x * is discussed.
Proposition 1.
Suppose
(a) Point x * solves the equation F ( x ) = 0 .
(b) There exists s ¯ t * such that
0 1 ψ 0 ( ( 1 θ ) s ¯ + θ t * ) d θ < 1 .
Set D 1 = B [ x 0 , s ¯ ] D . Then, x * is unique in D 1 .
Proof. 
Consider x ¯ D 1 satisfying F ( x ¯ ) = 0 . Define M 0 = 0 1 F ( x * + θ ( x ¯ x * ) ) d θ . It then follows from (A1) and (18) that
F ( x 0 ) 1 ( M 0 F ( x 0 ) ) 0 1 ψ 0 ( ( 1 θ ) x ¯ x 0 + θ x * x 0 ) d θ 0 1 ψ 0 ( ( 1 θ ) s ¯ + θ t * ) d θ < 1 ,
so x ¯ = x * follows from M 0 1 L ( E 1 , E ) and the approximation M 0 ( x ¯ x * ) = F ( x ¯ ) F ( x * ) = 0 0 = 0 .  □
Remark 2.
We want to see how developed sequences are defined in some interesting cases. Runge–Kutta and other high convergence schemes can also be studied under this technique by also specializing the operators A n and B n . Let us choose A n = B n = I . That is, we consider Traub’s scheme. Then, we have in turn
a ¯ n = A n F ( x n ) 1 F ( x 0 ) = F ( x n ) 1 F ( x 0 ) 1 1 ψ 0 ( x n x 0 ) 1 1 ψ 0 ( t n ) = : a n , b ¯ n = F ( x n ) 1 ( 0 1 ( F ( y n + θ ( z n y n ) ) F ( z n ) ) d θ + ( F ( z n ) F ( x n ) ) 0 1 ψ ( ( 1 θ ) z n y n ) ) d θ + ψ ( θ z n x n ) 1 ψ 0 ( x n x 0 ) 0 1 ψ ( ( 1 θ ) ( u n s n ) ) d θ + ψ ( u n t n ) 1 ψ 0 ( t n ) = : b n ,
c ¯ n = F ( x 0 ) 1 ( 0 1 ( F ( z n 1 + θ ( x n z n 1 ) ) F ( x n ) ) d θ + ( F ( x n ) F ( x n 1 ) ) 0 1 ψ ( ( 1 θ ) x n z n 1 ) ) d θ + ψ ( x n x n 1 ) 1 ψ 0 ( x n 1 x 0 ) 0 1 ψ ( ( 1 θ ) ( t n u n 1 ) ) d θ + ψ ( t n t n 1 ) 1 ψ 0 ( t n 1 ) = : c n 1 .
Under these choices, we shall present another result on majorizing sequences using our idea of recurrent functions, which is weaker than that of Lemma 3. We have in this case
a ¯ n = 0 1 ψ ¯ ( ( 1 θ ) ( s n t n ) ) d θ 1 ψ 0 ( t n ) ,
b n = 0 1 ψ ( ( 1 θ ) ( u n s n ) ) d θ + ψ ( ( u n s n ) + ( s n t n ) ) 1 ψ 0 ( t n )
and
c n 1 ψ 0 ( t n + 1 ) = 0 1 ψ ( ( 1 θ ) ( t n + 1 u n ) ) d θ + ψ ( ( t n + 1 u n ) + ( u n s n ) + ( s n t n ) ) 1 ψ 0 ( t n + 1 ) .
Let us consider the interesting case when ψ 0 ( t ) = L 0 t and ψ ( t ) = L t .
Define sequences of functions { h n ( j ) } , j = 1 , 2 , 3 on the interval [ 0 , 1 ) by
h n ( 1 ) = L 2 t 2 n 1 η + L 0 ( 1 + t + + t 2 n ) η 1 , h n ( 2 ) ( t ) = L 2 t 2 n η + L ( t 2 n + t 2 n 1 ) η + L 0 ( 1 + t + + t 2 n ) η 1 , h n ( 3 ) = L 2 t 2 n + 1 η + L ( t 2 n + 1 + t 2 n + t 2 n 1 ) η + L 0 ( 1 + t + + t 2 n ) η 1 , g 1 ( t ) = L 0 t 3 + ( L 0 + L 2 ) t 2 L 2 , g 2 ( t ) = ( 3 L 2 + L 0 ) t 3 + ( L 0 + L ) t 2 3 2 L t L , g 3 ( t ) = L 0 t 5 + ( 3 L 2 + L 0 ) t 4 + L t 3 L 2 t 2 L t L , h ( 1 ) ( t ) = h ( 2 ) ( t ) = h ( 3 ) ( t ) = L η 1 t 1 .
Notice that g 1 ( 0 ) = L 2 , g 2 ( 0 ) = g 3 ( 0 ) = L , g 1 ( 1 ) = g 2 ( 1 ) = g 3 ( 1 ) = 2 L 0 . It then follows (by the intermediate value theorem) that polynomial g j have zeros in ( 0 , 1 ) . Call by ρ j the minimal such zeros, respectively. Set ρ = min { ρ j } .
Next, we show another result on majorizing sequences for scheme (2).
Lemma 4.
Suppose that
μ 0 ρ < 1 L 0 η .
Then, the conclusions of Lemma 3 hold for sequences { s n } , { t n } , { u n } with ρ replacing μ .
Proof. 
We shall show this time
0 a ¯ k ρ ,
0 b k ρ ,
0 c k 1 L 0 t k + 1 ρ
and
t k s k u k t k + 1 .
These assertions hold for k = 0 by (48) and the definition of these sequences (see Remark 2). Then, as in Lemma 3, we can show instead of (20) that
L 2 ρ 2 k 1 η + L 0 ( 1 + ρ + + ρ 2 k ) η 1 0 .
This estimate motivates us to define recurrent functions h k ( 1 ) and show instead
h k ( 1 ) ( ρ ) 0 .
We need a relationship between two consecutive functions h K ( 1 ) . Then, we can write
h k + 1 ( 1 ) = L 2 t 2 k + 1 η + L 0 ( 1 + t + + t 2 k + 2 ) η 1 L 2 t 2 k 1 L 0 ( 1 + t + + t 2 k ) η + 1 + h k ( 1 ) ( t ) = h k ( 1 ) ( t ) + g 1 ( t ) t 2 k 1 η .
In particular, we have
h k + 1 ( 1 ) ( ρ 1 ) = h k ( ρ 1 )
by the definition of ρ 1 . Define also function h ( 1 ) ( t ) = lim k h k ( 1 ) ( t ) . Then, we have
h ( 1 ) ( t ) = L 0 η 1 t 1 .
Hence, we can show instead of (20) that
h ( 1 ) ( ρ 1 ) 0 ,
which is true by (48). The induction for (20) is completed. Moreover, similarly instead of (21) we can show that
L 2 ρ 2 k η + L ( ρ 2 k + ρ 2 k 1 ) η + L 0 ( 1 + ρ + + ρ 2 k ) η 1 0
or
h k ( 2 ) ( ρ ) 0 .
Then, again we have
h k + 1 ( 2 ) = L 2 t 2 k + 2 η + L ( t 2 k + 2 + t 2 k + 1 ) η + L 0 ( 1 + t + + t 2 k + 2 ) η 1 L 2 t 2 k η L 2 t 2 k η L ( t 2 k + t 2 k 1 ) η L 0 ( 1 + t + + t 2 k ) η + 1 + h k ( 2 ) ( t ) = h k ( 2 ) ( t ) + g 2 ( t ) t 2 k 1 η .
We have in particular
h k + 1 ( 2 ) ( ρ 2 ) = h k ( 2 ) ( ρ 2 ) .
Define function h ( 2 ) ( t ) = lim k h k ( 2 ) ( t ) . Then, we have
h ( 2 ) ( t ) = h ( 1 ) ( t ) .
Hence, we can show instead of (30) that h ( 2 ) ( ρ 2 ) 0 , which is true by (48). Furthermore, (22) holds if we show instead
L 2 ρ 2 k + 1 η + L ( ρ 2 k + 1 + ρ 2 k + ρ 2 k 1 ) η + L 0 ( 1 + ρ + + ρ 2 k + 2 ) η 1 0
or
h k ( 3 ) ( ρ ) 0 .
However, we get
h k + 1 ( 3 ) = L 2 t 2 k + 3 η + L ( t 2 k + 3 + t 2 k + 2 + t 2 k + 1 ) η + L 0 ( 1 + t + + t 2 k + 4 ) η 1 L 2 t 2 k + 1 η L ( t 2 k + 1 + t 2 k + t 2 k 1 ) η L 0 ( 1 + t + + t 2 k + 2 ) η + 1 + h k ( 3 ) ( t ) = h k ( 3 ) ( t ) + g 3 ( t ) t 2 k 1 η .
In particular, we have
h k + 1 ( 3 ) ( ρ 3 ) = h k ( 3 ) ( ρ 3 ) .
Defined function h ( 3 ) ( t ) = lim k h k ( 3 ) ( t ) . Then, we also get
h ( 3 ) ( t ) = h ( 1 ) ( t ) .
Hence, (33) holds if h ( 3 ) ( ρ 3 ) 0 . However, this is true by (48). Therefore, the induction is terminated for (20)–(23). The rest is as in the proof of Lemma 1. □

4. Local Convergence

We shall introduce real parameter and functions to be used in the convergence analysis. Set M = [ 0 , ) .
Suppose
(i)
φ 0 ( t ) 1 has a minimal zero R 0 M { 0 } , where φ 0 : M M is some continuous and nondecreasing function. Let M 0 = [ 0 , R 0 ) .
(ii)
φ 1 ( t ) 1 has a minimal zero R 1 M 0 { 0 } , where function φ : M 0 M is continuous and nondecreasing and φ 1 : M 0 M is defined by
φ 1 ( t ) = 0 1 φ ( ( 1 θ ) t ) d θ 1 φ 0 ( t ) .
(iii)
φ 0 ( φ 1 ( t ) t ) 1 has a minimal zero R ¯ 1 M 0 { 0 } . Let R ¯ 2 = min { R 0 , R ¯ 1 } and M 1 = [ 0 , R ¯ 2 ) .
(iv)
φ 2 ( t ) has a smallest zero R 2 M 1 { 0 } , where
φ 2 ( t ) = φ 1 ( φ 1 ( t ) t ) + ( φ 0 ( t ) + h ( t , φ 1 ( t ) t ) ) 0 1 ω ( θ φ 1 ( t ) t ) d θ ( 1 φ 0 ( t ) ) ( 1 φ 0 ( φ 1 ( t ) t ) ) φ 1 ( t ) ,
with functions ω : M 1 M and h : M × M 1 M are continuous and nondecreasing.
(v)
φ 3 ( t ) 1 has a smallest zero R 3 M 1 { 0 } where
φ 3 ( t ) = φ 1 ( φ 2 ( t ) t ) + ( φ 0 ( t ) + h 1 ( t , φ 1 ( t ) t , φ 2 ( t ) t ) ) 0 1 ω ( θ φ 2 ( t ) t ) d θ ( 1 φ 0 ( t ) ) ( 1 φ 0 ( φ 2 ( t ) t ) ) φ 2 ( t ) ,
where h 1 : M × M 1 × M 1 M is nondecreasing and continuous. It shall be shown that
R = min { R i } , i = 1 , 2 , 3
is a convergence radius for scheme (2). Set M 2 = [ 0 , R ) . These definitions imply that for each t E 2
0 φ 0 ( t ) < 1 ,
0 φ 0 ( φ 1 ( t ) t ) < 1 ,
and
0 φ 1 ( t ) < 1 , i = 1 , 2 , 3 .
The conditions (H) shall be used.
Suppose
(H1)
For all w D
F ( x * ) 1 ( F ( w ) F ( x * ) ) φ 0 ( w x * ) .
Let D 0 = B ( x * , R 0 ) D .
(H2)
For all w , w 1 , z D 0
F ( x * ) 1 ( F ( w 1 ) F ( w ) ) φ ( w 1 w ) ,
F ( x * ) 1 F ( w ) ω ( w x * ) ,
F ( x * ) 1 ( F ( x * ) F ( w 1 ) A ( w , w 1 ) ) h ( w x * , w 1 x * )
and
F ( x * ) 1 ( F ( x * ) F ( z ) B ( w , w 1 ) ) h 1 ( w x * , w 1 x * , z x * )
(H3)
B [ x * , R ] D .
The local convergence of scheme (2) is given next based on the previous notation and conditions (H).
Theorem 2.
Suppose: x 0 B ( x * , R ) { x * } and conditions (H) hold. Then, we conclude lim n x n = lim n y n = lim n z n = x * .
Proof. 
Let v B ( x * , R ) { x * } . Using (17), (18) and (H1), we have
F ( x * ) 1 ( F ( v ) F ( x * ) ) φ 0 ( v x * ) φ 0 ( R ) < 1 ,
so
F ( v ) 1 F ( x * ) 1 1 φ 0 ( v x * ) .
In particular, iterate is well defined by (38) for v = x 0 and the first substep of scheme (2), from which we can also write
y 0 x * = x 0 x * F ( x 0 ) 1 F ( x 0 ) = ( F ( x 0 ) 1 F ( x * ) ) × 0 1 F ( x * ) 1 ( F ( x * + θ ( x 0 x * ) ) F ( x 0 ) ) d θ ( x 0 x * ) .
By (34), (37) (for i = 1 ), (38) (for v = x 0 ), (39) and (H2), we find in turn that
y 0 x * 0 1 φ ¯ ( ( 1 θ ) x 0 x * ) d θ x 0 x * 1 φ 0 ( x 0 x * ) φ 1 ( x 0 x * ) x 0 x * x 0 x * < R ,
so y 0 B ( x * , R ) , where φ ¯ = φ 0 , k = 0 φ , k = 1 , 2 , . We also have that (38) holds for v = y 0 , and iterate z 0 is well defined, from which we can write in turn that
z 0 x * = y 0 x * F ( y 0 ) 1 F ( y 0 ) + ( F ( y 0 ) 1 A 0 F ( x 0 ) 1 ) F ( y 0 ) = y 0 x * F ( y 0 ) 1 F ( y 0 ) + F ( y 0 ) 1 ( F ( x 0 ) F ( y 0 ) A 0 ) F ( x 0 ) 1 F ( y 0 ) .
In view of (34), (37) (for i = 2 ), (38) (for v = x 0 , y 0 ), (40), (41) and (H2), we obtain in turn
z 0 x * [ φ 1 ( φ 1 ( x 0 x * ) x 0 x * ) + ( φ 0 ( x 0 x * ) + h ( x 0 x * , y 0 x * ) ) 0 1 ω ( θ y 0 x * ) d θ ( 1 φ 0 ( y 0 x * ) ) ( 1 φ 0 ( x 0 x * ) ) y 0 x * φ 2 ( x 0 x * ) x 0 x * x 0 x * < R ,
so z 0 B ( x * , R ) . Similarly, but using the third substep of scheme (2), we can write
x 1 x * = z 0 x * F ( z 0 ) 1 F ( z 0 ) + ( F ( z 0 ) 1 B 0 F ( x 0 ) 1 ) F ( z 0 ) = z 0 x * F ( z 0 ) 1 F ( z 0 ) + ( F ( z 0 ) 1 B 0 F ( x 0 ) 1 ) F ( z 0 ) = z 0 x * F ( z 0 ) 1 F ( z 0 ) + F ( z 0 ) 1 ( ( F ( x 0 ) F ( x * ) ) + ( F ( x * ) F ( z 0 ) B 0 ) ) F ( x 0 ) 1 F ( z 0 ) ,
so
x 1 x * [ φ 1 ( φ 2 ( x 0 x * ) x 0 x * ) + H ( 1 φ 0 ( φ 2 ( x 0 x * ) x 0 x * ) ) ( 1 φ 0 ( x 0 x * ) ) ×   φ 2 ( x 0 x * ) φ 3 ( x 0 x * ) x 0 x * x 0 x * ,
for H = ( φ 0 ( x 0 x * ) + h 1 ( x 0 x * , φ 1 ( x 0 x * ) x 0 x * , φ 2 ( x 0 x * ) x 0 x * ) ) 0 1 ω ( θ φ 2 ( x 0 x * ) x 0 x * ) d θ . Simply, switch x 0 , y 0 , z 0 , x 1 by x k , y k , z k , x k + 1 , respectively, in the preceding calculations to get
y k x * φ 1 ( x k x * ) x k x * x k x * < R
z k x * φ 2 ( x k x * ) x k x * x k x * < R
and
x k + 1 x * φ 3 ( x k x * ) x k x * x k x * .
Then, from the estimation
x k + 1 x * d x k x * < R ,
where d = φ 3 ( x k x * ) , we get x k + 1 B ( x * , R ) and lim k x k = x * .  □
A uniqueness result is given next.
Proposition 2. 
Suppose:
(i) 
Point x * is a simple solution of equation F ( x ) = 0 .
(ii) 
0 1 φ 0 ( θ R * ) d θ < 1 , for some R * R .
Set D 1 = B [ x * , R * ] D . Then, x * is unique in D 1 .
Proof. 
Consider x ˜ D 1 with F ( x ˜ ) = 0 . Set S = 0 1 F ( x * + θ ( x ˜ x * ) ) d θ . Using (H1) and (47), we obtain
F ( x * ) 1 ( S F ( x * ) ) 0 1 φ 0 ( θ x ˜ x * ) d θ 0 1 φ 0 ( θ R * ) d θ < 1 ,
so x ˜ = x * follows by S 1 L ( E 1 , E ) and S ( x ˜ x * ) = F ( x ˜ ) F ( x * ) = 0 0 = 0 .  □

5. Numerical Experiments

We consider four examples with A n = B n = I (Multistep Newton method). Here, φ 0 ( t ) = a 0 t , φ ( t ) = a t , ω ( t ) = a 1 t and h ( t , t ) = h 1 ( t , t , t ) = φ 0 ( t ) .
Example 1.
Define function
q ( t ) = δ 0 t + δ 1 + δ 2 sin δ 3 t , t 0 = 0 ,
where δ j , j = 0 , 1 , 2 , 3 are numbers. Then, for δ 3 large and δ 2 small, a 0 a is arbitrarily small and a 0 a 0 .
Example 2.
If E = E 1 = C [ 0 , 1 ] ,   D = B [ 0 , 1 ] , consider Q : D E 1 given as
Q ( λ ) ( x ) = φ ( x ) 5 0 1 x θ λ ( θ ) 3 d θ .
We obtain
Q ( λ ( ξ ) ) ( x ) = ξ ( x ) 15 0 1 x θ λ ( θ ) 2 ξ ( θ ) d θ , for each ξ D ,
so for x * = 0 , we set a 0 = 7.5 , a = a 4 = K = 15 , a 1 = L 0 2 . Then, the radii:
r 1 = 0.066667 = r , r 2 = 0.109818 , and ρ R = 2 3 K = 0.0667 .
Example 3.
Consider the motion system
N 1 ( w 1 ) = e w 1 , N 2 ( w 2 ) = ( e 1 ) w 2 + 1 , N 3 ( w 3 ) = 1
with N 1 ( 0 ) = N 2 ( 0 ) = N 3 ( 0 ) = 0 . Let N = ( N 1 , N 2 , N 3 ) . Let E = E 1 = R 3 , D = B [ 0 , 1 ] , x * = ( 0 , 0 , 0 ) T . Let function N on D for w = ( w 1 , w 2 , w 3 ) T given as
N ( w ) = ( e w 1 1 , e 1 2 w 2 2 + w 2 , w 3 ) T .
Then, N is given as
N ( w ) = e x 0 0 0 ( e 1 ) w 2 + 1 0 0 0 1 .
Then, we can set a 0 = ( e 1 ) , a = e 1 e 1 = a 4 , a 1 = a 0 2 and K = e . Then, the radii:
r 1 = 0.382692 = r , r 2 = 0.417923 , and ρ R = 2 3 K = 0.2453 ,
where K is the Lipschitz constant in D given in [26,30].
Example 4.
Consider E , E 1 and D as in the second Example. Then, the (BVP) [13]
p ( 0 ) = 0 , p ( 1 ) = 1 ,
p = p σ p 2
can be also given as
p ( s ) = s + 0 1 G ( s , t ) ( p 3 ( t ) + σ p 2 ( t ) ) d t
where σ is a constant, Consider F : D V 2 as
[ F ( x ) ] ( s ) = x ( s ) s 0 1 G ( s , t ) ( x 3 ( t ) + σ x 2 ( t ) ) d t .
Let us set p 0 ( s ) = s and D = B ( p 0 , ρ 0 ) . Then, clearly B ( p 0 , ρ 0 ) B ( 0 , ρ 0 + 1 ) , since p 0 = 1 . Suppose 2 σ < 5 . Then, conditions (A) are satisfied for
a 0 = 2 σ + 3 ρ 0 + 6 8 , a = σ + 6 ρ 0 + 3 4 ,
a 1 = a 0 2 and μ = 1 + σ 5 2 σ . Notice that a 0 < a 1 .

6. Conclusions

We have provided a single sufficient criterion for the semi-local convergence of three step schemes. Upon specializing the parameters involved we show that although our majorizing sequence is more general than earlier ones: Convergence criteria are weaker (i.e., the utility of the schemes is extended); the upper error estimates are more accurate (i.e., at least as few iterates are required to achieve a predecided error tolerance) and we have an at least as large ball containing the solution. These benefits are obtained without additional hypotheses. According to our new technique we locate a more accurate domain than before containing the iterates resulting to more accurate (at least as small) Lipschitz condition.
Our theoretical results are further justified using numerical experiments. In the future we plan to extend these results by replacing the Lipschitz constants by generalized functions along the same lines.

Author Contributions

Conceptualization, S.R., C.I.A., I.K.A. and S.G.; software, S.R., C.I.A., I.K.A. and S.G.; validation, S.R., C.I.A., I.K.A. and S.G.; formal analysis, S.R., C.I.A., I.K.A. and S.G.; investigation, S.R., C.I.A., I.K.A. and S.G.; resources, S.R., C.I.A., I.K.A. and S.G.; data curation, S.R., C.I.A., I.K.A. and S.G.; writing—original draft preparation, S.R., C.I.A., I.K.A. and S.G.; writing—review and editing, S.R., C.I.A., I.K.A. and S.G.; visualization, S.R., C.I.A., I.K.A. and S.G.; supervision, S.R., C.I.A., I.K.A. and S.G.; project administration, S.R., C.I.A., I.K.A. and S.G.; funding acquisition, S.R., C.I.A., I.K.A. and S.G. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Argyros, I.K. On the Newton—Kantorovich hypothesis for solving equations. J. Comput. Math. 2004, 169, 315–332. [Google Scholar] [CrossRef] [Green Version]
  2. Argyros, I.K. Computational Theory of Iterative Schemes; Studies in Computational Mathematics Series, 15; Chui, C.K., Wuytack, L., Eds.; Elsevier Publ. Co.: New York, NY, USA, 2007. [Google Scholar]
  3. Argyros, I.K. Convergence and Applications of Newton-Type Iterations; Springer: Berlin, Germany, 2008. [Google Scholar]
  4. Argyros, I.K.; Hilout, S. Weaker conditions for the convergence of Newton’s scheme. J. Complex. 2012, 28, 364–387. [Google Scholar] [CrossRef] [Green Version]
  5. Argyros, I.K.; Hilout, S. On an improved convergence analysis of Newton’s scheme. Appl. Math. Comput. 2013, 225, 372–386. [Google Scholar]
  6. Argyros, I.K.; Magréñan, A.A. Iterative Schemes and Their Dynamics with Applications; CRC Press: New York, NY, USA, 2017. [Google Scholar]
  7. Argyros, I.K.; Magréñan, A.A. A Contemporary Study of Iterative Schemes; Elsevier: New York, NY, USA, 2018. [Google Scholar]
  8. Behl, R.; Maroju, P.; Martinez, E.; Singh, S. A study of the local convergence of a fifth order iterative scheme. Indian J. Pure Appl. Math. 2020, 51, 439–455. [Google Scholar]
  9. Cătinaş, E. The inexact, inexact perturbed, and quasi-Newton schemes are equivalent models. Math. Comput. 2005, 74, 291–301. [Google Scholar] [CrossRef]
  10. Chen, X.; Yamamoto, T. Convergence domains of certain iterative schemes for solving nonlinear equations. Numer. Funct. Anal. Optim. 1989, 10, 37–48. [Google Scholar] [CrossRef]
  11. Dennis, J.E., Jr.; Schnabel, R.B. Numerical Schemes for Unconstrained Optimization and Nonlinear Equations; SIAM: Philadelphia, PA, USA, 1996; First published by Prentice-Hall: Englewood Cliffs, NJ, USA, 1983. [Google Scholar]
  12. Deuflhard, P. Newton Schemes for Nonlinear Problems. Affine Invariance and Adaptive Algorithms; Springer Series in Computational Mathematics, 35; Springer: Berlin, Germany, 2004. [Google Scholar]
  13. Ezquerro, J.A.; Hernandez, M.A. Newton’s Scheme: An Updated Approach of Kantorovich’s Theory; Springer: Cham, Switzerland, 2018. [Google Scholar]
  14. Grau-Sánchez, M.; Grau, À.; Noguera, M. Ostrowski type schemes for solving systems of nonlinear equations. Appl. Math. Comput. 2011, 281, 2377–2385. [Google Scholar]
  15. Gutiérrez, J.M.; Magreñán, Á.A.; Romero, N. On the semilocal convergence of Newton-Kantorovich scheme under center-Lipschitz conditions. Appl. Math. Comput. 2013, 221, 79–88. [Google Scholar]
  16. Hernandez, M.A.; Romero, N. On a characterization of some Newton-like schemes of R- order at least three. J. Comput. Appl. Math. 2005, 183, 53–66. [Google Scholar] [CrossRef] [Green Version]
  17. Kantorovich, L.V.; Akilov, G.P. Functional Analysis; Pergamon Press: Oxford, UK, 1982. [Google Scholar]
  18. Magréñan, A.A.; Argyros, I.K.; Rainer, J.J.; Sicilia, J.A. Ball convergence of a sixth-order Newton-like scheme based on means under weak conditions. J. Math. Chem. 2018, 56, 2117–2131. [Google Scholar] [CrossRef]
  19. Nashed, M.Z.; Chen, X. Convergence of Newton-like schemes for singular operator equations using outer inverses. Numer. Math. 1993, 66, 235–257. [Google Scholar] [CrossRef]
  20. Ortega, J.M.; Rheinboldt, W.C. Iterative Solution of Nonlinear Equations in Several Variables; SIAM Publ.: Philadelphia, PA, USA, 2000; First published by Academic Press: New York, NY, USA; London, UK, 1997. [Google Scholar]
  21. Potra, F.A.; Pták, V. Nondiscrete Induction and Iterative Processes; Research Notes in Mathematics, 103; Pitman (Advanced Publishing Program): Boston, MA, USA, 1984. [Google Scholar]
  22. Verma, R. New Trends in Fractional Programming; Nova Science Publisher: New York, NY, USA, 2019. [Google Scholar]
  23. Zabrejko, P.P.; Nguen, D.F. The majorant scheme in the theory of Newton-Kantorovich approximations and the Pták error estimates. Numer. Funct. Anal. Optim. 1987, 9, 671–684. [Google Scholar] [CrossRef]
  24. Proinov, P.D. General local convergence theory for a class of iterative processes and its applications to Newton’s scheme. J. Complex. 2009, 25, 38–62. [Google Scholar] [CrossRef] [Green Version]
  25. Proinov, P.D. New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems. J. Complex. 2010, 26, 3–42. [Google Scholar] [CrossRef] [Green Version]
  26. Rheinboldt, W.C. An Adaptive Continuation Process of Solving Systems of Nonlinear Equations; Polish Academy of Science, Banach Center Publications; Institute of Mathematics Polish Academy of Sciences, Instytut Matematyczny Polskiej Akademii Nauk: Warszawa, Poland, 1978; Volume 3, pp. 129–142. Available online: https://eudml.org/doc/208686 (accessed on 28 November 2021).
  27. Shakhno, S.M.; Iakymchuk, R.P.; Yarmola, H.P. Convergence analysis of a two step scheme for the nonlinear squares problem with decomposition of operator. J. Numer. Appl. Math. 2018, 128, 82–95. [Google Scholar]
  28. Sharma, J.R.; Guha, R.K.; Sharma, R. An efficient fourth order weighted—Newton scheme for systems of nonlinear equations. Numer. Algorithms 2013, 62, 307–323. [Google Scholar] [CrossRef]
  29. Soleymani, F.; Lotfi, T.; Bakhtiari, P. A multi-step class of iterative schemes for nonlinear systems. Optim. Lett. 2014, 8, 1001–1015. [Google Scholar] [CrossRef]
  30. Traub, J.F.; Werschulz, A.G. Complexity and Information, Lezioni Lince; Lincei Lectures; Cambridge University Press: Cambridge, UK, 1998; pp. xii+139. ISBN 0-521-48506-1. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Regmi, S.; Argyros, C.I.; Argyros, I.K.; George, S. Convergence Criteria of Three Step Schemes for Solving Equations. Mathematics 2021, 9, 3106. https://doi.org/10.3390/math9233106

AMA Style

Regmi S, Argyros CI, Argyros IK, George S. Convergence Criteria of Three Step Schemes for Solving Equations. Mathematics. 2021; 9(23):3106. https://doi.org/10.3390/math9233106

Chicago/Turabian Style

Regmi, Samundra, Christopher I. Argyros, Ioannis K. Argyros, and Santhosh George. 2021. "Convergence Criteria of Three Step Schemes for Solving Equations" Mathematics 9, no. 23: 3106. https://doi.org/10.3390/math9233106

APA Style

Regmi, S., Argyros, C. I., Argyros, I. K., & George, S. (2021). Convergence Criteria of Three Step Schemes for Solving Equations. Mathematics, 9(23), 3106. https://doi.org/10.3390/math9233106

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop