Abstract
In this study, we present a convergence analysis of a Newton-like midpoint method for solving nonlinear equations in a Banach space setting. The semilocal convergence is analyzed in two different ways. The first one is shown by replacing the existing conditions with weaker and tighter continuity conditions, thereby enhancing its applicability. The second one uses more general -continuity conditions and the majorizing principle. This approach includes only the first order Fréchet derivative and is applicable for problems that were otherwise hard to solve by using approaches seen in the literature. Moreover, the local convergence is established along with the existence and uniqueness region of the solution. The method is useful for solving Engineering and Applied Science problems. The paper ends with numerical examples that show the applicability of our convergence theorems in cases not covered in earlier studies.
Keywords:
nonlinear equations; Newton’s method; local and semilocal convergence; Banach space; Fréchet derivative; majorizing sequences MSC:
47J25; 49M15; 65J15; 65H10; 65G99
1. Introduction
One of the most challenging problems in Engineering and Applied Sciences is to determine a locally unique solution of a nonlinear equation
where the operator F is defined on the Banach space with values in a Banach space . As an example, engineering problems reduce to solving differential or integral equations, which in turn are set up as (1). A solution of the Equation (1) is difficult to find in closed form. That forces researchers to develop iterative methods, which generate iterations convergent to , provided that certain initial conditions hold.
A popular iterative method is defined for each by
This is the so-called Newton’s method (NM), which is only quadratically convergent [1,2,3,4]. In order to increase the order of convergence as well as the efficiency, a plethora of iterative methods have been developed (see, e.g., [5,6,7,8,9] and references therein). Among those, special attention has been given to the Newton-like midpoint method (NLMM) defined by
NLMM requires per iteration one operator evaluation and one of the inverse of . The efficiency index according to Ostrowski is shown to be approximately [10]. This index is higher than NM (), as well as the one given in [11] (). The construction of this method was essentially given in [12] when but with no formal proof of convergence. That is why the semilocal convergence is developed in [10] under Kantorovich’s hypotheses. Moreover, favorable comparisons are given to methods using similar information.
- Motivation for writing this study: The following concerns arise with the applicability of this method in general.
- The convergence region in [10] is not large.
- The upper bounds on the distances and are not tight enough.
- The uniqueness region of the solution is not large.
- The local convergence analysis is not studied in [10].
- Novelty: Due to the importance of this method, the items – are positively addressed. The current study includes two procedures for analyzing the semilocal convergence of NLMM. The first analysis replaces the conditions used in [10] with weaker and tighter conditions, thereby enlarging the uniqueness region. In the second semilocal convergence, the convergence conditions used in the earlier section have been replaced by more generalized -continuity conditions using majorizing sequences [1,4,5,11,12,13,14,15,16,17]. The main advantage of this approach is that it uses only the first derivative, which actually appears in NLMM, for proving the convergence result instead of the second derivative used in [10], thereby enhancing its applicability. Thus, our work improves the results derived in [10] under more stringent conditions and generates finer majorizing sequences. The innovation of the study lies in the fact that extensions are achieved under weaker conditions (see also Remarks throughout the paper). The local convergence of NLMM is also established, along with the existence and uniqueness region of the solution. Moreover, the new error analysis is finer, requiring fewer iterates to achieve a predetermined error tolerance. Furthermore, more precise information is provided on the uniqueness domain of the solution. Finally, the technique can be used on other methods utilizing the inverse of an operator.
The rest of the paper is structured as follows: Section 2 includes mathematical background. In Section 3, we develop the first kind of semilocal convergence theorem based on weaker conditions. The generalized -continuity conditions are applied to prove the second type of semilocal convergence theorem in Section 4. The local convergence, along with the uniqueness results of NLMM, is studied in Section 5. In Section 6, numerical examples are given to illustrate the theoretical results. Concluding remarks are reported in Section 7.
2. Mathematical Background
The study of the behavior of a certain cubic polynomial and the corresponding scalar Newton function play a role in the semilocal convergence of NLMM. Let , and be given parameters. Define the cubic polynomial
the Newton iteration function
and the scalar sequences , for
and
The proof of the following auxiliary result containing some properties of q, , , and can be found in [10].
Lemma 1.
Suppose:
or
Then, the following assertions hold:
- (i)
- The polynomial q given by the Formula (4) has two zeros , with .
- (ii)
- q is decreasing in the interval .
- (iii)
- is increasing and q is convex in .
- (iv)
- is increasing in .
- (v)
- is increasing in , and .
- (vi)
- The functionis positive in and .
- (vii)
- and .
3. Semilocal Convergence I
The following conditions relating the parameters L, M, d to NLMM have been used in the semilocal convergence.
Suppose:
- (H1)
- There exist an initial guess and a parameter such that and .
- (H2)
- .
- (H3)
- for some parameter and each .
- (H4)
- .and
- (H5)
- .
The following semilocal convergence result was shown in [2,10].
Theorem 1.
Suppose that the conditions – and
- (H6)
for hold. Then, the following assertions hold:
- (1)
- .
- (2)
- for each such that .
- (3)
- for each such that .
- (4)
- .
- (5)
- .
- (6)
- .
- (7)
- .
- (8)
- .
- (9)
- .
- (10)
- The sequence generated by NLMM is well defined in the ball , remains in and converges to the only solution of the equation in .
- (11)
- Moreover, the following error estimates hold:and
Next, the preceding results are extended without additional conditions. Suppose:
- for some and each .
Define the parameter
and the region
- for some parameter and each .
Clearly, we have
and
since
It is assumed without loss of generality
Otherwise, the results that follow hold with replacing K. Notice also that the computation of the parameter requires the computation of , K and , , but . Hence, no additional conditions are required to develop the results that follow.
Let us consider the cubic polynomials
and
Suppose that
- .
The following auxiliary result is needed.
Lemma 2.
Suppose that the condition holds. Then, the conclusions of Lemma 1 with K, replace L and q, respectively.
Proof.
Simply replace by , respectively, in the proof of Lemma 1. □
Remark 1.
Notice also that:
- (a)
- The parameter r is the unique positive zero of the equationand
- (b)
but not necessarily vice versa unless if .
Hence, we arrived at the following extension of the Theorem 1.
Theorem 2.
Suppose that the conditions , , , , and
hold. Then, the assertions – of Theorem 1 hold with K, , , , replacing , q, , , , respectively, where
and
Proof.
The assertions – follow with the above changes. Concerning the assertion , set , and for each . Then, we have in turn that
leading to
Notice that the last inequality in (29) follows from , and .
Then, from and the definition of and
The condition in Theorem 2 can be replaced by
where r is given by (10).
Moreover, the uniqueness ball can be enlarged from given in Theorem 1 to . This can be seen using the weaker condition instead of used in Theorem 1 in [10] or Theorem 2 used by us. Indeed, in Theorem 1, the estimate was obtained for ,
since for all , leading to
and consequently, . However, the same estimate is obtained using the tighter condition with , replacing q, , respectively.
- The Lipschitz constant K can be replaced by an at least as small.
It follows by the Banach lemma on linear operators with inverses [3,5] and (30) that
showing the assertion . Notice that in Theorem 1, the less tight estimate than (31) is shown under the stronger and not actually needed condition , which is
In view of the estimate (31), the rest of the proof follows as in [10]. □
Define the ball for . Notice that . Then, suppose
- for some and each .
It follows that , can replace , K, respectively, in our results and
The iterates .
4. Semilocal Convergence II
The convergence conditions of the previous section may not hold, even if the method (3) converges. As a motivational example, consider the function f defined on the interval by
Then, clearly the function is unbounded on . Hence, the results of the previous section cannot guarantee the convergence of method (3) to the solution . That is why we drop the conditions -, , , and and utilize the more general -continuity conditions, the first derivative that actually only appears on the method (3) and majorizing sequences to present another semilocal convergence result under weaker conditions.
Let be a continuous and nondecreasing function. Suppose that the equation
has a smallest positive solution s. Moreover, suppose that there exists a function , which is continuous and nondecreasing. Let also parameters , , be such that , and . Define the sequences , by
This sequence shall be shown to be majorizing for the method (3). However, a convergence result is developed first.
Lemma 3.
Suppose that for each and some
Then, the following items hold:
and
Proof.
Remark 3.
A possible choice for β is any number in the interval .
The conditions connecting the “h” functions to the operators F and are:
- (A1)
- There exists an initial guess , , such that , , and for , with
- (A2)
- for each .Set
- (A3)
- for each .
- (A4)
- The condition (34) holdsand
- (A5)
- .
An Ostrowski-like representation [17] is needed for the iterates and .
Lemma 4.
Suppose that the iterates , exist for each . Then, the following items hold
and
Proof.
Next, the semilocal convergence is developed for the method (3).
Theorem 3.
Suppose that the conditions – hold. Then, the sequence converges to a solution such that
Proof.
Mathematical induction is applied to show
and
The condition and the Formula (4) (for ) imply that the estimate (39) holds for . Then, we also have the iterate . Moreover, , so . Let be an arbitrary point. Then, the condition gives
That is, and
In particular, if , then the iterate and are well defined by the method (3). Moreover, the last condition in and (33) give
Thus, the assertion (40) holds for . Suppose that the assertions (39) and (40) held for all integers smaller than . Then, we obtain from
thus,
Then, by (37), we obtain in turn that
Hence, (40) holds, and the iterate . Furthermore, by (38) and the second substep of the method (3), we have in turn that
and
However, the sequence is Cauchy as convergent by Lemma 3. Therefore, the sequence is also Cauchy in a Banach space , and as such, it converges to some , since this set is closed. Furthermore, by using the continuity of F and letting in the calculation,
we conclude that . □
Concerning the uniqueness of the solution in a neighborhood about the point , we have:
Proposition 1.
Suppose:
- (a)
- There exists a solution of the equation for some .
- (b)
- The condition holds on the ball
and
- (c)
- There exists such that
Set . Then, the equation is uniquely solvable by in the region .
Proof.
Let with . Define the linear operator . Then, it follows by condition and (47) that
which implies . □
Remark 4.
(1) If all the conditions of Theorem 3 hold, then we can set .
- (2)
- The condition can be replaced by
- .
- (3)
- Suppose that . Define the set . Notice that . Then, a tighter function h is obtained if replaces in the condition .
5. Local Convergence
We shall introduce some scalar functions and some parameters to show the local convergence analysis of NLMM.
Suppose:
- (i)
- There exists a function , which is nondecreasing and continuous and a parameter such that the function has a smallest zero , where is defined by
- (ii)
- The function is such thathas a smallest zero , where
The parameter shall be shown to be a radius of convergence for NLMM.
The convergence conditions are:
- (l1)
- There exists a simple solution of the equation and a parameter such that .
- (l2)
- for each .
- (l3)
- .
Next, the local convergence is given for NLMM.
Theorem 4.
Suppose that the conditions hold. Then, the sequence generated by NLMM converges to provided that .
Proof.
Let . It follows by the conditions , and the definition of the radius in turn that
thus, and
By hypothesis and (49) for , we have that and the iterate is well defined by the first substep of NLMM.
Moreover, we can write for
By applying the condition and (49) (for ) on (50), we obtain in turn that
where we used that
and . Thus, the iterate . Then, notice that
so the point .
Suppose that . Then, we also have
so the iterates and are well defined by NLMM. Then, we can write for and
However, the expression in the bracket can be written as
In view of (49) (for ), (52), (53), we obtain
where, for the numerator, we obtain
where we also used .
Hence, the iterates , for each . Then, from the estimates
and
we deduce that since . □
The uniqueness of the solution ball is determined in the next result.
Proposition 2.
Suppose:
- (i)
- The condition holds.
- (ii)
- There exists a solution for some .
- (iii)
- The condition holds on the ball .and
- (iv)
- There exists such that
Set . Then, the only solution of the equation in the region is .
Proof.
Let with . Set and . Then, we can write
Remark 5.
We can certainly choose .
6. Numerical Examples
In this section, some numerical examples are solved in order to corroborate the theoretical results obtained and the efficacy of our approach.
Example 1.
Let and for some parameter . Define the polynomial F on the interval Ω by
Choose . Then, if we substitute F on the “h” conditions, we see that the conditions
are verified provided that
for
Notice that and . Moreover, .
For and ,
and
Thus, it is clear that our new condition holds true, but the condition used in [10] does not hold. By taking and , we obtain the following
which shows that conditions - are satisfied. Hence, by Theorem 3, the sequence converges to a unique solution where, . Thus, this example can be solved using the weaker condition used in our study but not using the earlier one [10].
Example 2.
Let . Define the mapping by
where . We shall find a solution to the equation . The first and second-order Fréchet derivatives are calculated to be
and
Pick . Then, it follows that , , and can be arbitrary. By setting , we see that . Moreover, the solution is obtained after iterations. Notice that it takes iterations for NM but only three for NLMM to reach . Thus, this method requires fewer computations than that of Newton’s method.
Example 3.
Let and . Define a function F on D by
Clearly, we have . Then, the conditions and hold if and . Then, and .
The parameter and radius of convergence .
Example 4.
Let and . Define a mapping F on D by
where . Clearly, the solution is . It follows by the definition of the mapping F that the first two Fréchet derivatives are
and
Notice that . Therefore, the conditions and are verified for and . Then, and .
The parameter and radius of convergence .
The numerical examples were simulated by using Mathematica 8 on Intel(R) Core(TM) i5-8250U CPU @ 1.60 GHz 1.80 GHz, with 8 GB of RAM running on Windows 10 Pro version 2017. This kind of local and semilocal convergence demonstrates that the guarantee the existence and uniqueness of the solution are especially valuable in processes where it is difficult to prove the existence of solutions.
7. Conclusions
The present study deals with new local and semilocal convergence results for the Newton-like midpoint method under improved initial conditions. In the first type of semilocal convergence, the previous results are extended without using any additional postulates. The estimate obtained in [10] is less tight and uses stronger conditions in comparison to our results. The second semilocal convergence utilizes more general -continuity conditions and can be applied to the problems where earlier conditions fail. Notice also that the condition on is dropped (see also the Example 1). Both semilocal convergence results are computationally verifiable and improve the previous study [10] in several directions, which are of practical importance. The local convergence theorem not given in [10] is established for the existence-uniqueness of the solution. We present varied numerical examples to show the applicability of our results. The innovation demonstrated that NLMM can also be used to extend the applicability of other methods requiring the inversion of a linear operator in an analogous way since our technique is method-free. This is the future area of research.
Author Contributions
The authors contributed equally. 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
- Argyros, I.K.; Magreñán, Á.A. Ball convergence theorems and the convergence planes of an iterative methods for nonlinear equations. SEMA 2015, 71, 39–55. [Google Scholar]
- Gutiérrez, J.M. A new semilocal convergence for Newton’s method. J. Comput. Appl. Math. 1997, 79, 131–145. [Google Scholar] [CrossRef]
- Kantorovich, L.V. On Newton’s method for functional equations (russian). Dokl. Akad. Nauk. SSSR 2009, 59, 1237–1240. [Google Scholar]
- Wu, Q.; Zhao, Y. Convergence analysis for a deformed Newton’s method with third-order in Banach space under γ-condition. Int. J. Comput. Math. 2009, 86, 441–450. [Google Scholar]
- Ezquerro, J.; Hernández, M. New iterations of R-order four with reduced computational cost. BIT Numer. Math. 2009, 49, 325–342. [Google Scholar] [CrossRef]
- Grau-Sánchez, M.; Noguera, M.; Gutiérrez, J. On some computational orders of convergence. Appl. Math. Lett. 2010, 23, 472–478. [Google Scholar] [CrossRef]
- Herceg, D.; Herceg, D.J. Means based modifications of Newton’s method for solving nonlinear equations. Appl. Math. Lett. 2013, 219, 6126–6133. [Google Scholar] [CrossRef]
- Parida, P.K.; Gupta, D.K. Recurrence relations for a Newton-like method in Banach spaces. J. Comput. Appl. Math. 2007, 206, 873–887. [Google Scholar] [CrossRef]
- Sharma, J.R.; Guha, R.K.; Sharma, R. An efficient fourth order weighted-Newton method for systems of nonlinear equations. Numer. Algorithms 2013, 62, 307–323. [Google Scholar] [CrossRef]
- Cárdenas, E.; Castro, R.; Sierra, W. On Newton-type midpoint method with high efficiency index. J. Math. Anal. Appl. 2020, 491, 124381. [Google Scholar] [CrossRef]
- Argyros, I.K.; Chen, D. The midpoint method for solving nonlinear operator equations in Banach space. Appl. Math. Lett. 1992, 5, 7–9. [Google Scholar]
- McDougall, T.J.; Wotherspoon, S.J. A simple modification of Newton’s method to achieve convergence of order 1 + . Appl. Math. Lett. 2014, 29, 20–25. [Google Scholar] [CrossRef]
- Argyros, I.K.; Chen, J. On local convergence of a Newton-type method in Banach space. Int. J. Comput. Math. 2009, 86, 1366–1374. [Google Scholar] [CrossRef]
- Neta, B. A sixth order family of methods for nonlinear equations. Int. J. Comp. Math. 1979, 7, 157–161. [Google Scholar] [CrossRef]
- Ezquerro, J.A.; Hernández, M.A. Newton’s Method: An Updated Approach of Kantorovich’s Theory; Springer: Cham, Switzerland, 2018. [Google Scholar]
- Kou, J. A third-order modification of Newton method for systems of non-linear equations. Appl. Math. Comput. 2007, 191, 117–121. [Google Scholar] [CrossRef]
- Ostrowski, A.M. Solutions of Equations and Systems of Equations; Academic Press: New York, NY, USA; London, UK, 1966. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 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/).