1. Introduction
We present a semilocal convergence analysis for Newton-type methods on a generalized Banach space setting to approximate a zero of an operator. A generalized norm is defined to be an operator from a linear space into a partially order Banach space (as will be elaborated in
Section 2). Earlier studies such as [
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16] for Newton’s method have shown that a more precise convergence analysis is obtained when compared with the real norm theory. However, the main assumption is that the operator involved is Fréchet differentiable. This hypothesis limits the applicability of Newton’s method. In the present study we only assume the continuity of the operator. This may be expand the applicability of these methods. Our approach allows the extension of Newton-type methods in fractional calculus and other areas (see
Section 4) not possible before (since the operator must be Fréchet differentiable). Moreover, we obtain the following advantages over the earlier mentioned studies using Newton’s method:
(i) Weaker sufficient semilocal convergence criteria.
(ii) Tighter error bounds on the distances involved.
(iii) An at least as precise information on the location of the zero.
Moreover, we show that the advantages (ii) are possible even if our Newton-type methods are reduced to Newton’s method.
Furthermore, the advantages (i)–(iii) are obtained under the same or less computational cost.
Notice that in the recent elegant work by Adly
et al., [
1] Newton’s method has also been generalized to other important directions for solving inclusions and set-valued approximations. In the classical Banach space setting though these results that rely on non smooth analysis and metric regularity do not provide sufficient convergence criteria in the local as well as semilocal convergence case that are verifiable using Lipschitz-type constants as we utilize in the present study. Moreover, computable error bounds on the distances involved are not given neither the uniqueness or location of the solution is discussed.
The rest of the paper is organized as follows.
Section 2 contains the basic concepts on generalized Banach spaces and auxiliary results on inequalities and fixed points. In
Section 3 we present the semilocal convergence analysis of Newton-type methods. Finally, in
Section 4 and
Section 5, we present special cases and favorable comparisons with earlier results and applications in some areas including fractional calculus.
2. Generalized Banach Spaces
We present some standard concepts that are needed in what follows to make the paper as self-contained as possible. More details on generalized Banach spaces can be found in [
5,
6,
7,
14], and the references therein.
Definition 2.1. A generalized Banach space is a triplet such that
(i) X is a linear space over .
(ii) is a partially ordered Banach space, i.e.,
(ii) is a real Banach space,
(ii) E is partially ordered by a closed convex cone K,
(iii) The norm is monotone on K.
(iii) The operator satisfies
,
for each , .
(iv) X is a Banach space with respect to the induced norm .
Remark 2.2. The operator is called a generalized norm. In view of (iii) and (ii), is a real norm. In the rest of this paper all topological concepts will be understood with respect to this norm.
Let
stand for the space of
j-linear symmetric and bounded operators from
to
Y, where
X and
Y are Banach spaces. For
partially ordered
stands for the subset of monotone operators
P such that
Definition 2.3. The set of bounds for an operator on a generalized Banach space is defined to be:Let and be an operator. If the sequence given byis well-defined. We write in case of convergence We need some auxiliary results on inequations.
Lemma 2.4. Let be a partially ordered Banach space, and .
(i) Suppose there exists such thatandThen, is well-defined, satisfies the equation and is the smaller than any solution of the inequality . (ii) Suppose there exists and such that , then there exists satisfying (i).
Proof. (i) Define sequence
by
. Then, we have by Equantion (2.5) that
. Suppose that
for each
. Then, we have by Equantion (2.5) and the inductive hypothesis that
⇒
. Hence, sequence
is bounded above by
r. Set
. We shall show that
We have by the definition of
and Equantion (2.6) that
which shows Equantion (2.7) for
. Suppose that Equantion (2.7) is true for
. Then, we have in turn by Equantion (2.6) and the inductive hypothesis that
which completes the induction for Equantion (2.7). It follows that
is a complete sequence in a Banach space and as such it converges to some
b. Notice that
b solves the equation
. We have that
, where
r is a solution of
. Hence,
b is smaller than any solution of
.
(ii) Define sequences
,
by
,
,
,
. Then, we have that
and the sequence
is bounded above by
q. Hence, it converges to some
r with
. We also get by Equantion (2.8) that
as
⇒
as
. ☐
We also need the auxiliary result for computing solutions of fixed point problems.
Lemma 2.5. Let be a generalized Banach space, and be a bound for . Suppose there exist and such thatThen, , is well-defined and satisfies: and . Moreover, z is the unique solution in the subspace . The proof can be found in [14, Lemma 3.2]. 3. Semilocal Convergence
Let
and
Y be generalized Banach spaces,
an open subset,
a continuous operator and
. A zero of operator
G is to be determined by a Newton-type method starting at a point
. The results are presented for an operator
, where
. The iterating elements are determined through a fixed point problem:
Let
stand for the ball defined by
for some
.
Next, we present the semilocal convergence analysis of Newton-type method Equation (3.1) using the preceding notation.
Theorem 3.1. Let , and be as defined previously. Suppose:
(H) There exists an operator for each .
(H) There exists an operator satisfying for each (H) There exists a solution of (H) .
(H) as .
Then, the following hold:
(C) The sequence defined byis well-defined, remains in for each and converges to the unique zero of operator F in . (C) An a priori bound is given by the null-sequence defined by and for each (C) An a posteriori bound is given by the sequence defined bywhere Proof. Let us define for each the statement:
(I
)
and
are well-defined and satisfy
We use induction to show (I
). The statement (I
) is true: By Lemma 2.4, (H
) and (H
), there exists
such that:
Hence, by Lemma 2.5
is well-defined and we have
. Then, we get the estimate
It follows with Lemma 2.4 that
is well-defined and
Suppose that (I
) is true for each
. We need to show the existence of
and obtain a bound
q for
. To achieve this, notice that:
Then, it follows from Lemma 2.4 that there exists
such that
By (I
) it follows that
Hence, and by (H) M is a bound for
We can write by (H
) that
It follows from Equations (3.3) and (3.4) that
By Lemma 2.5,
is well-defined and
. In view of the definition of
we have that
so that by Lemma 2.4,
is well-defined and
which proves (I
). The induction for (I
) is complete. Let
, then we obtain in turn that
Moreover, we get inductively the estimate
It follows from (H) that is a null-sequence. Hence, is a complete sequence in a Banach space X by Equation (3.5) and as such it converges to some . By letting in Equation (3.5) we deduce that . Furthermore, Equation (3.4) shows that is a zero of F. Hence, (C) and (C) are proved.
In view of the estimate
the a priori bound of (C
) is well-defined by Lemma 2.4. That is,
is smaller in general than
. The conditions of Theorem 3.1 are satisfied for
replacing
. A solution of the inequality of (C
) is given by
—see Equation (3.4). It follows from Equation (3.5) that the conditions of Theorem 3.1 are easily verified. Then, it follows from (C
) that
, which proves (C
). ☐
In general, the a posterior estimate is of interest. Then, condition (H) can be avoided as follows:
Proposition 3.2. Suppose: condition (H) of Theorem 3.1 is true.
(H) There exists , such that (H) .
Then, there exists satisfying the conditions of Theorem 3.1. Moreover, the zero of F is unique in .
Remark 3.3. (i) Notice that by Lemma 2.4 is the smallest solution of . Hence any solution of this inequality yields on the upper estimate for . Similar inequalities appear in (H) and (H).
(ii) The weak assumptions of Theorem 3.1 do not imply the existence of . In practice, the computation of as a solution of a linear equation is of no problem, and the computation of the expensive or impossible to compute in general is not needed.
(iii) We can use the following result for the computation of the a posteriori estimates. The proof can be found in [14, Lemma 4.2] by simply exchanging the definitions of R. Lemma 3.4. Suppose that the conditions of Theorem 3.1 are satisfied. If is a solution of , then and solves . This solution might be improved by for each .
4. Special Cases and Applications
Application 4.1. The results obtained in earlier studies such as [5,6,7,14] require that the operator F (i.e., G) is Fréchet differentiable. This assumption limits the applicability of the earlier results. In the present study we only require that F is a continuous operator. Hence, we have extended the applicability of Newton-type methods to classes of operators that are only continuous. Moreover, as we will show next, by specializing F to be a Fréchet differentiable operator (i.e., ), our Theorem 3.1 improves earlier results. Indeed, first of all, notice that the Newton-type method defined by Equation (3.1) reduces to Newton’s method: Next, we present Theorem 2.1 from [
14] and the specialization of our Theorem 3.1 so that we can compare them.
Lemma 4.2. Let be a Fréchet differentiable operator and . Suppose that the following conditions hold:
() There exists an operator .
() There exists an operator satisfying for () There exists a solution of the inequality () .
() as .
Then, the following hold
() The sequence generated by Equation (4.1) is well-defined and converges to a unique zero of F in .
() An a priori bound is given by the null-sequence defined by () An a posteriori bound is given by the sequence defined bywhere sequences and are as defined previously. Lemma 4.3. Let be a Fréchet differentiable operator and . Suppose that the following conditions hold:
() There exists an operator for each .
() There exists an operator satisfying for each () There exists a solution of () .
() as .
Then, the following hold:
() The sequence generated by Equation (4.1) is well-defined and converges to a unique zero of F in .
() An a priori bound is given by , , .
() An a posteriori bound is given by the sequence defined by , .
We can now compare the two preceding theorems. Notice that we can write
Then, it follows from (
), (
) and the preceding estimate that
holds in general. In particular, we have that
Moreover, we get in turn by (
), (
) and (
) that
Therefore, by (
) and Equation (4.3), we obtain that
holds in general.
Then, in view of Equation (4.2), (4.4) and the (
), (
) hypotheses we deduce that
but not necessarily vice versa unless if equality holds in Equations (4.2) and (4.4);
and
Notice also that strict inequality holds in Equation (4.8) or (4.9) if strict inequality holds in Equation (4.2) or (4.4).
Estimates (4.5)–(4.9) justify the advantages of our approach over the earlier studies as already stated in the introduction of this study.
Next, we show that the results of Theorem 2.1 in [
14],
i.e., of Theorem 4.2 can be improved under the same hypotheses by noticing that in view of (
).
(
) There exists an operator
satisfying for
,
Moreover,
holds in general and
can be arbitrarily large [
4,
5,
6,
7].
It is worth noticing that (
) is not an additional hypothesis to (
), since in practice the computation of
requires the computation of
as a special case. Using now (
) and (
) we get that
Hence, can be used as bounds for instead of , , respectively.
Then, with the above changes and following the proof of Theorem 2.1 in [
14], we arrive at the following improvement:
Lemma 4.4. Suppose that the conditions of Theorem 4.2 hold but with replaced by the at most as large . Then, the conclusions ()–(),andwhere the sequences , are defined by Remark 4.5. Notice that estimates Equation (4.13) and Equation (4.14) follow by a simple inductive argument using Equations (4.11) and (4.12). Moreover, strict inequality holds in Equation (4.13) (for ) and in Equation (4.14) (for ) if strict inequality holds in Equation (4.11) or (4.12). Hence, again we obtain better a priori and a posteriori bounds under the same hypotheses ().
Condition
has been weakened since
. It turns out that condition
can be weakened and sequences
and
can be replaced by more precise sequences as follows: Define operators
on
D by
Suppose that there exists a solution
of the inequality
There exists a solution
with
of the inequality
where
There exists a solution
with
such that
Moreover, define operators on
D by
and
Furthermore, define sequences
and
by
Then, the proof of Theorem 4.2 goes on through in this setting to arrive at:
Theorem 4.6. Suppose that the conditions of Theorem 4.2 are satisfied but with c, replaced by μ, ,
as , respectively.
Then, the conclusions of Theorem 4.2 hold with sequences and replacing and respectively. Moreover, we have thatand Clearly, the new error bounds are more precise: the information on the location of the solution is at least as precise and the sufficient convergence criteria and are weaker than and , respectively.
Example 4.7. The j-dimensional space is a classical example of a generalized Banach space. The generalized norm is defined by component-wise absolute values. Then, as ordered Banach space we set with component-wise ordering with, e.g., the maximum norm. A bound for a linear operator (a matrix) is given by the corresponding matrix with absolute values. Similarly, we can define the “N” operators.
Let . That is we consider the case of a real normed space with norm denoted by . Let us see how the conditions of Theorem 3.1 and Theorem 4.4 look like.
Theorem 4.8. () for some .
() for some .
() .
() as , where r is given by Equation (4.15).
Then, the conclusions of Theorem 3.1 hold.
Theorem 4.9. () for some .
()
, for some and .
() .
() as , where c is defined by Equation (4.17).
Then, the conclusions of Theorem 4.4 hold.
Remark 4.10. Condition (4.16) is a Newton–Kantorovich type hypothesis appearing as a sufficient semilocal convergence hypothesis in connection to Newton-type methods. In particular, if , then and Equation (4.16) reduces to the famous for its simplicity and clarity Newton–Kantorovich hypothesisappearing in the study of Newton’s method [1,2,5,6,7,9,10,11,12,13,14,15,16]. 5. Application to Fractional Calculus
The semilocal convergence Newton-type general methods that we presented earlier, see Theorem 4.8, apply in the next two fractional settings given that the following inequalities are fulfilled:
and
where
; furthermore
for all
.
Here we consider .
The specific functions , will be described next.
(I) Let
and
. The Riemann–Liouville integral ([
8], p.13) is given by
That is
i.e.,
is a bounded linear operator.
By [
3], p. 388, we get that
is a continuous function over
and in particular over
. Thus there exist
such that
Therefore the equation
has the same solutions as the equation
Hence the first condition (5.1) is fulfilled
Clearly .
Next we assume that
is a contraction,
i.e.,
and
.
Choosing small enough, we can make , fulfilling Equation (5.2).
Next we call and we need that
equivalently,
equivalently,
which is possible for small
λ,
. That is
, fulfilling Equation (5.3). So our numerical method converges and solves Equation (5.13).
(II) Let again
,
,
(
ceiling function),
,
,
. Here we consider the Caputo fractional derivative (see [
3], p. 270),
By [
3], p. 388,
is a continuous function over
and in particular continuous over
. Notice that by [
4], p. 358, we have that
.
Therefore there exist such that , and , for .
We assume that
(
i.e.,
, ∀
).
The equation
has the same set of solutions as the equation
Hence the first condition (5.1) is fulfilled
Clearly .
Next we assume that
is a contraction over
,
i.e.,
and
.
Hence, ∀
we get that
Choosing small enough we can make . So Equation (5.2) is fulfilled.
Next we call and need
equivalently we find,
equivalently,
which is possible for small
λ,
.
That is , fulfilling Equation (5.3). Hence Equation (5.33) can be solved with our presented numerical methods.