1. Introduction
Let the nonlinear operator
T be a map in the domain D from
to
Y and taken as a Fréchet differentiable with
its Fréchet derivative which maps
a Banach space to another Banach space
Y,
convex open subset, which can be generated as
Computational sciences have advanced significantly in mathematics, economic equilibrium theory, and engineering sciences. Iteration techniques are also used to solve optimization difficulties. In computer sciences, the discipline of numerical analysis for determining such solutions is fundamentally linked to versions of Newton’s approach as
It is chosen despite its slow convergence speed. A survey on Newton’s method [
1] can be found in Kantorovich [
2] and the references by Rall [
3].
There is an extensive literature on the local convergence for Newton, Jarratt, Weerakoon schemes, etc., in the Banach space in the refs. [
4,
5,
6,
7,
8,
9,
10,
11]. Our objectives here are centered on the local convergence study of a four-step nonlinear scheme (FSS) under generalized/weak Lipschitz criteria which Wang [
12] developed, where a non-decreasing positive integrable function (NDPIF) was incorporated rather than a Lipschitz constant. However, Wang with Li [
13] discovered new conclusions on the convergence study of Newton’s method (NM) in the Banach spaces where the
meets the radius/center Lipschitz criteria but relaxing
-average. Shakhno [
14] has explored local convergence for the Secant-type method [
2] with a first-order non-differentiable operator satisfying the generalized/weak Lipschitz conditions.
We shall use the classical FSS [
15] under the
-average condition to study the local convergence of FSS that is expressed as:
The method (
3) is notable for being the simplest and most efficient fifth-order iterative procedure. We find, in the literature, a study using
-continuity conditions on
. While methods of greater
R-order convergence are often not implemented regularly despite their great speed of convergence, this is due to the high operational expense. That being said, in stiff system challenges, the method of higher
R-order convergence can be used cited by [
2] where quick convergence is necessary.
We are extremely motivated from the captivating study [
13] which gave us the possibility of relaxing the
-average Lipschitz condition and property of the ND of
to be essential for the convergence of a fifth-order FSS scheme. In [
16], we also illustrated the local convergence of a third-order Newton-like method under the same
-average Lipschitz condition taken above. Using such considerations, we derive a new local convergence study for the scheme (
3), which enables us to enlarge the convergence ball by dropping out additional assumptions along-with an error/distance estimate. In addition, few corollaries with numerical examples are also stated.
In the literature, L.V. Kantorovich first investigated the semi-local convergence results in [
2]. Many other scholars have since examined the enhancement of outcomes based on majorizing sequences and its variants [
1,
3,
17,
18,
19,
20], which is described as [
21]:
Definition 1 (Majorized sequence). Let be a sequence in a Banach space X and be an increasing scalar sequence. We could say is majorized by if , for each
It is also important to provide a unified semi-local convergence analysis for the FSS (
3) along-with the uniqueness of the solution. This analysis can improve existing results through specialization.
The structure of the presentation of the work is as follows. Section
Section 2 comprises some conditions and preliminary lemma for
-average weak conditions. In
Section 3 and
Section 4, we provide local convergence with its domain of uniqueness for FSS while relaxing the assumption that
should satisfy radius/center Lipschitz criteria under weak
-average saying
/
is assumed to be belonging to one of the families of PIF, which are not always ND for convergence-related theorems. This work unifies the semi-local analysis of FSS in Section
Section 5 under majorizing sequences and more weak Lipschitz-type conditions than previously. Finally, applications and further corollaries are given in order to justify the significance of the findings.
2. Notions and Preliminary Results
Making the research as self-contained as one possibly can, we reintroduce some essential concepts and findings [
12,
13]. Let
be a ball where the radius is denoted by
and the center is denoted by
.
The notions about Lipschitz criteria are defined as follows.
Definition 2. The operator T satisfies the radius Lipschitz criterion ifin which . This definition is previously used by researchers with constant ϰ. Definition 3. The operator T satisfies the center Lipschitz criterion ifwith the constant in which . It turns out that substituting ϰ as when [4,9,22] leads to: - (i)
Larger convergence radius/domain.
- (ii)
At least as specific information on the solution’s location .
- (iii)
Closer error boundaries on distances .
The novelty of our work is to see that
used in the Lipschitz criteria is not required to be essentially constant; rather, it takes the form of an integrable positively function. In that case, condition (
4) is substituted with:
Definition 4. The operator T satisfies the ϰ-average or generalized/weak Lipschitz criterion, if And condition (5), respectively, is substituted with:
Definition 5. The operator T satisfies the center ϰ-average criterion, ifin which together with . As an illustration of motivation, assume that the motion of a three-dimensional object is regulated by a system of differential equations
Let
and the solution represented by
. Define the function
T on
for
as
We find the Fréchet derivative as
Thus, where (as per Definitions 2 and 3). As a result, substituting with at the denominator enhances the convergence radius mentioned in example 1. When , are not considered to be constants, then we can find (as per Definitions 4, 5 and Remark 1).
Next, we shall show in Lemma 1 the two major double integrals that will be used in the main results by solving through a change of variables.
Lemma 1. Assuming T being continuously differentiable in , , exists
- (a)
If the center average Lipschitz condition under the -average is satisfied by :in which and is (ND); therby, we see - (b)
If the radius average Lipschitz condition under the ϰ-average is satisfied by :in which , ϰ is positively integrable. Then,
Proof. The definition for average Lipschitz criteria (11) and (9), respectively, infers that
where
. □
3. Local Convergence Results for Four-Step Scheme (3)
Under this section, we present the key findings about local convergence as well as improved error estimates with distances.
Let the relation be satisfied by
as:
Lemma 2 ([
13])
. Assume that ϰ is PIF along with the function given by expression (46) to be ND for some α with . Then, the function for each takes the formis also ND. Lemma 3. Assume that ϰ is NDPIF. Then, the function defined by is also ND with respect to t.
Proof. Obviously, since
is monotone, we arrive at
for
Thus,
is ND with respect to
t. □
Theorem 1. Assuming T being continuously differentiable in , , exists and Definitions 4 and 5 are satisfied by along with ϰ and to be ND, ρ satisfies the relation (13). Then, the FSS (3) converges within which the quantitiesare found to be less than 1. In addition, with Then, we propose a uniqueness theorem with a center-average Lipschitz condition for FSS, (3).
Theorem 2. Assuming T being continuously differentiable in , , exists and Definition 5 is satisfied by and ρ satisfies the relation Then, has a unique solution .
Next, we provide proofs for the two core results.
Proof of Theorem 1. Clearly, if
, we have with the help of the center-average Lipschitz condition under
-average along with the assumption (13):
By the virtue of the Banach Lemma [
2] and the above equation
using the expression (21), we arrive at the following inequality:
WLOG picking
, in which
and
are given as per the relation (19) and
fulfills the inequality (13), can be proved as:
In what follows, if
, then we have from the scheme (3)
Through Taylor’s expansion, we obtain from the expansion of
along
:
So, combining expressions (23) and (24) along with Definition 4,
That gives the first inequality of relation (15) with Lemma 1. With the method’s second sub-step (3) and a parallel analogy, we see that
That gives the first inequality of relation (16) with Lemma 1. With the method’s third sub-step (3) and in similar analogy, we obtain
Looking the Lemma 1, we obtain relation (17). At last, in the last sub-step of the scheme (3), we obtain
That gives the expression (18). Moreover,
,
,
and
are monotonically decreasing; hence,
, and we see
Setting above gives us . This result shows that , and it can therefore be repeated indefinitely as per Equation (3). Furthermore, all values of will belong to by a mathematical induction, and the value of will decrease monotonically.
By some computation in the first part of expression (15) and (16), we obtain
Setting
in inequality (29) gives us
. This result shows that
, and it can therefore be repeated indefinitely as per Equation (3). Furthermore, all values of
will belong to
by mathematical induction, and the value of
will decrease monotonically.
Setting
in inequality (29) gives us
. This result shows that
, and it can therefore be repeated indefinitely as per Equation (3). Furthermore, all values of
will belong to
by mathematical induction, and the value of
will decrease monotonically. In addition, the last expression (18) gives
That is all regarding inequalities (15)–(18). It remains to check (20); for that, we use mathematical induction. For
, we have by the relation (16),
Subsequently, the aforementioned inequality can be transformed into an alternative form:
That means the equality (20) is said to be true for
. Next, assume the relation (20) holds for some integer
. The below form is preserved by the aforementioned inequality:
□
We are now prepared to demonstrate the uniqueness result.
Proof of Theorem 2. WLOG picking
,
and considering the scheme, we obtain
Through Taylor’s expansion, we obtain from expansion of
along
:
So, combining expressions (35) and (36) along with Definition 5,
Looking at the relation (37) with Lemma 1, we have
However, that is found to be a contradiction. Hence, we find that . This gives the core result for this part. □
Specifically, assuming that and are constants, we can obtain the usual results on the Lipschitz condition.
5. Semi-Local Convergence
This section follows semi-local convergence outcomes for highly comprehensive majorizing sequences of FSS (3). The study of iterative methods highly values majorizing sequences as they significantly contribute to the analysis of the given scheme. This is because majorizing sequences provide a way to bound the error of the iterative method, which is crucial in understanding the convergence properties of the method. By providing a tight upper bound on the error, majorizing sequences can be used to establish convergence results for iterative methods. We introduce an extensive majorizing sequence. Suppose that there exists a real function
defined on the interval
such that the equation
has a smallest positive solution
. Let also
be a real function defined on the interval
. Let
and
be a non-negative parameter. Then, define the sequence
by
and
The sequence is shown to be majorizing for the sequence in Theorem 4. Let us first develop convergence criteria for the sequence .
Lemma 4. Suppose there exists such that for each Then, the following assertions holdand there exists such that and . Proof. By the definition of the sequence given by the formula (73) and the conditions (74), we see that the assertion (75) holds. Hence, the rest of the assertions also hold. □
Remark 2. If the function is strictly increasing, then set (1). The functions and the limit point are associated with the method (3). Suppose:
- (A1)
There exists a parameter and a point such that the linear operator is invertible and
- (A2)
for each . Set
- (A3)
for each .
- (A4)
The conditions in (74) hold and
- (A5)
.
Remark 3. - (1)
The parameter ρ can replace the limit point in the condition .
- (2)
Suppose that
for each , where is a continuous and non-decreasing real function defined on the interval .
Then, under the conditions , we obtain in turn That is, we can choose Then, the condition holds for this choice. However, the function can be smaller than the function in some examples. As an example, define the real function . Then, we obtain In practice, we shall be using the smaller of the functions and . Moreover, if is smaller, then should be added in the conditions –, since implies but not necessarily vice versa.
The main result for the FSS (3)’ semi-local convergence is:
Theorem 5. Suppose that the conditions – hold. Then, the sequence generated by the method (3) is well defined in the ball remains in for each and is convergent to a solution of the equation . Additionally, the following assertions hold for each and Proof. Induction shall determine the assertions. The condition
and the method (3) for
give
Thus, the iterate
and the assertion (76) is established for
Let
. Then, by the condition
, it follows
thus
We can write by the first sub-step
Hence, by
,
and by the second sub-step
and
where we also used (76) for
. Hence, the iterate
and the assertion (77) holds. Then, we can write
Hence, the iterate
and the assertion (78) holds. Similarly, the last sub-step gives in turn
and
Hence, the iterate
and the assertion (79) holds. Moreover, we can write by the first sub-step
so
Hence, the iterate
and the assertion (79) holds. The induction is terminated. Therefore, it is established that the sequence
majorizes the sequence
. Moreover, the sequence
is complete as convergent by the condition
. Thus, the sequence
is also complete in Banach space . Hence, there exists
such that
. Furthermore, if
in (82), then we conclude from
that
. Finally, let
in the estimate
to obtain the assertion (80). □
The determination of the solution region’s uniqueness follows.
Proposition 1. Suppose there exists a solution of the equation for some , the condition holds in the ball and there exists such that Set . Subsequently, in the region , the equation has to be uniquely solvable by .
Proof. Let
be such that
. Then, by applying
and the condition (83), we obtain in turn for
that
Thus, the linear operator M is invertible. Hence, we obtain Therefore, we conclude . □
Remark 4. If all the conditions – hold in Proposition 1, then choose and .