Next Article in Journal
Comparative Performance of NIR-Hyperspectral Imaging Systems
Next Article in Special Issue
Approximating Solutions of Nonlinear Equations Using an Extended Traub Method
Previous Article in Journal / Special Issue
Extended Newton–Kantorovich Theorem for Solving Nonlinear Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On the Semi-Local Convergence of a Noor–Waseem-like Method for Nonlinear Equations

by
Ioannis K. Argyros
1,*,
Jai Prakash Jaiswal
2,
Akanksha Saxena
3 and
Michael I. Argyros
4
1
Department of Mathematical Sciences, Cameron University, Lawton, OK 73505, USA
2
Department of Mathematics, Guru Ghasidas Vishwavidyalaya (A Central University), Bilaspur 495009, India
3
Department of Mathematics, Maulana Azad National Institute of Technology, Bhopal 462003, India
4
Department of Computer Science, University of Oklahoma, Norman, OK 73019, USA
*
Author to whom correspondence should be addressed.
Foundations 2022, 2(2), 512-522; https://doi.org/10.3390/foundations2020034
Submission received: 13 April 2022 / Revised: 13 June 2022 / Accepted: 16 June 2022 / Published: 20 June 2022
(This article belongs to the Special Issue Iterative Methods with Applications in Mathematical Sciences)

Abstract

:
The significant feature of this paper is that the semi-local convergence of high order methods for solving nonlinear equations defined on abstract spaces has not been studied extensively as done for the local convergence by a plethora of authors which is certainly a more interesting case. A process is developed based on majorizing sequences and the notion of restricted Lipschitz condition to provide a semi-local convergence analysis for the third convergent order Noor–Waseem method. Due to the generality of our technique, it can be used on other high order methods. The convergence analysis is enhanced. Numerical applications complete are used to test the convergence criteria.

1. Introduction

In this article we are concerned with the task of finding a solution χ for the nonlinear equation
G ( x ) = 0 ,
where G : B T 1 T 2 is a differentiable nonlinear operator in the sense of Fréchet, T 1 and T 2 stand for Banach spaces and B is an open set. A plethora of applications from applied as well as theoretical disciplines can be reduced to determining the point χ B , but this task is very difficult in general. Moreover, the closed form of χ is hard to find unless in special cases. This forces researchers and practitioners to resort to iterative approximations to χ . A plethora of such approximations can be found in the literature [1,2,3,4,5]. Among those the most useful are the high convergence order ones. We noticed that many local convergence results exist for these methods relying Taylor expansions and derivatives of order at least one higher than the order of the method. As an example consider the third order Noor–Waseem method [6] defined by x 0 Ω ,
y t = x t [ G ( x t ) ] 1 G ( x t ) , x t + 1 = x t 4 [ A t ] 1 G ( x t ) , t = 0 , 1 , 2 , ,
where A t = 3 G 2 x t + y t 3 + G ( y t ) .
The existence of derivatives up to fourth order has been assumed although derivatives of order two and above do not appear on method. Moreover, method (2) may converge even if derivatives other than the first do not exist. Consider the academic and motivational example for T 1 = T 2 = and B = [ 0.5 , 1.5 ] by solving the nonlinear equation
φ ( u ) = 0 ,
where function φ is defined as
φ ( u ) = u 3 l o g ( u 2 ) + u 5 u 4 , if u 0 0 , if u = 0 .
Then, we see that χ = 1 B and the third derivative is
φ ( u ) = 6 l o g u 2 + 60 u 2 24 u + 22 .
Notice that the third derivative of function φ is unbounded on B. Therefore, convergence is not assured by the results in [6]. There are no uniqueness of χ results or error bounds on | | x t x | | , | | y t x t | | , | | x t + 1 y t | | that can be computed. The same observations can be made for the local results of other methods [4,6,7,8,9]. Hence, there is a need to develop results using conditions only on the first derivative that appears on these methods. These results should also provide the uniqueness of χ and the error bounds in advance. Moreover, they should be given for the more interesting semi-local convergence case. It turns out that these objectives can be achieved not only for (2) but for other methods too in a similar way. This is the novelty and motivation of our article. That is to expand the applicability under weaker conditions for these methods. It turns out that our error bounds are more accurate, and our convergence criteria hold even when the equivalent hypotheses in the preceding references are violated.
The remainder of this paper is organized as follows: Majorizing sequences for method (2) are introduced and studied in Section 2. The semi-local convergence is given in Section 3 for method (2). Numerical applications appear in Section 4. Concluding remarks in Section 5 complete this article.

2. Majorizing Sequences

A recall of the definition of a mozorizing sequence is needed.
Definition 1.
A nonnegative sequence { v t } is called majorizing for a sequence { w t } in a Banach space T if for all t = 0 , 1 , 2 ,
w t + 1 w t v t + 1 v t .
Scalar sequences are developed that majorize method (2). Let κ 0 > 0 , κ > 0 , κ 1 > 0 and t 0 be given constants. Define sequence { u t } by u 0 = 0 , v 0 = Ω
u t + 1 = v t + 2 κ ( v t u t ) 2 1 κ 0 6 ( u t + 2 v t ) , v t + 1 = u t + 1 + κ ( u t + 1 u t ) 2 + 2 κ 1 ( u t + 1 v t ) 2 ( 1 κ 0 u t + 1 ) .
Next, we present convergence criteria for sequence { u t } .
Lemma 1.
Suppose that for all t = 0 , 1 , 2 , ,
κ 0 ( u t + 2 v t ) < 6 a n d κ 0 u t + 1 < 1 .
Then, sequence { u t } is non-decreasing, bounded from above by 1 κ 0 and converges to its unique least upper bound u [ 0 , 1 κ 0 ] .
Proof. 
It follows by (4) and (5) that
0 u t v t u t + 1 < 1 κ 0 ,
so, we conclude that lim t u t = u . □
Stronger convergence criteria than (4) can be given but which are easier to verify as follows:
Define recurrent polynomials on the interval [ 0 , 1 ) by
p t ( 1 ) ( u ) = 2 κ u t 1 Ω + κ 0 6 ( 3 ( 1 + u + + u t ) Ω + 2 u t Ω ) 1 , p t ( 2 ) ( u ) = 16 κ 3 u 3 t 1 Ω 3 + 8 κ 2 u 2 t 1 Ω 2 + κ 2 u t 1 Ω + 2 κ 0 ( 1 + u + + u t + 1 ) Ω 2 , q 1 ( u ) = 2 κ u 2 κ + κ 0 6 ( 5 u 2 2 u ) , q t ( 2 ) ( u ) = 16 κ 3 u 2 t + 3 Ω 2 16 κ 3 u 2 t Ω 2 + 8 κ 2 u t + 2 Ω 8 κ 2 u t Ω + κ 2 u κ 2 + 2 κ 0 u 3 ,
and
q 2 ( u ) = 16 κ 3 u 5 Ω 2 16 κ 3 u 2 Ω 2 + 8 κ 2 u 3 Ω 8 κ 2 u Ω + κ 2 u κ 2 + 2 κ 0 u 3 ,
where κ 2 = ( 1 + 8 κ 1 ) κ . Set also p 2 ( u ) = p 1 ( 2 ) ( u ) . Notice that q 1 ( 0 ) = 2 κ , q 1 ( 1 ) = κ 0 2 , q 2 ( 0 ) = κ 2 and q 2 ( 1 ) = 2 κ 0 . Hence, polynomials q 1 and q 2 have zeros in the interval ( 0 , 1 ) . Denote by α and v the smallest such zeros, respectively. These polynomials are connected.
Lemma 2.
The following items hold
( i ) p t + 1 ( 1 ) ( u ) = p t ( 1 ) ( u ) + q 1 ( u ) u ( t 1 ) Ω .
I n p a r t i c u l a r , p t + 1 ( 1 ) ( u ) = p t ( 1 ) ( u ) a t u = α .
( i i ) q t + 1 ( 2 ) ( u ) q t ( 2 ) ( u ) .
I n p a r t i c u l a r , q t ( 2 ) ( u ) q 2 ( u ) a t u = v .
and
( i i i ) p t + 1 ( 2 ) ( u ) = p t ( 2 ) ( u ) + q t ( 2 ) ( u ) u ( t 1 ) Ω p t ( 2 ) ( u ) + q 2 ( u ) u ( t 1 ) Ω .
I n p a r t i c u l a r , p t + 1 ( 2 ) ( u ) p t ( u ) ( u ) a t u = v .
Then, sequence { u t } is non-decreasing, bounded from above by 1 κ 0 and converges to its unique least upper bound u [ 0 , 1 κ 0 ] .
Proof. 
By the definition of these polynomials we have in turn:
( i ) p t + 1 ( 1 ) ( u ) = p t + 1 ( 1 ) ( u ) p t ( 1 ) ( u ) + p t ( 1 ) ( u ) = 2 κ u t Ω + κ 0 6 ( 3 ( 1 + u + + u t ) Ω + 2 u t + 1 Ω ) 1 2 κ u t 1 Ω κ 0 6 ( 3 ( 1 + u + + u t ) Ω + 2 u t Ω ) + 1 + p t ( 1 ) ( u ) = p t ( 1 ) ( u ) + q 1 ( u ) u t 1 Ω ,
so,
p t + 1 ( 1 ) ( α ) = p t ( 1 ) ( α ) + q 1 ( α ) α ( t 1 ) Ω , s i n c e q 1 ( α ) = 0 .
( i i ) q t + 1 ( 2 ) ( u ) q t ( 1 ) ( u ) = 16 κ 3 u 2 t + 3 Ω 2 16 κ 3 u 2 t Ω 2 + 8 κ 2 u t + 2 Ω 8 κ 2 u t Ω = 16 κ 3 u 2 t Ω 2 ( u 1 ) + 8 κ 2 u t Ω ( u 2 1 ) = 16 u 3 u 2 t Ω 2 ( u 1 ) ( u 2 + u + 1 ) + 8 κ 2 Ω ( u 1 ) ( u + 1 ) u t 0 .
( i i i ) p t + 1 ( 2 ) ( u ) = 16 κ 3 u 3 t + 2 Ω 3 + 8 κ 2 u 2 t + 1 Ω 2 + κ 2 u t Ω + 2 κ 0 ( 1 + u + + u t + 2 ) Ω 16 κ 3 u 3 t 1 Ω 3 8 κ 2 u 2 t 1 Ω 2 κ 2 u t 1 Ω 2 κ 0 ( 1 + u + + u t + 1 ) Ω + p t ( 2 ) ( u ) = p t ( 2 ) ( u ) + q t ( 2 ) ( u ) u ( t 1 ) Ω p t ( 2 ) ( u ) + q 1 ( u ) u ( t 1 ) Ω = p t ( 2 ) ( u ) + q 2 ( u ) u ( t 1 ) Ω
Set
a = 2 κ Ω 1 κ 0 Ω 3 , b = κ ( u 1 u 0 ) 2 + 2 κ 1 ( u 1 Ω ) 2 Ω ( 1 κ 0 u 1 ) f o r Ω 0 , c = m a x { a , b } a n d d = m i n { 1 2 κ 0 Ω , v } .
Lemma 3.
Suppose
κ 0 u 1 < 1 , 2 κ 0 Ω < 1 , p 2 ( α ) 0 ,
and
0 c α d .
Notice that conditions (6) and (7) determine the smallness of Ω.
Then, sequence { u t } is non-decreasing, bounded from above by u = Ω 1 α and converges to its unique least upper bound u [ 0 , Ω 1 α ] . Moreover, the following estimates hold:
0 v t u t α t Ω ,
and
0 u t + 1 v t α t + 1 Ω .
Proof. 
The following items shall be shown using induction
0 2 κ ( v k u k ) 1 κ 0 6 ( u k + 2 v k ) α ,
0 κ ( u k + 1 u k ) 2 + 2 κ 1 ( u k + 1 v k ) 2 ( 1 κ 0 u k + 1 ) α ( v k u k ) ,
and
0 u k v k u k + 1 .
These estimates hold for k = 0 by the expression (4), the choices of a, b, conditions (6) and (7). It follows that
0 u 1 v 0 α Ω ,
0 v 1 u 1 α ( v 0 u 0 ) α Ω , s o u 1 Ω + α Ω = 1 α 2 1 α Ω < Ω 1 α = u .
Suppose
0 v k u k α k Ω , 0 u k + 1 v t α k + 1 Ω and u k + 1 1 α k + 2 1 α Ω < u ,
hold for all k t . Then, evidently (10) holds if
2 κ α k Ω + κ 0 6 α 1 α k + 1 1 α Ω + 2 1 α k + 1 1 α + α k Ω α 0 ,
or
p k ( 1 ) ( u ) 0 a t u = α .
Define function p ( 1 ) on the interval [ 0 , 1 ] by
p ( 1 ) ( u ) = lim k p k ( 1 ) ( u ) .
It follows by the definition of p ( 1 ) and p k ( 1 ) that
p ( 1 ) ( u ) = κ 0 Ω 2 ( 1 u ) 1 .
Then, by Lemma 2(i) and expression (15), estimate (14) holds if
κ 0 Ω 2 ( 1 u ) 1 0 a t u = α ,
which is true by the right hand side of (7). Notice that
2 κ 0 6 ( u k + 2 v k ) κ 0 3 3 Ω 1 α 1 ,
by the choice of α , so
0 1 1 κ 0 6 ( u k + 2 v k ) 2 .
Hence, (11) holds if
κ [ 4 κ ( v k u k ) 2 + ( v k u k ) ] 2 + 8 κ 1 κ ( v k u k ) 2 2 ( 1 κ 0 u k + 1 ) α ( v k u k ) ,
or
κ [ 4 κ ( v k u k ) + 1 ] 2 ( v k u k ) + 8 κ 1 κ ( v k u k ) 2 ( 1 κ 0 u k + 1 ) α ,
or
16 κ 3 ( v k u k ) 3 + 8 κ 2 ( v k u k ) 2 + κ ( v k u k ) + 8 κ 1 κ ( v k u k ) + 2 κ 0 u k + 1 2 α 0 ,
or
16 κ 3 ( α k Ω ) 3 + 8 κ 2 ( α k Ω ) 2 + κ 2 α k Ω + 2 α κ 0 1 α k + 2 1 α Ω 2 α 0 ,
or
p k ( 2 ) ( u ) 0 a t u = α .
By Lemma 2(iii), the definition of α and v, estimate (16) holds if p 1 ( 2 ) ( u ) 0 a t u = α , which is true by (13). The induction for estimate (10) and (11) is completed. Then, estimate (12) holds by expressions (4), (10) and (11). It follows that sequence { u t } is nondecreasing and bounded from above by u and as seen it converges to u [ 0 , Ω 1 α ] . □

3. Semilocal Convergence

Throughout this section, we prove the existence theorem for the method (2) for which the conditions H are needed. Assume:
( h 1 )
There exist x 0 B , Ω 0 such that [ G ( x 0 ) ] 1 δ ( T 2 , T 1 ) and [ G ( x 0 ) ] 1 [ G ( x 0 ) ] Ω .
( h 2 )
There exists κ 0 > 0 such that for each z B
[ G ( x 0 ) ] 1 ( G ( z ) G ( x 0 ) ) κ 0 z x 0 .
Define B 1 = U ( x 0 , 1 κ 0 ) B .
( h 3 )
There exists κ > 0 , κ 1 > 0 such that for each μ B 1 , w B 1
[ G ( x 0 ) ] 1 ( G ( μ ) G ( w ) ) κ μ w ,
a n d [ G ( x 0 ) ] 1 G ( μ ) κ 1 .
( h 4 )
Conditions of Lemma (1) or Lemma (3) hold, and
( h 5 )
U [ x 0 , u ] B .
Then, the following semilocal result for method (2) can be shown under conditions H.
Theorem 1.
Assume conditions H. Then, iteration { x t } given by method (2) is well defined in U [ x 0 , u ] remains in U [ x 0 , u ] for each t = 0 , 1 , and converges to a solution χ of equation G ( x ) = 0 in U [ x 0 , u ] . Moreover, the following assertions hold
| | y t x t | | v t u t ,
| | x t + 1 y t | | u t + 1 v t ,
and
| | χ x t | | u u t .
Proof. 
By condition ( h 1 ) and the expression (4),
y 0 x 0 = [ G ( x 0 ) ] 1 [ G ( x 0 ) ] Ω = v 0 u 0 u ,
so (17) holds for t = 0 and y 0 U [ x 0 , u ] . Let μ U [ x 0 , u ] . Using condition ( h 2 ) , we get
[ G ( x 0 ) ] 1 ( G ( μ ) G ( x 0 ) ) κ 0 μ x 0 κ 0 u < 1 ,
Thus, the Banach lemma on linear invertible operators [1,2,7] assures that [ G ( μ ) ] 1 exists and
[ G ( μ ) ] 1 G ( x 0 ) 1 1 κ 0 μ x 0 .
Next, we can write from the method (2)
x k + 1 = y k + [ G ( x k ) ] 1 G ( x k ) 4 [ A k ] 1 G ( x k ) = y k + ( [ G ( x k ) ] 1 4 [ A k ] 1 ) G ( x k ) = y k ( 4 [ A k ] 1 [ G ( x k ) ] 1 ) G ( x k ) = y k [ A k ] 1 ( 4 [ G ( x k ) ] 1 A k ) [ G ( x k ) ] 1 G ( x k ) .
Some estimates are needed assuming inequalities (18) and (19) for all k t
4 [ G ( x k ) ] 3 G 2 x k + y k 3 G ( y k ) = 3 [ G ( x k ) ] G 2 x k + y k 3 ] + [ G ( x k ) G ( y k ) ] ,
Hence, by conditions ( h 2 ) and ( h 3 )
[ G ( x 0 ) ] 1 [ 4 [ G ( x k ) ] 3 G 2 x k + y k 3 G ( y k ) ] 3 κ x k 2 x k + y k 3 + κ y k x k 2 κ y k x k 2 κ ( v k u k ) ,
[ 4 G ( x 0 ) ] 1 [ A k 4 G ( x 0 ) ] 1 4 [ 3 [ G ( x 0 ) ] 1 [ G 2 x k + y k 3 G ( x 0 ) ] + [ G ( x 0 ) ] 1 ( G ( y k ) G ( x 0 ) ) ] 1 4 κ 0 [ 2 x k + y k 3 x 0 + y k x 0 ] 1 4 κ 0 [ 2 x k x 0 + y k x 0 3 + y k x 0 ] 1 4 κ 0 [ 1 3 ( 2 u k + v k ) + v k ] = κ 0 6 ( u k + 2 v k ) < 1 ,
so
[ A k ] 1 G ( x 0 ) 1 1 κ 0 2 ( u k + 2 v k ) .
Hence, by expressions (4) and (22)–(24), we have
x k + 1 y k 2 κ ( v k u k ) ( v k u k ) 1 κ 0 2 ( u k + 2 v k ) = u k + 1 v k ,
and
x k + 1 x 0 x k + 1 y k + y k x 0 u k + 1 v k + v k u 0 = u k + 1 u * .
Therefore, iterate x k + 1 U [ x 0 , u ] and inequality (19) holds for t = 0 . Hence, iterate y k + 1 is well defined (by (21) for μ = x k + 1 ). We can write
G ( x k + 1 ) = G ( x k + 1 ) G ( x k ) + G ( x k ) = G ( x k + 1 ) G ( x k ) G ( x k ) ( y k x k ) = G ( x k + 1 ) G ( x k ) G ( x k ) ( x k + 1 x k ) + G ( x k ) ( x k + 1 y k ) ,
so by assumption ( h 3 ) and the induction hypotheses
[ G ( x 0 ) ] 1 G ( x k + 1 ) κ 2 x k + 1 x k 2 + κ 1 x k + 1 y k κ 2 ( u k + 1 u k 2 + κ 1 u k + 1 v k .
and
y k + 1 x k + 1 [ G ( x k + 1 ) ] 1 G ( x 0 ) + [ G ( x 0 ) ] 1 G ( x k + 1 ) κ ( u k + 1 u k ) 2 + 2 κ 1 ( u k + 1 v k ) 2 ( 1 κ 0 u k + 1 ) = v k + 1 u k + 1 ,
and
y k + 1 x 0 y k + 1 x k + 1 + x k + 1 x 0 v k + 1 u k + 1 + u k + 1 u 0 = v k + 1 u * ,
which complete the induction for inequality (18) and (19). The sequence { u k } is fundamental as convergent and majorizes sequence { x t } . Therefore, sequence { x t } is fundamental in Banach space T 1 ). Hence, there exists χ U [ x 0 , u ] such that lim k x k = χ . Then, by letting k in inequality (24), we get G ( χ ) = 0 , where we also used the continuity of G. □
Remark 1. (a) The limit point u * can be replaced by 1 κ 0 and Ω 1 α given in closed form in Theorem 1 under the conditions of Lemmas 1 and 3, respectively.
(b) The solution v of equation q 2 ( u ) = 0 depends on Ω, but it can independent of Ω as follows. Define polynomial
q 2 ¯ ( u ) = 2 κ 0 u 3 + κ 2 u κ 2 .
Then, we have q 2 ¯ ( 0 ) = κ 2 and q 2 ¯ ( 1 ) = 2 κ 0 . Denote the smaller zero of equation q 2 ( u ) = 0 in ( 0 , 1 ) by v ¯ .
Notice also that
q 2 ( u ) = 16 κ 3 u 2 Ω 2 ( u 3 1 ) + 8 κ 2 u 3 Ω ( u 2 1 ) + q 2 ¯ ( u ) q 2 ¯ ( u ) ,
so v ¯ , q 2 ¯ can replace v , q 2 , respectively, in the previous results, In this case v ¯ is independent of Ω.
A uniqueness of the solution result follows.
Proposition 1.
Assume
(1)
There exists element χ U [ x 0 , δ 0 ] B for some δ 0 > 0 which is a simple solution for equation G ( x ) = 0 .
(2)
Condition ( h 2 ) holds.
(3)
There exists δ 1 δ 0 such that
κ 0 2 ( δ 0 + δ 1 ) < 1 .
Define B 2 = U [ x 0 , δ 1 ] B .
Then, the element χ is the only solution of equation G ( x ) = 0 in the set B 2 .
Proof. 
Assume there exists μ B 2 satisfying G ( μ ) = 0 . Define linear operator M = 0 1 G ( μ + θ ( χ μ ) ) d θ . Then, in view of condition ( h 2 ) and inequality (26), we obtain in turn
[ G ( x 0 ) ] 1 ( M G ( x 0 ) ) κ 0 0 1 [ ( 1 θ ) μ * x 0 + θ χ x 0 ] d θ = κ 0 2 ( δ 0 + δ ) < 1 .
Therefore, operator M is invertible. Hence, by using the identity M ( μ χ ) = G ( μ * ) G ( χ ) = 0 , we deduce that μ = χ . □
Remark 2.
Notice that not all conditions H are used in Proposition 1, But if they were used, then we can certainly set δ 0 = u .

4. Numerical Examples

Example 1.
To revert to the motivational example from the study’s introductory section, dealing with the study of semilocal convergence, Let u 0 = 0.9955 . The consecutive derivatives of φ are
φ ( u ) = 3 u 2 l o g u 2 + 5 u 4 4 u 3 + 2 u 2 , φ ( u ) = 6 u l o g u 2 + 20 u 3 12 u 2 + 10 u , φ ( u ) = 6 l o g u 2 + 60 u 2 24 u + 22 .
It can be easily seen that φ is unbounded on B. Through the conditions ( h 1 ) , ( h 2 ) and ( h 3 ) , we can calculate
[ φ ( u 0 ) ] 1 . φ ( u 0 ) = 0.00456182 = Ω ,
κ 0 = 21.5093 , κ = 7.03249 and κ 1 = 1.3044 , where B 1 = U ( u 0 , 1 κ 0 ) B . Next, we verify the conditions (5), (6) and (7) of Lemma 1 and Lemma 3 where α = 0.714123 and v = 0.766581 . Majorizing sequences
u t = { 0 , 0.00486441 , 0.00540241 , 0.00540983 , 0.00540983 , } v t = { 0.00456182 , 0.00486441 , 0.00539816 , 0.00540983 , 0.00540983 , }
converge to u [ 0 , 0.159573 ] . Table 1 displays error estimates (18), (19) and (20) which are not computable in earlier studies. Nevertheless, all the assumptions of the Theorem 1 are satisfied and hence, the iteration { x t } given by scheme (2) converges to a solution χ of equation G ( x ) = 0 in U [ u 0 , 0.00540983 ] . Precisely, we present a technique that gives weaker sufficient semi-local convergence conditions, tighter error estimates on the distances involved, and more exact information on the solution’s location.
Example 2
([10]). Next, in order to demonstrate the applicability of our hypothesis in a real-world scenario, take the following quartic equation, that describes the fraction of the nitrogen-hydrogen feed that gets converted to ammonia, called the fractional conversion. For 250 atm and 500C, this equation is written as follows:
f ( x ) = x 4 7.79075 x 3 + 14.7445 x 2 + 2.511 x 1.674 .
In this example, we wil look at the domain B = ( 0.3 , 0.4 ) , where x 0 = 0.3 . Through the conditions ( h 1 ) , ( h 2 ) and ( h 3 ) , we can calculate
[ f ( x 0 ) ] 1 . f ( x 0 ) = 0.02179956 = Ω ,
κ 0 = κ = 1.76728 and κ 1 = 1.15604 , where B 1 = U ( x 0 , 1 κ 0 ) B . Next, we verify the conditions (5), (6) and (7) of Lemmas 1 and 3 where α = 0.843909 and v = 0.87568 . Majorizing sequences
u t = { 0 , 0.0234965 , 0.0260807 , 0.0261157 , 0.0261157 , } v t = { 0.0217956 , 0.026057 , 0.0261157 , 0.0261157 , 0.0261157 , }
converge to u [ 0 , 0.0415249 ] . Table 2 displays error estimates (18), (19) and (20). Therefore, as expected, estimates of the error are lower as initial guesses get closer to the root. Nevertheless, all the assumptions of the Theorem 1 are satisfied and hence, the iteration { x t } given by scheme (2) converges to a solution χ of equation G ( x ) = 0 in U [ x 0 , 0.0261157 ] .
Example 3
([10]). Let us define the function f on D 0 by
f ( x ) = x 3 p ;
where D 0 = U ( x 0 , 1 p ) and p ( 0 , 1 ) . Set x 0 = 1 . As a result, through the conditions ( h 1 ) , ( h 2 ) and ( h 3 ) , we can calculate
[ f ( x 0 ) ] 1 . f ( x 0 ) = 1 p 3 = Ω ,
κ 0 = ( 3 p ) , κ = 2 min ( 2 p ) , 1 + 1 κ 0 a n d κ 1 = ( 2 p ) 2 ,
where D 1 = U ( x 0 , 1 κ 0 ) D 0 . Next, we verify the conditions (5), (6) and (7) of Lemmas 1 and 3 where α = 0.848595 and v = 0.887371 . Majorizing sequences
u t = { 0 , 0.038339 , 0.047006 , 0.0475302 , 0.0475323 , } v t = { 0.0333333 , 0.0466847 , 0.047529 , 0.0475323 , 0.0475323 , }
converge to u [ 0 , 0.22016 ] . Table 3 displays error estimates (18), (19) and (20). Nevertheless, all the assumptions of the Theorem 1 are satisfied and hence, the iteration { x t } given by scheme (2) converges to a solution χ of equation G ( x ) = 0 in U [ x 0 , 0.0475323 ] . Therefore, as expected, estimates of the error are lower as initial guesses get closer to the root.

5. Conclusions

A new technique is developed using only derivatives appearing on the method to show semilocal convergence for high convergence order method (2). Earlier works have shown convergence assuming the existence of derivatives of high order which may not appear in the method. Hence, limiting its applicability. This technique also provides error bounds and uniqueness results that are not previously available. Finally, this technique is very general since it does not depend on the actual method. That is why it can be used along the same lines to extend the applicability of other methods such as single step Newton, Newton-like, Secant, Kurchatov, Stirling’s or two step Traub, Newton or multistep methods [1,2,4,5,10,11].

Author Contributions

I.K.A. wrote the framework and the original draft of this paper; A.S., J.P.J. and M.I.A. reviewed and validated the paper. 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.

Abbreviations and Nomenclature

Abbreviations

Nomenclature

κ 0 , κ , κ 1 Lipschitz constants
{ u t } , { v t } Scalar sequences

References

  1. Argyros, I.K. The Theory and Application of Iteration Methods, 2nd ed.; Engineering Series; CRC Press-Taylor and Francis Publ. Comp.: Boca Raton, FL, USA, 2022. [Google Scholar]
  2. Argyros, I.K. Unified Convergence Criteria for Iterative Banach Space Valued Methods with Applications. Mathematics 2021, 9, 1942. [Google Scholar] [CrossRef]
  3. Ezquerro, J.A.; Hernandez, M.A. Newton’s Method: An Updated Approach of Kantorvich’s Theory; Birkhaser: Cham, Switzerland, 2018. [Google Scholar]
  4. Petković, M.S.; Neta, B.; Petković, L.D.; Džunić, J. Multipoint methods for solving nonlinear equations: A survey. Appl. Math. Comput. 2014, 226, 635–660. [Google Scholar] [CrossRef] [Green Version]
  5. Regmi, S.; Argyros, C.I.; Argyros, I.K.; George, S. On the Semi-Local Convergence of a Traub-Type Method for Solving Equations. Foundations 2022, 2, 114–127. [Google Scholar] [CrossRef]
  6. Noor, M.A.; Waseem, M. Some iterative methods for solving a system of nonlinear equations. Comput. Math. Appl. 2009, 57, 101–106. [Google Scholar] [CrossRef] [Green Version]
  7. Homeier, H.H. A modified Newton method with cubic convergence: The multivariate case. J. Compu. Appl. Math. 2004, 169, 161–169. [Google Scholar] [CrossRef] [Green Version]
  8. Magreñán, Á.A.; Gutiérrez, J.M. Real dynamics for damped Newton’s method applied to cubic polynomials. J. Comput. Appl. Math. 2015, 275, 527–538. [Google Scholar] [CrossRef]
  9. Singh, S.; Martínez, E.; Maroju, P.; Behl, R. A study of the local convergence of a fifth order iterative method. Indian J. Pure Appl. Math. 2020, 51, 439–455. [Google Scholar] [CrossRef]
  10. Argyros, I.K.; Giménez, E.; Magreñán, Á.A.; Sarría, I.; Sicilia, J.A. Improved semilocal convergence analysis in Banach space with applications to chemistry. J. Math. Chem. 2018, 6, 1958–1975. [Google Scholar] [CrossRef]
  11. Polyanin, A.D.; Manzhirov, A.V. Handbook of Integral Equations; CRC Press: Boca Raton, FL, USA, 2008. [Google Scholar]
Table 1. Error estimates.
Table 1. Error estimates.
t v t u t u t + 1 v t u u t
00.004561820.000302590.00540983
100.0005380.00054542
Table 2. Error estimates.
Table 2. Error estimates.
t v t u t u t + 1 v t u u t
00.02179560.00170090.0261157
10.00256052.37 × 10−50.0026192
23.5 × 10−503.5 × 10−5
Table 3. Error estimates.
Table 3. Error estimates.
t v t u t u t + 1 v t u u t
00.03333330.00500570.0475323
10.00834570.0003190.0091933
20.0005231.2 × 10−60.0005263
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, I.K.; Jaiswal, J.P.; Saxena, A.; Argyros, M.I. On the Semi-Local Convergence of a Noor–Waseem-like Method for Nonlinear Equations. Foundations 2022, 2, 512-522. https://doi.org/10.3390/foundations2020034

AMA Style

Argyros IK, Jaiswal JP, Saxena A, Argyros MI. On the Semi-Local Convergence of a Noor–Waseem-like Method for Nonlinear Equations. Foundations. 2022; 2(2):512-522. https://doi.org/10.3390/foundations2020034

Chicago/Turabian Style

Argyros, Ioannis K., Jai Prakash Jaiswal, Akanksha Saxena, and Michael I. Argyros. 2022. "On the Semi-Local Convergence of a Noor–Waseem-like Method for Nonlinear Equations" Foundations 2, no. 2: 512-522. https://doi.org/10.3390/foundations2020034

Article Metrics

Back to TopTop