Next Article in Journal
BlockCrime: Blockchain and Deep Learning-Based Collaborative Intelligence Framework to Detect Malicious Activities for Public Safety
Previous Article in Journal
Numerical Simulation of Single Droplet Impingement upon Dynamic Liquid Film Obliquely
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Unified Local-Semilocal Convergence Analysis of Efficient Higher Order Iterative Methods in Banach Spaces

by
Janak Raj Sharma
1,
Harmandeep Singh
1 and
Ioannis K. Argyros
2,*
1
Department of Mathematics, Sant Longowal Institute of Engineering and Technology, Longowal 148106, Punjab, India
2
Department of Mathematical Sciences, Cameron University, Lawton, OK 73505, USA
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(17), 3196; https://doi.org/10.3390/math10173196
Submission received: 29 July 2022 / Revised: 24 August 2022 / Accepted: 1 September 2022 / Published: 4 September 2022

Abstract

:
To deal with the estimation of the locally unique solutions of nonlinear systems in Banach spaces, the local as well as semilocal convergence analysis is established for two higher order iterative methods. The given methods do not involve the computation of derivatives of an order higher than one. However, the convergence analysis was carried out in earlier studies by using the assumptions on the higher order derivatives as well. Such types of assumptions limit the applicability of techniques. In this regard, the convergence analysis is developed in the present study by imposing the conditions on first order derivatives only. The central idea for the local analysis is to estimate the bounds on convergence domain as well as the error approximations of the iterates along with the formulation of sufficient conditions for the uniqueness of the solution. Based on the choice of initial estimate in the given domain, the semilocal analysis is established, which ensures the convergence of iterates to a unique solution in that domain. Further, some applied problems are tested to certify the theoretical deductions.

1. Introduction

Solving the problems in many branches of science and engineering, through the process of mathematical modeling, is one of the major challenges in the field of applied mathematics. Under some assumptions, a particular problem is modeled into a nonlinear equation, or more general, a system of nonlinear equations, which can be expressed mathematically as
F ( x ) = 0 ,
where F: D B B 1 is a nonlinear mapping, B and B 1 are Banach spaces, and D is an open convex subset of B . It should be noted, however, that obtaining the analytical or closed form solutions of nonlinear systems is a challenging task. However, iterative methods based on the fixed point theory [1,2,3,4,5] provide the approximate solutions in numerical form up to the desired accuracy. Numerous iterative schemes have been developed in the given context (for example, see [5,6,7,8] and references therein) and further investigated for their convergence behavior in Banach spaces.
As a conventional approach, the convergence order of an iterative scheme is estimated by employing the Taylor series expansions, which involve the set of assumptions on higher order derivatives ( F ( n ) , n = 1 , 2 , . . . ) . Such assumptions certainly limit the applicability of techniques, since most of these involve derivatives only up to the first order. As a matter of fact, consider an example of a real valued function F : D R R , D = [ 0.5 , 1.5 ] , which is defined by
F ( x ) = x 3 ln ( x 2 ) + x 5 x 4 , x 0 , 0 , x = 0 .
Consequently,
F ( x ) = 3 x 2 ln ( x 2 ) + 5 x 4 4 x 3 + 2 x 2 , F ( x ) = 6 x ln ( x 2 ) + 20 x 3 12 x 2 + 10 x ,
and
F ( x ) = 6 ln ( x 2 ) + 60 x 2 24 x + 22 .
Apparently, F ( x ) is unbounded in the given domain D, and therefore, expanding F ( x ) as the Taylor series might not be the suitable approach to analyze the convergence behavior of an iterative technique.
Apart from the convergence order, the convergence behavior of an iterative method is significantly affected by the selection of the initial approximation in the neighborhood of the solution. An iterative scheme is classified as locally convergent if the convergence is bound to happen only in the case of a sufficient proximity of initial estimate to the desired solution, whereas the globally convergent schemes are not affected by the selection of a initial estimate for their convergence. In contrary to the Taylor series approach, in recent times, many authors have investigated the locally convergent techniques by imposing assumptions only on the first order derivatives. The most appropriate methodologies adopted in Banach spaces are local and semilocal convergence analysis [9,10,11,12,13,14,15,16,17,18]. Based on the information around the solution, the local analysis provides the bounds on the convergence domain and the error approximations of iterates along with the set of conditions for the uniqueness of solution in the given domain. On the other hand, the semilocal analysis is concerned about the convergence of an iterative scheme for a given initial estimate, which particularly involves the study of majorizing sequences [9] that are established to further formulate the sufficient conditions for the convergence of iterates. It is important to further discuss the importance as well as the difference between the local and semilocal analysis by stating:
(i)
The local analysis requires information about the solution, whereas the semilocal analysis utilizes information about the initial guess.
(ii)
The local convergence results are crucial to study the convergence behavior, since these results illustrate the degree of difficulty in choosing the initial guesses. However, the semilocal results require the initial guess to be close enough to the solution so that the sequence generated by the given method converges to it.
(iii)
The local as well as semilocal analysis provide knowledge in advance about the number of steps required to achieve the desired error tolerance level. Moreover, these results provide the information about the uniqueness of the solution in the given domain.
From this perspective, we shall investigate the local as well as semilocal convergence of the sixth order iterative techniques, developed by Singh and Sharma [8], which are denoted by ψ 1 and ψ 2 as follows.
Method-1 ( ψ 1 ):
y ( k ) = x ( k ) F ( x ( k ) ) 1 F ( x ( k ) ) , z ( k ) = y ( k ) F ( x ( k ) ) 1 F ( y ( k ) ) , x ( k + 1 ) = z ( k ) ( 3 I 3 T k + T k 2 ) F ( x ( k ) ) 1 F ( z ( k ) ) .
Method-2 ( ψ 2 ):
y ( k ) = x ( k ) + F ( x ( k ) ) 1 F ( x ( k ) ) , z ( k ) = y ( k ) F ( x ( k ) ) 1 F ( y ( k ) ) , x ( k + 1 ) = z ( k ) ( 3 I 3 T k + T k 2 ) F ( x ( k ) ) 1 F ( z ( k ) ) .
Here, T k = F ( x ( k ) ) 1 F ( z ( k ) ) . For any x D B , F ( x ) L ( B , B 1 ) is the first Fréchet derivative [19] of the nonlinear operator defined by (1), where L ( B , B 1 ) stands for the set of bounded linear mappings from B to B 1 . The given methods are investigated thoroughly in [8] for their convergence behavior and computational efficiency along with illustrating the benefits over the existing methods by testing on the variety of applied nonlinear problems. It is evident from the Equations (2) and (3) that both of the methods utilize the computation of derivatives of order only up to one, however, the sixth order convergence is proven in [8] by using the hypotheses on the existence of higher order derivatives. It is worth noticing that the convergence order is determined in [8] only for a special case of B = B 1 = R m , but it is imperative to study the convergence in a more general setting of a Banach space to extend their applicability to a wider section of problems.
Keeping in mind the above discussion, our objective here is to weaken the conditions given in [8], by developing the hypotheses on the first order derivatives only, which undoubtedly extends the applicability of the considered iterative schemes. In what follows, the local convergence analysis for both the methods is established in Section 2, and further, the semilocal analysis is developed in Section 3 by imposing conditions on the operators involved in the given methods. Some numerical applications are given in Section 4 to validate the theoretical deductions. Section 5 contains the concluding remarks.

2. Local Convergence Analysis

In this section, the local convergence analysis shall be developed for iterative methods ψ 1 and ψ 2 , which are defined by Equation (2) and Equation (3), respectively. To establish the local convergence analysis of ψ 1 , we first define some real parameters and functions. For M = [ 0 , ), let the following suppositions (i–iv) hold.
(i)
There exists a function p 0 : M M , which is non-decreasing and continuous, such that the equation
p 0 ( t ) 1 = 0 ,
has the smallest root ρ 0 M { 0 } . Set M 0 = [ 0 , ρ 0 ).
(ii)
There exists a function p : M 0 M , which is non-decreasing and continuous, such that the equation
h 1 ( t ) 1 = 0 ,
has the smallest root ρ 1 M 0 { 0 } , where h 1 : M 0 R is defined as
h 1 ( t ) = 0 1 p ( ( 1 θ ) t ) d θ 1 p 0 ( t ) .
(iii)
The equation
h 2 ( t ) 1 = 0 ,
has the smallest root ρ 2 M 0 { 0 } , where h 2 : M 0 R is defined as
h 2 ( t ) = 0 1 p ( t + θ h 1 ( t ) t ) d θ 1 p 0 ( t ) h 1 ( t ) .
(iv)
The equation
h 3 ( t ) 1 = 0 ,
has the smallest root ρ 3 M 0 { 0 } , where h 3 : M 0 R is defined as
h 3 ( t ) = 0 1 p ( t + θ h 2 ( t ) t ) d θ 1 p 0 ( t ) + p 0 ( h 2 ( t ) t ) + p 0 ( t ) 1 p 0 ( t ) + p 0 ( h 2 ( t ) t ) + p 0 ( t ) 1 p 0 ( t ) 2 × 1 + 0 1 p 0 ( θ h 2 ( t ) t ) d θ 1 p 0 ( t ) h 2 ( t ) .
We shall aim to prove that
ρ = min { ρ 1 , ρ 2 , ρ 3 } ,
is the convergence radius for the method ψ 1 . Setting M = [ 0 , ρ ) , and by the definition of ρ , we have for all t M ,
0 p 0 ( t ) < 1 ,
0 h i ( t ) < 1 ,
for each i = 1 , 2 , 3 .
For any x D , let us denote S [ x , r ] as the closure of an open ball S ( x , r ) , having radius equal to ‘r’. Before we proceed to the main result, it is required that the following conditions ( C 1 ) ( C 4 ) hold.
( C 1 ) :
The equation F ( x ) = 0 has a solution x D , such that the inverse operator F ( x ) 1 L ( B 1 , B ) .
( C 2 ) :
For each v D ,
F ( x ) 1 ( F ( v ) F ( x ) ) p 0 ( v x ) .
Let D 1 = S ( x , ρ 0 ) D .
( C 3 ) :
For each v 1 , v 2 D 1 ,
F ( x ) 1 ( F ( v 1 ) F ( v 2 ) ) p ( v 1 v 2 ) .
( C 4 ) :
S [ x , ρ ] D .
Next, the local convergence analysis is developed for method ψ 1 using the conditions ( C 1 )–( C 4 ).
Theorem 1.
Under the conditions ( C 1 ) ( C 4 ) and further choosing the initial estimate x ( 0 ) S ( x , ρ ) { x } for the iterative method defined by Equation (2), the following assertions hold:
x ( k ) S ( x , ρ ) , k = 0 , 1 , 2 , ,
y ( k ) x h 1 ( x ( k ) x ) x ( k ) x < x ( k ) x < ρ ,
z ( k ) x h 2 ( x ( k ) x ) x ( k ) x < x ( k ) x ,
x ( k + 1 ) x h 3 ( x ( k ) x ) x ( k ) x < x ( k ) x ,
and
lim k x ( k ) = x ,
where the functions h 1 , h 2 and h 3 are defined previously, and ρ is defined in Equation (4).
Proof. 
Assertions (7)–(10) shall be shown using the mathematical induction on ‘k’. Let us choose an arbitrary point u S ( x , ρ ) { x } . In view of (4) and (5), and the condition ( C 1 ) , we have in turn that
F ( x ) 1 ( F ( u ) F ( x ) ) p 0 ( u x ) p 0 ( ρ ) < 1 .
The Banach lemma [19] on the invertible linear operators, together with Equation (11), imply that F ( u ) 1 L ( B 1 , B ) and
| | F ( u ) 1 F ( x ) | | 1 1 p 0 ( | | u x | | ) .
Therefore, the iterates y ( 0 ) , z ( 0 ) and x ( 1 ) , of the technique ψ 1 , are well defined by (12) for u = x ( 0 ) . Then, we obtain
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 ( 0 ) ) F ( x + θ ( x ( 0 ) x ) ) ( x ( 0 ) x ) d θ .
Using Equations (4), (6) and (12) (for u = x ( 0 ) ), and condition ( C 2 ) , the following estimate is obtained from Equation (13),
y ( 0 ) x 0 1 p ( ( 1 θ ) x ( 0 ) x ) d θ 1 p 0 ( x ( 0 ) x ) x ( 0 ) x h 1 ( x ( 0 ) x ) x ( 0 ) x < x ( 0 ) x < ρ ,
which proves that the iterate y ( 0 ) S ( x , ρ ) , and therefore, assertion (8) holds for k = 0 . Further, using the second sub-step of method ψ 1 for k = 0 , we can write
z ( 0 ) x = y ( 0 ) x F ( x ( 0 ) ) 1 F ( y ( 0 ) ) = F ( x ( 0 ) ) 1 F ( x ( 0 ) ) 0 1 F ( x + θ ( y ( 0 ) x ) ) d θ ( y ( 0 ) x ) .
Then, by Equations (4), (6) and (14), and condition ( C 2 ) , the Equation (15) yields the following estimate,
z ( 0 ) x 0 1 p ( x ( 0 ) x + θ y ( 0 ) x ) d θ 1 p 0 ( x ( 0 ) x ) y ( 0 ) x h 2 ( x ( 0 ) x ) x ( 0 ) x < x ( 0 ) x ,
which means that the iterate z ( 0 ) S ( x , ρ ) and the assertion (9) is true for k = 0 .
Furthermore, by the third sub-step of ψ 1 for k = 0 , we have
x ( 1 ) x = z ( 0 ) x F ( x ( 0 ) ) 1 F ( z ( 0 ) ) F ( x ( 0 ) ) 1 ( F ( x ( 0 ) ) F ( z ( 0 ) ) ) × I + F ( x ( 0 ) ) 1 ( F ( x ( 0 ) ) F ( z ( 0 ) ) ) F ( x ( 0 ) ) 1 F ( z ( 0 ) ) ,
and then using the approximation
F ( x ) 1 F ( z ( 0 ) ) 0 1 F ( x ) 1 F ( x + θ ( z ( 0 ) x ) ) z ( 0 ) x d θ 0 1 I + F ( x ) 1 ( F ( x + θ ( z ( 0 ) x ) ) F ( x ) ) z ( 0 ) x d θ 1 + 0 1 p 0 ( θ z ( 0 ) x ) d θ z ( 0 ) x ,
the following estimate is obtained,
x ( 1 ) x [ 0 1 p ( x ( 0 ) x + θ z ( 0 ) x ) d θ 1 p 0 ( x ( 0 ) x ) + p 0 ( x ( 0 ) x ) + p 0 ( z ( 0 ) x ) 1 p 0 ( x ( 0 ) x ) × 1 + p 0 ( x ( 0 ) x ) + p 0 ( z ( 0 ) x ) 1 p 0 ( x ( 0 ) x ) 1 + 0 1 p 0 ( θ z ( 0 ) x ) d θ 1 p 0 ( x ( 0 ) x ) ] × z ( 0 ) x h 3 ( x 0 x ) x 0 x < x 0 x < ρ ,
which proves that the iterate x ( 1 ) S ( x , ρ ) , and the assertion (10) holds for k = 0 . The induction process on ‘k’, for the estimates (8), (9) and (10), is terminated if x ( 0 ) , y ( 0 ) and x ( 1 ) are replaced by x ( k ) , y ( k ) and x ( k + 1 ) , respectively. Moreover, in view of the estimate
x ( k + 1 ) x < β x ( k ) x < ρ ,
where β = h 3 ( | | x ( 0 ) x | | ) [ 0 , 1 ) , we eventually have that x ( k + 1 ) S ( x , ρ ) for all k N , and lim k x ( k ) = x . □
Further, we claim the uniqueness of solution through the following proposition.
Proposition 1.
Assume that:
(i)
The equation F ( x ) = 0 has a solution x S ( x , ρ ¯ ) D for some ρ ¯ > 0 .
(ii)
The conditions ( C 1 ) and ( C 2 ) hold on S ( x , ρ ¯ ) .
(iii)
There exists ρ ˜ ρ ¯ , such that
0 1 p 0 ( θ ρ ˜ ) d θ < 1 .
Let D 2 = S [ x , ρ ˜ ] D . Then, the equation F ( x ) = 0 is uniquely solvable by x in the region D 2 .
Proof. 
Suppose y D 2 solves F ( x ) = 0 . Define the linear operator
H = 0 1 F ( x + θ ( y x ) ) d θ .
By applying the given conditions (i)–(iii), we obtain in turn that
F ( x ) 1 ( H F ( x ) ) 0 1 p 0 ( θ y x ) d θ 0 1 p 0 ( θ ρ ˜ ) d θ < 1 .
Hence x = y follows from H 1 L ( B 1 , B ) and H ( y x ) = F ( y ) F ( x ) = 0 . □
Remark 1.
The conditions ( C 3 ) and ( C 4 ) are not used in Proposition 1, otherwise we can set ρ ¯ = ρ .
In what follows, the local convergence analysis of iterative technique ψ 2 , which is defined by Equation (3), and is shown along the same lines of the analysis of method ψ 1 but with a couple of modifications in the definitions of function h 1 and convergence radius. The function h 1 is re-defined as
h ¯ 1 ( t ) = 0 1 p ( ( 1 θ ) t ) d θ + 2 1 + 0 1 p 0 ( θ t ) d θ 1 p 0 ( t ) .
Set r = min { r 2 , r 3 } and R = max { r , h ¯ 1 ( r ) r } , where r 2 and r 3 are defined as the smallest zeros of functions h 2 and h 3 , respectively. Moreover, instead of ( C 4 ) , we also assume the following condition,
( C 4 ) : S [ x , r ] D .
Finally, we arrive at the corresponding result for the local convergence of ψ 2 .
Theorem 2.
Under the conditions ( C 1 ) ( C 3 ) and ( C 4 ) , choose x ( 0 ) S ( x , r ) x . Then, lim k x ( k ) = x , where the sequence { x ( k ) } k 1 is generated by the method defined by Equation (3). Moreover, the following assertions hold:
x ( k ) S ( x , r ) k = 0 , 1 , 2 , , y ( k ) x h ¯ 1 ( x ( k ) x ) x ( k ) x R , z ( k ) x h 2 ( x ( k ) x ) x ( k ) x < x ( k ) x , x ( k + 1 ) x h 3 ( x ( k ) x ) x ( k ) x < x ( k ) x .
Further, the uniqueness result of Proposition 1 holds for the given method.
Proof. 
We simply need to provide the derivation of the estimate involving the new function h ¯ 1 ( t ) . With the definition given by Equation (19), the following estimate is obtained for the first sub-step of method ψ 2 ,
y ( 0 ) x = x ( 0 ) x F ( x ( 0 ) ) 1 F ( x ( 0 ) ) + 2 F ( x ( 0 ) ) 1 F ( x ( 0 ) ) 0 1 p ( ( 1 θ ) x ( 0 ) x ) d θ + 2 1 + 0 1 p 0 ( θ x ( 0 ) x ) d θ 1 p 0 ( x ( 0 ) x ) x ( 0 ) x h ¯ 1 ( x ( 0 ) x ) x ( 0 ) x h ¯ 1 ( r ) r R .
The derivation for the rest of assertions, being identical as presented in Theorem 1, are omitted. □
Remark 2.
It is worth noticing that the methodology in this section provides the computable error estimates on x ( k ) x and the uniqueness results for both the techniques, which are not given in the previous studies [8].

3. Semilocal Convergence Analysis

In this section, the semilocal convergence analysis is established for the iterative methods ψ 1 and ψ 2 . To start with, let M = [ 0 , ) and assume that the following conditions hold.
(i)
There exists a function q 0 : M M , which is non-decreasing and continuous such that the function q 0 ( t ) 1 has the smallest zero r 0 M { 0 } . Let M 1 = [ 0 , r 0 ) .
(ii)
There exists a function q : M 1 M , which is continuous and non-decreasing.
Then, define the scalar sequences { t ( k ) } , { s ( k ) } and { u ( k ) } for all k = 0 , 1 , 2 , , such that t ( 0 ) = 0 , s ( 0 ) = d for some d 0 , and
u ( k ) = s ( k ) + 0 1 q ( θ ( s ( k ) t ( k ) ) ) d θ 1 q 0 ( t ( k ) ) ( s ( k ) t ( k ) ) , t ( k + 1 ) = u ( k ) + 3 ( q 0 ( t ( k ) ) + q 0 ( u ( k ) ) ) ( 1 q 0 ( t ( k ) ) ) 2 + ( 1 + q 0 ( u ( k ) ) ) 2 ( 1 q 0 ( t ( k ) ) ) 3
× 0 1 q ( s ( k ) t ( k ) + θ ( u ( k ) s ( k ) ) ) d θ ( u ( k ) s ( k ) ) , s ( k + 1 ) = t ( k + 1 ) + 1 1 q 0 ( t ( k + 1 ) ) 1 + q 0 ( u ( k ) ) + 0 1 q ( θ ( t ( k + 1 ) u ( k ) ) ) d θ ( t ( k + 1 ) u ( k ) )
+ 0 1 q ( s ( k ) t ( k ) + θ ( u ( k ) s ( k ) ) ) d θ ( u ( k ) s ( k ) ) .
In what follows, the sequences defined by Equations (20)–(22) are shown to be the majorizing for the sequence of iterates generated by technique ψ 1 . Let us recall the definition of the majorizing sequence [9].
Definition 1.
Let { x ( k ) } k 0 be a sequence in a normed linear space and { γ ( k ) } k 0 be a non-negative scalar sequence, then { γ ( k ) } is called the majorizing sequence of { x ( k ) } , if
x ( k + 1 ) x ( k ) γ ( k + 1 ) γ ( k ) , f o r e a c h k = 0 , 1 , 2 , .
It follows by the above definition that the sequence { γ ( k ) } is non-decreasing. Moreover, if it is bounded above by some γ ¯ 0 , then it is convergent to some γ [ 0 , γ ¯ ] . Furthermore, if the normed linear space is complete, it follows that the sequence { x ( k ) } is also convergent to some x and
x x ( k ) γ γ ( k ) , for each k = 0 , 1 , 2 , .
This definition plays a crucial part in the convergence analysis of iterative methods. Before proceeding to the main theorem, let us first show a general convergence result through the following Lemma.
Lemma 1.
For all k = 0 , 1 , 2 , , assume that:
q 0 ( t ( k ) ) < 1 ,
and
t ( k ) r ¯ 0 , f o r s o m e r ¯ 0 r 0 .
Then, the sequence { t ( k ) } is convergent monotonically to its unique least upper bound t [ 0 , r ¯ 0 ] .
Proof. 
It follows by the definition of sequence { t ( k ) } and the conditions given by Equations (23) and (24) that it is non-decreasing and bounded above by r ¯ 0 . Hence, it will converge to its unique least upper bound t . □
Remark 3.
By the definitions of sequences given in Equations (20)–(22), and as a consequence of Lemma 1, it follows that t ( k ) s ( k ) u ( k ) t ( k + 1 ) r ¯ 0 for each k = 0 , 1 , 2 , .
The conditions used in the semilocal convergence analysis of method ψ 1 are as follows. Assume that:
( H 1 ) :
There exists a point x ( 0 ) D such that F ( x ( 0 ) ) 1 L ( B 1 , B ) and
F ( x ( 0 ) ) 1 F ( x ( 0 ) ) d .
( H 2 ) :
For each v D ,
F ( x ( 0 ) ) 1 ( F ( v ) F ( x ( 0 ) ) ) q 0 ( v x ( 0 ) ) .
Let D 3 = S ( x ( 0 ) , r 0 ) D .
( H 3 ) :
For each v 1 , v 2 D 3 ,
F ( x ( 0 ) ) 1 ( F ( v 1 ) F ( v 2 ) ) q ( v 1 v 2 ) .
( H 4 ) :
Conditions of Lemma 1 hold.
( H 5 ) :
S [ x ( 0 ) , t ] D .
The semilocal convergence of method ψ 1 is as follows using the conditions ( H 1 ) ( H 5 ) and the developed notation.
Theorem 3.
Assume that the conditions ( H 1 ) ( H 5 ) hold. Then, the following assertions hold for the sequences generated by the method defined by Equation (2).
x ( k ) S ( x ( 0 ) , t ) k = 0 , 1 , 2 , ,
y ( k ) x ( k ) s ( k ) t ( k ) ,
z ( k ) y ( k ) u ( k ) s ( k ) ,
x ( k + 1 ) z ( k ) t ( k + 1 ) u ( k ) ,
and further, lim k x ( k ) = x S [ x ( 0 ) , t ] , such that F ( x ) = 0 .
Proof. 
To show the assertions (25)–(28), the process of mathematical induction is used. Let v S ( x ( 0 ) , t ) be arbitrary, then by applying the conditions ( H 1 ) and ( H 2 ) , we have
F ( x ( 0 ) ) 1 ( F ( v ) F ( x ( 0 ) ) ) q 0 ( v x ( 0 ) ) q 0 ( t ) < 1 ,
and therefore
| | F ( v ) 1 F ( x ( 0 ) ) | | 1 1 q 0 ( | | v x ( 0 ) | | ) .
It follows by condition ( H 1 ) and Equation (29) (for v = x ( 0 ) ) that the iterates y ( 0 ) , z ( 0 ) and x ( 1 ) are well defined for the method ψ 1 . In view of the first sub-step of ψ 1 , we have
y ( 0 ) x ( 0 ) = F ( x ( 0 ) ) 1 F ( x ( 0 ) ) d = s ( 0 ) t ( 0 ) < t .
So, the iterate y ( 0 ) S ( x ( 0 ) , t ) and the estimate (26) holds for k = 0 . Further, the second sub-step of ψ 1 along with the definition of sequence { t ( k ) } yields
z ( 0 ) y ( 0 ) = F ( x ( 0 ) ) 1 F ( y ( 0 ) ) = F ( x ( 0 ) ) 1 ( F ( y ( 0 ) ) F ( x ( 0 ) ) F ( x ( 0 ) ) ( y ( 0 ) x ( 0 ) ) ) 0 1 q ( θ y ( 0 ) x ( 0 ) ) d θ 1 q 0 ( x ( 0 ) x ( 0 ) ) y ( 0 ) x ( 0 ) u ( 0 ) s ( 0 ) ,
and therefore
z ( 0 ) x ( 0 ) = z ( 0 ) y ( 0 ) + y ( 0 ) x ( 0 ) u ( 0 ) s ( 0 ) + s ( 0 ) t ( 0 ) < t .
Thus, the iterate z ( 0 ) S ( x ( 0 ) , t ) and the estimate (27) holds for k = 0 .
Then, by the third sub-step of ψ 1 , we obtain in turn that
x ( 1 ) z ( 0 ) 3 I F ( x ( 0 ) ) 1 F ( z ( 0 ) ) + F ( x ( 0 ) ) 1 F ( z ( 0 ) ) 2 F ( x ( 0 ) ) 1 F ( z ( 0 ) ) 3 I F ( x ( 0 ) ) 1 F ( z ( 0 ) ) + F ( x ( 0 ) ) 1 F ( z ( 0 ) ) 2 × F ( x ( 0 ) ) 1 ( F ( z ( 0 ) ) F ( y ( 0 ) ) F ( x ( 0 ) ) ( z ( 0 ) y ( 0 ) ) ) 3 ( q 0 ( x ( 0 ) x ( 0 ) ) + q 0 ( z ( 0 ) x ( 0 ) ) ) ( 1 q 0 ( x ( 0 ) x ( 0 ) ) ) 2 + ( 1 + q 0 ( z ( 0 ) x ( 0 ) ) ) 2 ( 1 q 0 ( x ( 0 ) x ( 0 ) ) ) 3 × 0 1 q ( y ( 0 ) x ( 0 ) + θ z ( 0 ) y ( 0 ) ) d θ z ( 0 ) y ( 0 ) t ( 1 ) u ( 0 ) ,
and consequently
x ( 1 ) x ( 0 ) = x ( 1 ) z ( 0 ) + z ( 0 ) x ( 0 ) t ( 1 ) u ( 0 ) + u ( 0 ) t ( 0 ) < t .
Therefore, the iterate x ( 1 ) S ( x ( 0 ) , t ) and the estimate (28) holds for k = 0 . Now, by the first sub-step of method ψ 1 for k = 1 , the following estimate is obtained,
y ( 1 ) x ( 1 ) F ( x ( 1 ) ) 1 F ( x ( 0 ) ) F ( x ( 0 ) ) 1 F ( x ( 1 ) ) F ( x ( 1 ) ) 1 F ( x ( 0 ) ) F ( x ( 0 ) ) 1 ( F ( x ( 1 ) ) F ( z ( 0 ) ) + F ( z ( 0 ) ) ) 1 1 q 0 ( x ( 1 ) x ( 0 ) ) 1 + q 0 ( z ( 0 ) x ( 0 ) ) + 0 1 q ( θ x ( 1 ) z ( 0 ) ) d θ × x ( 1 ) z ( 0 ) + 0 1 q ( y ( 0 ) x ( 0 ) + θ z ( 0 ) y ( 0 ) ) d θ z ( 0 ) y ( 0 ) s ( 1 ) t ( 1 ) ,
and consequently
y ( 1 ) x ( 0 ) = y ( 1 ) x ( 1 ) + x ( 1 ) x ( 0 ) s ( 1 ) t ( 1 ) + t ( 1 ) t ( 0 ) < t .
Hence, the iterate y ( 1 ) S ( x ( 0 ) , t ) and the estimate (26) holds for k = 1 . By repeating the previous calculations but switching x ( 0 ) , y ( 0 ) , z ( 0 ) and x ( 1 ) by x ( k ) , y ( k ) , z ( k ) and x ( k + 1 ) , the induction process is completed for the assertions (25)–(28). In particular, we have the estimate
F ( x ( 0 ) ) 1 F ( x ( k ) ) 1 + q 0 ( u ( k ) ) + 0 1 q ( θ ( t ( k + 1 ) u ( k ) ) ) d θ ( t ( k + 1 ) u ( k ) ) + 0 1 q ( s ( k ) t ( k ) + θ ( u ( k ) s ( k ) ) ) d θ ( u ( k ) s ( k ) ) .
Since the sequence { t ( k ) } is convergent by condition ( H 4 ) , and the sequence { x ( k ) } is fundamental in the Banach space, so there exists x S ( x ( 0 ) , t ) , such that lim k x ( k ) = x . Finally, letting k in the estimate (30) and using the continuity of operator F, we conclude that F ( x ) = 0 . □
The uniqueness result follows from the following proposition.
Proposition 2.
Assume that:
(i)
The equation F ( x ) = 0 has a solution x S ( x ( 0 ) , t ¯ ) D for some t ¯ > 0 and F ( x ( 0 ) ) 1 L ( B 1 , B ) .
(ii)
The conditions ( H 1 ) and ( H 2 ) hold.
(iii)
There exists t ˜ t ¯ , such that
0 1 q 0 ( θ t ˜ + ( 1 θ ) t ¯ ) d θ < 1 .
Let D 4 = S [ x ( 0 ) , t ˜ ] D . Then, x solves uniquely the equation F ( x ) = 0 in the region D 4 .
Proof. 
Consider y D 4 with F ( y ) = 0 , and let the operator H be defined as in Proposition 1. By applying the conditions ( H 1 ) , ( H 2 ) , and using Equation (31), we obtain
F ( x ( 0 ) ) 1 ( H F ( x ( 0 ) ) ) 0 1 q 0 ( θ y x ( 0 ) + ( 1 θ ) x x ( 0 ) ) d θ 0 1 q 0 ( θ t ˜ + ( 1 θ ) t ¯ ) d θ < 1 .
Thus, we deduce that x = y . □
Remark 4.
The limit point t can be replaced in the condition ( H 4 ) by the point r 0 .
Remark 5.
The semilocal convergence analysis of the iterative technique ψ 2 is given analogously to the analysis of technique ψ 1 but re-defining the sequence { u ( k ) } by
u ( k ) = t ( k ) + 1 + q 0 ( t ( k ) ) + 0 1 q ( θ ( s ( k ) t ( k ) ) ) d θ 1 q 0 ( t ( k ) ) ( s ( k ) t ( k ) ) .
The definition of sequences { t ( k ) } and { s ( k ) } are same as given by Equations (21) and (22), respectively. The results of Lemma 1, Theorem 3, Proposition 2 and Remark 4 also hold for the analysis of method ψ 2 . However, note that the estimate (27) is reformulated as
z ( k ) x ( k ) u ( k ) t ( k ) ,
wherein z ( 0 ) S ( x ( 0 ) , t ) by the definition (32) and due to the following estimate,
z ( 0 ) x ( 0 ) = F ( x ( 0 ) ) 1 ( F ( y ( 0 ) ) F ( x ( 0 ) ) ) 1 + q 0 ( x ( 0 ) x ( 0 ) ) + 0 1 q ( θ y ( 0 ) x ( 0 ) ) d θ 1 q 0 ( x ( 0 ) x ( 0 ) ) y ( 0 ) x ( 0 ) u ( 0 ) t ( 0 ) < t .

4. Numerical Results

In coherence with the theoretical results, we provide here the parameters and functions, defined in Section 2 and Section 3, for each of the following numerical examples.
Example 1.
Consider the domain R m , for any integer m 2 , which is equipped with the norm, x = max 1 i m | x i | for each x = ( x 1 , , x m ) T R m and the corresponding matrix norm is given by A = max 1 i m j = 1 m | a i j | for any A = ( a i j ) 1 i , j m L ( R m ) . Define the two-point boundary value problem on the closed interval [ 0 , 1 ] as
x ( t ) = x ( t ) 2 , x ( 0 ) = x ( 1 ) = 0 .
To transform the given equation into a finite dimensional problem, consider the uniform partitioning of interval [ 0 , 1 ] having a sub-interval length h = 1 / k as
0 = t 0 < t 1 < t 2 < < t k 1 < t k = 1 .
Denoting x i = x ( t i ) for each i, and using the following divided difference approximations:
x i x i + 1 2 x i + x i 1 h 2 , f o r e a c h i = 1 , 2 , , k 1 ,
the Equation (33) reduces into the system of nonlinear equations, F : D R k 1 R k 1 , which is given by
x i + 1 2 x i + h 2 x i 2 + x i 1 = 0 , i = 1 , 2 , , k 1 ,
where x 0 = x k = 0 . The Fréchet derivative at any point x = ( x 1 , , x k 1 ) T D is given by
F ( x ) = 2 h 2 x 1 2 1 0 0 1 2 h 2 x 2 2 1 0 0 1 2 h 2 x 3 2 0 0 0 0 2 h 2 x k 1 2 .
To estimate the parameters defined in the Section 2 and Section 3, we take k = 26 in particular so that the system (34) reduces to a system of 25 equations satisfying the solution x = ( 0 , 25 , 0 ) T . Further, considering the domain as an open ball, D = S ( x , c ) for some positive constant c, we select the initial estimate as x ( 0 ) = ( 1 2 , 25 , 1 2 ) T D . Then, for any x , y D , we can obtain that
F ( x ) 1 ( F ( x ) F ( y ) ) L 0 x y ,
and
F ( x ( 0 ) ) 1 ( F ( x ) F ( y ) ) L 1 x y ,
where L 0 = 0.25 and L 1 = 0.27903 . Moreover,
F ( x ( 0 ) ) 1 F ( x ( 0 ) ) L 2 ,
where L 2 = 0.53488 .
In view of the above approximations, the parameters defined in Section 2 under conditions ( C 1 ) ( C 4 ) for the local convergence analysis are chosen as
p 0 ( t ) = L 0 t , p ( t ) = L 0 t ,
and consequently for the method ψ 1 ,
ρ = min { ρ 1 , ρ 2 , ρ 3 } = min { 2.6667 , 2.2112 , 1.6232 } = 1.6232 ,
whereas for the method ψ 2 ,
r = min { r 2 , r 3 } = min { 0.57629 , 0.60542 } = 0.57629 .
Moreover, the parameters defined in Section 3 under conditions ( H 1 ) ( H 5 ) for the semilocal convergence analysis are chosen as
q 0 ( t ) = L 1 t , q ( t ) = L 1 t , a n d d = L 2 ,
and consequently, we obtain the majorizing sequence { t ( k ) } for method ψ 1 as
{ t k } k 1 = { 0.58608 , 0.60925 , 0.60925 , } ,
which converges to t 0.60926 < r 0 = 3.58389 , whereas for method ψ 2 , the sequence is obtained as
{ t k } k 1 = { 0.58608 , 0.61853 , 0.61919 , } ,
which converges to t 0.61919 < r 0 = 3.58389 . It can be easily verified from the above estimations that the conditions of Section 2 and Section 3 hold for each of the methods for the considered example.
Example 2.
Let C [ 0 , 1 ] represents the space of continuous functions defined on the domain as closed unit interval [ 0 , 1 ] and equipped with the norm x = sup 0 t 1 | x ( t ) | for each x C [ 0 , 1 ] . Let D = { x C [ 0 , 1 ] | x < 1 } and define the nonlinear mapping (see [12]) F : D C [ 0 , 1 ] as
F ( x ) ( t ) = x ( t ) μ 0 1 κ ( s , t ) x ( s ) 3 d s , t [ 0 , 1 ] , x D ,
where μ R is a parameter, and the kernel κ ( s , t ) is defined as
κ ( s , t ) = ( 1 s ) t , t s , ( 1 t ) s , s t ,
which satisfies the following approximation,
0 1 κ ( s , t ) d s 1 8 .
Moreover, the Fréchet derivative of the mapping (35) is given by
F ( x ) ξ ( t ) = ξ ( t ) 3 μ 0 1 κ ( s , t ) x ( s ) 2 ξ ( s ) d s , ξ D .
Note that x = 0 is the solution of (35), which also satisfies that F ( x ) = I . Then, for any x , y D , we have the following approximation,
F ( x ) 1 ( F ( x ) F ( y ) ) 3 | μ | 0 1 κ ( s , t ) x ( s ) 2 y ( s ) 2 ξ ( s ) d s L 0 x y ,
where L 0 = 3 | μ | 4 . Moreover, for the initial approximation x ( 0 ) D which is defined as x ( 0 ) ( t ) = t 2 , t [ 0 , 1 ] , and using the estimation
I F ( x ( 0 ) ) 3 | μ | 0 1 κ ( s , t ) x ( 0 ) ( s ) 2 ξ ( s ) d s 3 | μ | 32 ,
it is obtained that F ( x ( 0 ) ) 1 32 32 3 | μ | , provided | μ | < 32 3 . Therefore, for any x , y D , we have obtained that
F ( x ( 0 ) ) 1 ( F ( x ) F ( y ) ) L 1 x y ,
and
F ( x ( 0 ) ) 1 F ( x ( 0 ) ) L 2 ,
where L 1 = 24 | μ | 32 3 | μ | and L 2 = 1 + | μ | 32 16 32 3 μ .
We particularly set μ = 1 2 , in above approximations, for the estimation of parameters defined in Section 2 and Section 3. The parameters used in the conditions ( C 1 ) ( C 4 ) are defined as
p 0 ( t ) = L 0 t , p ( t ) = L 0 t ,
and therefore, for the convergence of method ψ 1 , we have
ρ = min { ρ 1 , ρ 2 , ρ 3 } = min { 1.7778 , 1.4741 , 1.0821 } = 1.0821 ,
whereas for the method ψ 2 ,
r = min { r 2 , r 3 } = min { 0.38419 , 0.40362 } = 0.38419 .
Further, the parameters defined in the conditions ( H 1 ) ( H 5 ) are chosen as
q 0 ( t ) = L 1 t , q ( t ) = L 1 t , a n d d = L 2 ,
and consequently, we obtain the majorizing sequence { t ( k ) } for method ψ 1 as
{ t k } k 1 = { 0.61587 , 0.67771 , 0.67799 , } ,
which converges to t 0.678 < r 0 = 2.54167 , whereas for method ψ 2 , the sequence is given by
{ t k } k 1 = { 0.61587 , 0.72464 , 0.75542 , } ,
which converges to t 0.75913 < r 0 = 2.54167 . With these estimations, the conditions of Section 2 and Section 3 hold for both the considered methods.
Example 3.
Now consider a nonlinear equation due to Kepler [20]:
F ( x ) = x β sin ( x ) μ = 0 ,
where 0 β < 1 and 0 μ π . Different choices for the values of β and μ are given in [20]. In particular, for β = 1 4 and μ = 1 10 , the approximate solution of (36) is given as, x 0.13320215 . Let D = S ( x , c ) , where c is a positive constant, such that the initial approximation x ( 0 ) = 3 4 D . Moreover, we have
F ( x ) = 1 β cos ( x ) .
Thus, for any x , y D , we have the following approximation,
| F ( x ) 1 ( F ( x ) F ( y ) ) | = | β ( cos ( x ) cos ( y ) ) | | 1 β cos ( x ) | = 2 | β | | sin ( x + y 2 ) sin ( x y 2 ) | | 1 β cos ( x ) | L 0 | x y | ,
and similarly
| F ( x ( 0 ) ) 1 ( F ( x ) F ( y ) ) | L 1 | x y | ,
where L 0 = | β | | 1 β cos ( x ) | 0.332352 and L 1 = | β | | 1 β cos ( x ( 0 ) ) | 0.305968 . moreover,
| F ( x ( 0 ) ) 1 F ( x ( 0 ) ) | = | x ( 0 ) β sin ( x ( 0 ) ) μ | | 1 β cos ( x ( 0 ) ) | = L 2 ,
where L 2 0.586958 .
The above approximations lead to the estimation of parameters used in the conditions of Section 2 as well as the conditions of Section 3. The parameters used in conditions ( C 1 ) ( C 4 ) are given as
p 0 ( t ) = L 0 t , p ( t ) = L 0 t ,
and consequently for the method ψ 1 , we have
ρ = min { ρ 1 , ρ 2 , ρ 3 } = min { 2.0059 , 1.6633 , 1.2210 } = 1.2210 ,
whereas for the convergence of method ψ 2 ,
r = min { r 2 , r 3 } = min { 0.43350 , 0.45541 } = 0.43350 .
Moreover, the parameters defined in the conditions ( H 1 ) ( H 5 ) are chosen as
q 0 ( t ) = L 1 t , q ( t ) = L 1 t , a n d d = L 2 ,
and consequently, the majorizing sequence { t ( k ) } for method ψ 1 is obtained as
{ t k } k 1 = { 0.65961 , 0.70232 , 0.70236 , } ,
which converges to t 0.70237 < r 0 = 3.26831 , whereas the sequence for method ψ 2 is given by
{ t k } k 1 = { 0.65961 , 0.72546 , 0.73050 , } ,
which converges to t 0.73054 < r 0 = 3.26831 .

5. Conclusions

Two sixth-order iterative techniques are analyzed comprehensively for their local as well semilocal convergence in Banach Spaces. On the contrary to the usual approach using Taylor series expansions, the generalized results for their convergence are established using the assumptions only on first order derivatives. The presented analysis provides a new avenue for the study of the convergence of iterative methods, since it is based only on the operators involved in the given iterative methods. However, the earlier studies make use of the higher order derivatives, which are not appearing in the given methods and, in fact, these higher order derivatives may not even always exist. Thus, the previous results do not assure the convergence of these methods, although convergence may happen. Effectively, the applicability of given methods is extended to the wider section of problems. Further, testing the developed results on some applied problems satisfactorily favor the presented analysis. An important observation is that the technique, which is utilized in the analysis, can also be applied in general to the other methods in order to extend their applicability in a similar way. Furthermore, as a future work, the applicability of given iterative methods can be investigated for the solution of problems considered in [21,22,23].

Author Contributions

The contributions of all authors have been similar. All of them worked together to develop the present manuscript. 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. Debnath, P.; Konwar, N.; Radenovic, S. Metric Fixed Point Theory: Applications in Science, Engineering and Behavioural Sciences; Springer: Singapore, 2021. [Google Scholar]
  2. Debnath, P.; Srivastava, H.M.; Kumam, P.; Hazarika, B. Fixed Point Theory and Fractional Calculus: Recent Advances and Applications; Springer: Singapore, 2022. [Google Scholar]
  3. Kantorovich, L.V.; Akilov, G.P. Functional Analysis; Pergamon Press: Oxford, UK, 1982. [Google Scholar]
  4. Kirk, W.; Shahzad, N. Fixed Point Theory in Distance Spaces; Springer International Publishing: Cham, Switzerland, 2014. [Google Scholar]
  5. Traub, J.F. Iterative Methods for the Solution of Equations; Chelsea Publishing Company: New York, NY, USA, 1982. [Google Scholar]
  6. Amat, S.; Bermúdez, C.; Hernández-Verón, M.A.; Martínez, E. On an efficient k-step iterative method for nonlinear equations. J. Comput. Appl. Math. 2016, 302, 258–271. [Google Scholar] [CrossRef]
  7. Ostrowski, A.M. Solution of Equation and Systems of Equations; Academic Press: New York, NY, USA, 1960. [Google Scholar]
  8. Singh, H.; Sharma, J.R. Reduced cost numerical methods of sixth-order convergence for systems of nonlinear models. Rev. Real Acad. Cienc. Exactas Fis. Nat. A Mat. 2022, 116, 144. [Google Scholar] [CrossRef]
  9. Argyros, I.K. Unified convergence criteria for iterative Banach space valued methods with applications. Mathematics 2021, 9, 1942. [Google Scholar] [CrossRef]
  10. Argyros, I.K. The Theory and Applications of Iteration Methods, 2nd ed.; CRC Press: New York, NY, USA, 2022. [Google Scholar]
  11. Cordero, A.; Ezquerro, J.A.; Hernández, M.A.; Torregrosa, J.R. On the local convergence of fifth-order iterative method in Banach spaces. Appl. Math. Comput. 2015, 251, 396–403. [Google Scholar] [CrossRef]
  12. Gutiérrez, J.M.; Magreñán, Á.A.; Romero, N. On the semilocal convergence of Newton–Kantorovich method under center-Lipschitz conditions. Appl. Math. Comput. 2013, 221, 79–88. [Google Scholar] [CrossRef]
  13. Hernández-Verón, M.A.; Martínez, E.; Teruel, C. Semilocal convergence of a k-step iterative process and its application for solving a special kind of conservative problems. Numer. Algorithms 2017, 76, 309–331. [Google Scholar] [CrossRef]
  14. Jaiswal, J.P. Semilocal convergence of a computationally efficient iterative method in Banach spaces under weak condition. J. Anal. 2020, 28, 141–154. [Google Scholar] [CrossRef]
  15. Liu, T.; Qin, X.; Wang, P. Local convergence of a family of iterative methods with sixth and seventh order convergence under weak conditions. Int. J. Comput. Methods 2019, 16, 1850120. [Google Scholar] [CrossRef]
  16. Martínez, E.; Singh, S.; Hueso, J.L.; Gupta, D.K. Enlarging the convergence domain in local convergence studies for iterative methods in Banach spaces. Appl. Math. Comput. 2016, 281, 252–265. [Google Scholar] [CrossRef]
  17. Sharma, J.R.; Argyros, I.K.; Singh, H.; Argyros, M.I. On the local convergence of a (p+1)-step method of order 2p+1 for solving equations. Foundations 2022, 2, 242–250. [Google Scholar] [CrossRef]
  18. 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]
  19. Ortega, J.M.; Rheinboldt, W.C. Iterative Solution of Nonlinear Equations in Several Variables; Academic Press: New York, NY, USA, 1970. [Google Scholar]
  20. Danby, J.M.A.; Burkardt, T.M. The solution of Kepler’s equation, I. Celest. Mech. 1983, 31, 95–107. [Google Scholar] [CrossRef]
  21. Ramos, H.; Rufai, M.A. An adaptive one-point second-derivative Lobatto-type hybrid method for solving efficiently differential systems. Int. J. Comput. Math. 2022, 99, 1687–1705. [Google Scholar] [CrossRef]
  22. Rufai, M.A.; Ramos, H. Numerical solution of Bratu’s and related problems using a third derivative hybrid block method. Comput. Appl. Math. 2020, 39, 322. [Google Scholar] [CrossRef]
  23. Rufai, M.A.; Ramos, H. Numerical integration of third-order singular boundary-value problems of Emden–Fowler type using hybrid block techniques. Commun. Nonlinear Sci. Numer. Simul. 2022, 105, 106069. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Sharma, J.R.; Singh, H.; Argyros, I.K. A Unified Local-Semilocal Convergence Analysis of Efficient Higher Order Iterative Methods in Banach Spaces. Mathematics 2022, 10, 3196. https://doi.org/10.3390/math10173196

AMA Style

Sharma JR, Singh H, Argyros IK. A Unified Local-Semilocal Convergence Analysis of Efficient Higher Order Iterative Methods in Banach Spaces. Mathematics. 2022; 10(17):3196. https://doi.org/10.3390/math10173196

Chicago/Turabian Style

Sharma, Janak Raj, Harmandeep Singh, and Ioannis K. Argyros. 2022. "A Unified Local-Semilocal Convergence Analysis of Efficient Higher Order Iterative Methods in Banach Spaces" Mathematics 10, no. 17: 3196. https://doi.org/10.3390/math10173196

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