Abstract
The local convergence analysis of multi-step, high-order Jarratt-like schemes is extended for solving Banach space valued systems of equations using the derivative instead of up to the ninth derivative as in previous works. Our idea expands the usage of the scheme in cases not considered earlier and can also be utilized in other schemes, too. Experiments test the theoretical results.
MSC:
65H10; 65G99; 49M15
1. Introduction
Let be an open subset of a Banach X and H a continuous operator mapping into Y, another Banach space.
Numerous problems from diverse disciplines turn into an equation
by mathematical modeling [1,2,3,4,5,6,7,8,9,10,11].
We want to find a solution in closed form, but this is achieved just in special occasions. This is why iterative schemes are developed generating sequences converging to under suitable convergence criteria [2,4,12,13,14,15,16,17,18].
We study the multi-step Jarratt-like scheme developed for and all and for , () by
The convergence order of (2) is presented in [19] for from Taylor series expansions with conditions reaching the ninth derivative of H (not appearing in scheme (2)). These restrict the application of scheme (2). Consider the simple illustration for defined by
Then, it is easily seen that is unbounded. Therefore, the work in [19] cannot guarantee convergence to a solution using scheme (2). Notice that the method (2) is of order at least eight if , which is optimum in the sense of the Kung–Traub conjecture [20]. Moreover, each step increases the convergence order by three [19]. The computational efficiency and computational cost of the method (2) have been given and discussed in detail (see Section 4 in [19]). It is also shown that it is better from the efficiency point of view when compared with other modified Jarratt-type methods. We also refer the reader to the notable relevant papers by Ignatova et al. [21], Kung et al. [20] and Petkovic [17]. Moreover, no upper bounds on or results on the uniqueness of are given. Motivated by all these, we develop a technique using only (that appears in (2)), which also gives computable upper bounds on and a uniqueness result.
Hence, we extend the applicability of scheme (2). Moreover, the Computational Order of Convergence (COC) and the Approximate Computational Order of Convergence (ACOC) are utilized to compute the convergence order, which does not require usage of higher derivatives or divided differences. This is conducted in Section 2. Numerical experiments are given in Section 3. Finally, the conclusion appears in Section 4.
2. Analysis
We develop the real functions , and and real indicators. Next, these functions are connected as majorizing for the operator (see the conditions – that follow). Set .
Suppose that there exist functions:
- (a)
- sohas a solution denoted by , which is continuous and nondecreasing (CN). Set .
- (b)
- , CN so that forforand
equations
have the least solutions , respectively, in .
Then, we show that given by
is a convergence radius for scheme (2).
It follows by these definitions that for each
and
Let stand for the closure of ball .
The conditions are used to provide the functions as given earlier:
- Equation has a simple solution .
- For allSet .
- For all u,and
- .
Next, using conditions together with the developed notation, we develop the local result of scheme (2).
Theorem 1.
Suppose conditions hold. Then, if , iteration developed by scheme (2) exists, stays in and converges to γ.
Proof.
Using (5)–(7) (for ), (9) (for ), ), (10) and scheme (2), we obtain in turn
hence, . Similarly, by (5), (7) (for ), (10), (11) and scheme (2), we have in turn that
therefore, .
Then, for the rest of the substeps, similarly, we obtain for
Simply replace by in the preceding calculations to obtain
so, and . □
We have the uniqueness result:
Proposition 1.
Suppose:
- (i)
- Point γ is a simple solution in of (1) and
- (ii)
Then, γ is unique in as a solution of (1).
Proof.
Let be such that . Define . Then, in view of and (16), we obtain in turn
so, , since and . □
Definition 1.
The COC is defined as
and, for , the ACOC [16] by
3. Applications
We test the conditions .
Example 1.
If , let function . The conditions must be verified. Clearly, solves the equation . Hence, we choose in conditions . In particular, the choice satisfies the condition . Concerning the condition , we have, in turn, by the definition of H and, since and , that
provided that , since there exists such that
That is the condition that is satisfied for this choice of . Moreover, by solving the equation , we obtain , and we can set .
Similarly, we have
for some, , so we can choose . Then, the first condition in is satisfied. Concerning the second condition in , we obtain in turn that
so, we can choose . Then, we have for the resutls of Table 1.
Table 1.
Radius for Example 1.
Example 2.
If , and considering the continuous operator (with the maximum norm) as
where space S contains continuous functions defined on the interval , we have that
Then, we obtain that , and for we obtain the functions , . This way, we obtain the Table 2.
Table 2.
Radius for Example 2.
Example 3.
Let , and . Let H defined on Ω be
For the point , the derivative is
Taking into account rows with their max. norm and
for we obtain through conditions , , and the radius in Table 3.
Table 3.
Radius for Example 3.
Example 4.
Taking into account the academic example in the first section of this work, for , we obtain , . The corresponding radius are in Table 4.
Table 4.
Radius for Example 4.
Example 5.
We consider the conventional form of Kepler’s equation
where and . In [22], we can find, for distinct values of τ and σ, a numerical study. In this case, we select value and , so the solution obtained is . Since
we obtain
and
Consequently, we have and . The calculated value parameters for are given in Table 5.
Table 5.
Radius for Example 5.
Example 6.
We analyze the following system of nonlinear equations
with . Then, the solution of the previous scheme is showed for by function defined by
The Fréchet derivative is given by
Then, we obtain
Then, we have that , , and the radii are in Table 6.
Table 6.
Radius for Example 6.
4. Conclusions
A technique is introduced involving only , which also gives computable upper error bounds on . This way, the method (2) becomes applicable in cases not possible before, since higher hypotheses on were required. The COC or ACOC are used to determine the convergence order. The technique is not based on method (2) and is very general. Hence, it can be used to extend the applicability of other methods [11,17,20,21]. This will be the focus of our future work.
Author Contributions
Conceptualization, I.K.A., C.A., M.A., J.C. and D.G.; data curation, I.K.A., C.A., M.A., J.C. and D.G.; methodology, I.K.A., C.A., M.A., J.C. and D.G.; project administration, D.G.; formal analysis, I.K.A., C.A., M.A., J.C. and D.G.; investigation, I.K.A., C.A., M.A., J.C. and D.G.; resources, I.K.A., C.A., M.A., J.C. and D.G.; writing—original draft preparation, I.K.A., C.A., M.A., J.C. and D.G.; writing—review and editing, I.K.A., C.A., M.A., J.C. and D.G.; visualization, I.K.A., C.A., M.A., J.C. and D.G.; supervision, I.K.A., C.A., M.A., J.C. and D.G. All authors have read and agreed to the published version of the manuscript.
Funding
This research was funded by Universidad de Las Américas, Quito, Ecuador, grant number FGE.DGS.20.15.
Data Availability Statement
Not applicable.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Amat, S.; Argyros, I.K.; Busquier, S.; Hernández–Verón, M.Á.; Martínez, E. On the local convergence study for an efficient k–step iterative method. JCAM 2018, 343, 753–761. [Google Scholar] [CrossRef]
- Amorós, C.; Argyros, I.K.; González, D.; Magreñán, Á.A.; Regmi, S.; Sarría, Í. New Improvement of the Domain of Parameters for Newton’s Method. Mathematics 2020, 8, 103. [Google Scholar] [CrossRef]
- Argyros, I.K.; George, S. Mathematical Modeling for the Solution of Equations and Systems of Equations with Applications; Nova Publishers: Hauppauge, NY, USA, 2019; Volume IV. [Google Scholar]
- Argyros, I.K.; González, D.; Magreñán, Á.A.; Moysi, A.; Regmi, S.; Sicilia, J.A. Convergence and Dynamics of a Higher–Order Method. Symmetry 2020, 12, 420. [Google Scholar]
- Argyros, I.K.; Magreñán, Á.A. A Contemporary Study of Iterative Methods; Elsevier: Amsterdam, The Netherlands, 2018. [Google Scholar]
- Frontini, M.; Sormani, E. Some variant of Newton’s method with third–order convergence. Appl. Math. Comput. 2003, 140, 419–426. [Google Scholar] [CrossRef]
- Grau–Sánchez, M.; Grau, Á.; Noguera, M. Ostrowski type methods for solving systems of nonlinear equations. Appl. Math. Comput. 2011, 218, 2377–2385. [Google Scholar] [CrossRef]
- Ortega, J.M.; Rheinboldt, W.C. Iterative Solution of Nonlinear Equations in Several Variables; Academic Press: New York, NY, USA, 1970. [Google Scholar]
- Rheinboldt, W.C. An adaptive continuation process for solving systems of nonlinear equations. Pol. Acad. Sci. Banach Ctr. Publ. 1978, 3, 129–142. [Google Scholar] [CrossRef]
- Soleymani, F.; Lotfi, T.; Bakhtiari, P. A multi–step class of iterative methods for nonlinear systems. Optim. Lett. 2014, 8, 1001–1015. [Google Scholar] [CrossRef]
- Traub, J.F. Iterative Methods for the Solution of Equations; Prentice-Hall: Englewood Cliffs, NJ, USA, 1964. [Google Scholar]
- Cordero, A.; Hueso, J.L.; Martínez, E.; Torregrosa, J.R. A modified Newton–Jarratt’s composition. Numer. Algorithms 2010, 55, 87–99. [Google Scholar] [CrossRef]
- Gutiérrez, J.M.; Hernández, M.A. A family of Chebyshev–Halley type methods in Banach spaces. Bull. Aust. Math. Soc. 1997, 55, 113–130. [Google Scholar] [CrossRef]
- Homeier, H.H. A modified Newton method with cubic convergence: The multivariable case. J. Comput. Appl. Math. 2004, 169, 161–169. [Google Scholar] [CrossRef]
- Jarratt, P. Some fourth order multipoint iterative methods for solving equations. Math. Comp. 1966, 20, 434–437. [Google Scholar] [CrossRef]
- 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. On a general class of multipoint root–finding methods of high computational efficiency. SIAM J. Numer. Anal. 2011, 49, 1317–1319. [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]
- Ahmad, F.; Tohidi, E.; Ullah, M.Z.; Carrasco, J.A. Higher order multi–step Jarratt–like method for solving systems of nonlinear equations: Application to PDEs and ODEs. Comp. Math. App. 2015, 70, 624–636. [Google Scholar] [CrossRef]
- Kung, H.T.; Traub, J.F. Optimal order of one point and multipoint iteration. J. AMC 1974, 21, 643–651. [Google Scholar] [CrossRef]
- Ignatova, B.; Kyurkchiev, N.; Iliev, A. Multipoint Algorithms Arising from Optimal in the Sense of Kung–Traub Iterative Procedures for Numerical Solution of Nonlinear Equations. Gen. Math. Notes 2011, 6, 45–79. [Google Scholar]
- Danby, J.M.A.; Burkardt, T.M. The solution of Kepler’s equation, I. Celest. Mech. 1983, 31, 95–107. [Google Scholar] [CrossRef]
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/).