Abstract
We discuss the local convergence of a derivative-free eighth order method in a Banach space setting. The present study provides the radius of convergence and bounds on errors under the hypothesis based on the first Fréchet-derivative only. The approaches of using Taylor expansions, containing higher order derivatives, do not provide such estimates since the derivatives may be nonexistent or costly to compute. By using only first derivative, the method can be applied to a wider class of functions and hence its applications are expanded. Numerical experiments show that the present results are applicable to the cases wherein previous results cannot be applied.
1. Introduction
We study local criteria for obtaining a unique solution of the nonlinear model
for Banach space valued mappings with , where F is differentiable in the sense of Fréchet [1,2]. For a good survey of literature on local and semilocal convergence criteria of iterative methods see [3,4,5,6,7,8,9,10,11,12,13].
The most popular numerical method for approximating a solution of Equation (1) is the quadratically convergent Newton’s method, which is expressed as
In quest of efficient higher order method, a number of improved, multipoint Newton’s or Newton-like iterative schemes have been proposed in literature; see, for example [3,5,8,9,10,12,13,14,15,16,17,18,19] and references cited therein.
In particular, Amiri et al. [16] have recently developed an eighth order method for solving using a derivative-free composite scheme. The method is of order eight using only divided differences, derivatives up to the order nine and Taylor expansions in the special case when and , , where , . We study this method in the more general setting of a Banach space setting:
where is an initial point, , is divided difference of order one with
for each with and for each , if F is differentiable at u. Here is the set of bounded linear operators from B into B.
The benefits of using method (2) over others in the literature have been well explained in [16]. Then to avoid repetitions, we refer the reader to [16]. But there are drawbacks when it comes to using method (2) limiting its applicability. These are: The existence of the ninth derivative is needed to show the order of convergence; the upper bounds on or results on the uniqueness of the solution are not given; the initial point is a shot in the dark; the method is restricted only on the i-dimensional Euclidean space and higher order derivatives do not appear on the method. Notice that the method cannot even guarantee convergence, if we consider the scalar function on given as
Then, clearly is unbounded on . Hence, there is no assurance that under the conditions in [16]. The novelty of this work is that we deal with all these drawbacks using only conditions on the divided difference of order one which actually used in Equation (2). Hence, we extend its applicability and for operators valued on Banach space.
2. Local Convergence Analysis
Certain real functions and parameters appearing in the local convergence analysis of Equation (2) are introduced. Set , let , be continuous and increasing functions with . Suppose that equation
has at least one positive solution. Let be the smallest such solution. Set . Let also , and be continuous and increasing functions with . Define functions and in the interval by
and
where .
We have and as . The intermediate value theorem implies that equation has at least one solution in . Let be the smallest such solution. Further assume that equation
possesses at least one positive solution. Denote by the smallest such solution. Set and . Define functions and on the interval by
and
where
and
Then, we also get and as . Denote by the smallest solution of equation in .
Assume that equation
possesses at least one positive solution. Denote by the smallest such solution. Set and . Define functions and on the interval by
and
where
and
We obtain again and as . Denote by the smallest solution of equation in . Define parameter r by
This parameter shall be shown to be a radius of convergence for Equation (2) in Theorem 1. Then, we have that for each
and
By , we denote the open and closed balls in B, respectively with center and of radius . In order to study the local convergence of Equation (2), we need to rewrite the three steps.
Lemma 1.
Suppose that Equation (2) is well defined for each and for each . Then, the following assertions hold
and
Proof.
The local convergence analysis is based on the following conditions (say, A):
- is continuously differentiable in the sense of Frèchet, , are a divided difference of order one and there exists such that and
- There exist continuous and increasing functions and with such that for eachandSet where is given in Equation (3).
- There exist continuous and increasing functions , and such that for eachand
- There exists such thatwhere function is continuous and increasing with Set
By Lemma 1, we can use the notations
and
Next, we present the local convergence of Equation (2) using the conditions (A) and the notations mentioned above.
Theorem 1.
Suppose that the conditions (A) hold. Then, sequence generated for is well defined, remains in for each and converges to , so that
and
where the functions are given previously and r is defined in Equation (6).
Proof.
We shall show estimates for Equations (17)–(19) using mathematical induction. Let By , , and Equation (6), we obtain in turn
where we also used that
so
It follows from Equation (20) and the Banach perturbation lemma on invertible operators [8] that and
and , , are well defined by Equation (2) for
Then, by Equations (6) and (13) (for ), (14) and (21) (for ), and , we get, in turn, that
so Equation (17) holds for and We need the estimate obtained using and (20)
and the estimate using and that
so
Then, by Equations (6), (13) (for ), (15), and Equations (21)–(24) (for ), we have, in turn, that
so Equation (18) holds for and Next, from Equations (6) and (13) (for ), (21) (for ), and Equations (22)–(25), we obtain in turn that
so Equation (19) holds for and The induction for estimates of Equations (17)–(19) is terminated, if we replace , , , by , , , in the preceding computations.
Then, from the estimate
we get that and Finally, set for some for Using we have
so is invertible. Then, we obtain via identity
□
3. Numerical Results
It is noted that in all examples are found by solving scalar equations , . Then, r is obtained using Equation (6). The parameters have been shown to exist above Lemma 1. The divided difference in all examples is chosen as
All computations are performed in Mathematica software using multi-precision arithmetic.
Example 1.
Let , . Consider the Hammerstein-type problem as
where
Let be defined as
But, we get
leading to
since ,
By Equation (28), we select , . The parameters are
Example 2.
Consider the three-dimensional system
with for . Then, the system for with is
Hence, we obtain
But and , by the definition in Equation (28), we select , , and , where , . Then, we have
Example 3.
Consider be defined by
where .
Example 4.
Define function F on , given as
Then, we get
By Equation (28), we can choose and . The parameter values are given as
Example 5.
The Van der Waals equation of state for a vapor is (see [16])
This equation leads to,
in V, where all constants have a physical meaning whose values can be found in [16]. Choose P = 10,000 kPa and T = 800 K. Then, . By Equation (28), we can set and . The parameter values are given as
4. Conclusions
In the forgoing study, the local convergence of an eighth order derivative-free method is discussed comprehensively in Banach space. Far from other methods that depend on higher derivatives and Taylor series, we have considered only the first derivative in our procedure. In this sense, the method can be applied to a wider class of functions and hence its applications are expanded. Another advantage of analyzing the convergence is the computation of a convergence ball (wherein the iterates lie) and error estimates. Theoretical results of analysis so derived are confirmed through numerical testing on some practical problems.
Author Contributions
Methodology, J.R.S.; writing—review and editing, J.R.S.; conceptualization, S.K.; data curation, S.K.; investigation, I.K.A.; formal analysis, I.K.A. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Rheinbolt, W.C. An Adaptive Continuation Process for Solving System of Nonlinear Equations; Banach Center Publications: Warsaw, Poland, 1978; pp. 129–142. [Google Scholar]
- Argyros, I.K. Computational Theory of Iterative Methods; Series: Studies in Computational Mathematics; Chui, C.K., Wuytack, L., Eds.; Elsevier Publ. Co.: New York, NY, USA, 2007; Volume 15. [Google Scholar]
- Hernández, M.A.; Salanova, M.A. Modification of Kantrovich assumptions for semilocal convergence of Chebyshev method. J. Comput. Appl. Math. 2000, 126, 131–143. [Google Scholar] [CrossRef]
- Babajee, D.K.R.; Dauhoo, M.Z.; Darvishi, M.T.; Barati, A. A note on local convergence of iterative methods based on Adomian decomposition method and 3-note quadrature rule. Appl. Math. Comput. 2008, 200, 452–458. [Google Scholar] [CrossRef]
- Gutiérrez, J.M.; Magreñán, A.A.; Romero, N. On the semilocal convergence of Newton-Kantrovich method under center-Lipschitz conditions. Appl. Math. Comput. 2013, 221, 79–88. [Google Scholar]
- Jaiswal, J.P. Semilocal convergence of an eighth-order method in Banach spaces and its computational efficiency. Numer. Algorithms 2016, 71, 933–951. [Google Scholar] [CrossRef]
- Jaiswal, J.P.; Pandey, B. Recurrence relations and semilocal convergence of a fifth order method in Banach spaces. Int. J. Pure Appl. Math. 2016, 108, 767–780. [Google Scholar] [CrossRef][Green Version]
- Argyros, I.K.; Magreñán, Á.A. Iterative Methods and Their Dynamics with Applications; CRC Press: New York, NY, USA, 2017. [Google Scholar]
- Sharma, J.R.; Argyros, I.K.; Kumar, S. Ball convergence of an efficient eighth order iterative method under weak conditions. Mathematics 2018, 6, 260. [Google Scholar] [CrossRef]
- Sharma, J.R.; Kumar, D. A fast and efficient composite Newton–Chebyshev method for systems of nonlinear equations. J. Complex. 2018, 49, 56–73. [Google Scholar] [CrossRef]
- Kumar, D.; Argyros, I.K.; Sharma, J.R. Convergence ball and complex geometry of an iteration function of higher order. Mathematics 2019, 7, 28. [Google Scholar] [CrossRef]
- Sharma, J.R.; Argyros, I.K.; Kumar, S. Convergence analysis of weighted-Newton methods of optimal eighth order in Banach spaces. Mathematics 2019, 7, 198. [Google Scholar] [CrossRef]
- Sharma, J.R.; Kumar, S.; Argyros, I.K. Generalized Kung-Traub method and its multi-step iteration in Banach spaces. J. Complex. 2019. [Google Scholar] [CrossRef]
- Darvishi, M.T.; Barati, A. A third-order Newton-type method to solve systems of nonlinear equations. Appl. Math. Comput. 2007, 187, 630–635. [Google Scholar] [CrossRef]
- Darvishi, M.T.; Barati, A. A fourth-order method from quadrature formulae to solve systems of nonlinear equations. Appl. Math. Comput. 2007, 188, 257–261. [Google Scholar] [CrossRef]
- Amiri, A.R.; Cordero, A.; Darvishi, M.T.; Torregrosa, J.R. Preserving the order of convergence: Low-complexity Jacobian-free iterative schemes for solving nonlinear systems. J. Comput. Appl. Math. 2018, 337, 87–97. [Google Scholar] [CrossRef]
- Xiao, X.; Yin, H. A simple and efficient method with high order convergence for solving systems of nonlinear equations. Comput. Math. Appl. 2015, 69, 1220–1231. [Google Scholar] [CrossRef]
- Narang, M.; Bhatia, S.; Kanwar, V. New two-parameter Chebyshev–Halley–like family of fourth and sixth–order methods for systems of nonlinear equations. Appl. Math. Comput. 2016, 275, 394–403. [Google Scholar] [CrossRef]
- Xiao, X.; Yin, H. Achieving higher order of convergence for solving systems of nonlinear equations. Appl. Math. Comput. 2017, 311, 251–261. [Google Scholar] [CrossRef]
© 2020 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 (http://creativecommons.org/licenses/by/4.0/).