1. Introduction
The objective in this paper was to locate a simple solution
of
given that
is a continuous operator,
are Banach spaces and the set
. Numerous methods can be represented for all
by
where
and
Special Cases:
Newton’s method (second order) [1,2,3,4,5,6,7,8,9,10]: Set
and
This method is of the order of two.
Jarrat’s method (second order) [10]: Set
and
to obtain
Traub-like method (fifth order) [10]: Let
and
to get
Homeier method (third order) [11]: Set
and
to obtain
Corodero–Torregrosa method (third order) [12]: Set
and
to obtain
or
Noor–Wasseem method (third order) [13]: and
Xiao–Yin method (third order) [14]: and
Cordero method (fifth order) [12]: and
or
and
Sharma–Arora method (fifth order) [15]: and
Xiao–Yinmethod (fifth order) [16]: and
Other choices are also possible [
1,
2,
3,
8,
9,
14,
15,
17,
18,
19]. Therefore, it is interesting to consider the semilocal convergence of these methods not given in earlier papers under the same convergence criteria in the Banach space setting using the method (
2). In earlier papers, only the local convergence was given in the finite-dimensional Euclidean space requiring the existence of derivatives one more than the order. Moreover, these derivatives do not appear on the methods but are only used to show the convergence order.
For example, let
Define function
on
by
Notice that
The definition of function
gives
However,
is unbounded on
Thus, the convergence of method (
2) is not verified by the earlier analyses. This paper extends the usage of these methods because no conditions on derivatives of high order are used to show convergence. This is the novelty of the paper. The study also includes the semilocal analysis not given in earlier research. Notice that the branching of the solutions cannot be handled using the iterative method (
2) since the first step required that
exists. The paper contains seven sections, including a numerical and a concluding section.
2. Real Sequences
Let
and
be nonnegative sequences and
be a given parameter. Set
Consider functions
to be nondecreasing, continuous, and sequence
and
are defined by
where
Next, three auxiliary results are given on the convergence of the majorizing sequence (
3).
Lemma 1. Suppose there exists minimal zero τ of function and Then, the sequence is nondecreasing and convergent to some The limit point is the least upper bound of the sequence and it is unique.
Proof. The result followed by (
3) and (
4), since the sequence
is bounded from
and nondecreasing. □
A stronger result follows.
Lemma 2. Sequence is strictly increasing and Then, it holds
Proof. Set in Lemma 1. □
Next, we define sequences
and
for all
by
and
where
and functions
by
and
provided that these exist
such that
The convergence criteria given so far are very general. However, we can consider stronger ones.
Suppose functions
have minimal zeros
and set
Next, we present the third result.
Lemma 3. Then, the following items hold for all and Proof. Items (
10)–(
12) are shown using induction on
Using (
7)–(
9), and the definition of the sequence
By (
14)–(
16), estimates (
10)–(
12) hold for
Assume they are true for all integers
m smaller than
Using the induction
and
Moreover, estimates (
14)–(
16) shall hold for
m replacing 0 if
which is true by the definition of parameters
and functions
Hence, the induction for estimates (
10)–(
12) is terminated. Consequently, it follows
□
3. Semilocal Convergence
The convergence requires conditions:
Assume:
- (C1)
There exist
such that
and
- (C2)
for all
- (C3)
Equation has a minimal positive solution . Let
- (C4)
There exist nondecreasing and continuous functions
such that
for all
- (C5)
Conditions of any of the Lemmas in
Section 2 hold.
- (C6)
It is worth noticing that if , the resulting (C4) conditions will have a tighter function than Moreover, the same proof as that of Theorem 2 follows through (see the numerical Section).
Next, we provide the semilocal convergence.
Theorem 1. Suppose conditions (C1)–(C6) hold. Then, sequence exists, and there exists so that and Proof. The iterates
exist by (C1) and (
2) for
Then, the estimate is derived by (C1)
Thus, the iterate
Let
Then, by (C2) and (C6)
leading to
and
by the Banach lemma on the linear operator with inverses [
6]. Moreover, by (C4) and method (
2), the following estimates are obtained in turn
Hence,
where
and
Therefore,
and
hold for
Estimates preceding (
23) hold with indices
replacing
respectively. Thus, the induction for estimates (
23)–(
27) is terminated.
It follows sequence
is fundamental in
X which is a Banach space, so
exists and
. Then, considering the estimate (see (
21))
Therefore,
follows if
in (
28). □
Proposition 1. Suppose:
(i) Point for some solves the equation
(ii) Condition (C2) holds.
(iii) There exists so that Let Then, solves Equation (1) uniquely in Proof. Let
satisfy
Set
By applying (
29) and (C2), one obtains
Then, it follows that by and the implication □
Remark 1. (i) The point which is in closed form may replace in the condition (C6).
(ii) Proposition 2 is not using all conditions of Theorem 2. However, if all conditions are assumed then, set
4. Local Convergence Analysis
Some auxiliary scalar functions and parameters are first introduced based on which the local convergence analysis of method (
2) shall be given. Set
Let function
be continuous and nondecreasing.
Suppose:
(H1) Equation
has a smallest solution
Set
Let function
be continuous and nondecreasing. Define function
by
(H2) Equation
has a smallest solution
Let
be a parameter. Define function
by
(H3) Equation
has a smallest solution
Let
be a parameter. Define function
by
(H4) Equation
has a smallest solution
The parameter
r defined for
as
is proven to be a radius of convergence for method (
2) in Theorem 2. Set
In view of these definitions, we have that for all
and
Next, the relationship is given between the aforementioned functions and the operators appearing on the method (
2). Consider the conditions.
Suppose:
(A1) There exists a solution such that is invertible.
(A2) for all Set
(A3)
and
for all
where functions
and
are continuous.
(A4) The parameter given by the Formula (
30) exists and
(A5)
The main local convergence result follows for the method (
2).
Theorem 2. Suppose conditions (A1)–(A5) hold. Then, sequence produced by method (2) for exists in remains in for all and converges to Moreover, the following items hold for all andwhere the functions are previously defined and the radius r is given by (3). Proof. Mathematical induction is utilized to prove items (
8)–(
10). Let
Let
be arbitrary. By applying conditions
and
Then, the linear operator
exists and
If
then the iterative
exists by method (
2). It follows
Then, by applying (A3) and (
37) (for
)
Hence, the iterate
and (
33) is true for
where we also use the estimate
so,
Similarly, by the second substep of method (
2), we can write
By applying (A3), and (
37) (for
), we obtain in turn that
Thus, the iterate
and estimate (
34) hold for
Then, again, by the third substep of method (
2), we obtain:
Consequently,
where we also used (
39) and
It follows from estimate (
40) that iterate
is well defined and (
35) holds for
Therefore, the induction for assertions (
33)–(
35) is completed if the iterates
are exchanged with the iterates
respectively, in the previous calculations. Finally, from the calculation
where
we obtain that
and the iterate
□
The uniqueness of the solution result follows.
Proposition 2. Suppose: there exists a simple solution of equation for some and (A2) holds. Furthermore, suppose equation has a smallest positive solution Set Then, the point is the only solution of equation in the region
Proof. Let
with
Let the linear operator
Then, by applying condition (A3)
Hence, is implied by the inverse of T and the application gives Therefore, we conclude that □
5. A Specialization of Method
Set
and
for all
Then, method (
2) reduces to
This is Newton’s three-step fifth-order method, also called Traub’s extended three-step method. It seems to be the most interesting special case of method (
2) to study as an application.
Consider the popular choices:
Semilocal case:
and
We can also set
However, for determining
and
q, let us start with
It follows that we can set
Local case: and Then, we obtain
These choices are used in the examples of the numerical section.
6. Numerical Examples
We verify the convergence criteria using method (
42). Moreover, we compare the Lipschitz constants
, and
In particular, we used the first example to show that the ratio can be arbitrarily small.
Example 1. Let Define the functionwhere are fixed parameters. It follows that for large and small, can be small (arbitrarily), so that The parameters
and
are computed in the next example, where
is the Lipschitz parameter on
used by Kantorovich [
6], whereas
K is the parameter replacing
L if, as noted in
Section 3, for
we choose
in (C4). Moreover, the convergence conditions by Kantorovich [
6] are compared to those of Lemma 1.
Example 2. Let Define scalar function on the interval for by Pick Then, the estimates are for all so for all and so for all and Notice that for all Next, set Then, we have Define function on the set by Then, we obtain by this definition thatwith being the critical point of function Notice that It follows that this function is decreasing on the interval and increasing on the interval since and Hence, we can setand However, if thenwhere and for all Then, the Kantorovich criterion [6] is not satisfied for all Therefore, there is no assurance that method (2) is convergent to Let us test the convergence criteria of Lemma 1 by selecting Then, we have the following Table 1, verifying the convergence condition (6) for Example 3. Let for . Then, the boundary value problem [4]is transformed as the integral equationwhere γ is a constant and is due to Green’s function given by Let us pick and Then, clearly since If Then, conditions (H1)–(H4) are satisfied for Hence,
The next two examples concern the local convergence of the method (
2) and radii
computed using Formula (
30) and the functions
Example 4. Consider and . Consider given as The max-norm is used. Then, since conditions (A1)–(A5) hold, provided that and Then, the radii are: Example 5. Let the system of differential equationswith Let Let . Then, Let function on Ω for given as Then, the derivative due to Fréchet is given by This definition implies that Let with Moreover, the norm for is We need to verify the conditions (A1)–(A5). To achieve this, we study on , so hence and It follows that Then, This time, we obtainwhere Then, we obtain for all Moreover,where We can set Therefore, the computed radii are
Discussion: It is important to mention some more applications. Notice that the branching of the solutions cannot be handled using the iterative method (
2) since the existence of
is required in the first step. It is worth noticing that the present results can also apply to notable references by Singh et al. [
10] and Vijayakumar et al. [
20,
21] involving the solution of differential equations. This is provided that the Banach space
is specialized to be the space of all Bockner integrable functions and the involved operator is defined as a Riemann–Liouville integral, Riemann–Liouville fractional derivative, or Caputo fractional derivative of a certain order in the interval
[
10].
In the references [
20,
21], the evolution differential inclusions should be in Banach space. In particular, the control function should belong in
, which is the Banach space of admissible functions with
.
7. Conclusions
Sufficient conditions unify the convergence of generalized three-step methods. Their specializations provide a finer convergence analysis since smaller Lipschitz parameters and tighter real majorizing sequences are used than in [
3,
4,
6,
11,
12,
17,
18].
More areas of application can be found in [
3,
4,
6,
9,
19] and the references therein. These ideas can be immediately extended to include multistep as well as multipoint iterative methods along the same lines. This is the topic of future work.
Author Contributions
Conceptualization, S.R., I.K.A., S.G. and C.I.A.; methodology, S.R., I.K.A., S.G. and C.I.A.; software, S.R., I.K.A., S.G. and C.I.A.; validation, S.R., I.K.A., S.G. and C.I.A.; formal analysis, S.R., I.K.A., S.G. and C.I.A.; investigation, S.R., I.K.A., S.G. and C.I.A.; resources, S.R., I.K.A., S.G. and C.I.A.; data curation, S.R., I.K.A., S.G. and C.I.A.; writing—original draft preparation, S.R., I.K.A., S.G. and C.I.A.; writing—review and editing, S.R., I.K.A., S.G. and C.I.A.; visualization, S.R., I.K.A., S.G. and C.I.A.; supervision, S.R., I.K.A., S.G. and C.I.A.; project administration, S.R., I.K.A., S.G. and C.I.A.; funding acquisition, S.R., I.K.A., S.G. and C.I.A. 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.
Data Availability Statement
Not applicable.
Conflicts of Interest
The authors declare no conflict of interest.
References
- 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. Unified Convergence Criteria for Iterative Banach Space Valued Methods with Applications. Mathematics 2021, 9, 1942. [Google Scholar] [CrossRef]
- Argyros, I.K.; Magréñan, A.A. A Contemporary Study of Iterative Methods; Elsevier (Academic Press): New York, NY, USA, 2018. [Google Scholar]
- Argyros, I.K. The Theory and Applications of Iteration Methods, 2nd ed.; Engineering Series; CRC Press, Taylor and Francis Group: Boca Raton, FL, USA, 2022. [Google Scholar]
- Ezquerro, J.A.; Hernandez, M.A. Newton’s Method: An Updated Approach of Kantorovich’s Theory; Springer: Cham, Switzerland, 2018. [Google Scholar]
- Kantorovich, L.V.; Akilov, G.P. Functional Analysis; Pergamon Press: Oxford, UK, 1982. [Google Scholar]
- 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]
- Shakhno, S.M.; Gnatyshyn, O.P. On an iterative Method of order 1.839⋯ for solving nonlinear least squares problems. Appl. Math. Appl. 2005, 161, 253–264. [Google Scholar]
- Singh, A.; Shukla, A.; Vijayakumar, V.; Udhayakumar, R. Asymptotic stability of fractional order (1, 2] stochastic delay differential equations in Banach spaces. Chaos Solitons Fractals 2021, 150, 111095. [Google Scholar] [CrossRef]
- Homeier, H.H.H. A modified Newton method with cubic convergence: The multivariate case. J. Comput. Appl. Math. 2004, 169, 161–169. [Google Scholar] [CrossRef] [Green Version]
- Cordero, A.; Torregrosa, J.R. Variants of Newton’s method using fifth-order quadrature formulas. Appl. Math. Comput. 2007, 190, 686–698. [Google Scholar] [CrossRef]
- Noor, M.A.; Waseem, M. Some iterative methods for solving a system of nonlinear equations. Comput. Math. Appl. 2009, 57, 101–106. [Google Scholar] [CrossRef] [Green Version]
- Verma, R. New Trends in Fractional Programming; Nova Science Publisher: New York, NY, USA, 2019. [Google Scholar]
- Sharma, J.R.; Arora, H. Efficient derivative-free numerical methods for solving systems of nonlinear equations. Comp. Appl. Math. 2016, 35, 269–284. [Google Scholar] [CrossRef]
- Xiao, X.; Yin, H. Achieving higher order of convergence for solving systems of nonlinear equations. Appl. Math. Comput. 2017, 311, 251–261. [Google Scholar] [CrossRef]
- Grau-Sanchez, M.; Grau, A.; Noguera, M. Ostrowski type methods for solving system of nonlinear equations. Appl. Math. Comput. 2011, 218, 2377–2385. [Google Scholar] [CrossRef]
- Kou, J.; Wang, X.; Li, Y. Some eight order root finding three-step methods. Commun. Nonlinear Sci. Numer. Simul. 2010, 15, 536–544. [Google Scholar] [CrossRef]
- Traub, J.F. Iterative Methods for the Solution of Equations; Prentice Hall: Hoboken, NJ, USA, 1964. [Google Scholar]
- Vijayakumar, V.; Murugesu, R. Controllability for a class of second-order evolution differential inclusions without compactness. Appl. Anal. 2019, 98, 1367–1385. [Google Scholar] [CrossRef]
- Vijayakumar, V.; Nisar, K.S.; Chalishajar, D.; Shukla, A.; Malik, M.; Alsaadi, A.; Aldosary, S.F. A Note on Approximate Controllability of Fractional Semilinear Integrodifferential Control Systems via Resolvent Operators. Fractal Fract. 2022, 6, 73. [Google Scholar] [CrossRef]
Table 1.
Real sequence (
42).
Table 1.
Real sequence (
42).
n | 1 | 2 | 3 | 4 | 5 | 6 |
---|
| 0.2330 | 0.2945 | 0.3008 | 0.3009 | 0.3009 | 0.3009 |
| 0.2000 | 0.2896 | 0.3008 | 0.3009 | 0.3009 | 0.3009 |
| 0.2341 | 0.2946 | 0.3008 | 0.3009 | 0.3009 | 0.3009 |
| 0.5200 | 0.7530 | 0.7820 | 0.7824 | 0.7824 | 0.7824 |
| 0.6058 | 0.7658 | 0.7822 | 0.7824 | 0.7824 | 0.7824 |
| 0.6087 | 0.7659 | 0.7822 | 0.7824 | 0.7824 | 0.7824 |
| 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/).