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 is shown for 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 and be Banach spaces, and let be a nonempty convex subset of In addition, is a Fréchet differentiable mapping between the Banach spaces abd Let also denote the space of bounded linear operators from into The nonlinear equation
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
for 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 [,]. He presented two different proofs based on majorant functions and recurrent relations [,]. 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 [,,,,,,,] shows that convergence criteria may not be satisfied. However, (NP) may converge. That is why these criteria are weakened in [] without new conditions. However, only linear convergence was obtained for (NP) with the techniques employed in [].
In the present study, by employing different and more precise techniques, the elusive convergence order is obtained for This is achieved by choosing a bit smaller upper bound on Another new feature involves an explicit upper bound on the smallness of the initial approximation not given in []. Notice also that the present study is written completely independently of the corresponding one in []. 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 [] and others [,,,,], 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 [,,,,,,]. This will be the topic of future work.
2. Majorization
Let be positive parameters and
The sequence generated for and for by
plays a critical role as a majorizing sequence for (NP) in the Lipschitz case () as well as the Hölder one ().
Two convergence results for sequence are developed.
Lemma 1.
Suppose
and
Then, the following assertions hold
and
where
Proof.
The assertions follow by the definition of the sequence and the conditions of Lemma 1. □
Another convergence result follows.
It is convenient to develop parameters, , and set Moreover, introduce functions depending on parameter p and defined on the interval S for by
and
Next, some properties for these functions are presented.
Lemma 2.
and
Then, the sequence is such that
and
where
The following assertions hold
and
Define the parameter δ by
Moreover, suppose
- (I)
- or
- (II)
- if where the parameter is the smallest zero in of the function
Proof.
The assertions on functions and follow immediately by their definitions. If by using the quadratic formula the parameter is obtained. Then, the definition of the function for implies and Let again stand for the smallest zero of the function in assured to exist by the (IVT) (intermediate Value Theorem). Similarly the definition of parameter is assured by (IVT), since and as
Notice also that under (I)
whereas under condition (II)
and
where Hence, the sequence is bounded from above by and non-decreasing. □
Next, we show that condition (I) can be solved in terms of as in case (II).
Define the real quadratic polynomials by
and
The discriminants of these polynomials can be written as
and
respectively. It follows by the definition of and that
and so
That is the polynomials and have the same roots. Denote by the unique positive root of polynomial This root is given by the quadratic formula and can be written as
Moreover, denote by the common positive root of the polynomials and This root can be written as
Define the parameter by
Suppose that the nonnegative number is such that
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 [,,].
By the choice of the parameters and the polynomials and the condition (4) we get follows that
since and We infer that
and
Furthermore, the following estimate holds
Indeed, the left hand side inequality reduces to showing and the right hand side to showing Conditions (4) provides the smallness of to force convergence of the sequence By choosing to be a little bit larger the convergence is recovered as follows. Let Set and
Define function on interval S by
where
These definitions imply and as Denote by the smallest zero of the function on the interval Define
Let the sequence be defined as in the Formula (3). Then its convergence is of order
Lemma 3.
Let be such that
Then, the following assertions hold
and
The convergence order of the sequence is
Proof.
Induction is used to show
where and Then, this assertion holds for by the choice of Then, the assertion (7) holds if using Lemma 2
Define the functions
It suffices to show
The definitions of the functions yield
Define the function on the interval S by
By the definition of the functions it suffices to show which is true by the choice of The induction is completed. It follows by the sequence and Lemma 2
so
which shows the first assertion. Moreover, if
The second assertion follows if 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 make the proof of Lemma 3 possible.
Next, the Banach lemma on the invertible operators is recalled.
Lemma 4
([,]). If Q is a bounded linear operator in exists if and only if there is a bounded linear operator P in such that exists and
If exists, then
and
3. Convergence of (NP)
The notation means the open and closed balls with radius and center respectively. The parameters , and are connected with the operator F as follows. Consider conditions (A):
Suppose
- (A1)
- There exist such thatand
- (A2)
- forSet
- (A3)
- for and for
- (A4)
- The conditions of the preceding Lemma 1 or Lemma 2 or Lemma 3 hold.
- (A5)
Notice that
Next, conditions (A) are applied to show the main convergence result for (NP).
Theorem 1.
Under the conditions in (A) any (NP) sequence is convergent to a solution of the equation Moreover, upper bounds of the form
hold for all
Proof.
The assertions
and
are shown by induction Let The following inequalities are consequences of conditions (A1) together with the equality
So, the vector That is assertions (9) and (10) hold for Assume these assertions hold if It follows for each
and
By the induction hypotheses, by Lemmas 1–3 and the conditions (A1), (A2), and (A4), it follows that
Hence, the inverse of the linear operator exists. Therefore, and
follows as a consequence of Lemma 4, where The following general integral equality is implied by (NP)
Then, using the induction hypotheses, estimate (9) and condition (A3)
where
It follows by (NP), estimates (11), (13) and the definition (3) of the sequence
where and Moreover, if it follows
So, the vector completing the induction for assertions (9) and (10). Notice that the scalar majorizing sequence is fundamentally convergent. Hence, the sequence is also convergent to some Furthermore, let in estimate (13), to conclude □
Next, the uniqueness ball for a solution is presented. Notice that not all conditions mentioned in (A) are used.
Proposition 1.
Let, for some the center-Lipschitz condition (A2) be satisfied. Further assume that there exists such that there exists a solution of equation (1) and such that linear operator is invertible. Let the parameter be given by
Then, the point s solves uniquely the equation in the set
Proof.
Define the linear operator for some point satisfying By using the definition of set and condition (A2),
concluding that where the invertibility of the linear operator is also used together with the approximation □
Remark 1.(i) Under the conditions in (A), the existence of is assured. In this case set and
(ii) Condition (A3) can be replaced by
and This even smaller parameter can replace L in the aforementioned results. The existence of the iterate 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 studied in [] defined by
Suppose function
is nondecreasing and bounded from above by some Then, the same proof as Lemma 3 recovers the order of convergence for this general iteration provided that and the conditions of Lemma 1 or Lemma 2 in [] hold. This is due to the calculation
Then, under the conditions of Theorem 1 and Proposition 1 in [] the conclusions, hold for a sequence in this more general setting, where it is also shown that the convergence order is In the case when are constant functions, then, set Hence condition (17) can be realized. Notice that sequence specializes to if and Under, these choices of functions Lemma 1 and Theorem 1 coincide with the corresponding ones in []. Moreover, the rest of the Lemmas in [] show only linear convergence of majorizing sequences and, consequently of the sequence However, in Lemma 3, the convergence order is obtained.
Finally, in Lemma 2, in [], the upper bound on η is not given explicitly in all cases, nor is the convergence order 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)
The interval is divided into j subintervals. Set Denote by the points of subdivision with corresponding values of the function Then, the discretization of is given by
Further, notice that It follows that the following system of equations is obtained
This system can be converted into an operator equation as follows: Define operator whose derivative is given as
Pick be arbitrary. The norm used is where as the norm for is given as
Then, pick for to obtain in turn
Choose as an initial guess vector to obtain after four iterations Then, the parameters are Then, The following Table 1 shows that the conditions of Lemma 1 are satisfied, since for Hence, the conditions of Theorem 1 hold.
Table 1.
Sequence (3).
By using the initial vector on (NP) the generated vector is not good enough to apply Theorem 1. However, after four iterations, the vector 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 Then, using the preceding values Therefore, the convergence order is Hence, the conclusions of Theorem 1 hold. The corresponding criteria in ([Remark 2, for the Hölder case], []) are
where and However, these conditions give an implicit estimate on the smallness they are not satisfied for this example for However, even if they were the convergence of the sequence is only linear. The same is true if another criterion given in [] by 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 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 [,,,,,]. 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
- Argyros, I.K. Unified Convergence Criteria for Iterative Banach Space Valued Methods with Applications. Mathematics 2021, 9, 1942. [Google Scholar] [CrossRef]
- Kantorovich, L.V.; Akilov, G.P. Functional Analysis; Pergamon Press: Oxford, UK, 1982. [Google Scholar]
- Ezquerro, J.A.; Hernandez, M.A. Newton’s Scheme: An Updated Approach of Kantorovich’s Theory; Springer: Cham, Switzerland, 2018. [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]
- 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]
- 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]
- 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]
- 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]
- Verma, R. New Trends in Fractional Programming; Nova Science Publisher: New York, NY, USA, 2019. [Google Scholar]
- 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]
- 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]
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/).