Next Article in Journal
Detailed Error Analysis for a Fractional Adams Method on Caputo–Hadamard Fractional Differential Equations
Next Article in Special Issue
Semi-Local Convergence of Two Derivative-Free Methods of Order Six for Solving Equations under the Same Conditions
Previous Article in Journal
Integral Results Related to Similarly Separable Vectors in Separable Hilbert Spaces
Previous Article in Special Issue
Approximating Solutions of Nonlinear Equations Using an Extended Traub Method
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Semi-Local Convergence of a Seventh Order Method with One Parameter for Solving Non-Linear Equations

by
Christopher I. Argyros
1,
Ioannis K. Argyros
1,*,
Samundra Regmi
2,
Jinny Ann John
3 and
Jayakumar Jayaraman
3
1
Department of Computing and Mathematical Sciences, Cameron University, Lawton, OK 73505, USA
2
Department of Mathematics, University of Houston, Houston, TX 77204, USA
3
Department of Mathematics, Puducherry Technological University, Pondicherry 605014, India
*
Author to whom correspondence should be addressed.
Foundations 2022, 2(4), 827-838; https://doi.org/10.3390/foundations2040056
Submission received: 16 August 2022 / Revised: 16 September 2022 / Accepted: 18 September 2022 / Published: 21 September 2022
(This article belongs to the Special Issue Iterative Methods with Applications in Mathematical Sciences)

Abstract

:
The semi-local convergence is presented for a one parameter seventh order method to obtain solutions of Banach space valued nonlinear models. Existing works utilized hypotheses up to the eighth derivative to prove the local convergence. But these high order derivatives are not on the method and they may not exist. Hence, the earlier results can only apply to solve equations containing operators that are at least eight times differentiable although this method may converge. That is why, we only apply the first derivative in our convergence result. Therefore, the results on calculable error estimates, convergence radius and uniqueness region for the solution are derived in contrast to the earlier proposals dealing with the less challenging local convergence case. Hence, we enlarge the applicability of these methods. The methodology used does not depend on the method and it is very general. Therefore, it can be used to extend other methods in an analogous way. Finally, some numerical tests are performed at the end of the text, where the convergence conditions are fulfilled.
MSC:
65G99; 65H10; 47H99; 49M15

1. Introduction

Let U and V be Banach spaces, and B be a non-empty, convex and open subset of U. Suppose F : B U V is derivable in the Fréchet sense. The ultimate aim is to produce a solution u * for the equation
F ( u ) = 0 .
A plethora of highly challenging scientific and engineering problems can be modeled as nonlinear equations in the form (1) [1,2,3,4]. Overcoming this nonlinearity has long been a significant problem in mathematics. Purely analytical answers to these equations are difficult to provide. Because of this, scientists and researchers often apply the strategy of iterative algorithms to obtain the required solution. Among iterative procedures, the approach given by Newton is widely used to address (1). During the last several years, a lot of new higher order iterative techniques have been developed and are being implemented to deal with nonlinear equations [5,6,7,8,9]. In most of these research works, convergence theorems of iterative schemes have been established using conditions on derivatives of higher order. Additionally, these studies provide no conclusions on the convergence radii, error distances and existence-uniqueness regions for the solution. The study of semi-local analysis of an iterative formula allows to estimate the convergence balls, bounds on error and uniqueness region for a solution. The results of local convergence of efficient iterative procedures have been deduced in [6,7,8,9,10,11,12,13,14,15,16,17,18]. In these works, important results containing convergence radii, measurements on error estimates and expanded utility of these iterative approaches have been given. Outcomes of local analysis are valuable because they illustrate the complexity of selecting initial points. Most recently, Liu et al. [7] established a local convergence theorem for a class of sixth and seventh convergence order iterative methods defined on the real line by considering assumptions on the first derivative of F and Lipschitz parameters. These methods are defined for n = 0 , 1 , 2 , . . . , by
s n = u n F ( u n ) 1 F ( u n ) , z n = s n τ F ( u n ) + F ( s n ) F ( u n ) ( 1 τ ) F ( u n ) 1 F ( u n ) F ( u n ) F ( u n ) F ( s n ) , u n + 1 = z n F ( z n ) [ z n , s n ; F ] + [ z n , u n , u n ; F ] ( z n s n ) ,
where u 0 is a starting guess, τ R and [ . , . ; F ] is the first order divided difference, and
[ z n , s n ; F ] = [ s n , z n ; F ] = F ( z n ) F ( s n ) z n s n , [ z n , u n ; F ] = [ u n , z n ; F ] = F ( z n ) F ( u n ) z n u n , [ z n , u n , u n ; F ] = [ z n , u n ; F ] F ( u n ) z n u n .
The authors also obtained the error bounds and radii of convergence based on their proposed theorem. They concluded that this family has the largest convergence radius for τ = 0 in comparison with the other members (for τ = 2 , τ = 1.5 , τ = 0.5 and τ = 2.5 ).
In this document, we offer the semi-local convergence result for a one parameter seventh convergence order iterative method discussed by Amiri et al. [10] to address problem (1). This method is presented for α 0 as follows:
y n = x n F ( x n ) 1 F ( x n ) , z n = y n 1 α F ( x n ) 1 F ( y n ) , v n = z n F ( x n ) 1 ( ( 2 1 α α ) F ( y n ) + α F ( z n ) ) , x n + 1 = v n H ( m n ) F ( z n ) 1 F ( v n ) ,
where x 0 is a starting estimation, Q n = ( 2 1 α α ) F ( y n ) + α F ( z n ) , m n = I 1 α F ( x n ) 1 [ y n , z n ; F ] , H ( t ) = ( 1 1 α ) I + α ( t ( 1 1 α ) I ) + 1 2 ( α + 6 α 2 ) ( t ( 1 1 α ) I ) 2 , α > 0 and [ . , . ; F ] : B × B L ( U , V ) is a divided difference of order one. It is shown to be of order seven utilizing eighth order Fréchet derivative of F [5,8,9,10,11,12,18]. The usage of these solvers is restricted due to such hypotheses on derivatives of higher order.
Let us choose the following motivational problem, where U = V = R and the function T is defined on B = [ 1 2 , 3 2 ] by
T ( u ) = u 3 ln ( u 2 ) + u 5 u 4 , if u 0 0 , if u = 0 .
The definition of T gives that T ( u ) = 6 ln u + 60 u 2 24 u + 22 . Hence, we arrive at the conclusion that the convergence theorem for the method (3) suggested by [10] does not apply for this example although the method may converge. This is because the third derivative T is unbounded on B. Besides, no results on the convergence domain, bounds on error and uniqueness results were established in the existing article by [10]. However, we propose the semi-local convergence theorem for this method (3) in the more general Banach space case by considering a set of assumptions only on F . In particular, ω -continuity of the first Fréchet derivative is employed to enhance the utility of these methods.
It is worth noticing that our approach does not depend on method (3). Therefore, due to its generality it can be used on other methods using inverses of linear operators [5,6,7,9,10,11,12,13,14,15,16,17,18]. Other computational pit-falls of high convergence order methods have been reported by Sen et al. [4]. In particular, they illustrated that the computational complexity of high-order methods can be higher than the second-order Newton method. The family of methods (3) can be applied to solve: oxygen diffusion problems in cylindrically shaped sections of tissue [1,3] and melting problems [2].
The outline of this document can be described as: A majorizing sequence is developed to prove the semi-local convergence of method (3) in Section 2. The Semi-local convergence of the considered method (3) is established in Section 3. In Section 4, Numerical experiments are described. Conclusions are also presented in Section 5.

2. Convergence for the Majorizing Sequence

A scalar sequence is developed that is shown to be majorizing for the method (3) in the next section. Set M 0 = 0 , .
Suppose:
(i)
There exists a function ω 0 with D o m ( ω 0 ) = M 0 and R a n g e ( ω 0 ) = R which is continuous and non-decreasing such that the equation
ω 0 ( u ) 1 = 0
has a smallest solution ρ 0 M 0 { 0 } . Set M = 0 , ρ 0 .
(ii)
There exist functions ω , ψ with D o m ( ω ) = M , D o m ( ψ ) = M × M × M whose range is R which are continuous and non-decreasing.
It is convenient to define parameters l , s and p by
l = 1 1 α , s = α ( 6 α 1 ) 2 and p = 6 α 1 2 α
The notation S ( x , ξ ) , S [ x , ξ ] stands for the open and closed ball in U with center x and of radius ξ > 0 .
Let Δ 0 be a given parameter. Moreover, define the sequence { a n } for all n = 0 , 1 , 2 , . . . by
a 0 = 0 , b 0 = Δ ,
c n = b n + 0 1 ω ( ( 1 θ ) b n ) d θ ( b n a n ) | α | ( 1 ω 0 ( a n ) ) , q n = | 2 1 α | 0 1 ω ( ( 1 θ ) ( b n a n ) ) d θ ( b n a n ) + | α | 1 + 0 1 ω 0 ( b n + θ ( c n b n ) ) d θ ( c n b n ) , d n = c n + q n 1 ω 0 ( a n ) , α n = 1 + 0 1 ω 0 ( b n + θ ( d n b n ) ) d θ ( d n b n ) + 0 1 ω ( ( 1 θ ) ( b n a n ) ) d θ ( b n a n ) , γ n = ψ ( a n , b n , c n ) 1 ω 0 ( a n ) , h n = | l | + γ n + | p | γ n 2 , a n + 1 = d n + α n h n 1 ω 0 ( c n ) , λ n + 1 = 0 1 ω ( ( 1 θ ) ( a n + 1 a n ) ) d θ ( a n + 1 a n ) + ( 1 + ω 0 ( a n ) ) ( a n + 1 b n ) and b n + 1 = a n + 1 + λ n + 1 1 ω 0 ( a n + 1 ) .
A general convergence result follows for the sequence { a n } .
Lemma 1.
Suppose there exists ρ > ρ 0 such that for all n = 0 , 1 , 2 ,
ω 0 ( a n ) < 1
and
a n < ρ .
Then, the sequence { a n } is convergent to some a * [ η , ρ ] such that a n b n c n d n a n + 1 ρ .
Proof. 
It follows by the definition of { a n } and the conditions (6) and (7) that this sequence is bounded from above by ρ and non-decreasing. Hence, it is convergent to its unique least upper bound a * . □
Remark 1.
If the function ω 0 is strictly increasing, then set
ρ = ω 0 1 ( 1 ) .
In this case the condition (6) becomes
a n < ρ .

3. Convergence for the Method (3)

The semi-local convergence is based on the majorizing sequence { a n } and the following conditions.
Suppose:
( A 1 )
There exists a point x 0 B and a parameter Δ 0 such that F ( x 0 ) 1 L ( V , U ) and F ( x 0 ) 1 F ( x 0 ) Δ .
( A 2 )
F ( x 0 ) 1 ( F ( u ) F ( x 0 ) ) ω 0 ( u x 0 ) for all u B . Set B 0 = S ( x 0 , ρ 0 ) B .
( A 3 )
F ( x 0 ) 1 ( F ( u 2 ) F ( u 1 ) ) ω ( u 2 u 1 ) and
F ( x 0 ) 1 ( [ u 1 , u 2 ; F ] F ( u 3 ) ) ψ ( u 1 x 0 , u 2 x 0 , u 3 x 0 ) for all u 1 , u 2 , u 3 B 0 .
( A 4 )
The conditions (6) and (7) hold.
( A 5 )
S [ x 0 , a * ] B .
Next, the main semi-local convergence result is presented under the conditions ( A 1 )–( A 5 ) and using { a n } as the majorizing sequence for method (3).
Theorem 1.
Suppose that the conditions ( A 1 )–( A 5 ) hold. Then, the sequence { x n } produced by the method (3) and starting at x 0 B is convergent to a solution u * of the equation F ( u ) = 0 such that
x n u * a * a n ,
where the sequence { a n } is given by the formula (5).
Proof. 
Induction is employed to show
y k x k b k a k ,
z k y k c k b k
v k z k d k c k
and
x k + 1 v k a k + 1 d k .
The assertion (11) holds true for k = 0 , since by the condition ( A 1 )
y 0 x 0 = F ( x 0 ) 1 F ( x 0 ) Δ = b 0 a 0 = b 0 < a * .
Hence, the iterates y 0 , z 0 , v 0 , x 1 are well defined and y 0 S ( x 0 , a * ) . Let u S ( x 0 , a * ) . It then follows from the conditions ( A 1 ), ( A 2 ) and (6) that
F ( x 0 ) 1 ( F ( u ) F ( x 0 ) ) ω 0 ( u x 0 ) ω 0 ( a * ) < 1 .
Thus, the Banach perturbation lemma [15] asserts that F ( u ) 1 L ( V , U ) and
F ( u ) 1 F ( x 0 ) 1 1 ω 0 ( u x 0 ) .
Suppose that the assertions hold for all integer values smaller than k.
The first substep of method (3) gives the identity
F ( y k ) = F ( y k ) F ( x k ) F ( x k ) ( y k x k ) = 0 1 ( F ( x k + θ ( y k x k ) ) d θ F ( x k ) ) ( y k x k ) .
Then, it follows by the condition ( A 3 ), (15) (for u = x k ), (5) and the second sub-step of the method (3),
z k y k = 1 | α | F ( x k ) 1 F ( y k ) 1 | α | F ( x k ) 1 F ( x 0 ) F ( x 0 ) 1 F ( y k ) 0 1 ω ( ( 1 θ ) y k x k ) d θ y k x k | α | ( 1 ω 0 ( x k x 0 ) ) 0 1 ω ( ( 1 θ ) ( b k a k ) ) d θ ( b k a k ) | α | ( 1 ω 0 ( a k ) ) = c k b k and z k x 0 z k y k + y k x 0 c k b k + b k = c k < a * .
Therefore, the assertions (12) holds and the iterate z k S ( x 0 , a * ) .
Similarly, the identity
F ( z k ) F ( y k ) = 0 1 F ( y k + θ ( z k y k ) ) d θ ( z k y k ) = 0 1 ( F ( y k + θ ( z k y k ) ) d θ F ( x 0 ) ) ( z k y k ) + F ( x 0 ) ( z k y k )
gives
F ( x 0 ) 1 Q k = ( 2 1 α ) F ( x 0 ) 1 ( F ( y k ) + α ( F ( z k ) F ( y k ) ) ) | 2 1 α | 0 1 ω ( ( 1 θ ) y k x k ) d θ y k x k + | α | ( 1 + 0 1 ω 0 ( y k x 0 + θ z k y k ) d θ z k y k = q k ¯ q k .
Thus, it follows
v k z k F ( x k ) 1 F ( x 0 ) F ( x 0 ) 1 Q k q k ¯ 1 ω 0 ( a k ) q k 1 ω 0 ( a k ) = d k c k
and
v k x 0 v k z k + z k x 0 d k c k + c k = d k < a * .
Hence, the iterate v k S ( x 0 , a * ) and the assertion (13) holds.
Then, the identity F ( v k ) = F ( v k ) F ( y k ) + F ( y k ) gives similarly
F ( x 0 ) 1 F ( v k ) ( 1 + 0 1 ω 0 ( y k x 0 + θ v k y k ) d θ ) v k y k + 0 1 ω ( ( 1 θ ) y k x k ) d θ y k x k α k ¯ α k .
Moreover, it can be written
m k = ( I 1 α ) I + 1 α ( I F ( x k ) 1 [ y k , z k ; F ] ) = l I + 1 α F ( x k ) 1 ( F ( x k ) [ y k , z k ; F ] ) , m k l = 1 α γ k ¯ ,
so
H ( m k ) = l I + α ( 1 α γ k ¯ ) + s ( 1 α γ k ¯ ) 2 = l I + γ k ¯ + p γ k ¯ 2
by the definition of the parameters l and p. Consequently, by the estimate (18), the second condition in ( A 3 ), (5), it is obtained
H ( m k ) | l | + γ k ¯ + | p | γ k ¯ 2 | l | + γ k + | p | γ k 2 = h k ,
where we also used
γ k ¯ = F ( x k ) 1 ( F ( x k ) [ y k , z k ; F ] ) ψ ( x k x 0 , y k x 0 , z k x 0 ) 1 ω 0 ( x k x 0 ψ ( a k , b k , c k ) 1 ω 0 ( a k ) = γ k .
Then, by the fourth sub-step of the method (3), (17), (15) (for u = z k ) and (5),
x k + 1 v k H ( m k ) F ( z k ) 1 F ( x 0 ) F ( x 0 ) 1 F ( v k ) h k α k 1 ω 0 ( c k ) = a k + 1 d k
and
x k x 0 x k + 1 v k + v k x 0 a k + 1 d k + d k = a k + 1 < a * .
Therefore, the iterate x k + 1 S ( x 0 , a * ) and the estimate (14) holds. The first sub-step of method (3) gives
F ( x k + 1 ) = F ( x k + 1 ) F ( x k ) F ( x k ) ( y k x k ) = F ( x k + 1 ) F ( x k ) F ( x k ) ( x k + 1 x k ) + F ( x k ) ( x k + 1 y k )
leading to
F ( x 0 ) 1 F ( x k + 1 ) 0 1 F ( x 0 ) 1 ( F ( x k + θ ( x k + 1 x k ) ) d θ F ( x k ) ) ( x k + 1 x k ) + F ( x 0 ) 1 ( F ( x k ) F ( x 0 ) ) ( x k + 1 y k ) + F ( x 0 ) 1 F ( x 0 ) ( x k + 1 y k ) 0 1 ω ( ( 1 θ ) x k + 1 x k ) d θ x k + 1 x k + ( 1 + ω 0 ( x k x 0 ) ) x k + 1 y k 0 1 ω ( ( 1 θ ) ( a k + 1 a k ) ) d θ ( a k + 1 a k ) + ( 1 + ω 0 ( a k ) ) ( a k + 1 b k ) = λ ¯ k + 1 ,
so
y k + 1 x k + 1 F ( x k + 1 ) 1 F ( x 0 ) F ( x 0 ) 1 F ( x k + 1 ) λ ¯ k + 1 1 ω 0 ( x k + 1 x 0 ) λ k + 1 1 ω 0 ( a k + 1 ) = b k + 1 a k + 1 and y k + 1 x 0 y k + 1 x k + 1 + x k + 1 x 0 b k + 1 a k + 1 + a k + 1 = b k + 1 < a * .
That is the induction for the assertions (11)–(14) is terminated. The condition ( A 4 ) implies that the sequence { a k } is complete. Consequently, by (11)–(14) the sequence { x k } is also complete and convergent to some u * S [ x 0 , a * ] (since the ball S [ x 0 , a * ] is a closed set). Furthermore, by the continuity of the operator F and if k in (19), we deduce that F ( u * ) = 0 . Finally, for i 0 the estimate
x k + i x k a k + i a k
shows the assertion (10) by letting i . □
Next, the uniqueness of the convergence region is determined.
Proposition 1.
Suppose:
There exists a solution μ S ( x 0 , ρ 1 ) for some ρ 1 > 0 ; condition ( A 2 ) holds on the ball S ( x 0 , ρ 1 ) and there exists ρ 2 ρ 1 such that
0 1 ω 0 ( θ ρ 2 ) d θ < 1 .
Set B 1 = S [ x 0 , ρ 1 ] B . Then, the Equation (1) is uniquely solvable by μ in the region B 1 .
Proof. 
Suppose that there exists μ 0 B 1 with F ( μ 0 ) = 0 . Define the linear operator G = 0 1 F ( μ + θ ( μ 0 μ ) ) ( μ 0 μ ) d θ .
Then, by the application of the conditions ( A 2 ) and (20) it follows that
F ( x 0 ) 1 ( G F ( x 0 ) ) 0 1 ω 0 ( θ μ 0 μ ) d θ 0 1 ω 0 ( θ ρ 2 ) d θ < 1 .
Therefore, the operator is invertible and μ 0 μ = G 1 ( F ( μ 0 ) F ( μ ) ) = G 1 ( 0 0 ) = 0 . Therefore, we conclude that μ = μ 0 . □
Remark 2.
(a)The parameter ρ 0 given by the condition (i) of the Lemma 1 in closed form can replace a * in the condition ( A 4 ).
(b) 
Proposition 1 is not using all the conditions of the Theorem 1. But if this is the case, then set ρ 1 = a * or ρ 1 = ρ 0 .
(c) 
The second condition in ( A 3 ) involving the function ψ can be dropped as follows: Suppose that there exists a function ψ 0 : M × M R continuous and non-decreasing such that for all y , z B 0
F ( x 0 ) 1 ( [ y , z ; F ] F ( x 0 ) ) ψ 0 ( y x 0 , z x 0 ) .
Then, in view of the estimate
F ( x 0 ) 1 ( F ( x ) [ y , z ; F ] F ( x 0 ) 1 ( F ( x ) F ( x 0 ) ) + F ( x 0 ) 1 ( [ y , z ; F ] F ( x 0 ) ) ,
the function ψ can be defined by
ψ ( t 1 , t 2 , t 3 ) = ω 0 ( t 1 ) + ψ 0 ( t 2 , t 3 ) f o r a l l t 1 , t 2 , t 3 0 , ρ 0 .
Moreover, if the divided difference is defined by
[ y , z ; F ] = 0 1 F ( z + θ ( y z ) ) d θ ,
then, the function ψ can be defined by
ψ ( t 1 , t 2 , t 3 ) = ω 0 ( t 1 ) + 1 2 ( ψ 0 ( t 2 ) + ψ 0 ( t 3 ) ) ,
since ψ 0 ( t 2 , t 3 ) = 1 2 ( w 0 ( t 2 ) + ω 0 ( t 3 ) ) . In fact, (21) is the choice for the function ψ used in the examples.

4. Numerical Examples

Example 1.
Let B = S ( x 0 , 1 a ) for some a 0 , 1 . Define the cubic polynomial
F ( u ) = u 3 a .
If one chooses x 0 = 1 and defines [ δ 1 , δ 2 ; F ] = F ( δ 2 ) F ( δ 1 ) δ 2 δ 1 for δ 1 δ 2 , then the conditions ( A 1 )–( A 2 ) are verified for Δ = 1 a 3 , ω 0 ( t ) = ( 3 a ) t , ρ = ρ 0 = 1 3 a , B 0 = S ( x 0 , 1 3 a ) , ω ( t ) = 2 ( 1 + 1 3 a ) and ψ ( t 1 , t 2 , t 3 ) = ( 3 a ) ( t 1 + 1 2 ( t 2 + t 3 ) ) . Choose a = 0.95 . Table 1, Table 2 and Table 3 verifies condition (6) and (7) for α = 0.75 , 1 , 1.25 respectively.
Estimates for ω 0 ( a n ) and a n .
Hence, we can conclude that (6) and (7) holds, so ( A 4 ) holds. Therefore, all the conditions ( A 1 )–( A 5 ) holds and hence by Theorem 1, the sequence { x n } generated by the method (3) converges to a solution u * of the equation F ( u ) = 0 in S [ x 0 , a * ] .
Example 2.
The utility of our results in the real world can be successfully established by considering the quartic equation for fractional conversion which represents the fraction of the nitrogen-hydrogen feed that gets converted to ammonia. At 500 C and 250 a t m , this equation can be formulated as
F ( u ) = u 4 7.79075 u 3 + 14.7445 u 2 + 2.511 u 1.674 .
Let B = ( 0.3 , 0.4 ) and choose x 0 = 0.3 . Define [ δ 1 , δ 2 ; F ] = F ( δ 2 ) F ( δ 1 ) δ 2 δ 1 , for δ 1 δ 2 . Then, the conditions ( A 1 )–( A 2 ) are valid if
F ( x 0 ) 1 F ( x 0 ) = 0.0217956 = Δ ,
ω 0 = ω = 1.56036 , ρ 0 = 0.640877 , B 0 = S [ x 0 , ρ ] B and ψ ( t 1 , t 2 , t 3 ) = ω 0 ( t 1 ) + 1 2 ( ω 0 ( t 2 ) + ω 0 ( t 3 ) ) . Table 4, Table 5 and Table 6 verifies the conditions (6) and (7) of Lemma 1.
Estimates for ω 0 ( a n ) and a n .
Hence, we can conclude that condition ( A 4 ) holds and therefore all the conditions of Theorem 1 are fulfilled. Hence, the sequence { x n } generated by the method (3) converges to a solution u * of equation the F ( u ) = 0 in S [ x 0 , a * ] .
Example 3.
Next, we reconsider the motivational example from the introduction part of this study. Choose x 0 = 0.9955 . [ δ 1 , δ 2 ; F ] is a divided difference of order one and defined as [ δ 1 , δ 2 ; F ] = F ( δ 2 ) F ( δ 1 ) δ 2 δ 1 , for δ 1 δ 2 . Conditions ( A 1 ) and ( A 2 ) are verified for
F ( x 0 ) 1 F ( x 0 ) = 0.00456182 = Δ ,
ω 0 = 12.8089 , ρ 0 = 0.0780704 , B 0 = S ( x 0 , ρ 0 ) B , ω = 1.12091 and ψ ( t 1 , t 2 , t 3 ) = ω 0 ( t 1 ) + 1 2 ( ω 0 ( t 2 ) + ω 0 ( t 3 ) ) . Table 7, Table 8 and Table 9 verifies the conditions (6) and (7) of Lemma 1 for α = 0.75 , 1 and 1.25 respectively.
Estimates for ω 0 ( a n ) and a n .
From Table 7, Table 8 and Table 9, we can easily verify that condition ( A 4 ) holds. Therefore, all the assumptions ( A 1 )–( A 5 ) of Theorem 1 are satisfied and hence, we can conclude that the sequence { x n } generated by the method (3) converges to a solution u * of the equation F ( u ) = 0 in S [ x 0 , a * ] .

5. Conclusions

The semi-local convergence theorem for method (3) is established by applying generalized Lipschitz condition only on the first derivative. As a result, estimates on convergence balls, measurable error distances and the existence-uniqueness regions for the solution are deduced. At the end, the suggested theoretical outcomes are verified on application problems. It is found that method (3) has the smallest convergence radius for α = 1 . As, the value of α drifts away from one, the convergence radii of the balls increases. This approach is so general and independent of the method that it can be employed on other high convergence order methods including multi-point ones. That will be our future focus. In particular, we will also provide necessary conditions for the semi-local convergence of old and new single and multi-step high convergence order methods.

Author Contributions

Conceptualization, C.I.A., I.K.A., S.R., J.A.J. and J.J.; methodology, C.I.A., I.K.A., S.R., J.A.J. and J.J.; software, C.I.A., I.K.A., S.R., J.A.J. and J.J.; validation, C.I.A., I.K.A., S.R., J.A.J. and J.J.; formal analysis, C.I.A., I.K.A., S.R., J.A.J. and J.J.; investigation, C.I.A., I.K.A., S.R., J.A.J. and J.J.; resources, C.I.A., I.K.A., S.R., J.A.J. and J.J.; data curation, C.I.A., I.K.A., S.R., J.A.J. and J.J.; writing—original draft preparation, C.I.A., I.K.A., S.R., J.A.J. and J.J.; writing—review and editing, C.I.A., I.K.A., S.R., J.A.J. and J.J.; visualization, C.I.A., I.K.A., S.R., J.A.J. and J.J.; supervision, C.I.A., I.K.A., S.R., J.A.J. and J.J.; project administration, C.I.A., I.K.A., S.R., J.A.J. and J.J.; funding acquisition, C.I.A., I.K.A., S.R., J.A.J. and J.J. 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

The following abbreviations are used in this manuscript:
ω , ω 0 Lipschitz constants
L ( U , V ) Set of Linear operators from U to V
{ a n } Scalar sequence

References

  1. Boureghda, A. Numerical solution of the oxygen diffusion problem in cylindrically shaped sections of tissue. Int. J. Numer. Methods Fluids 2008, 56, 1945–1960. [Google Scholar] [CrossRef]
  2. Boureghda, A. A modified variable time step method for solving ice melting problem. J. Differ. Equ. Appl. 2012, 18, 1443–1455. [Google Scholar] [CrossRef]
  3. Djellab, N.; Boureghda, A. A moving boundary model for oxygen diffusion in a sick cell. Comput. Methods Biomech. Biomed. Eng. 2022, 25, 1402–1408. [Google Scholar] [CrossRef] [PubMed]
  4. Sen, S.K.; Agarwal, R.P.; Khattri, S.K. Computational pitfalls of high-order methods for nonlinear equations. J. Appl. Math. Inform. 2012, 30, 395–411. [Google Scholar]
  5. Argyros, I.K. Unified Convergence Criteria for Iterative Banach Space Valued Methods with Applications. Mathematics 2021, 9, 1942. [Google Scholar] [CrossRef]
  6. Grau-Sánchez, M.; Gutiérrez, J.M. Zero-finder methods derived from Obreshkovs techniques. Appl. Math. Comput. 2009, 215, 2992–3001. [Google Scholar]
  7. Liu, T.; Qin, X.; Wang, P. Local Convergence of a Family of Iterative Methods with Sixth and Seventh Order Convergence under Weak Condition. Int. J. Comput. Methods 2019, 16, 1850120. [Google Scholar] [CrossRef]
  8. Magreñán, Á.A. Different anomalies in a Jarratt family of iterative root-finding methods. Appl. Math. Comput. 2014, 233, 29–38. [Google Scholar]
  9. Rheinboldt, W.C. An Adaptive Continuation Process for Solving Systems of Nonlinear Equations; Banach Center: Warsaw, Poland, 1978; Volume 3, pp. 129–142. [Google Scholar]
  10. Amiri, A.; Cordero, A.; Darvishi, M.T.; Torregrosa, J.R. Preserving the order of convergence: Low-complexity Jacobian-free iterative schemes for solving nonlinear systems. J. Comput. Appl. Math. 2018, 337, 87–97. [Google Scholar] [CrossRef]
  11. Amiri, A.; Cordero, A.; Darvishi, M.T.; Torregrosa, J.R. Stability analysis of a parametric family of seventh-order iterative methods for solving nonlinear systems. Appl. Math. Comput. 2018, 323, 43–57. [Google Scholar] [CrossRef]
  12. Argyros, I.K. The Theory and Applications of Iteration Methods, 2nd ed.; Engineering Series; CRC Press, Taylor and Francis Group: Boca Raton, FL, USA, 2022. [Google Scholar]
  13. Cordero, A.; Villalba, E.G.; Torregrosa, J.R.; Triguero-Navarro, P. Convergence and Stability of a Parametric Class of Iterative Schemes for Solving Nonlinear Systems. Mathematics 2021, 9, 86. [Google Scholar] [CrossRef]
  14. Kumar, D.; Sharma, J.R.; Jäntschi, L. Convergence Analysis and Complex Geometry of an Efficient Derivative-Free Iterative Method. Mathematics 2019, 7, 919. [Google Scholar] [CrossRef]
  15. Ortega, J.M.; Rheinholdt, W.C. Iterative Solution of Nonlinear Equations in Several Variables; Academic Press: New York, NY, USA, 1970. [Google Scholar]
  16. Sharma, D.; Parhi, S.K. Extending the Applicability of a Newton-Simpson-Like Method. Int. J. Appl. Comput. Math. 2020, 6, 79. [Google Scholar] [CrossRef]
  17. Sharma, J.R.; Arora, H. Improved Newton-like methods for solving systems of nonlinear equations. SeMA J. 2016, 74, 1–7. [Google Scholar] [CrossRef]
  18. Traub, J.F. Iterative Methods for Solution of Equations; Prentice-Hall: Upper Saddle River, NJ, USA, 1964. [Google Scholar]
Table 1. α = 0.75 .
Table 1. α = 0.75 .
n012345678
ω 0 ( a n ) 00.03808250.04387340.04466440.044770.04478410.0447860.04478620.0447862
a n 00.01857680.02140170.02178750.0218390.02184590.02184680.02184690.0218469
Here, a* = 0.0218469.
Table 2. α = 1 .
Table 2. α = 1 .
n01234567
ω 0 ( a n ) 00.03687430.04099290.04133450.04136150.04136360.04136380.0413638
a n 00.01798750.01999660.02016320.02017640.02017740.02017750.0201775
a* = 0.0201775.
Table 3. α = 1.25 .
Table 3. α = 1.25 .
n01234567
ω 0 ( a n ) 00.03760780.0426540.04314960.04319530.04319940.04319980.0431998
a n 00.01834530.02080680.02104860.02107090.02107290.02107310.0210731
a* = 0.0210731.
Table 4. α = 0.75 .
Table 4. α = 0.75 .
n01234567
ω 0 ( a n ) 00.03667980.04041370.0407270.04075270.04075480.04075490.0407549
a n 00.02350730.02590020.0261010.02611750.02611880.02611890.0261189
a* = 0.0261189.
Table 5. α = 1 .
Table 5. α = 1 .
n01234567
ω 0 ( a n ) 00.03585610.03856030.03870140.03870850.03870890.03870890.0387089
a n 00.02297940.02471240.02480290.02480740.02480760.02480770.0248077
a* = 0.0248077.
Table 6. α = 1.25 .
Table 6. α = 1.25 .
n01234567
ω 0 ( a n ) 00.03635640.03964740.03984550.03985680.03985740.03985750.0398575
a n 00.02330.02540910.02553610.02554330.02554370.02554380.0255438
a* = 0.0255438.
Table 7. α = 0.75 .
Table 7. α = 0.75 .
n012345
ω 0 ( a n ) 00.05915540.06009710.06010840.06010860.0601086
a n 00.00461830.004691820.004692710.004692720.00469272
a* = 0.00469272.
Table 8. α = 1 .
Table 8. α = 1 .
n01234
ω 0 ( a n ) 00.05893390.05963380.05963930.0596394
a n 00.004601010.004655650.004656090.00465609
a* = 0.00465609.
Table 9. α = 1.25 .
Table 9. α = 1.25 .
n012345
ω 0 ( a n ) 00.0590720.05992120.05992870.05992870.0599287
a n 00.004611790.004678090.004678670.004678680.00467868
a* = 0.00467868.
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.; Regmi, S.; John, J.A.; Jayaraman, J. Semi-Local Convergence of a Seventh Order Method with One Parameter for Solving Non-Linear Equations. Foundations 2022, 2, 827-838. https://doi.org/10.3390/foundations2040056

AMA Style

Argyros CI, Argyros IK, Regmi S, John JA, Jayaraman J. Semi-Local Convergence of a Seventh Order Method with One Parameter for Solving Non-Linear Equations. Foundations. 2022; 2(4):827-838. https://doi.org/10.3390/foundations2040056

Chicago/Turabian Style

Argyros, Christopher I., Ioannis K. Argyros, Samundra Regmi, Jinny Ann John, and Jayakumar Jayaraman. 2022. "Semi-Local Convergence of a Seventh Order Method with One Parameter for Solving Non-Linear Equations" Foundations 2, no. 4: 827-838. https://doi.org/10.3390/foundations2040056

Article Metrics

Back to TopTop