Abstract
There are a plethora of semi-local convergence results for Newton’s method (NM). These results rely on the Newton–Kantorovich criterion. However, this condition may not be satisfied even in the case of scalar equations. For this reason, we first present a comparative study of established classical and modern results. Moreover, using recurrent functions and at least as small constants or majorant functions, a finer convergence analysis for NM can be provided. The new constants and functions are specializations of earlier ones; hence, no new conditions are required to show convergence of NM. The technique is useful on other iterative methods as well. Numerical examples complement the theoretical results.
MSC:
49M15; 65J15; 65G99
1. Introduction
The concern of this study is to solve the following nonlinear equation
using the celebrated Newton’s method (NM) in the following form
Here, is differentiable according to Fréchet and operates between Banach spaces and , whereas subset
Kantorovich provided the semi-local convergence analysis of NM utilizing Banach’s contraction mapping principle. In particular, he presented two different proofs using majorant functions or recurrent relations [1]. The Newton-Kantorovich Theorem is that no assumption as to the solution is made, while at the same time the existence of the solution is established. Numerous researchers have used this theorem, both in applications and as a theoretical tool [2,3,4,5,6,7,8,9,10]. While the convergence criteria may not hold, NM may converge.
Assume that there exist constants , and a point such that the Lipschitz condition
and
hold for each The main convergence criterion is provided by
There are even simple scalar equations where criterion (5) is not satisfied. Indeed, let and set Then, conditions (3) and (4) are satisfied provided that and However, then condition (5) is not satisfied for any as Hence, there is a need to replace (5) with a weaker criterion without adding conditions. The same extension is useful in the Hölder case or when is replaced by a majorant function. The last two cases are not considered in [11]. Moreover, the Lipschitz case is extended further than in [11] (see the end of Section 4). This is the motivation for presenting new results that both extend the convergence region and provide more precise error estimates and better knowledge as to the location of the solution. In this way, the use of NM can be extended. The novelty of the present article is that these benefits require no additional conditions. The same technique used here can be applied to extend other iterative methods along the same lines.
2. Majorizing Sequences
Real functions are utilized to develop sequences that are shown to be majorizing for NM in Section 3. Let Assume:
There exist functions non-decreasing and continuous such that function has a smallest zero Set Consider function for continuous and non-decreasing.
Let be a given constant. Define scalar sequence for by
Next, results appear on the convergence of sequence
Lemma 1.
Assume:
and
Then, sequence is such that and where is the unique least upper bound of sequence satisfying
Proof.
Remark 1. (i) If function is strictly increasing, then in conditions (8) and (9) can be defined by
(ii), although the conditions of Lemma 1 can be verified by constructing sequence in advance. Next, convergence conditions which are stronger than (7)–(9) are provided, which are easier to verify. Let be non-negative constants and Define functions
and
Notice that for the Lipschitz and for the Hölder case is obtained. It follows from these definitions that sequence is reduced for to
Define parameters and by
and
Moreover, define functions on the interval for by
and
Next, the second convergence result for sequence obtained by (11) is presented, using the preceding notation.
Lemma 2.
Assume:
(H1)
or
(H2)
Then, the following assertions hold under condition (H1):
and the following under condition (H2):
Moreover, if under condition (H1)
or under condition (H2)
hold, then sequence obtained by (11) is such that and
Proof.
Induction is utilized to show
Inequality (18) holds if per the definition of and Then, it follows per (11) that
Assume estimates (19) and (20) hold for all values of It follows by the induction hypotheses that
and
Hence, per estimates (21) and (22), assertion (18) holds if
or
The recurrent functions are related, as
Case of Condition (H1): Define function
Per estimates (23) and (26), it follows that
and
Thus, estimate (24) holds if
which is true per condition (16). The induction under (H1) is terminated.
Case of Condition (H2): It follows that estimate (24) holds, as
That is, the induction is completed under condition (H2) as well. Hence, under either condition (H1) or (H2), sequence is non-decreasing and bounded from above. Hence, it converges to □
Remark 2.
Define function by
It follows that and Hence, the intermediate value theorem ensures that the equation has zeros in Denote by the smallest such zero. Notice that
The parameter δ is preferred in closed form. This is possible in certain cases.
Lipschitz Case: Set Then, the choice for
In the case that the zero is not in closed form; instead
Indeed, because solves equation then
leading to condition (33). Under (H1), one obtains , and condition (16) becomes
By solving the left hand side inequality for η,
The right hand side inequality in condition (34) is solved as follows:
Case: Set
Hence, (34) holds if
To consider the rest of the cases, define function by
Denote by Δ the discriminant of If and set
Then, condition (34) holds if
If and then φ has a positive zero denoted by Then, (34) holds if
If and then denote by the positive zero of function Then, condition (34) holds if
If and the right hand side of (34) is not solvable and does not hold.
Hölder Case. Let Per the definition of functions , it follows that
Thus, condition (H2) becomes
where
The convergence conditions in this Section are compared to existing ones in Section 4.
3. Convergence of NM
The notation refers to the open and closed balls with radius and center respectively. The semi-local convergence of NM is presented under conditions (A). The functions are provided in Section 2. Assume:
- (A1)
- There exist such that and
- (A2)
- andwhere
- (A3)
- Set
- (A4)
- (A5)
- Conditions of Lemma 1 hold and
- (A6)
- (or ).
Next, the main semi-local convergence result for NM is developed.
Theorem 1.
Assume conditions (A) hold. Then, the sequence generated by NM exists in stays in for all and converges to a solution of equation
Proof.
Estimates
and
shall be shown by induction. Let It follows that
Thus, Then, we obtain
per condition (A1), implying that estimates (43) and (44) hold for Assume (43) and (44) hold for all It follows that
and
Let Using (A2), we obtain
Hence, and
are derived by Lemma on invertible linear operators due to Banach [2,9,12]. In particular, for iterate exists per the second substep of NM. Moreover, one can write
Then, by (A2) and estimate (46), it follows that
It then follows from estimates (46) (for ), (48) and NM for that
Similarly, we can write
Thus, per condition (A4) and estimates (46) and (50) (for ),
Consequently,
Hence, estimate (43) holds Furthermore, if one obtains
thus, Induction for estimates (43) and (44) is terminated. Sequence is fundamental as convergent. Hence, per estimate (43) and (44), sequence is fundamental in a Banach space as well, and thus converges to some Per the continuity of and letting in estimate (48), it follows that □
Next, we present a uniqueness of the solution result.
Proposition 1.
Assume:
(i) Point is a simple solution of equation in for some and condition (A3) holds.
(ii) There exists such that
Let Then, the only solution of equation is
Proof.
Assume there exists such that Set Then, it follows from conditions (A3) and (54) that
Thus, is implied by the invertibility of and the approximation □
Remark 3.
Proposition 1 uses only condition (A3). However, under conditions (A) set
4. Discussion and Conclusions
There are a plethora of results on NM. The sufficient convergence criteria in these studies are weakened by the new technique without adding conditions (see the numerical Section). Notice that with the developed technique there is an at least as tight subset of containing the iterates. Therefore, the Lipschitz–Hölder majorant functions are at least as tight as the ones provided in earlier studies, leading to the advantages stated in the introduction. Below, we provide several examples.
Assume [2,9,13]
for all Define function
and iteration per :
The sufficient convergence criterion is derived supposing that scalar function has a smallest positive zero However, under condition (A4), define instead for
Notice that
In particular as .
and has an at least as small zero Hence, the new convergence criterion is at least as weak. This is the contribution in the case of majorant functions.
In particular, in the case where and are constant functions, such as
then
and
which is weaker, as and is the Lipschitz constant on
(a) Lipschitz Case: Convergence criteria already in the literature are listed below in the left column, and the new criteria in the right column.
where
and
It follows from these definitions that
Consequently,
although not necessarily vice versa unless . Parameter is the Lipschitz constant on used by Kantorovich and others [1,7]. Another comparison between convergence criteria can be made as follows. Notice that
Similarly,
These limits show by how many times at most the applicability of NM can be extended. Moreover, under the new approach this applicability is extended even further. Indeed, notice that
Similarly,
Clearly, the new convergence criterion can be arbitrarily many times weaker than the previous ones. This technique of replacing constants with smaller ones leads to both weaker criteria and more precise majorizing sequences. Indeed, consider again iterations and with the choice of functions and obtained by (62) and (63), respectively. It follows that
then
and
as
and
where
The constant was reported by Kantorovich. Hence, tighter error estimates on and become possible if .
| [1] (66) |
| [12] (67) |
| [11,14] (68) |
| [12] (69) |
Moreover, the information on the location of the solution is more accurate if , which is possible for . Concerning the uniqueness of the solution balls, where
Thus, the uniqueness of the solution ball is extended. The constant is provided by Kantorovich. Furthermore, if we choose and assume , set . Then, if , and the solution is unique in the ball according to Proposition 1. This is the contribution in the Lipschitz case.
(b) Hölder Cases:
where the new contributions are, respectively,
and
Hence,
and
Notice that the proofs of and are implied by respectively, if is used instead of The conditions of Lemma 1 are weaker than all preceding, whereas those of Lemma 1 can be weaker as well, as and (see the numerical Section).
| [1,2,4,6,13,15] |
Notice again that the Hölder conditions of the Lemmas and Remark 2 are weaker as well. This is the contribution in the Hölder case.
- (c) It turns out that the results can be weakened even more if Lipschitz or Hölder constants are replaced by constants at least as small in two different ways, namely:
- (i) Noting that convergence conditions should not hold for all , only for and , the proofs of the results proceed in this weaker setting. However, the corresponding constant is at least as tight. Denote such a constant per ; it follows that .
- (ii) Consider ball for and have replace in condition (A3). Then, as , the constant is again at least as small. Denote such a constant per . It follows that . The rest of the convergence results found in the literature can be immediately weakened under this technique as well.
Finally, it is worth noticing that the new constants are special cases of . Hence, the benefits under the new technique are obtained without additional computational effort or conditions, which represents one contribution of this paper.
5. Numerical Experiments
In the first example, the new constants are smaller than those of earlier studies.
Example 1.
Define scalar function
for where and are real parameters. It follows by this definition that for sufficiently large and for sufficiently small can be arbitrarily small. In particular,
In the last two examples, Kantorovich criterion (66) is not satisfied; however, the new criterion (66) holds.
Example 2.
Let for and Define real function F on Ω as
Then, the parameters are Moreover, one obtains thus Denote by the set of values q for which conditions () are satisfied. Then, by solving inequalities (66)–(69) for q, and respectively.
Next, the new conditions are tested. Concerning the new criterion (66), the inequality
must be solved, obtaining ; thus,
Similarly, when solving for q in new criteria (67)–(69), the intervals are extended. This is due to the fact that for all q in M. Hence, the range of values q is extended in the new approach. Notice in particular that the Newton–Kantorovich criterion (66) is not satisfied for any
Example 3.
Let be the domain of continuous real functions defined on the interval The max-norm is used. Set and define operator F on Ω as
where y is given in and N is a kernel obtained by Green’s function as
It follows per this definition that the derivative of F
Pick It then follows from (78)–(80) that
and thus Notice that and Choose The Kantorovich convergence criterion (66) is not satisfied, as Hence, convergence of converge NM is not assured by the Kantorovich criterion. However, new criterion (66) is satisfied, as
6. Conclusions
A comparison study between results on the semi-local convergence of NM is provided. The technique uses recurrent functions. In this way, the new sufficient convergence criteria are weaker in the Lipschitz, Hölder, and more general cases, as they rely on smaller constants. Other benefits include more precise error bounds and uniqueness of the solution results. The new constants are special cases of earlier ones. The technique is very general, rendering it useful to extend the usage of other iterative methods.
Author Contributions
Conceptualization, S.R., C.I.A., I.K.A. and S.G.; methodology, S.R., C.I.A., I.K.A. and S.G.; software, S.R., C.I.A., I.K.A. and S.G.; validation, S.R., C.I.A., I.K.A. and S.G.; formal analysis, S.R., C.I.A., I.K.A. and S.G.; investigation, S.R., C.I.A., I.K.A. and S.G.; resources, S.R., C.I.A., I.K.A. and S.G.; data curation, S.R., C.I.A., I.K.A. and S.G.; writing—original draft preparation, S.R., C.I.A., I.K.A. and S.G.; writing—review and editing, S.R., C.I.A., I.K.A. and S.G.; visualization, S.R., C.I.A., I.K.A. and S.G.; supervision, S.R., C.I.A., I.K.A. and S.G. project administration, S.R., C.I.A., I.K.A. and S.G.; funding acquisition, S.R., C.I.A., I.K.A. and S.G. 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
- Kantorovich, L.V.; Akilov, G.P. Functional Analysis; Pergamon Press: Oxford, UK, 1982. [Google Scholar]
- 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]
- Cianciaruso, F.; De Pascale, E. The Newton-Kantorovich approximations when the derivative is Hölder: Old and New Results. Numer. Funct. Anal. 2003, 24, 713–723. [Google Scholar] [CrossRef]
- Demidovich, N.T.; Zabreiko, P.P.; Lysenko, J.V. Some remarks on the Newton-Kantorovich method for nonlinear equations with Hölder continuous linearizations. Izv. Akad. Nauk Beloruss 1993, 3, 22–26. (In Russian) [Google Scholar]
- De Pascale, E.; Zabreiko, P.P. The convergence of the Newton-Kantorovich method under Vertgeim conditions: A new improvement. Z. Anal. Anwend. 1998, 17, 271–280. [Google Scholar] [CrossRef]
- Ezquerro, J.A.; Hernandez, M.A. Newton’s Methods: An Updated Approach of Kantorovich’s Theory; Birkhäuser: Cham, Switzerland, 2017. [Google Scholar]
- Ortega, L.M.; Rheinboldt, W.C. Iterative Solution of Nonlinear Equations in Several Variables; Academic Press: New York, NY, USA, 1970. [Google Scholar]
- Potra, F.A.; Pták, V. Nondiscrete Induction and Iterative Processes; Research Notes in Mathematics, 103; Pitman (Advanced Publishing Program): Boston, MA, USA, 1984. [Google Scholar]
- 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]
- Yamamoto, T. Historical developments in convergence analysis for Newton’s and Newton-like methods. J. Comput. Appl. Math. 2000, 124, 1–23. [Google Scholar] [CrossRef]
- Argyros, I.K. Unified Convergence Criteria for Iterative Banach space Valued Methods with Applications. Mathematics 2021, 9, 1942. [Google Scholar] [CrossRef]
- Argyros, I.K.; Hilout, S. On an improved convergence analysis of Newton’s scheme. Appl. Math. Comput. 2013, 225, 372–386. [Google Scholar]
- 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. and Optim. 1987, 9, 671–684. [Google Scholar] [CrossRef]
- Argyros, I.K.; Hilout, S. Weaker conditions for the convergence of Newton’s method. J. Complex. 2012, 28, 364–387. [Google Scholar] [CrossRef]
- Vertgeim, B.A. On some methods of the approximate solution of nonlinear functional equations in Banach spaces. Engl. Transl. Am. Math. Soc. Transl. 1960, 16, 378–382. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).