Abstract
The convergence order of numerous iterative methods is obtained using derivatives of a higher order, although these derivatives are not involved in the methods. Therefore, these methods cannot be used to solve equations with functions that do not have such high-order derivatives, since their convergence is not guaranteed. The convergence in this paper is shown, relying only on the first derivative. That is how we expand the applicability of some popular methods.
MSC:
65H10; 65J10; 41A25; 49M15
1. Introduction
Let and be Banach spaces and be a convex subset of . Further, suppose that is the set of bounded linear operators from into . In applied mathematics many problems can be modeled in the form
wherein is a Fréchet differentiable operator. Most of the methods for finding a solution of Equation (1) are iterative, since closed form solutions can be found only in some special cases (see [1,2]). In this paper, we study the local convergence of the method defined by
where Method (2) was studied in [3], when , where m is a positive integer. The method was compared favorably to existing higher-order methods.
The eighth-order convergence of Equation (2) was shown in [3] using Taylor expansions and assumptions on , . Such assumptions restrict the applicability of this method, especially since only the first derivative is used in the method. As a motivational example, define function F on and , by
We have that
and
Notice that is not bounded on , so earlier results cannot be applied. In this work, our goal is to weaken the assumptions considered in [3]. Consequently, we study the local convergence of Method (2) using hypotheses on the first Fréchet-derivative only by taking advantage of the Lipschitz continuity of the first Fréchet-derivative. There exist many studies which deal with the local and semilocal convergence of iterative methods (see, for example, [2,4,5,6,7,8,9,10,11,12,13,14,15,16]). In particular, relevant work can be found in [17] for the special case .
The rest of the paper is structured as follows. In Section 2, the local convergence analysis is studied. In the analysis, we also provide a radius of convergence, error bounds, and a uniqueness result of Method (2). Some numerical examples are presented in Section 3. Concluding remarks are given in Section 4.
2. Local Convergence Analysis
We shall introduce some scalar functions and parameters that appear in the local convergence of Method (2). Let be an increasing and continuous function satisfying Suppose that equation
has at least one positive solution. Denote by the smallest such solution. Let and be increasing and continuous functions with Define functions and on the interval by
and
We have and as . The intermediate value theorem assures that the equation has at least one solution in . Denote by the smallest such solution. Suppose that the equation
has at least one positive solution. Denote by the smallest such solution. Set Define functions and on by
and
We obtain and as . Denote by the smallest solution of Equation in Suppose that equation
has at least one positive solution. Denote by the smallest such solution. Set Define functions and on the by
and
We obtain and as . Denote by the smallest solution of Equation in Define a radius of convergence r by
it follows that for each
and
Denote by the open ball in with center and of radius . Moreover, denote by the closure of .
The local convergence analysis of Method (2) uses the hypotheses (H) as follows:
- is continuously differentiable operators in the sense of Frèchet and there exists such that and
- There exists a function that is continuous and increasing with such that for eachand defined by Equation (3) exists. Set
- There exist functions and that are continuous and increasing such that for eachand
- There exists such thatSet
In the sequel, we present local convergence analysis of Method (2) using the preceding notation and the hypotheses (H).
Theorem 1.
Suppose that the hypotheses (H) hold and we choose . Then, sequence starting at and generated by Method (2) is well defined, remains in for every , and converges to . Additionally, the following error bounds hold
and
where functions are given previously and r is defined in Equation (6). Furthermore, the limit point is only a solution of the equation in given in .
Proof.
Estimates (11)–(13) shall be shown using mathematical induction. Let By Equation (6), and , we have in turn that
It also follows that, for , iterates , , and are well defined by Method (2) for We obtain from the first substep of Method (2) for and that
so by Equations (6), (10) (for ), , (15), and (16), we obtain in turn that
which shows Equation (11) for and The second substep of the method can be written as
Then, by Equations (6), (10) (for ), (15) (for ), (17), and (18), we obtain in turn that
which shows Equation (14) for and , where we also used the definition of and the estimates
Using the third substep of the method for , we can write
Then, using Equations (6), (10) (for ), (15) (for ), (17), (19), and (20), we have in turn as in Equation (19) that
which shows Equation (2) for and The induction for Equations (11)–(13) is finished, by simply replacing , , and by , , and in the preceding estimates. Then, using the estimate
where , we deduce that and . Finally, in order to show the uniqueness part, let with Define . Then, using and we obtain in turn that
so by the identity
Hence, we conclude by Equation (24) that ☐
3. Numerical Results
Example 1.
Consider the motivational example as given in the introduction of the paper. Note that is zero of this function. By conditions , we can choose , , and , where . Using the definition, we obtain the parameter values as
Example 2.
Let Define function F on Ω for by
The Fréchet-derivative is given by
Then, we have by conditions ,
Using the definition of the radius of Equation (6), the parameter values are given as
Example 3.
Consider function F defined on by
Then, as in the previous examples, we have the following for :
The parameter values are given as
Example 4.
Let be the space of continuous functions defined on and equipped with the max norm. Let Define function F on Ω by
We have that
Similarly, to the previous examples, we get that Then, we obtain
4. Conclusions
In the forgoing study, we have studied the local convergence of an efficient eighth-order method by assuming conditions only on the first derivative of the operator. The iterative scheme does not use second or higher-order derivative of the considered function. However, in an earlier study of convergence, the hypotheses used were based on Taylor series expansions reaching up to the eighth- or higher-order derivatives of function, although the iterative scheme uses first-order derivative. These conditions restrict the usage of the iterative scheme. We have extended the suitability of the method by considering suppositions only on the first-order derivative. The local convergence we have studied is also important in the sense that it provides estimates on the radius of convergence and the error bounds of the solution. Such estimates are not provided in the procedures that use Taylor expansions of higher derivatives, which may not exist or may be very expensive to compute. We have also verified the theoretical results so derived on some numerical problems.
Author Contributions
Methodology, J.R.S.; Writing—review & editing, J.R.S.; Conceptualization, I.K.A.; Formal analysis, I.K.A.; Investigation, S.K.; Data Curation, S.K.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Hoffman, J.D. Numerical Methods for Engineers and Scientists; McGraw-Hill Book Company: New York, NY, USA, 1992. [Google Scholar]
- Argyros, I.K.; Magreñán, A.A. Iterative Methods and Their Dynamics with Applications; CRC Press: New York, NY, USA, 2017. [Google Scholar]
- Sharma, J.R.; Arora, H. Improved Newton-like methods for solving systems of nonlinear equations. SeMA J. 2017, 74, 147–163. [Google Scholar] [CrossRef] [Scilit]
- Amat, S.; Busquier, S.; Gutiérrez, J.M. Third-order iterative methods with applications to Hammerstein equations: A unified approach. J. Comput. Appl. Math. 2011, 235, 2936–2943. [Google Scholar] [CrossRef] [Scilit]
- Amat, S.; Hernández, M.A.; Romero, N. Semilocal convergence of a sixth-order iterative method for quadratic equations. Appl. Numer. Math. 2012, 62, 833–841. [Google Scholar] [CrossRef] [Scilit]
- Argyros, I.K.; Hilout, S. Weaker conditions for the convergence of Newton’s method. J. Complex. 2002, 28, 364–387. [Google Scholar] [CrossRef] [Scilit]
- Argyros, I.K.; Ren, H. Improved local analysis for certain class of iterative methods with cubic convergence. Numer. Algorithms 2012, 59, 505–521. [Google Scholar]
- Argyros, I.K.; Sharma, J.R.; Kumar, D. Ball convergence of Newton-Gauss method in Banach spaces. SeMA. J. 2016, 74, 429–439. [Google Scholar] [CrossRef] [Scilit]
- Argyros, I.K.; Behl, R.; Motsa, S.S. Local convergence of an optimal eighth-order method under weak conditions. Algorithms 2015, 8, 645–655. [Google Scholar] [CrossRef] [Scilit]
- Argyros, I.K.; George, S. Extended local convergence analysis of inexact Gauss-Newton method for singular systems of equations under weak conditions. Stud. Univ. Babeş-Bolyai Math. 2017, 62, 543–558. [Google Scholar] [CrossRef] [Scilit]
- Babajee, D.K.R.; Dauhoo, M.Z.; Darvishi, M.T.; Barati, A. A note on the local convergence of iterative methods based on Adomian decomposition method and 3-node quadrature rule. Appl. Math. Comput. 2008, 200, 452–458. [Google Scholar] [CrossRef] [Scilit]
- Chun, C.; Stănică, P.; Neta, B. Third-order family of methods in Banach spaces. Comput. Math. Appl. 2011, 61, 1665–1675. [Google Scholar] [CrossRef] [Scilit]
- Ezquerro, J.A.; Hernández, M.A. Recurrence relation for Chebyshev-type methods. Appl. Math. Optim. 2000, 41, 227–236. [Google Scholar] [CrossRef] [Scilit]
- 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] [Scilit]
- Ren, H.; Wu, Q. Convergence ball and error analysis of a family of iterative methods with cubic convergence. Appl. Math. Comput. 2009, 209, 369–378. [Google Scholar] [CrossRef] [Scilit]
- Bi, W.; Wu, Q.; Ren, H. A new family of eight-order iterative methods for solving nonlinear equations. Appl. Math. Comput. 2009, 214, 236–245. [Google Scholar]
© 2018 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/).