Next Article in Journal
Monte Carlo Based Isogeometric Stochastic Finite Element Method for Uncertainty Quantization in Vibration Analysis of Piezoelectric Materials
Next Article in Special Issue
Collaboration Effect by Co-Authorship on Academic Citation and Social Attention of Research
Previous Article in Journal
MST-RNN: A Multi-Dimension Spatiotemporal Recurrent Neural Networks for Recommending the Next Point of Interest
Previous Article in Special Issue
On the Existence of Self-Similar Solutions in the Thermostatted Kinetic Theory with Unbounded Activity Domain
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Comparison Study of the Classical and Modern Results of Semi-Local Convergence of Newton–Kantorovich Iterations-II

1
Department of Mathematics, University of Houston, Houston, TX 77204, USA
2
Department of Mathematical Sciences, Cameron University, Lawton, OK 73505, USA
3
Department of Mathematical and Computational Sciences, National Institute of Technology Karnataka, Karnataka 575 025, India
4
Department of Computer Science, University of Oklahoma, Norman, OK 73019, USA
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(11), 1839; https://doi.org/10.3390/math10111839
Submission received: 29 April 2022 / Revised: 24 May 2022 / Accepted: 25 May 2022 / Published: 27 May 2022
(This article belongs to the Special Issue Mathematics: 10th Anniversary)

Abstract

:
This article is an independently written continuation of an earlier study with the same title [Mathematics, 2022, 10, 1225] on the Newton Process (NP). This process is applied to solve nonlinear equations. The complementing features are: the smallness of the initial approximation is expressed explicitly in turns of the Lipschitz or Hölder constants and the convergence order 1 + p is shown for p ( 0 , 1 ] . The first feature becomes attainable by further simplifying proofs of convergence criteria. The second feature is possible by choosing a bit larger upper bound on the smallness of the initial approximation. This way, the completed convergence analysis is finer and can replace the classical one by Kantorovich and others. A two-point boundary value problem (TPBVP) is solved to complement this article.
MSC:
49M15; 65J15; 65G99

1. Introduction

Let X 1 and X 2 be Banach spaces, and let Ω be a nonempty convex subset of X 1 . In addition, F : Ω X 1 X 2 is a Fréchet differentiable mapping between the Banach spaces X 1 abd X 2 . Let also L ( X 1 , X 2 ) denote the space of bounded linear operators from X 1 into X 2 . The nonlinear equation
F ( x ) = 0 ,
plays an important role due to the fact that many applications can be brought to look like it. The celebrated Newton Process (NP) in the following form
x 0 Ω , F ( x n ) s n = F ( x n ) , x n + 1 = x n + s n ,
for n = 0 , 1 , 2 , is widely used to solve Equation (1) iteratively. This set up is motivated by the solution of corresponding differential equations (see also the Numerical Section 4).
Kantorovich initiated the semi-local convergence (SLC) analysis of (NP) by using the contraction mapping principle due to Banach [1,2]. He presented two different proofs based on majorant functions and recurrent relations [2,3]. The Newton–Kantorovich Theorem contains the (SLC) for (NP). A plethora of researchers utilized this result, in applications, and also as a theoretical tool.
An elementary scalar equation given in [1,2,4,5,6,7,8,9] shows that convergence criteria may not be satisfied. However, (NP) may converge. That is why these criteria are weakened in [6] without new conditions. However, only linear convergence was obtained for (NP) with the techniques employed in [6].
In the present study, by employing different and more precise techniques, the elusive convergence order 1 + p is obtained for p ( 0 , 1 ] . This is achieved by choosing a bit smaller upper bound on F ( x 0 ) 1 F ( x 0 ) . Another new feature involves an explicit upper bound on the smallness of the initial approximation not given in [6]. Notice also that the present study is written completely independently of the corresponding one in [6]. The former reference is only mentioned to stretch the differences and the benefits of the new approach. Consequently, new results can always replace corresponding ones by Kantorovich [2] and others [7,8,9,10,11], as preceding results imply the one in this study but not necessarily vice versa. The method in this study uses smaller Lipschitz or Hölder parameters to achieve these extensions, which are specializations of earlier ones. That is, no additional effort is needed. The generality of this idea allows its application to other processes [3,5,6,7,9,10,11]. This will be the topic of future work.
Majorization of (NP) is presented in Section 2. The (SLC) of (NP) can be found in Section 3. Section 4 contains a Boundary Value Problem (BVP) as an application. Conclusions complete this study in Section 5.

2. Majorization

Let K 0 , L 0 , K , L be positive parameters and η 0 .
The sequence generated for p ( 0 , 1 ] and for n = 0 , 1 , 2 , by v 0 = 0 , v 1 = η
v 2 = η + K η 1 + p ( 1 + p ) ( 1 K 0 η p ) , v n + 2 = v n + 1 + L ( v n + 1 v n ) 1 + p ( 1 + p ) ( 1 L 0 v n + 1 p ) ,
plays a critical role as a majorizing sequence for (NP) in the Lipschitz case ( p = 1 ) as well as the Hölder one ( p ( 0 , 1 ) ).
Two convergence results for sequence { v n } are developed.
Lemma 1.
Suppose
K 0 η p < 1
and
L 0 v n + 1 p < 1
n = 0 , 1 , 2 , . Then, the following assertions hold
0 v n v n + 1
and
lim n v n = t * min v , 1 L 0 1 p ,
where v = ( 1 K 0 ) 1 p .
Proof. 
The assertions follow by the definition of the sequence { v n } and the conditions of Lemma 1. □
Another convergence result follows.
It is convenient to develop parameters, d = v 2 v 1 , δ 0 = K d p ( 1 + p ) ( 1 K 0 η p ) , δ 1 = 1 d 1 L 0 p η and set S = [ 0 , v ) . Moreover, introduce functions depending on parameter p and defined on the interval S for n = 1 , 2 , by
h n , p ( t ) = L η p t n p + ( 1 + p ) L 0 t ( η + 1 t n + 1 1 t d ) p ( 1 + p ) t
and
g n , p ( t ) = L t p L + ( 1 + p ) L 0 t [ ( t n + + 1 + t ) p ( t n + + 1 ) p ] .
Next, some properties for these functions are presented.
Lemma 2.
The following assertions hold
h n + 1 , p ( t ) = h n , p ( t ) + g n , p ( t ) t n p η p ,
g n + 1 , p ( t ) g n , p ( t ) = ( 1 + p ) L 0 t [ ( t n + 1 + + t ) p ( t n + 1 + + t + 1 ) p ( ( t n + + 1 + t ) p ( t n + + 1 ) p ) ] ,
g n , 1 ( t ) = L t L + ( 1 + p ) L 0 t 1 + p ,
g n + 1 , 1 ( t ) g n , 1 ( t ) = 0 t S
and
g n + 1 , p ( t ) g n , p ( t ) 0 t S , p ( 0 , 1 ) .
Define the parameter δ by
δ = 2 L L + L 2 + 8 L 0 L , if p = 1 the smallest zero in S { 0 } of the function g 1 , p , if p ( 0 , 1 ) .
Moreover, suppose
(I)
0 δ 0 δ δ 1 , i f p = 1 or
(II)
η 1 2 , η 2 1 : = min { v , η 0 , η 1 } , if p ( 0 , 1 ) , where the parameter η 0 is the smallest zero in ( 0 , v ) of the function
φ ( t ) = K K t 1 + p ( 1 + p ) ( 1 K 0 t p ) p δ ( 1 + p ) ( 1 K 0 t p )
and
η 1 = ( 1 + p ) δ L δ p + ( 1 + p ) L 0 δ ( 1 + δ + δ 2 ) p 1 p .
Then, the sequence { v n } is such that
0 v n + 1 v n δ ( v n v n 1 ) ,
0 v n v n + 1 η + ( 1 + δ 0 1 δ n 1 δ d ) η + δ 0 d 1 δ = : t * * ,
and
lim n v n = t * [ 0 , t * * ] ,
where δ 0 = L ( v 2 v 1 ) p ( 1 + p ) ( 1 L 0 t p ) .
Proof. 
The assertions on functions h n , p and g n , p follow immediately by their definitions. If p = 1 by using the quadratic formula the parameter δ ( 0 , 1 ) is obtained. Then, the definition of the function g 1 , p for p ( 0 , 1 ) implies g 1 , p ( 0 ) < 0 and g 1 , p ( 1 ) > 0 . Let δ again stand for the smallest zero of the function g 1 , p in S { 0 } assured to exist by the (IVT) (intermediate Value Theorem). Similarly the definition of parameter η 0 is assured by (IVT), since φ ( 0 ) = δ ( 1 + p ) < 0 and φ ( t ) as t v .
Notice also that under (I)
h n , 1 ( t ) h n + 1 , 1 ( t ) h ( t ) 0 t [ 0 , δ ] ,
whereas under condition (II)
g 1 , p ( t ) 0 t [ 0 , η 0 ] ,
h 1 , p ( t ) 0 t [ 0 , η 1 ]
and
h n + 1 , p ( t ) h n , p ( t ) t [ 0 , δ ] ,
where h , p ( t ) = t [ L 0 ( η + d 1 t ) p 1 ] . Hence, the sequence { v n } is bounded from above by t * * and non-decreasing. □
Next, we show that condition (I) can be solved in terms of η as in case (II).
Define the real quadratic polynomials q , q 1 , q 2 by
q ( t ) = L 0 ( K 2 K 0 ) t 2 + 2 L 0 t 1 ,
q 1 ( t ) = ( L K + 2 δ L 0 ( K 2 K 0 ) ) t 2 + 4 δ ( L 0 + K 0 ) t 4 δ ,
and
q 2 ( t ) = L 0 ( K 2 ( 1 δ ) K 0 ) t 2 + 2 ( 1 δ ) ( L 0 + K 0 ) t 2 ( 1 δ ) .
The discriminants , 1 , 2 of these polynomials can be written as
= 4 L 0 ( L 0 + K 2 K 0 ) > 0 ,
1 = 16 δ ( δ ( L 0 K 0 ) 2 + ( L + 2 δ L 0 ) K ) > 0
and
2 = 4 ( 1 δ ) ( ( 1 δ ) ( L 0 K 0 ) 2 + 2 L 0 K ) > 0 ,
respectively. It follows by the definition of δ , q 1 and q 2 that
L = 2 L 0 δ 2 1 δ , L K + 2 δ L 0 ( K 2 K 0 ) = 2 L 0 δ 1 δ ( K 2 ( 1 δ ) K 0 ) ,
and so
q 1 ( t ) = 2 L 0 δ 1 δ q 2 ( t ) .
That is the polynomials q 1 and q 2 have the same roots. Denote by 1 2 r 1 the unique positive root of polynomial q . This root is given by the quadratic formula and can be written as
1 2 r 1 = 1 L 0 + L 2 + L 0 ( K 2 K 0 ) .
Moreover, denote by 1 2 r 2 the common positive root of the polynomials q 1 and q 2 . This root can be written as
1 2 r 2 = 2 δ ( L 0 + K 0 ) + ( δ ( L 0 + K 0 ) ) 2 + δ ( K L + 2 δ L 0 ( K 2 K 0 ) ) .
Define the parameter η 3 by
η 3 1 = min 1 2 r 1 , 1 2 r 2 .
Suppose that the nonnegative number η is such that
η 3 η 1 2 .
It is worth noticing that criterion (4) is written this way to make it looks like the usual Kantorovich criterion for Newton’s method in the Lipschitz case [2,10,11].
By the choice of the parameters r 1 and r 2 the polynomials q , q 1 , q 2 and the condition (4) we get follows that
L 0 v 2 < 1 ,
since q ( η ) < 0 and K 0 η < 1 . We infer that
q 1 ( η ) 0
and
q 2 ( η ) 0 .
Furthermore, the following estimate holds
δ 0 δ 1 L 0 ( v 2 v 1 ) 1 L 0 v 1 .
Indeed, the left hand side inequality reduces to showing q 1 ( η ) 0 and the right hand side to showing q 2 ( η ) 0 . Conditions (4) provides the smallness of η to force convergence of the sequence { v n } . By choosing 1 2 η 3 to be a little bit larger the convergence 1 + p is recovered as follows. Let ϵ 0 . Set b = L 1 + p ( 1 + ϵ ) and c = b 1 p .
Define function ψ , p on interval S by
ψ , p ( t ) = ( 1 + ϵ ) L 0 t + d ( t ) ( 1 t ) p ϵ ,
where
d ( t ) = K t p ( 1 + p ) ( 1 K 0 t p ) .
These definitions imply ψ , p ( 0 ) = ϵ < 0 and ψ , p ( t ) as t v . Denote by 1 η 4 the smallest zero of the function ψ , p on the interval ( 0 , v ) . Define
η 5 = max { η 3 , 1 2 c , 1 2 η 4 } , i f p = 1 { η 2 , 1 2 c , 1 2 η 4 } , i f p ( 0 , 1 ) .
Let the sequence { v n } be defined as in the Formula (3). Then its convergence is of order 1 + p .
Lemma 3.
Let η 0 be such that
η 5 η < 1 2 .
Then, the following assertions hold
0 v n + 1 v n 1 c ( c η ) ( 1 + p ) n
and
t * v n 1 c ( 1 c η ) ( c η ) ( 1 + p ) n .
The convergence order of the sequence { v n } is 1 + p .
Proof. 
Induction is used to show
0 L ( 1 + p ) ( 1 L 0 v n + 1 p ) b ,
where b 0 1 + p = sup n 1 L p ( 1 + p ) p ( 1 L 0 v n p ) p , v 0 = η and b b 0 . Then, this assertion holds for n = 1 by the choice of η 0 . Then, the assertion (7) holds if using Lemma 2
( 1 + ϵ ) L 0 [ η + ( 1 + ( 1 + t + + t n 1 ) d ] p ϵ 0 .
Define the functions
ψ n , p ( t ) = ( 1 + ϵ ) L 0 ( η + ( 1 + ( 1 + t + + t n 1 ) d ) p ϵ 0 .
It suffices to show
ψ n , p ( t ) 0 a t t = δ .
The definitions of the functions { ψ n , p } yield
ψ n + 1 , p ( t ) ψ n , p ( t ) = ( 1 + ϵ ) L 0 { [ η + ( 1 + ( 1 + t + + t n ) d ] p [ η + ( 1 + ( 1 + t + + t n 1 ) d ] p } 0 .
Define the function ψ , p on the interval S by
ψ , p ( t ) = lim n ψ n , p ( t ) .
By the definition of the functions ψ , p , it suffices to show ψ , p ( t ) 0 , which is true by the choice of η 4 . The induction is completed. It follows by the sequence { v n } and Lemma 2
b p ( v n + 1 v n ) ( b ( v n v n 1 ) ) 1 + p b 1 + p ( b ( v n 1 v n 2 ) 1 + p ) 1 + p = b 1 + p b 1 + p ( v n 1 v n 2 ) ( 1 + p ) 2 b ( 1 + p ) + ( 1 + p ) + + ( 1 + p ) n 1 η ( 1 + p ) n ,
so
v n + 1 v n b 1 + ( 1 + p ) + + ( 1 + p ) n 1 η ( 1 + p ) n = b ( 1 + p ) n 1 p η ( 1 + p ) n = 1 c ( c η ) ( 1 + p ) n ,
which shows the first assertion. Moreover, if k = 1 , 2 ,
v n + k v n v n + k v n + k 1 + + v n + 1 v n 1 c [ ( c η ) ( 1 + p ) n + k 1 + + ( c η ) ( 1 + p ) n ] 1 c ( c η ) ( 1 + p ) n 1 ( c η ) ( 1 + p ) n 1 c η .
The second assertion follows if k in the preceding calculation. □
It is worth noticing that Lemma 3 is used to provide weak convergence conditions for (NP). Then, the upper bounds on the iterates v n + 1 make the proof of Lemma 3 possible.
Next, the Banach lemma on the invertible operators is recalled.
Lemma 4
([1,2]). If Q is a bounded linear operator in X 1 , Q 1 exists if and only if there is a bounded linear operator P in X 1 such that P 1 exists and
I P Q 1 .
If Q 1 exists, then
Q 1 = n = 0 ( I P T ) n P
and
Q 1 P 1 I P Q .

3. Convergence of (NP)

The notation U ( w , ρ ) , U [ w , ρ ] means the open and closed balls with radius ρ > 0 and center w X 1 , respectively. The parameters K 0 , L 0 , K , L , and η are connected with the operator F as follows. Consider conditions (A):
Suppose
(A1)
There exist x 0 Ω , η 0 such that F ( x 0 ) 1 L ( X 2 , X 1 ) , x 1 = x 0 F ( x 0 ) 1 F ( x 0 )
F ( x 0 ) 1 F ( x 0 ) η ,
F ( x 0 ) 1 ( F ( x 1 ) F ( x 0 ) ) K 0 x 1 x 0 p
and
F ( x 0 ) 1 ( F ( x 0 + ξ ( x 1 x 0 ) ) F ( x 0 ) ) K ξ ( x 1 x 0 ) p .
(A2)
F ( x 0 ) 1 ( F ( x ) F ( x 0 ) ) L 0 x x 0 p for x Ω .
Set B 1 = U ( x 0 , 1 L 0 1 p ) Ω .
(A3)
F ( x 0 ) 1 ( F ( x + ξ ( y x ) ) F ( x ) ) L ξ ( y x ) p for x , y B 1 and for ξ [ 0 , 1 ) .
(A4)
The conditions of the preceding Lemma 1 or Lemma 2 or Lemma 3 hold.
(A5)
U [ x 0 , t * ] Ω .
Notice that K 0 K L 0 .
Next, conditions (A) are applied to show the main convergence result for (NP).
Theorem 1.
Under the conditions in (A) any (NP) sequence { x n } is convergent to a solution x * U [ x 0 , t * ] of the equation F ( x * ) = 0 . Moreover, upper bounds of the form
x * x n t * v n
hold for all n = 0 , 1 , 2 , .
Proof. 
The assertions
x i + 1 x i v i + 1 v i ,
and
U [ x i + 1 , t * v i + 1 ] U [ x i , t * v i ] ,
are shown by induction i = 0 , 1 , 2 , . Let u U [ x 1 , t * v 1 ] . The following inequalities are consequences of conditions (A1) together with the equality v 0 = 0 .
x 1 x 0 = F ( x 0 ) 1 F ( x 0 ) η = v 1 v 0 ,
u x 0 u x 1 + x 1 x 0 t * v 1 + v 1 v 0 = t * .
So, the vector u U [ x 0 , t * v 0 ] . That is assertions (9) and (10) hold for i = 0 . Assume these assertions hold if i = 0 , 1 , , n . It follows for each ξ [ 0 , 1 ]
x i + ξ ( x i + 1 x i ) x 0 v i + ξ ( v i + 1 v i ) t * ,
and
x i + 1 x i j = 1 i + 1 x j x j 1 j = 1 i + 1 ( v j v j 1 ) = v i + 1 .
By the induction hypotheses, by Lemmas 1–3 and the conditions (A1), (A2), and (A4), it follows that
F ( x 0 ) 1 ( F ( x i + 1 ) F ( x 0 ) ) K ¯ x i + 1 x 0 p , K ¯ ( v i + 1 v 0 ) p K ¯ v i + 1 p < 1 .
Hence, the inverse of the linear operator F ( x i + 1 ) exists. Therefore, F ( v ) 1 L ( X 2 , X 1 ) and
F ( x i + 1 ) 1 F ( x 0 ) 1 1 K ¯ v i + 1 p
follows as a consequence of Lemma 4, where K ¯ = K 0 , i = 0 L 0 , i = 1 , 2 , . The following general integral equality is implied by (NP)
F ( x i + 1 ) = F ( x i + 1 ) F ( x i ) F ( x i ) ( x i + 1 x i ) , = 0 1 ( F ( x i + ξ ( x i + 1 x i ) ) F ( x i ) ) d ξ ( x i + 1 x i ) .
Then, using the induction hypotheses, estimate (9) and condition (A3)
F ( x 0 ) 1 F ( x i + 1 ) L ¯ 0 1 ( ξ x i + 1 x i ) p d ξ L ¯ 1 + p ( v i + 1 v i ) 1 + p ,
where L ¯ = K , i = 0 L , i = 1 , 2 , .
It follows by (NP), estimates (11), (13) and the definition (3) of the sequence { v n }
x i + 2 x i + 1 F ( x i + 1 ) 1 F ( x 0 ) F ( x 0 ) 1 F ( x i + 1 ) , K ˜ ( v i + 1 v i ) 1 + p 2 ( 1 L ˜ v i + 1 p ) = v i + 2 v i + 1 ,
where K ˜ = K , i = 0 L , i = 1 , 2 , . and L ˜ = K 0 , i = 0 L 0 , i = 1 , 2 , . Moreover, if v U [ x i + 2 , t * v i + 2 ] it follows
v x i + 1 v x i + 2 + x i + 2 x i + 1 t * v i + 2 + v i + 2 v i + 1 = t * v i + 1 .
So, the vector w U [ x i + 1 , t * v i + 1 ] completing the induction for assertions (9) and (10). Notice that the scalar majorizing sequence { v i } is fundamentally convergent. Hence, the sequence { x i } is also convergent to some x * U [ x 0 , t * ] . Furthermore, let i in estimate (13), to conclude F ( x * ) = 0 .
Next, the uniqueness ball for a solution is presented. Notice that not all conditions mentioned in (A) are used.
Proposition 1.
Let, for some x 0 Ω the center-Lipschitz condition (A2) be satisfied. Further assume that there exists 0 < R < 1 + p 2 L 0 1 p such that there exists a solution s U ( x 0 , R ) Ω of equation (1) and such that linear operator F ( s ) is invertible. Let the parameter R 1 R be given by
R 1 = 1 + p L 0 R p 1 p .
Then, the point s solves uniquely the equation F ( x ) = 0 in the set B 2 = U ( x 0 , R 1 ) Ω .
Proof. 
Define the linear operator Q = 0 1 F ( s ¯ + ξ ( s s ¯ ) ) d ξ for some point s ¯ B 2 satisfying F ( s ¯ ) = 0 . By using the definition of R 1 , set B 2 and condition (A2),
F ( x 0 ) 1 ( F ( x 0 ) Q ) 0 1 L 0 ( ( 1 ξ ) p x 0 s p + ξ p x 0 s ¯ p ) d ξ , < L 0 1 + p ( R 1 p + R p ) = 1 ,
concluding that s = s ¯ , where the invertibility of the linear operator is also used together with the approximation 0 = F ( s ) F ( s ¯ ) = Q ( s s ¯ ) .
Remark 1.(i) Under the conditions in (A), the existence of x * is assured. In this case set q = x * and R = t * .
(ii) Condition (A3) can be replaced by
F ( x 0 ) 1 ( F ( w 1 + ξ ( w 2 w 1 ) ) F ( w 1 ) ) d 0 ξ ( w 1 w 2 ) p
w 1 B 1 and w 2 = w 1 F ( w 1 ) 1 F ( w 1 ) B 1 . This even smaller parameter d 0 can replace L in the aforementioned results. The existence of the iterate w 2 is assured by (A2) and Lemma 4. Notice that the proof of Theorem 1 goes through if condition (15) replaces stronger (A3).
(iii) Concerning the more general iteration { v ¯ n } studied in [6] defined by
v ¯ 0 = 0 , v ¯ 1 = η , v ¯ 2 = v ¯ 1 + 0 1 ψ ¯ θ ( θ ( v ¯ 1 v ¯ 0 ) ) d θ ( v ¯ 1 v ¯ 0 ) 1 ψ ¯ 1 ( K ¯ ) , v ¯ n + 2 = v ¯ n + 1 + 0 1 ψ θ ( θ ( v ¯ n + 1 v ¯ n ) ) d θ ( v ¯ n + 1 v ¯ n ) 1 ψ 1 ( v ¯ n + 1 ) n = 1 , 2 , 3 , .
Suppose function
f θ ( t , u ) = 1 t p 0 1 ψ θ ( θ t ) d θ 1 ψ 1 ( u )
is nondecreasing and bounded from above by some b ¯ > 0 . Then, the same proof as Lemma 3 recovers the 1 + p order of convergence for this general iteration provided that c ¯ = b ¯ 1 p , η 1 c ¯ , and the conditions of Lemma 1 or Lemma 2 in [6] hold. This is due to the calculation
v ¯ n + 2 v ¯ n + 1 = 0 1 ψ θ ( θ ( v ¯ n + 1 v ¯ n ) ) d θ ( v ¯ n + 1 v ¯ n ) 1 + p ( 1 ψ 1 ( v ¯ n + 1 ) ) ( v ¯ n + 1 v ¯ n ) p b ¯ ( v ¯ n + 1 v ¯ n ) 1 + p for v ¯ n + 1 v ¯ n .
Then, under the conditions of Theorem 1 and Proposition 1 in [6] the conclusions, hold for a sequence { x n } in this more general setting, where it is also shown that the convergence order is 1 + p . In the case when ψ ¯ θ , ψ θ are constant functions, then, set b ¯ = L ( 1 + ϵ ) 1 + p . Hence condition (17) can be realized. Notice that sequence v ¯ n } specializes to { v n } if ψ ¯ 1 ( t ) = K 0 t p , ψ ¯ θ ( t ) = K ( θ t ) p , ψ 1 ( t ) = L 0 t p and ψ θ ( t ) = L ( θ t ) p . Under, these choices of functions Lemma 1 and Theorem 1 coincide with the corresponding ones in [6]. Moreover, the rest of the Lemmas in [6] show only linear convergence of majorizing sequences and, consequently of the sequence { x n } . However, in Lemma 3, the convergence order 1 + p is obtained.
Finally, in Lemma 2, in [6], the upper bound on η is not given explicitly in all cases, nor is the convergence order 1 + p . However, the objective of this article is to do so. That explains the approach in this article.

4. Example

The solution of a BVP is presented as an application of theory.
Example 1.
Let us consider the two-point BVP(TPBVP)
u + u 3 2 = 0 u ( 0 ) = u ( 1 ) = 0 .
The interval [ 0 , 1 ] is divided into j subintervals. Set m = 1 j . Denote by w 0 = 0 < w 1 < < w j = 1 the points of subdivision with corresponding values of the function u 0 = u ( w 0 ) , , u j = u ( w j ) . Then, the discretization of u is given by
u k u k 1 2 u k + u k + 1 m 2 f o r k = 2 , 3 , j 1 .
Further, notice that u 0 = u j = 0 . It follows that the following system of equations is obtained
m 2 u 1 3 2 2 u 1 + u 2 = 0 , u k 1 + m 2 u k 3 2 2 u k + u k + 1 = 0 f o r k = 2 , 3 , , j 1 u j 2 + m 2 u j 1 3 2 2 u j 1 = 0 .
This system can be converted into an operator equation as follows: Define operator H : R j 1 R j 1 whose derivative is given as
H ( u ) = 3 2 m 2 u 1 1 2 2 1 0 0 1 3 2 m 2 u 2 1 2 2 1 0 0 0 1 0 3 2 m 2 u j 1 1 2 2 .
Pick z R j 1 be arbitrary. The norm used is z = max 1 k j 1 z k , where as the norm for H R j 1 × R j 1 is given as
H = max 1 k j 1 i = 1 j 1 h k , i .
Then, pick u , z R j 1 for | u k | > 0 , | z k | > 0 , f o r k = 1 , 2 , , j 1 to obtain in turn
H ( u ) H ( z ) = d i a g { 3 2 ( u k 1 2 z k 1 2 ) } = 3 2 m 2 max 1 k j 1 | u k z k | 1 2 = 3 2 m 2 u z 1 2 .
Choose as an initial guess vector 130 sin π x to obtain after four iterations u 0 = [ 3.35740 × 10 1 , 6.5202 × 10 1 , 9.15664 × 10 1 , 1.09168 × 10 2 , 1.15363 × 10 2 , 1.09168 × 10 2 , 9.15664 × 10 1 , 6.52027 × 10 1 , 3.35740 × 10 1 ] t r . Then, the parameters are Q ( u 0 ) 1 2.5582 × 10 1 , η = 9.15311 × 10 5 , p = 0.5 , K 0 = L 0 = K = L = 3 200 = 0.015 . Then, K 0 η p = 1.4351 × 10 4 . The following Table 1 shows that the conditions of Lemma 1 are satisfied, since v n = v n + m for n = 0 , 1 , 2 , , m = 0 , 1 , 2 , . Hence, the conditions of Theorem 1 hold.
By using the initial vector on (NP) the generated vector is not good enough to apply Theorem 1. However, after four iterations, the vector u 0 is good enough. Then, the Hölder constants are obtained simply using conditions (A1)–(A3) and taking the max-norm of the resulting vector or matrix. In this paper, the conditions of Lemma 1 are verified first, which are weaker.
Concerning the convergence order, one should verify conditions (6) of Lemma 3. Choose ϵ = 0.8 . Then, using the preceding values η 5 η < 0.47 < 0.5 . Therefore, the convergence order is 1 + p = 1 + 0.5 = 1.5 . Hence, the conclusions of Theorem 1 hold. The corresponding criteria in ([Remark 2, for the Hölder case], [6]) are
h 1 , p ( γ p ) 0 a n d , 0 δ 0 γ p ,
where δ 0 = K ( v 2 v 1 ) p ( 1 + p ) ( 1 K 0 v 2 p ) , γ p = L L + ( 1 + p ) L 0 p 1 + p and h 1 , p ( t ) = L 1 + p t p ( v 2 v 1 ) p + t L 0 ( v 1 + ( 1 + t ) ) p ( v 2 v 1 ) p t . However, these conditions give an implicit estimate on the smallness η , they are not satisfied for this example for p = 0.5 . However, even if they were the convergence of the sequence { x n } is only linear. The same is true if another criterion given in [6] by 0 η min 2 γ 1 ( 1 + 2 γ 1 ) L 0 , 1 K 0 + L 0 . That is even if it is verified the convergence order is only linear.

5. Conclusions

The two new features are explicit upper bounds on the smallness of η . Convergence order 1 + p is also recovered by choosing a larger upper bound on η . New Lipschitz or Hölder parameters are smaller and specializations of previous parameters. The new theory can always replace previous ones due to a weaker a priori hypothesis. The strategy can be applied to other processes, such as Secant, Kurchatov, Stirling’s, Newton-like, and multistep [2,3,5,9,10,11]. This will be done in future work.

Author Contributions

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

Acknowledgments

We would like to express our gratitude to the reviewers for the constructive criticism of this article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Argyros, I.K. Unified Convergence Criteria for Iterative Banach Space Valued Methods with Applications. Mathematics 2021, 9, 1942. [Google Scholar] [CrossRef]
  2. Kantorovich, L.V.; Akilov, G.P. Functional Analysis; Pergamon Press: Oxford, UK, 1982. [Google Scholar]
  3. Ezquerro, J.A.; Hernandez, M.A. Newton’s Scheme: An Updated Approach of Kantorovich’s Theory; Springer: Cham, Switzerland, 2018. [Google Scholar]
  4. Appell, J.; De Pascale, E.; Lysenko, J.V.; Zabreiko, P.P. New results on Newton-Kantorovich approximations with applications to nonlinear integral equations. Numer. Funct. Anal. Optim. 1997, 18, 1–18. [Google Scholar] [CrossRef]
  5. 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]
  6. Regmi, S.; Argyros, I.K.; George, S.; Christopher, I.A. A Comparison Study of the Classical and Modern Results of Semi-Local Convergence of Newton-Kantorovich Iterations. Mathematics 2022, 10, 1225. [Google Scholar] [CrossRef]
  7. Cianciaruso, F.; De Pascale, E. The Newton-Kantorovich approximations when the derivative is Hölder: Old and New Results. Numer. Funct. Anal. 2002, 24, 713–723. [Google Scholar] [CrossRef]
  8. Zabreiko, P.P.; Nguen, D.F. The majorant method in the theory of Newton-Kantorovich approximations and the Pták error estimates. Numer. Funct. Anal. Optim. 1987, 9, 671–684. [Google Scholar] [CrossRef]
  9. Verma, R. New Trends in Fractional Programming; Nova Science Publisher: New York, NY, USA, 2019. [Google Scholar]
  10. Potra, F.A.; Pták, V. Nondiscrete Induction and Iterative Processes. In Research Notes in Mathematics; Pitman (Advanced Publishing Program): Boston, MA, USA, 1984; p. 103. [Google Scholar]
  11. Proinov, P.D. New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems. J. Complex. 2010, 26, 3–42. [Google Scholar] [CrossRef] [Green Version]
Table 1. Sequence (3).
Table 1. Sequence (3).
n123456
v n + 1 0.1435 × 10 3 0.1435 × 10 3 0.1435 × 10 3 0.1435 × 10 3 0.1435 × 10 3 0.1435 × 10 3
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Regmi, S.; Argyros, I.K.; George, S.; Argyros, M.I. A Comparison Study of the Classical and Modern Results of Semi-Local Convergence of Newton–Kantorovich Iterations-II. Mathematics 2022, 10, 1839. https://doi.org/10.3390/math10111839

AMA Style

Regmi S, Argyros IK, George S, Argyros MI. A Comparison Study of the Classical and Modern Results of Semi-Local Convergence of Newton–Kantorovich Iterations-II. Mathematics. 2022; 10(11):1839. https://doi.org/10.3390/math10111839

Chicago/Turabian Style

Regmi, Samundra, Ioannis K. Argyros, Santhosh George, and Michael I. Argyros. 2022. "A Comparison Study of the Classical and Modern Results of Semi-Local Convergence of Newton–Kantorovich Iterations-II" Mathematics 10, no. 11: 1839. https://doi.org/10.3390/math10111839

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