Next Article in Journal
Influence of Single- and Multi-Wall Carbon Nanotubes on Magnetohydrodynamic Stagnation Point Nanofluid Flow over Variable Thicker Surface with Concave and Convex Effects
Next Article in Special Issue
Local Convergence for Multi-Step High Order Solvers under Weak Conditions
Previous Article in Journal
Using Machine Learning Classifiers to Recognize the Mixture Control Chart Patterns for a Multiple-Input Multiple-Output Process
Previous Article in Special Issue
Semi-Local Analysis and Real Life Applications of Higher-Order Iterative Schemes for Nonlinear Systems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

New Improvement of the Domain of Parameters for Newton’s Method

by
Cristina Amorós
1,
Ioannis K. Argyros
2,
Daniel González
3,
Ángel Alberto Magreñán
4,*,
Samundra Regmi
2 and
Íñigo Sarría
1
1
Escuela Superior de Ingeniería y Tecnología, UNIR, 26006 Logroño, Spain
2
Department of Mathematics Sciences, Cameron University, Lawton, OK 73505, USA
3
Escuela de Ciencias Físicas y Matemáticas, Universidad de las Americas, Quito 170517, Ecuador
4
Departamento de Matemáticas y Computación, Universidad de la Rioja, 26004 Logroño, Spain
*
Author to whom correspondence should be addressed.
Mathematics 2020, 8(1), 103; https://doi.org/10.3390/math8010103
Submission received: 26 November 2019 / Revised: 30 December 2019 / Accepted: 4 January 2020 / Published: 8 January 2020
(This article belongs to the Special Issue Computational Methods in Analysis and Applications 2020)

Abstract

:
There is a need to extend the convergence domain of iterative methods for computing a locally unique solution of Banach space valued operator equations. This is because the domain is small in general, limiting the applicability of the methods. The new idea involves the construction of a tighter set than the ones used before also containing the iterates leading to at least as tight Lipschitz parameters and consequently a finer local as well as a semi-local convergence analysis. We used Newton’s method to demonstrate our technique. However, our technique can be used to extend the applicability of other methods too in an analogous manner. In particular, the new information related to the location of the solution improves the one in previous studies. This work also includes numerical examples that validate the proven results.

1. Introduction

Consider, approximating a locally unique solution z * of a nonlinear equation
F ( z ) = 0 ,
such that F is defined on a convex subset D of a Banach space B 1 with values in a Banach space B 2 and is a Fréchet–differentiable operator.
The study of numerous problems in diverse areas such as Mathematics, Mathematical: Biology, Chemistry, Economics, Physics, Environmental Sciences, and Engineering to mention a few leads to finding a solution of some equation involving abstract space valued operators. The difficulty in finding a solution of such equation in a closed form focuses us to resort to the development of iterative methods. However, the convergence domain of these methods is small in general for the semi-local as well as the local convergence case. In the case of the widely used Newton’s method, several attempts have been made starting with the seminal work by Kantorovich [1] and continuing with the works by others [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21].
All are trying to extend the convergence domain using Lipschitz type conditions on the operator F’ and starting close enough to the solution z * . We refer the reader to the sufficient convergence criteria (3)–(7) for a background. The novelty of our paper is that we further extend the applicability of Newton’s method by introducing a more precise set than in earlier studies containing the using criteria (3)–(7). Then, in this new set, the Lispchitz constants are tighter, resulting in the following advantages ( A ) over the earlier works:
( A 1 )
At least as weak sufficient semi-local and local convergence criteria (leading to more initial points)
( A 2 )
Tighter upper bounds on the distances z n + 1 z n and z n z * (leading to fewer iterations to obtain a predetermine accuracy)
( A 3 )
At least as precise information on the location of the solution.
The advantages ( A ) are not arrived at under additional conditions because in practice the new Lipschitz constants are special cases of the old ones, see Figure 1.
Moreover, in advanced mathematics, we need to use different alternatives since we all know the different problems that students present [22,23,24,25,26,27].
It can also be easily seen that our technique can be used to extend the applicability of other methods along the same lines.
Newton’s method for each n 0 is defined by
z n + 1 = z n F ( z n ) 1 F ( z n )
such that z 0 is an initial point. This is the most common methodology for approximating z * generating a sequence { z n } . Define open and closed balls B ( z , ϱ ) , B ¯ ( z , ϱ ) in B 1 with radius ϱ > 0 and center z B 1 .
The Newton–Kantorovich Theorem [1] is the most reputable semi-local convergence result for Newton’s method using the hypotheses:
Hypothesis 1
( H 1 ). There exists z 0 D with F ( z 0 ) 1 L ( B 2 , B 1 ) and a parameter η 0 such that
F ( z 0 ) 1 F ( z 0 ) η .
Hypothesis 2
( H 2 ). There exists a parameter L > 0 and, for each z , z 1 D such that
F ( z 0 ) 1 ( F ( z ) F ( z 1 ) ) L z z 1
and
Hypothesis 3
( H 3 ). There exists a closed ball B ¯ ( z 0 , R ) D for some R > 0 .
The renowned and well known Kantorovich hypothesis is based on the sufficient convergence criterion
h = 2 L η 1 .
Commonly, the convergence domain of Newton’s method is based on the parameters L and η being small. In order to enlarge the convergence domain, Argyros et al. [7,8] provide sufficient convergence criteria for Newton’s method based on improvements and more precise sequences than before [1,19].
The new conditions are:
h 1 = 2 C 1 η 1 ,
h 2 = 2 C 2 η 1 ,
h 3 = 2 C 3 η 1 ,
h 4 = 2 C 4 η 1 ,
where
C 1 = A 0 + L 2 , C 2 = 1 8 L + 4 A 0 + L 2 + 8 A 0 L ,
C 3 = 1 8 4 A 0 + A 0 L + 8 A 0 2 + A 0 L , C 4 = 1 η 0 ,
such that the small positive root of a quadratic polynomial [5,6,7,8] is η 0 and A 0 > 0 is the center Lipschitz constant, where
F ( z 0 ) 1 ( F ( x ) F ( z 0 ) ) A 0 x z 0 for each x D ,
whose existence is always implied by ( H 2 ) . We have that
A 0 L
is true and L A 0 can be randomly large [7]. Notice that condition (8) is not an added ( H 2 ) hypothesis, since in practice the computation of parameter L implies the computation of A 0 as a special case. Keep in mind that, if A 0 = L , conditions (4)–(7) reduce to criterion (3). However, if A 0 < L , we have [7,8]
h 1 h 1 1 h 2 1 h 3 1 h 4 1 ,
h 1 h 1 2 , h 2 h 1 4 , h 2 h 1 1 2 , h 3 h 0
and
h 3 h 2 0 , h 3 h 1 0 , as A 0 L 0 .
The main findings of this study are related to the distance involved and the improvement of the semi-local criteria (3)–(7) using parameters tighter than A 0 and L and restricting the domain. Similar ideas are used to improve error limits and expand radius convergence in the case of the local convergence.
The document is divided as follows: In Section 2 the results of the local and semi-local convergence are presented. In Section 3, we conclude with numerical examples, and, in the final section, we provide the conclusions.

2. Convergence Analysis

To begin, we analyze the semi-local convergence analysis of Newton’s method. Next, a new version of the Newton–Kantorovich Theorem [1] is stated in Theorem 2, whereas, in Theorem 1, we state the Newton–Kantorovich theorem for comparison purposes.
Theorem 1.
Suppose conditions ( H 1 ) ( H 3 ) and (3) are verified. Then, the sequence { z n } is well defined by Newton’s method for each n 0 , belongs in the ball B ( z 0 , R ) , and converges to a unique solution z * B ¯ ( z 0 , R ) of Equation (1), where
R = 1 1 h L .
Next, we state a semi-local convergence result improving the Kantorovich Theorem.
Theorem 2.
Suppose that there exist z 0 D , η 0 , γ 1 , and A γ > 0 , such that
F ( z 0 ) 1 L ( B 2 , B 1 ) ,
F ( z 0 ) 1 F ( z 0 ) η ,
D γ = B ¯ ( z 0 , γ η ) D ,
F ( z 0 ) 1 ( F ( x ) F ( y ) ) A γ x y f o r e a c h x , y D γ ,
h γ = 2 A γ η 1
and
R γ γ η ,
where
R γ = 1 1 h γ A γ ·
Then, the sequence { z n } is well defined by Newton’s method for each n 0 , belong in a ball B ( z 0 , R γ ) , and converge to a unique solution z * B ¯ ( z 0 , R γ ) of Equation (1).
Proof. 
The hypotheses ( H ) of Theorem 1 are verified immediately on D γ , if B ¯ ( z 0 , R ) , L , h , R are replaced by D γ , A γ , h γ and R γ , respectively. □
Next, we need to introduce an alternative to condition ( H 2 ):
Hypothesis 2’
( H 2 ) . For each x , y B z 0 , 1 A 0 D : = D 1 , there exists a parameter M > 0
F ( z 0 ) 1 ( F ( x ) F ( y ) ) M x y .
Notice that M L holds in general.
Next, we consider criterion (6) and improve a semi-local result given in [7].
Theorem 3.
Suppose that condition (6) and conditions ( H 1 ) , ( H 2 ) and ( H 3 ) are verified with
r 3 = η + A 0 η 2 2 ( 1 α ) ( 1 A 0 η ) ,
and
α = 2 M M + M 2 + 8 A 0 M ·
Then, the sequence { z n } is well defined by Newton’s method for each n 0 , belongs in the ball B ( z 0 , r 3 ) , and converges to a unique solution z * B ¯ ( z 0 , r 3 ) of Equation (1).
Proof. 
It follows by simply noticing that the iterates are such that z n D 1 , which is a more precise location than D used in previous works leading to M L ( D 1 D ). Then, the proof is analogous to the corresponding in Theorem 2 with M replacing L. □
The next theorem improves the result of Theorem 3.
Theorem 4.
Suppose that there exist z 0 D , η 0 , γ 1 , M γ > 0 and A 0 , γ 0 such that
F ( z 0 ) 1 L ( B 2 , B 1 ) ,
F ( z 0 ) 1 F ( z 0 ) η ,
D γ D ,
F ( z 0 ) 1 ( F ( x ) F ( z 0 ) ) A 0 , γ x z 0 f o r e a c h x D γ ,
F ( z 0 ) 1 ( F ( x ) F ( y ) ) M γ x y f o r e a c h x , y D 0 , γ : = D γ B ( z 0 , 1 A 0 , γ ) ,
h 3 , γ = 2 A 3 , γ η 1 ,
and
r 3 , γ γ η ,
where
A 3 , γ = 1 8 4 A 0 , γ + M γ A 0 , γ + 8 A 0 , γ 2 + A 0 , γ M γ ,
r 3 , γ = η + A 0 , γ η 2 2 ( 1 α γ ) ( 1 A 0 , γ η ) ,
and
α γ = 2 M γ M γ + M γ 2 + 8 A 0 , γ M γ ·
Then, the sequence { z n } is well defined by Newton’s method for each n 0 , belongs in the ball B ( z 0 , r 3 , γ ) , and converges to a unique solution z * B ¯ ( z 0 , r 3 , γ ) of Equation (1).
Proof. 
The result follows immediately from Theorem 2, if we replace D γ , A γ , h γ , R γ by D 0 , γ , A 0 , γ , h 3 , γ and r 3 , γ , respectively. □
Next, we consider criterion (7) and present a semi-local improving the convergence result of Newton’s method given in [8].
Theorem 5.
Suppose that conditions ( H 1 ) , ( H 2 ) , ( H 2 ) , ( H 3 ) , (8) and D γ D are verified, and there exist K 0 > 0 , K > 0 such that
F ( z 0 ) 1 ( F ( z 1 ) F ( z 0 ) ) K 0 z 1 z 0 ,
F ( z 0 ) 1 ( F ( z 0 + θ ( z 1 z 0 ) ) F ( z 0 ) ) K θ z 1 z 0 f o r e a c h θ [ 0 , 1 ] ,
h 4 = 2 A 4 η 1 ,
where
z 1 = z 0 F ( z 0 ) 1 F ( z 0 ) ,
A 4 = 1 2 η 0 1 ,
α 0 = L ( t 2 t 1 ) 2 ( 1 A 0 t 2 ) ,
t 1 = η , t 2 = η + K η 2 2 ( 1 K 0 η ) ,
r 4 = η + 1 + α 0 1 α K η 2 2 ( 1 K 0 η ) .
η 0 is defined by
η 0 = 1 A 0 + K 0 , i f B = L K + 2 α ( A 0 ( K 2 K 0 ) ) = 0 , p o s i t i v e r o o t o f p , i f B > 0 , s m a l l p o s i t i v e r o o t o f p , i f B < 0 ,
and
p ( t ) = ( L K + 2 α A 0 ( K 2 K 0 ) ) t 2 + 4 α ( A 0 + K 0 ) t 4 α .
Then, the sequence { z n } is well defined by Newton’s method for each n 0 , belongs in a ball B ( z 0 , r 4 ) , and converges to a unique solution z * B ¯ ( z 0 , r 4 ) of Equation (1).
Proof. 
As in the proof below Theorem 2. □
The next theorem improves the result of Theorem 5.
Theorem 6.
Suppose that there exist z 0 D , η 0 , γ 1 , K 0 , γ > 0 , K γ > 0 , M γ > 0 , and A 0 , γ 0 such that
F ( z 0 ) 1 L ( B 2 , B 1 ) ,
F ( z 0 ) 1 F ( z 0 ) η ,
D γ D ,
F ( z 0 ) 1 ( F ( z 1 ) F ( z 0 ) ) K 0 , γ z 1 z 0 ,
F ( z 0 ) 1 ( F ( z 0 + θ ( z 1 z 0 ) ) F ( z 0 ) ) K γ θ z 1 z 0 f o r e a c h θ [ 0 , 1 ] ,
F ( z 0 ) 1 ( F ( x ) F ( z 0 ) ) A 0 , γ x z 0 f o r e a c h x D γ ,
F ( z 0 ) 1 ( F ( x ) F ( y ) ) M γ x y f o r e a c h x , y D 1 , γ : = D γ B z 0 , 1 A 0 , γ ,
h 4 , γ = 2 A 4 , γ η 1 ,
and
r 4 , γ γ η ,
where
z 1 = z 0 F ( z 0 ) 1 F ( z 0 ) ,
α 0 , γ = M γ ( t 2 t 1 ) 2 ( 1 A 0 , γ t 2 ) ,
t 1 = η , t 2 = η + K γ η 2 2 ( 1 K 0 , γ η ) ,
r 4 , γ = η + 1 + α 0 , γ 1 α γ K γ η 2 2 ( 1 K 0 , γ η ) .
η 0 , γ is defined by
η 0 , γ = 1 A 0 , γ + K 0 , γ , i f B = M γ K γ + 2 α γ ( A 0 , γ ( K γ 2 K 0 , γ ) ) = 0 , p o s i t i v e r o o t o f p γ , i f M γ K γ + 2 α γ A 0 , γ ( K γ 2 K 0 , γ ) > 0 , s m a l l p o s i t i v e r o o t o f p γ , i f M γ K γ + 2 α γ A 0 , γ ( K γ 2 K 0 , γ ) < 0 ,
and
p γ ( t ) = ( M γ K γ + 2 α γ A 0 , γ ( K γ 2 K 0 , γ ) ) t 2 + 4 α γ ( A 0 , γ + K 0 , γ ) t 4 α γ .
Then, the sequence { z n } is well defined by Newton’s method for each n 0 , belongs in the ball B ( z 0 , r 4 , γ ) , and converges to a unique solution z * B ¯ ( z 0 , r 4 , γ ) of Equation (1).
Proof. 
The hypotheses of Theorem 2 are verified by replacing corresponding sets and Lipschitz parameters as done previously too. □
Similarly, we state a local convergence result of Newton’s methods.
Theorem 7
([5,7]). Suppose that there exist z * D , a 0 > 0 , and l > 0 such that
F ( z * ) = 0 ,
F ( z * ) 1 L ( B 2 , B 1 ) ,
F ( z * ) 1 ( F ( x ) F ( z * ) ) a 0 x z * f o r e a c h x D
F ( z * ) 1 ( F ( x ) F ( y ) ) l x y f o r e a c h x , y D 2 : = D B z * , 1 A 0 ,
and
B ¯ ( z * , ϱ ) D ,
where
ϱ = 2 2 a 0 + l ·
Then, the sequence { z n } for z 0 B ( z * , ϱ ) \ { z * } is well defined by Newton’s method for each n 0 , belongs in a ball B ( z * , ϱ ) , and converges to a z * . In addition, the limit point z * is the only solution of Equation (1) in B ¯ ( z * , T ) D for T ϱ , 2 a 0 .
Proof. 
See the comments below Theorem 2 for the analogous proof. □
The next Theorem improves the result of Theorem 7.
Theorem 8.
Suppose that there exist z * D , δ 1 , a 0 , δ > 0 , and a δ > 0 such that
F ( z * ) = 0 , F ( z * ) 1 L ( B 2 , B 1 ) ,
F ( z * ) 1 ( F ( x ) F ( z * ) ) a 0 , δ x z * f o r e a c h x D δ ,
F ( z * ) 1 ( F ( x ) F ( y ) ) a δ x y f o r e a c h x , y D 3 : = D δ B ( z * , 1 a 0 , δ ) ,
D δ = B ¯ ( z * , δ z 0 z * ) D f o r z 0 D ,
and
ϱ δ δ z 0 z * ,
with
ϱ δ = 2 2 a 0 , δ + a δ ·
Then, the sequence { z n } generated for z 0 B ( z * , ϱ δ ) \ { z * } is well defined by Newton’s method for each n 0 , belongs in a ball B ( z * , ϱ δ ) , and converges to a limit z * . Moreover, the limit point z * is the only solution of Equation (1) in B ¯ ( z * , T ) D for T ϱ δ , 2 a 0 , δ .
Proof. 
The Theorem proven by the hypotheses of Theorem 8 is satisfied on the domain D δ . □
Remark 1.
(a) 
Given ξ > η and η 0 , we considered D = B ( z 0 , ξ ) , then γ 1 , ξ η .
(b) 
Given γ = 2 1 + 1 2 A γ η , then condition R γ γ η equality is fulfilled. If γ is given by γ = 2 , then again R γ γ η , since we have that R γ 2 η = γ η .
(c) 
Then, we have that
A 0 , γ L ,
A γ L ,
K 0 , γ K 0 ,
and
K γ K .
Therefore, we get that
h 1 h γ 1 ,
h 3 1 h 3 , γ 1 ,
and
h 4 1 h 4 , γ 1
only if A 0 , γ = L , A γ = L , K 0 , γ = K 0 and K γ = K . The reciprocal is given.
Note also that the new major sequences are more accurate than the corresponding previous sequences. As an example, the majority sequences { t n } , { t ¯ n } defined by Newton’s method, corresponding to criteria h 1 and h γ 1 , are given as:
t 0 = 0 , t 1 = η , t n + 1 = t n + L ( t n t n 1 ) 2 2 ( 1 L t n ) ,
t ¯ 0 = 0 , t ¯ 1 = η , t ¯ n + 1 = t ¯ n + A γ ( t ¯ n t ¯ n 1 ) 2 2 ( 1 A 0 , γ t ¯ n ) .
Then, using mathematical induction, it immediately follows that:
t ¯ n t n ,
0 t ¯ n + 1 t ¯ n t n + 1 t n ,
and
R γ R .
If A γ < L , strict inequality remains with n 2 in the first inequality and for n 1 in the second case. Furthermore, it is clear that R γ < R . Therefore, the location information of the solution z * beats the previous information. Similarly, there are corresponding improved sequences to the other “h” and “ h γ ” conditions. Finally, it should be taken into account that the majorizing sequences corresponding to the conditions (5)–(7) have already been proven to be more precise than the sequence { t n } corresponding to condition (4).
(d) 
If D = B ( z * , ξ ) for some ξ > z 0 z * , then δ can b chosen so that δ 1 , ξ z 0 z * for z 0 z * .
(e) 
We have that
a 0 , δ a 0
and
a δ l .
Therefore, we get that
ϱ ϱ δ .
Moreover, if a 0 , δ < a 0 or a δ < l , then ϱ < ϱ δ . The corresponding error limits are also improved, since we have
z n + 1 z * l z n z * 2 2 ( 1 a 0 z n z * ) ·
It should be noted that, if a 0 = l , then Theorem 2.8 reduces to the corresponding by Rheinboldt [20] and Traub [21]. The radius found independently by these authors is given by
ϱ ¯ = 2 3 l ¯ ·
However, if a 0 < l , then our radius is such that
ϱ ¯ < ϱ < ϱ δ
and
ϱ ¯ ϱ 1 3 a s a 0 l ¯ 0 .
Therefore, our convergence radius ϱ can be at most three times greater than ϱ ¯ .
Remark 2.
The result with the new Lipschitz constants improves the ones in [13], since the new are smaller than the old ones.

3. Numerical Examples

Example 1.
In the same case as Example 1, let p = 49 100 and γ = 19 10 . Then, we have that η = 17 100 , γ η = 323 1000 and R γ = 0.258 l < 0.323 < 1 p . Hence, the hypotheses of Theorem 2 are satisfied.
Example 2.
Let B 1 = B 2 = C [ 0 , 1 ] , and let Ω = { x C [ 0 , 1 ] ; x R } , where R > 0 and operator F can be expressed as
F ( x ) ( s ) = x ( s ) f ( s ) λ 0 1 G ( s , t ) x ( t ) 3 d t , x C [ 0 , 1 ] , s [ 0 , 1 ] ,
considering f C [ 0 , 1 ] , λ is the real parameter, and G is the famous Green function.
If we choose z 0 ( s ) = f ( s ) = 1 , it follows I F ( z 0 ) 3 | λ | / 8 . Thus, if | λ | < 8 / 3 , the inverse at the starting point is defined and choosing λ = 1 , γ = 6 and R = 2 , we obtain
η = 0.2 ,
A 6 = 1.64 ,
A 0 , 6 = 1.52 ,
A 3 , 6 12.37 ,
α 6 0.51 ,
r 3 , 6 0.29 ,
and
2 A 3 , 6 η 0 . 66 1 .
Then, Newton’s method converges by our conditions.
Example 3.
Let B 1 = B 2 = R 3 , D = B ¯ ( 0 , 1 ) . Define F on D for v = ( x , y , z ) T by
F ( v ) = e x 1 , e 1 2 y 2 + y , z T .
Then, the Fréchet derivative is computable, and it is easy to see that z * = ( 0 , 0 , 0 ) , F ( z * ) = F ( z * ) 1 = d i a g { 1 , 1 , 1 } , a 0 = e 1 , l < l ¯ = e and g ¯ = 0.24 < g = 0.38 , where l = e 1 e 1 , a 0 < l < l ¯ so the ( A ) advantages hold. Then, Newton’s method converges.

4. Conclusions

A new technique has been developed to extend the convergence domain of Newton’s method. The novelty of it is that no additional criteria are needed than in earlier studies [7,8] for convergence in both the local as well as the semi-local convergence of Newton’s method. We have given the sufficient convergence criteria of earlier studies and then demonstrated the superiority of our new criteria. Due to locality of our results, we cannot say anything about global results in a Banach space setting unless D = B 1 . These are the limitations (disadvantages) of our study. However, the extensions are already given by advantages ( A ) . Numerical advantages have been used to further validate the theoretical results.

Author Contributions

Conceptualization, C.A., I.K.A., D.G., Á.A.M., S.R., and Í.S.; methodology, C.A., I.K.A., D.G., Á.A.M., S.R., and Í.S.; validation, C.C., I.K.A., D.G., Á.A.M., S.R., and Í.S.; formal analysis, C.A., I.K.A., D.G., Á.A.M., S.R., and Í.S.; investigation, C.A., I.K.A., D.G., Á.A.M., S.R., and Í.S.; resources, C.A., I.K.A., D.G., Á.A.M., S.R., and Í.S.; writing—original draft preparation, C.A., I.K.A., D.G., Á.A.M., S.R., and Í.S.; writing—review and editing, C.A., I.K.A., D.G., Á.A.M., S.R., and Í.S.; visualization, C.A., I.K.A., D.G., Á.A.M., S.R., and Í.S.; supervision, C.A., I.K.A., D.G., Á.A.M., S.R., and Í.S.; project administration, C.A., I.K.A., D.G., Á.A.M., S.R., and Í.S. All authors have read and agreed to the published version of the manuscript.

Funding

Research is supported in part by Séneca 20928/PI/18 and by MINECO PGC2018-095896-B-C21.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Kantorovich, L.V.; Akilov, G. Functional Analysis; Pergamon Press: Oxford, UK, 1982. [Google Scholar]
  2. Amat, S.; Busquier, S.; Bermúdez, C.; Magreñán, Á.A. On a two-step relaxed Newton-type method. Appl. Math. Comput. 2013, 219, 11341–11347. [Google Scholar] [CrossRef]
  3. Amat, S.; Magreñán, Á.A.; Romero, N. On the election of the damped parameter of a two-step relaxed Newton-type method. Nonlinear Dyn. 2016, 84, 9–18. [Google Scholar] [CrossRef]
  4. Argyros, I.K.; González, D.; Magreñán, Á.A. A Semilocal Convergence for a Uniparametric Family of Efficient Secant-Like Methods. J. Funct. Spaces 2014, 2014, 467980. [Google Scholar] [CrossRef]
  5. Argyros, I.K. Convergence and Application of Newton–Type Iterations; Springer: Berlin/Heidelberg, Germany, 2008. [Google Scholar]
  6. Argyros, I.K.; Hilout, S. Numerical Methods in Nonlinear Analysis; World Scientific Publishing: Hackensack, NJ, USA, 2013. [Google Scholar]
  7. Argyros, I.K.; Hilout, S. Weaker conditions for the convergence of Newton’s method. J. Complex. 2012, 28, 364–387. [Google Scholar] [CrossRef] [Green Version]
  8. Argyros, I.K.; Hilout, S. On an improved convergence analysis of Newton’s method. Appl. Mah. Comput. 2013, 225, 372–386. [Google Scholar] [CrossRef]
  9. Argyros, I.K.; Magreñán, Á.A. Iterative Methods and Their Dynamics with Applications: A Contemporary Study; CRC Press: Boca Ratón, FL, USA, 2017. [Google Scholar]
  10. Argyros, I.K.; Magreñán, Á.A.; Orcos, L.; Sarría, Í. Unified local convergence for Newton’s method and uniqueness of the solution of equations under generalized conditions in a Banach space. Mathematics 2019, 7, 463. [Google Scholar] [CrossRef] [Green Version]
  11. Argyros, I.K.; Magreñán, Á.A.; Orcos, L.; Sarría, Í. Advances in the semilocal convergence of Newton’s method with real-world applications. Mathematics 2019, 7, 299. [Google Scholar] [CrossRef] [Green Version]
  12. Cordero, A.; Gutiérrez, J.M.; Magreñán, Á.A.; Torregrosa, J.R. Stability analysis of a parametric family of iterative methods for solving nonlinear models. Appl. Math. Comput. 2016, 285, 26–40. [Google Scholar] [CrossRef]
  13. Kou, J.; Wang, B. semi-local convergence of a modified multi–point Jarratt method in Banach spaces under general continuity conditions. Numer. Algorithms 2012, 60, 369–390. [Google Scholar]
  14. Lotfi, T.; Magreñán, Á.A.; Mahdiani, K.; Rainer, J.J. A variant of Steffensen-King’s type family with accelerated sixth-order convergence and high efficiency index: Dynamic study and approach. Appl. Math. Comput. 2015, 252, 347–353. [Google Scholar] [CrossRef]
  15. Magreñán, Á.A. Different anomalies in a Jarratt family of iterative root-finding methods. Appl. Math. Comput. 2014, 233, 29–38. [Google Scholar]
  16. Magreñán, Á.A.; Argyros, I.K. A new tool to study real dynamics: The convergence plane. Appl. Math. Comput. 2014, 248, 215–224. [Google Scholar] [CrossRef] [Green Version]
  17. Magreñán, Á.A. On the local convergence and the dynamics of Chebyshev-Halley methods with six and eight order of convergence. J. Comput. Appl. Math. 2016, 298, 236–251. [Google Scholar] [CrossRef]
  18. Magreñán, Á.A.; Gutiérrez, J.M. Real dynamics for damped Newton’s method applied to cubic polynomials. J. Comput. Appl. Math. 2015, 275, 527–538. [Google Scholar] [CrossRef]
  19. Ren, H.; Argyros, I.K. Convergence radius of the modified Newton method for multiple zeros under Hölder continuous derivative. Appl. Math. Comput. 2010, 217, 612–621. [Google Scholar] [CrossRef]
  20. Rheinboldt, W.C. An Adaptive Continuation Process for Solving Systems of Nonlinear Equations; Banach Center Publications, Polish Academy of Science: Warszawa, Poland, 1978; Volume 3, pp. 129–142. [Google Scholar]
  21. Traub, J.F. Iterative Methods for the Solution of Equations; Series in Automatic Computation; Prentice–Hall: Englewood Cliffs, NJ, USA, 1964. [Google Scholar]
  22. Burrows, A.; Lockwood, M.; Borowczak, M.; Janak, E.; Barber, B. Integrated STEM: Focus on Informal Education and Community Collaboration through Engineering. Edu. Sci. 2018, 8, 4. [Google Scholar] [CrossRef] [Green Version]
  23. Nakakoji, Y.; Wilson, R. First-Year Mathematics and Its Application to Science: Evidence of Transfer of Learning to Physics and Engineering. Edu. Sci. 2018, 8, 8. [Google Scholar] [CrossRef] [Green Version]
  24. Prieto, M.C.; Palma, L.O.; Tobías, P.J.B.; León, F.J.M. Student assessment of the use of Kahoot in the learning process of science and mathematics. Edu. Sci. 2019, 9, 55. [Google Scholar] [CrossRef] [Green Version]
  25. Dejam, M. Advective-diffusive-reactive solute transport due to non-Newtonian fluid flows in a fracture surrounded by a tight porous medium. Int. J. Heat Mass Transf. 2019, 128, 1307–1321. [Google Scholar] [CrossRef]
  26. Jordán, C.; Magreñán, Á.A.; Orcos, L. Considerations about flip education in the teaching of advanced mathematics. Edu. Sci. 2019, 9, 227. [Google Scholar] [CrossRef] [Green Version]
  27. Kou, Z.; Dejam, M. Dispersion due to combined pressure-driven and electro-osmotic flows in a channel surrounded by a permeable porous medium. Phys. Fluids 2019, 31, 056603. [Google Scholar] [CrossRef]
Figure 1. General sketch of the problem.
Figure 1. General sketch of the problem.
Mathematics 08 00103 g001

Share and Cite

MDPI and ACS Style

Amorós, C.; Argyros, I.K.; González, D.; Magreñán, Á.A.; Regmi, S.; Sarría, Í. New Improvement of the Domain of Parameters for Newton’s Method. Mathematics 2020, 8, 103. https://doi.org/10.3390/math8010103

AMA Style

Amorós C, Argyros IK, González D, Magreñán ÁA, Regmi S, Sarría Í. New Improvement of the Domain of Parameters for Newton’s Method. Mathematics. 2020; 8(1):103. https://doi.org/10.3390/math8010103

Chicago/Turabian Style

Amorós, Cristina, Ioannis K. Argyros, Daniel González, Ángel Alberto Magreñán, Samundra Regmi, and Íñigo Sarría. 2020. "New Improvement of the Domain of Parameters for Newton’s Method" Mathematics 8, no. 1: 103. https://doi.org/10.3390/math8010103

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