Abstract
Problems from numerous disciplines such as applied sciences, scientific computing, applied mathematics, engineering to mention some can be converted to solving an equation. That is why, we suggest higher-order iterative method to solve equations with Banach space valued operators. Researchers used the suppositions involving seventh-order derivative by Chen, S.P. and Qian, Y.H. But, here, we only use suppositions on the first-order derivative and Lipschitz constrains. In addition, we do not only enlarge the applicability region of them but also suggest computable radii. Finally, we consider a good mixture of numerical examples in order to demonstrate the applicability of our results in cases not covered before.
PACS:
65G99; 65H10; 47J25; 47J05; 65D10; 65D99
1. Introduction
One of the most useful task in numerical analysis concerns finding a solution of
where is a Fréchet-differentiable operator, are Banach spaces and is a convex subset of . The is the space of bounded linear operators from to .
Consider, a three step higher-order convergent method defined for each by
where , and the second sub step represents any iterative method, in which the order of convergence is at least . If , then it was shown in []. The proof uses Taylor series expansions and the conditions on function is up to the seventh differentiable. These suppositions of derivatives on the considered function hamper the applicability of (2). Consider, a function on , by
Then, we have that
and
Then, obviously the third-order derivative is not bounded on . Method (2) studied in [], for suffers from several following defects:
- (i)
- Applicable only on the real line.
- (ii)
- Range of initial guesses for granted convergence is not discussed.
- (iii)
- Higher than first order derivatives and Taylor series expansions were used limiting the applicability.
- (iv)
- No computable error bounds on (where ) were given.
- (v)
- No uniqueness result was addressed.
- (vi)
- The convergence order claim by them is also not correct, e.g., see the following method 43 []It has fifth-order of convergence for but provides fourth-order convergence. But, authors claimed sixth-order convergence for every that is not correct. The new proof is given in Section 2.
- (vii)
- They can’t choose special cases like methods 41, 47 and 49 (numbering from their paper []) because Chen and Qian [], consider in the proof of theorem. Additionally, it is clearly mentioned in the expression of (21) (from their paper []).
To address all these problems, we first extend method (2) to Banach space valued operators. The order of convergence is computed by using or (see remark 2.2(d)). Our technique uses only the first derivative in the analysis of method (2), so we can solve classes of equations not possible before in [].
2. Convergence Analysis
We consider some scalars functions and constraints for convergence study. Therefore, we assume that functions are continuous and nondecreasing with and . Assume equation
has a minimal positive solution .
Functions and defined on as follow:
Notice, that and , as . Then, by the intermediate value theorem (IVT), the functions and have roots in . Let and , stand respectively the smallest such roots of the function and . Additionally, we consider two functions and on by
Suppose that
and
as for some . Then, again by adopting IVT that function has some roots . Let be the smallest such root. Notice that, if condition (5) is not needed to show , since in this case .
Finally, functions and on by
where . Suppose that
we get by (7) that and or positive number as . Let stand for the smallest root of function in . Consider a radius of convergence r as
Then, it holds
Let us assume that we have center and radius of and open and closed ball, respectively, in the Banach space .
Theorem 1.
Letbe a differentiable operator. Letbe nondecreasing continuous functions with. Additionally, we consider thatand. Assume that there existssuch that for every
and Equation (4) has a minimal solution and (5) holds.
Moreover, assume that for each
and
Then, for, we have, whereand the following assertions hold
and
whereand functionsare given previously. Moreover, if
then κ is unique in.
Proof.
We demonstrate that the sequence is well-defined in and converges to by adopting mathematical induction. By the hypothesis , (4), (6) and (13), we yield
where and , exists by the first two sub steps of method (2) and
From (4), (8), (9) (for ), (10), (12), (21) and the first substep of (2), we have
which implies (16) for and .
Remark 1.
- (a)
- (b)
- (c)
- Ifand w are constants, thenandwhereis the convergence radius for well-known Newton’s methodgiven in [].On the other hand, Rheindoldt [] and Traub [] suggestedwhere as Argyros [,]whereis the Lipschitz constant for (9) on . Then,soand
- (d)
- We use the following rule foror[], defined asnot requiring derivatives anddoes not depend on κ.
- (e)
- Our results can be adopted for operators Θ that satisfy [,]for a continuous operator P. The beauty of our study is that we can use the results without prior knowledge of solution κ, since. As an exampleso we assume.
- (f)
- Let us show how to consider functionsand m. Define function ϕ byThen, we can chooseIfare given in particular byandfor someand, then we have that
- (g)
- If, we can obtain the results for the two-step methodby settingin Theorem 1.
Convergence Order of Expression (3) from []
Theorem 2.
Lethas a simple zero ξ being a sufficiently many times differentiable function in an interval containing ξ. Further, we consider that initial guessis sufficiently close to ξ. Then, the iterative scheme defined by (3) from [] has minimum fourth-order convergence and satisfy the following error equation
where , and for .
Proof.
The Taylor’s series expansion of function and its first order derivative around with the assumption leads us to:
and
respectively.
The following expansion of about
Similarly, we can expand function about with the help of Taylor series expansion, which is defined as follows:
For choosing in (55), we obtain
This type of proof and theme are close to work on generalization of the fixed point theorem [,,,]. We recall a standard definition.
Definition 2.
Letbe a sequence inwhich converges to κ. Then, the convergence is of orderif there exist, abdsuch that
3. Examples with Applications
Here, we test theoretical results on four numerical examples. In the whole section, we consider that means for the computational point of view, called by .
Example 1.
Set. Consider an integral equation [], defined by
where
Consider corresponding operatoras
But
and
Using, we obtain
So, we can set
Hence, by adopting Remark 2.2(a), we have
The results in [] are not applicable, sinceis not Lipschitz. But, our results can be used. The radii of convergence of method (2) for example (1) are described in Table 1.
Table 1.
Radii of convergence for problem (1).
Example 2.
Consider a system of differential equations
that model for the motion of an object for. Then, forconsiderdefined by
We have
Then, we getand, whereand. The convergence radii of scheme (2) for example (2) are depicted in Table 2.
Table 2.
Radii of convergence for problem (2).
We follow the stopping criteria for computer programming (i)and (ii)in all the examples.
4. Conclusions
A major problem in the development of iterative methods is the convergence conditions. In the case of especially high order methods, such as (2), the operator involved must be seventh times differentiable according to the earlier study [] which do not appear in the methods, limiting the applicability. Moreover, no error bounds or uniqueness of the solution that can be computed are given. That is why we address these problems based only on the first order derivative which actually appears in the method. The convergence order is determined using or that do not require higher than first order derivatives. Our technique can be used to expand the applicability of other iterative methods [,,,,,,,,,,,,] along the same lines.
Author Contributions
All the authors have equal contribution for this paper.
Funding
This project was funded by the Deanship of Scientific Research (DSR), King Abdulaziz University, Jeddah, under grant No. (D-253-247-1440). The authors, therefore, acknowledge, with thanks, the DSR technical and financial support.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Chen, S.P.; Qian, Y.H. A family of combined iterative methods for solving nonlinear equations. Am. J. Appl. Math. Stat. 2017, 5, 22–32. [Google Scholar] [CrossRef][Green Version]
- Argyros, I.K. Convergence and Application of Newton-Type Iterations; Springer: Berlin, Germany, 2008. [Google Scholar]
- Rheinboldt, W.C. An Adaptive Continuation Process for Solving Systems of Nonlinear Equations; Polish Academy of Science, Banach Center Publications: Warsaw, Poland, 1978; Volume 3, pp. 129–142. [Google Scholar]
- Traub, J.F. Iterative Methods for the Solution of Equations; Prentice-Hall Series in Automatic Computation; Prentice-Hall: Englewood Cliffs, NJ, USA, 1964. [Google Scholar]
- Argyros, I.K.; Hilout, S. Computational Methods in Nonlinear Analysis; World Scientific Publishing Company: New Jersey, NJ, USA, 2013. [Google Scholar]
- Kou, J. A third-order modification of Newton method for systems of nonlinear equations. Appl. Math. Comput. 2007, 191, 117–121. [Google Scholar]
- Petkovic, M.S.; Neta, B.; Petkovic, L.; Džunič, J. Multipoint Methods for Solving Nonlinear Equations; Elsevier: Amsterdam, The Netherlands, 2013. [Google Scholar]
- Sharma, J.R.; Ghua, R.K.; Sharma, R. An efficient fourth-order weighted-Newton method for system of nonlinear equations. Numer. Algor. 2013, 62, 307–323. [Google Scholar] [CrossRef]
- Ezquerro, J.A.; Hernández, M.A. New iterations of R-order four with reduced computational cost. BIT Numer. Math. 2009, 49, 325–342. [Google Scholar] [CrossRef]
- Amat, S.; Hernández, M.A.; Romero, N. A modified Chebyshev’s iterative method with at least sixth order of convergence. Appl. Math. Comput. 2008, 206, 164–174. [Google Scholar] [CrossRef]
- 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]
- Cordero, A.; Torregrosa, J.R.; Vassileva, M.P. Increasing the order of convergence of iterative schemes for solving nonlinear system. J. Comput. Appl. Math. 2012, 252, 86–94. [Google Scholar] [CrossRef]
- Potra, F.A.; Pták, V. Nondiscrete Introduction and Iterative Process. In Research Notes in Mathematics; Pitman Advanced Publishing Program: Boston, MA, USA, 1984; Volume 103. [Google Scholar]
© 2019 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/).