Abstract
We develop a unified convergence analysis of three-step iterative schemes for solving nonlinear Banach space valued equations. The local convergence order has been shown before to be five on the finite dimensional Euclidean space assuming Taylor expansions and the existence of the sixth derivative not on these schemes. So, the usage of them is restricted six or higher differentiable mappings. But in our paper only the first Frèchet derivative is utilized to show convergence. Consequently, the scheme is expanded. Numerical applications are also given to test convergence.
1. Introduction
We study the problem of finding a simple solution of
provided is an operator acting between Banach spaces E and with Since a closed form solution is not possible in general, iterative schemes are used for solving (1). Many iterative schemes are studied for approximating In this paper, we consider the iterative schemes, developed for each as
where and
A plethora of schemes are special cases of (2).
Newton’s Scheme [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23]: Set to obtain
This scheme is of order two.
Traub’s Scheme [21,24,25,26,27,28,29,30]: Set to obtain
This scheme is of order five.
Ostrowski Scheme [20]: Set and to obtain
This scheme is of order four.
Ostrowski-Type Scheme [20]: Set and to obtain
This scheme is of order four.
Traub, Newton-type, Runge–Kutta and other three step schemes can be seen as special cases of (2) [7,14,20,30]. The local convergence of these schemes and their stability has been given in the aforementioned references using derivatives of order one more than the convergence order. As an example, the existence of the fifth derivative is required for the convergence of the Ostrowski scheme. Notice that convergence can be obtained without the fifth derivative, which does not appear on the scheme. Clearly there is a need to study the convergence of these schemes using a uniform set of criteria. That is why we developed scheme (2).
Let Consider on D by
Then, we get and
But, is unbounded on So, the convergence of scheme (2) is not assured by the previous analyses. In order to extend the utilization of these schemes, we study the local convergence of scheme (2): in a Banach space, under generalized continuity conditions and using hypotheses only on the operators appearing on these schemes. Notice also that the convergence of most high convergence order schemes was given only on the finite dimensional Euclidean space with no error bounds on or information about the uniqueness of the solution. However, we give such results in this paper. Moreover, we present the semi-local convergence of these schemes not given before using majorizing sequences. The technique can apply on other single, multipoint, and multistep schemes along the same lines, since it is so general [8,9,16,27,28,29].
In Section 2, Section 3 and Section 4, we present results on majorizing sequences, semi-local and local convergence, respectively. The applications are conclusions can be found in Section 4 and Section 5, respectively.
The analysis is provided in the next three sections followed by the examples and conclusions in the last two sections.
2. Convergence for Majorizing Sequence
We shall use the following definition of a majorizing sequence.
Definition 1.
Let be a sequence in Then, a sequence majorizes if
In this case, the study of the convergence for sequence reduces to that of [21].
Next, we shall define sequences to be shown to be majorizing for scheme (2). Set
Let and be continuous and nondecreasing functions. We denote and Let and be continuous and nondecreasing functions for some subset of Let also Define scalar sequences by
where
Next, we present two general results on the convergence of majorant sequence (3).
Lemma 1.
Suppose that there exists such that for each
and
Then, sequences converge to their unique least upper bound
Proof.
By the definition of these sequences, it follows that they are nondecreasing bounded from above by with and as such they converge to □
Proof.
Set in Lemma 1. □
Remark 1.
Define functions on the interval by
and
Suppose that these functions have smallest zeros respectively. Set
Then, we can show the third convergence result.
Lemma 3.
Suppose that
Then, sequences are bounded from above by nondecreasing and converge to so that
and
3. Semi-Local Convergence
We shall use some functions and parameters.
Suppose that there exists function continuous and nondecreasing such that has a minimal solution Set Suppose function is continuous and nondecreasing.
The following conditions (A) shall be used.
Suppose:
- (A1)
- There exists such that and
- (A2)
- For eachSet where and is the closure of
- (A3)
- (A4)
- For each
- (A5)
- Conditions of Lemma 1 or Lemma 2 or Lemma 3 hold.and
- (A6)
- (or ).The semi-local convergence of scheme (2) is shown next.
Theorem 1.
Suppose conditions (A) hold. Then, sequences generated by scheme (2) are well defined in stays in for each and converge to a solution of equation , so that for each
Proof.
We shall prove assertions
()
()
() using mathematical induction on By scheme (2) for and (A1), we have
so and () holds. By (A3), (A4) and the second substep of scheme (2), we have
showing (). Similarly by the second substep of scheme (2), we obtain in turn
and
showing () and (), where we also used
(by the third substep of scheme (2))
(by the second substep of scheme (2)),
so
by the Banach lemma on invertible operators [17,20]. Suppose (), (), () hold, Then, by repeating these calculations with replacing respectively, we complete the induction. Therefore, sequence is fundamental in a Banach space E so for some If then by the estimate
and using the continuity of F, we get □
Next, the uniqueness result of is discussed.
Proposition 1.
Suppose
(a) Point solves the equation
(b) There exists such that
Set Then, is unique in
Proof.
Consider satisfying Define It then follows from (A1) and (18) that
so follows from and the approximation □
Remark 2.
We want to see how developed sequences are defined in some interesting cases. Runge–Kutta and other high convergence schemes can also be studied under this technique by also specializing the operators and Let us choose That is, we consider Traub’s scheme. Then, we have in turn
Under these choices, we shall present another result on majorizing sequences using our idea of recurrent functions, which is weaker than that of Lemma 3. We have in this case
and
Let us consider the interesting case when and
Define sequences of functions on the interval by
Notice that It then follows (by the intermediate value theorem) that polynomial have zeros in Call by the minimal such zeros, respectively. Set
Next, we show another result on majorizing sequences for scheme (2).
Lemma 4.
Suppose that
Then, the conclusions of Lemma 3 hold for sequences with ρ replacing
Proof.
We shall show this time
and
These assertions hold for by (48) and the definition of these sequences (see Remark 2). Then, as in Lemma 3, we can show instead of (20) that
This estimate motivates us to define recurrent functions and show instead
We need a relationship between two consecutive functions Then, we can write
In particular, we have
by the definition of Define also function Then, we have
Hence, we can show instead of (20) that
which is true by (48). The induction for (20) is completed. Moreover, similarly instead of (21) we can show that
or
Then, again we have
We have in particular
Define function Then, we have
Hence, we can show instead of (30) that , which is true by (48). Furthermore, (22) holds if we show instead
or
However, we get
In particular, we have
Defined function Then, we also get
Hence, (33) holds if However, this is true by (48). Therefore, the induction is terminated for (20)–(23). The rest is as in the proof of Lemma 1. □
4. Local Convergence
We shall introduce real parameter and functions to be used in the convergence analysis. Set
Suppose
- (i)
- has a minimal zero where is some continuous and nondecreasing function. Let
- (ii)
- has a minimal zero where function is continuous and nondecreasing and is defined by
- (iii)
- has a minimal zero Let and
- (iv)
- has a smallest zero wherewith functions and are continuous and nondecreasing.
- (v)
- has a smallest zero wherewhere is nondecreasing and continuous. It shall be shown thatis a convergence radius for scheme (2). Set These definitions imply that for eachandThe conditions (H) shall be used.Suppose
- (H1)
- For allLet
- (H2)
- For alland
- (H3)
The local convergence of scheme (2) is given next based on the previous notation and conditions (H).
Theorem 2.
Suppose: and conditions (H) hold. Then, we conclude
Proof.
Let Using (17), (18) and (H1), we have
so
In particular, iterate is well defined by (38) for and the first substep of scheme (2), from which we can also write
By (34), (37) (for ), (38) (for ), (39) and (H2), we find in turn that
so where We also have that (38) holds for and iterate is well defined, from which we can write in turn that
In view of (34), (37) (for ), (38) (for ), (40), (41) and (H2), we obtain in turn
so Similarly, but using the third substep of scheme (2), we can write
so
for Simply, switch by respectively, in the preceding calculations to get
and
Then, from the estimation
where we get and □
A uniqueness result is given next.
Proposition 2.
Suppose:
- (i)
- Point is a simple solution of equation
- (ii)
- Set Then, is unique in
Proof.
Consider with Set Using (H1) and (47), we obtain
so follows by and □
5. Numerical Experiments
We consider four examples with (Multistep Newton method). Here, and
Example 1.
Define function
where are numbers. Then, for large and small, is arbitrarily small and
Example 2.
If consider given as
We obtain
so for we set Then, the radii:
Example 3.
Consider the motion system
with Let Let Let function N on D for given as
Then, is given as
Then, we can set and Then, the radii:
where K is the Lipschitz constant in D given in [26,30].
Example 4.
Consider and D as in the second Example. Then, the (BVP) [13]
can be also given as
where σ is a constant, Consider as
Let us set and Then, clearly since Suppose Then, conditions (A) are satisfied for
and Notice that
6. Conclusions
We have provided a single sufficient criterion for the semi-local convergence of three step schemes. Upon specializing the parameters involved we show that although our majorizing sequence is more general than earlier ones: Convergence criteria are weaker (i.e., the utility of the schemes is extended); the upper error estimates are more accurate (i.e., at least as few iterates are required to achieve a predecided error tolerance) and we have an at least as large ball containing the solution. These benefits are obtained without additional hypotheses. According to our new technique we locate a more accurate domain than before containing the iterates resulting to more accurate (at least as small) Lipschitz condition.
Our theoretical results are further justified using numerical experiments. In the future we plan to extend these results by replacing the Lipschitz constants by generalized functions along the same lines.
Author Contributions
Conceptualization, S.R., C.I.A., I.K.A. and S.G.; software, S.R., C.I.A., I.K.A. and S.G.; validation, S.R., C.I.A., I.K.A. and S.G.; formal analysis, S.R., C.I.A., I.K.A. and S.G.; investigation, S.R., C.I.A., I.K.A. and S.G.; resources, S.R., C.I.A., I.K.A. and S.G.; data curation, S.R., C.I.A., I.K.A. and S.G.; writing—original draft preparation, S.R., C.I.A., I.K.A. and S.G.; writing—review and editing, S.R., C.I.A., I.K.A. and S.G.; visualization, S.R., C.I.A., I.K.A. and S.G.; supervision, S.R., C.I.A., I.K.A. and S.G.; project administration, S.R., C.I.A., I.K.A. and S.G.; funding acquisition, S.R., C.I.A., I.K.A. and S.G. 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
- Argyros, I.K. On the Newton—Kantorovich hypothesis for solving equations. J. Comput. Math. 2004, 169, 315–332. [Google Scholar] [CrossRef] [Green Version]
- Argyros, I.K. Computational Theory of Iterative Schemes; Studies in Computational Mathematics Series, 15; Chui, C.K., Wuytack, L., Eds.; Elsevier Publ. Co.: New York, NY, USA, 2007. [Google Scholar]
- Argyros, I.K. Convergence and Applications of Newton-Type Iterations; Springer: Berlin, Germany, 2008. [Google Scholar]
- Argyros, I.K.; Hilout, S. Weaker conditions for the convergence of Newton’s scheme. J. Complex. 2012, 28, 364–387. [Google Scholar] [CrossRef] [Green Version]
- Argyros, I.K.; Hilout, S. On an improved convergence analysis of Newton’s scheme. Appl. Math. Comput. 2013, 225, 372–386. [Google Scholar]
- Argyros, I.K.; Magréñan, A.A. Iterative Schemes and Their Dynamics with Applications; CRC Press: New York, NY, USA, 2017. [Google Scholar]
- Argyros, I.K.; Magréñan, A.A. A Contemporary Study of Iterative Schemes; Elsevier: New York, NY, USA, 2018. [Google Scholar]
- Behl, R.; Maroju, P.; Martinez, E.; Singh, S. A study of the local convergence of a fifth order iterative scheme. Indian J. Pure Appl. Math. 2020, 51, 439–455. [Google Scholar]
- Cătinaş, E. The inexact, inexact perturbed, and quasi-Newton schemes are equivalent models. Math. Comput. 2005, 74, 291–301. [Google Scholar] [CrossRef]
- Chen, X.; Yamamoto, T. Convergence domains of certain iterative schemes for solving nonlinear equations. Numer. Funct. Anal. Optim. 1989, 10, 37–48. [Google Scholar] [CrossRef]
- Dennis, J.E., Jr.; Schnabel, R.B. Numerical Schemes for Unconstrained Optimization and Nonlinear Equations; SIAM: Philadelphia, PA, USA, 1996; First published by Prentice-Hall: Englewood Cliffs, NJ, USA, 1983. [Google Scholar]
- Deuflhard, P. Newton Schemes for Nonlinear Problems. Affine Invariance and Adaptive Algorithms; Springer Series in Computational Mathematics, 35; Springer: Berlin, Germany, 2004. [Google Scholar]
- Ezquerro, J.A.; Hernandez, M.A. Newton’s Scheme: An Updated Approach of Kantorovich’s Theory; Springer: Cham, Switzerland, 2018. [Google Scholar]
- Grau-Sánchez, M.; Grau, À.; Noguera, M. Ostrowski type schemes for solving systems of nonlinear equations. Appl. Math. Comput. 2011, 281, 2377–2385. [Google Scholar]
- Gutiérrez, J.M.; Magreñán, Á.A.; Romero, N. On the semilocal convergence of Newton-Kantorovich scheme under center-Lipschitz conditions. Appl. Math. Comput. 2013, 221, 79–88. [Google Scholar]
- Hernandez, M.A.; Romero, N. On a characterization of some Newton-like schemes of R- order at least three. J. Comput. Appl. Math. 2005, 183, 53–66. [Google Scholar] [CrossRef] [Green Version]
- Kantorovich, L.V.; Akilov, G.P. Functional Analysis; Pergamon Press: Oxford, UK, 1982. [Google Scholar]
- Magréñan, A.A.; Argyros, I.K.; Rainer, J.J.; Sicilia, J.A. Ball convergence of a sixth-order Newton-like scheme based on means under weak conditions. J. Math. Chem. 2018, 56, 2117–2131. [Google Scholar] [CrossRef]
- Nashed, M.Z.; Chen, X. Convergence of Newton-like schemes for singular operator equations using outer inverses. Numer. Math. 1993, 66, 235–257. [Google Scholar] [CrossRef]
- Ortega, J.M.; Rheinboldt, W.C. Iterative Solution of Nonlinear Equations in Several Variables; SIAM Publ.: Philadelphia, PA, USA, 2000; First published by Academic Press: New York, NY, USA; London, UK, 1997. [Google Scholar]
- Potra, F.A.; Pták, V. Nondiscrete Induction and Iterative Processes; Research Notes in Mathematics, 103; Pitman (Advanced Publishing Program): Boston, MA, USA, 1984. [Google Scholar]
- Verma, R. New Trends in Fractional Programming; Nova Science Publisher: New York, NY, USA, 2019. [Google Scholar]
- Zabrejko, P.P.; Nguen, D.F. The majorant scheme in the theory of Newton-Kantorovich approximations and the Pták error estimates. Numer. Funct. Anal. Optim. 1987, 9, 671–684. [Google Scholar] [CrossRef]
- Proinov, P.D. General local convergence theory for a class of iterative processes and its applications to Newton’s scheme. J. Complex. 2009, 25, 38–62. [Google Scholar] [CrossRef] [Green Version]
- Proinov, P.D. New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems. J. Complex. 2010, 26, 3–42. [Google Scholar] [CrossRef] [Green Version]
- Rheinboldt, W.C. An Adaptive Continuation Process of Solving Systems of Nonlinear Equations; Polish Academy of Science, Banach Center Publications; Institute of Mathematics Polish Academy of Sciences, Instytut Matematyczny Polskiej Akademii Nauk: Warszawa, Poland, 1978; Volume 3, pp. 129–142. Available online: https://eudml.org/doc/208686 (accessed on 28 November 2021).
- Shakhno, S.M.; Iakymchuk, R.P.; Yarmola, H.P. Convergence analysis of a two step scheme for the nonlinear squares problem with decomposition of operator. J. Numer. Appl. Math. 2018, 128, 82–95. [Google Scholar]
- Sharma, J.R.; Guha, R.K.; Sharma, R. An efficient fourth order weighted—Newton scheme for systems of nonlinear equations. Numer. Algorithms 2013, 62, 307–323. [Google Scholar] [CrossRef]
- Soleymani, F.; Lotfi, T.; Bakhtiari, P. A multi-step class of iterative schemes for nonlinear systems. Optim. Lett. 2014, 8, 1001–1015. [Google Scholar] [CrossRef]
- Traub, J.F.; Werschulz, A.G. Complexity and Information, Lezioni Lince; Lincei Lectures; Cambridge University Press: Cambridge, UK, 1998; pp. xii+139. ISBN 0-521-48506-1. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 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/).