Abstract
Symmetries play a crucial role in the dynamics of physical systems. As an example, microworld and quantum physics problems are modeled on principles of symmetry. These problems are then formulated as equations defined on suitable abstract spaces. Then, these equations can be solved using iterative methods. In this article, an Ostrowski-type method for solving equations in Banach space is extended. This is achieved by finding a stricter set than before containing the iterates. The convergence analysis becomes finer. Due to the general nature of our technique, it can be utilized to enlarge the utilization of other methods. Examples finish the paper.
1. Introduction
We are concerned with finding solving
where is an operator acting between Banach spaces E and with
The famous Ostrowski-type method is defined for and each by
where , with . There are numerous results for the convergence of iterative methods utilizing the information and higher order derivatives [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39]. However, higher order derivatives cannot be found on method (2). Moreover, these results do not give uniqueness ball or estimates on or . That is why we are motivated to write this paper, where only hypotheses on the derivative and divided differences of order one are used. Notice that only these operators appear on method (2).
The method (2) is shown to be of order four using Taylor expansion and assumptions on the fifth order derivative of which is not on these schemes [5]. So, the assumptions on the sixth derivative reduce the applicability of this method.
For example: Let Define on D by
Then, we get and
Obviously, is not bounded on So, the convergence of method (2) is not guaranteed by the previous analyses in [5].
The rest of the study is organized as follows: Section 2 contains results on majorizing sequences. In Section 3, we develop the semi-local convergence analysis based on majorizing sequences. The local convergence analysis can be found in Section 4. Numerical examples can be found in Section 5. The paper ends with some concluding remarks in Section 6.
2. Majorizing Sequences
We recall the definition of a majorizing sequences.
Definition 1.
Let be a sequence in a complete normed space. Then, a non-decreasing scalar sequence is called majorizing for if
Then, the convergence of sequence reduces to studying that of [40].
Let and be positive parameters. Set and Define sequences and for each by
Moreover, define quadratic polynomials and functions on the interval for some
and
Denote by or or the non-negative zeros of if they exist. Furthermore, define sequences of functions on the interval for by
and
Next, we present two results on the majorizing sequence for method (2).
Lemma 1.
Suppose that for each , items
and
hold. Then, sequences and are increasing, bounded from above by and converge to their unique least upper bound
Proof.
Remark 1.
We shall use the following set of conditions denoted by (A) in our second result on majorizing sequences for method (2).
Suppose: there exists satisfying
or
Then, under the preceding notation and conditions (A), we can show.
Lemma 2.
Under conditions (A), the conclusions of Lemma 1 hold for sequences Moreover, the following assertions hold for each
and
Recall that and
Proof.
We shall show using induction on n that the following hold.
and
Suppose these estimates hold for all integers smaller or equal to Then, evidently, (10) holds (since ), if we show instead using (14)–(18) that
or
Notice that expression (19) is obtained if we replace by the right hand sides of (14), (15) and (17), respectively, in (18), remove denominators and move all terms at the right hand side of the inequality.
We shall find a relationship between two consecutive functions We can write in turn that
since so
Define function
By the definition of functions and we get
Then, we can show instead of (20) that
which is true by the definition of and Similarly, (11) holds if
or
This time, we have
so
Define function
Then, we get
If then for each and holds at However, if for each then
3. Semi-Local Convergence
We shall use conditions (H):
Suppose
- (H1)
- There exist such that is invertible and
- (H2)
- For eachSet
- (H3)
- For eachand
- (H4)
- and
- (H5)
- Conditions of Lemma 1 or Lemma 2 hold.
Then, based on conditions (H), we present the semi-local convergence analysis of method (2).
Theorem 1.
Suppose hypotheses (H) hold. Then, sequences generated by method (2) with starter are well defined in remain in for each and converge to a solution of equation Moreover, the following error estimates hold
Proof.
Mathematical induction is employed to show
and
Iterate is well defined by the first substep of method (2) and (H1). We can write
so Using (H3), we get in turn for
by the Lemma on invertible opertors due to Banach [41,42], leading to
Similarly, iterate is well defined by the second substep of method (2). We also have by (H2) for
so and
In view of (H3), (35), (36) (for ), (37) and triangle inequality, we get in turn
and
so Thus, estimates (32) and (33) hold for where we also used
We know that (36) holds for so iterate is well defined by the first substep of method (2) for and we can write
Then, we have
so Suppose estimates (32) and (33) hold for all integers smaller or equal to Then, simply repeat the preceding calculations with replaced by respectively, and use the induction hypotheses to terminate the proof for (32) and (33). By the Lemma sequence is Cauchy in a Banach space E and as such it converges to some since it is a closed set. Finally, using (40), we get
as implying (by the continuity of F). □
The point can be replaced by or respectively, given in closed form.
Next, a uniqueness of the solution of equation is presented.
Proposition 1.
Suppose:
- (a)
- There exists a solution of equation ;
- (b)
- There exists such that
Set Then, the only solution of equation in the region is
Proof.
Let with Set Using (H2) and (42), we obtain in turn that
so follows from the invertability of linear operator M and the identity □
4. Local Convergence
Let be positive parameters. Define function by
and set
Define functions by
By this definition, we have and as It then follows from the intermediate value theorem that function q has zeros in Denote by the smallest such zero. Similarly, denote by the smallest zero of function defined by Set Moreover, define function by
Set
We have again and as Denote by the smallest zero of function in We shall show that
is a convergence radius for method (2). Set Then, it follows from these definitions that for each
and
The conditions (C) shall be used together with the preceding notation provided that is a simple solution of equation
Suppose:
- (C1)
- For eachSet
- (C2)
- For eachand
- (C3)
Next, we present the local convergence analysis of method (2).
Theorem 2.
Under the conditions (C) further suppose that Then, we have
Proof.
We shall use mathematical induction to show
and
where functions are given previously and radius is defined by (45). Let Then, using (C1), (45) and (46), we obtain
so is invertible with
and iterate exists by (52) for Then, we can write
so by (C1), (C2) and (52) (for ), we get
so and (50) hold for As in (52), we also show
and
so iterate exists. Then, we can write in turn by the second substep of method (2) that
Next, we present a uniqueness of the solution result.
Proposition 2.
Suppose:
- (a)
- is a simple solution of equation
- (b)
- There exists such that
Set Then, the only solution of equation in the region is
Proof.
Let with Set Then, using (C1) and (60), we obtain
so since and □
5. Numerical Experiments
We provide some examples, showing that the old convergence criteria are not verified, but ours are. The divided difference is chosen by
Example 1.
Define function
where are parameters. Then, clearly for large and small, can be small (arbitrarily).
Example 2.
Let the domain of functions given on , which are continuous. We consider the max-norm. Choose Define G on D be
is given, ϵ is a parameter and P is the Green’s kernel given by
By (31), we have
Consider and We get
and
Example 3.
Let and D be as in the Example 5.3. It is well known that the boundary value problem [4]
can be given as a Hammerstein-like nonlinear integral equation
where λ is a parameter. Then, define by
Choose and Then, clearly since Suppose Then, conditions (A) are satisfied for
and Notice that
Example 4.
Consider the motion system
with Let Let Define function T on D for by
Then, we get
so Then, the radii are:
6. Conclusions
A finer convergence analysis is presented for method (2) utilizing generalized conditions. This analysis includes weaker criteria of convergence and computable error bounds not given in earlier papers.
Author Contributions
Conceptualization, C.I.A., I.K.A., J.J., S.R. and S.G.; methodology, C.I.A., I.K.A., J.J., S.R. and S.G.; software, C.I.A., I.K.A., J.J., S.R. and S.G.; validation, C.I.A., I.K.A., J.J., S.R. and S.G.; formal analysis, C.I.A., I.K.A., J.J., S.R. and S.G.; investigation, C.I.A., I.K.A., J.J., S.R. and S.G.; resources, C.I.A., I.K.A., J.J., S.R. and S.G.; data curation, C.I.A., I.K.A., J.J., S.R. and S.G.; writing—original draft preparation, C.I.A., I.K.A., J.J., S.R. and S.G.; writing—review and editing, C.I.A., I.K.A., J.J., S.R. and S.G.; visualization, C.I.A., I.K.A., J.J., S.R. and S.G.; supervision, C.I.A., I.K.A., J.J., S.R. and S.G.; project administration, C.I.A., I.K.A., J.J., S.R. and S.G.; funding acquisition, C.I.A., I.K.A., J.J., S.R. and S.G. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Chen, X.; Yamamoto, T. Convergence domains of certain iterative methods for solving nonlinear equations. Numer. Funct. Anal. Optim. 1989, 10, 37–48. [Google Scholar] [CrossRef]
- Ðukić, D.; Paunović, L.; Radenović, S. Convergence of iterates with errors of uniformly quasi-Lipschitzian mappings in cone metric spaces. Kragujev. J. Math. 2011, 35, 399–410. [Google Scholar]
- Ezquerro, J.A.; Gutiérrez, J.M.; Hernández, M.A.; Romero, N.; Rubio, M.J. The Newton method: From Newton to Kantorovich (Spanish). Gac. R. Soc. Mat. Esp. 2010, 13, 53–76. [Google Scholar]
- Ezquerro, J.A.; Hernandez, M.A. Newton’s Method: An Updated Approach of Kantorovich’s Theory; Birkhäuser: Cham, Switzerland, 2018. [Google Scholar]
- Grau-Sánchez, M.; Àngela, G.; Noguera, M. Ostrowski type methods for solving systems of nonlinear equations. Appl. Math. Comput. 2011, 218, 2377–2385. [Google Scholar] [CrossRef]
- Magréñan, A.A.; Gutiérrez, J.M. Real dynamics for damped Newton’s method applied to cubic polynomials. J. Comput. Appl. Math. 2015, 275, 527–538. [Google Scholar] [CrossRef]
- Nashed, M.Z.; Chen, X. Convergence of Newton-like methods for singular operator equations using outer inverses. Numer. Math. 1993, 66, 235–257. [Google Scholar] [CrossRef]
- 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]
- Todorcević, V. Harmonic Quasiconformal Mappings and Hyperbolic Type Metrics; Springer Nature AG: Cham, Switzerland, 2019. [Google Scholar]
- Yamamoto, T. A convergence theorem for Newton-like methods in Banach spaces. Numer. Math. 1987, 51, 545–557. [Google Scholar] [CrossRef] [Green Version]
- 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 Methods; Series: Studies in Computational Mathematics; Chui, C.K., Wuytack, L., Eds.; Elsevier Publ. Co.: New York, NY, USA, 2007; Volume 15. [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 method. J. Complex. 2012, 28, 364–387. [Google Scholar] [CrossRef] [Green Version]
- Argyros, I.K.; Hilout, S. On an improved convergence analysis of Newton’s method. Appl. Math. Comput. 2013, 225, 372–386. [Google Scholar] [CrossRef]
- Argyros, I.K.; Magréñan, A.A. Iterative Methods 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 Methods; Elsevier (Academic Press): 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 method. Indian J. Pure Appl. Math. 2020, 51, 439–455. [Google Scholar]
- Cătinaş, E. The inexact, inexact perturbed, and quasi-Newton methods are equivalent models. Math. Comp. 2005, 74, 291–301. [Google Scholar] [CrossRef]
- Dennis, J.E., Jr. On Newton-like methods. Numer. Math. 1968, 11, 324–330. [Google Scholar] [CrossRef]
- Dennis, J.E., Jr.; Schnabel, R.B. Numerical Methods for Unconstrained Optimization and Nonlinear Equations; SIAM: Philadelphia, PA, USA, 1996. [Google Scholar]
- Deuflhard, P.; Heindl, G. Affine invariant convergence theorems for Newton’s method and extensions to related methods. SIAM J. Numer. Anal. 1979, 16, 1–10. [Google Scholar] [CrossRef]
- Deuflhard, P. Newton Methods for Nonlinear Problems. Affine Invariance and Adaptive Algorithms; Springer Series in Computational Mathematics; Springer: Berlin, Germany, 2004; Volume 35. [Google Scholar]
- Gutiérrez, J.M.; Magreñán, Á.A.; Romero, N. On the semilocal convergence of Newton-Kantorovich method under center-Lipschitz conditions. Appl. Math. Comput. 2013, 221, 79–88. [Google Scholar] [CrossRef]
- Hernandez, M.A.; Romero, N. On a characterization of some Newton-like methods of R-order at least three. J. Comput. Appl. Math. 2005, 183, 53–66. [Google Scholar] [CrossRef] [Green Version]
- Magréñan, A.A.; Argyros, I.K.; Rainer, J.J.; Sicilia, J.A. Ball convergence of a sixth-order Newton-like method based on means under weak conditions. J. Math. Chem. 2018, 56, 2117–2131. [Google Scholar] [CrossRef]
- Ortega, J.M.; Rheinboldt, W.C. Iterative Solution of Nonlinear Equations in Several Variables; SIAM Publ.: Philadelphia, PA, USA, 2000. [Google Scholar]
- Proinov, P.D. General local convergence theory for a class of iterative processes and its applications to Newton’s method. J. Complex. 2009, 25, 38–62. [Google Scholar] [CrossRef] [Green Version]
- Rheinboldt, W.C. An Adaptive Continuation Process of Solving Systems of Nonlinear Equations; Polish Academy of Science, Banach Center Publisher: Warsaw, Poland, 1978; Volume 3, pp. 129–142. [Google Scholar]
- Shakhno, S.M.; Gnatyshyn, O.P. On aan iterative algorithm of order 1.839… for solving nonlinear least squares problems. Appl. Math. Appl. 2005, 161, 253–264. [Google Scholar]
- Shakhno, S.M.; Iakymchuk, R.P.; Yarmola, H.P. Convergence analysis of a two step method 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 method 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 methods for nonlinear systems. Optim. Lett. 2014, 8, 1001–1015. [Google Scholar] [CrossRef]
- Steffensen, J.F. Remarks on iteration. Skand Aktuar Tidsr. 1993, 16, 64–72. [Google Scholar] [CrossRef]
- Traub, J.F. Iterative Methods for the Solution of Equations; Prentice Hall: Hoboken, NJ, USA, 1964. [Google Scholar]
- Traub, J.F.; Werschulz, A.G. Complexity and Information; Lincei Lectures; Cambridge University Press: Cambridge, UK, 1998; xii+139pp.; ISBN 0-521-48506-1. [Google Scholar]
- Traub, J.F.; Wozniakowski, H. Path integration on a quantum computer. Quantum Inf. Process 2002, 1, 356–388. [Google Scholar] [CrossRef]
- 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 method in the theory of Newton-Kantorovich approximations and the Pták error estimates. Numer. Funct. Anal. Optim. 1987, 9, 671–684. [Google Scholar] [CrossRef]
- Potra, F.A.; Pták, V. Nondiscrete Induction and Iterative Processes; Research Notes in Mathematics; Pitman (Advanced Publishing Program): Boston, MA, USA, 1984; Volume 103. [Google Scholar]
- Kantorovich, L.V.; Akilov, G.P. Functional Analysis; Pergamon Press: Oxford, UK, 1982. [Google Scholar]
- Ortega, J.M.; Rheinboldt, W.C. Iterative Solution of Nonlinear Equations in Several Variables; Academic Press: New York, NY, USA, 1970. [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/).