Return to Article Details Semilocal convergence of Newton-like methods under general conditions with applications in fractional calculus

Semilocal convegence of Newton-like methods under general conditions, with applications in fractional calculus

George A. Anastassiou1 Ioannis K. Argyros2

July 9, 2015

1 Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152, U.S.A., e-mail: ganastss@memphis.edu.

2 Department of Mathematical Sciences, Cameron University, Lawton, Oklahoma 73505-6377, USA, e-mail: ioannisa@cameron.edu.

We present a semilocal convergence study of Newton-like methods on a generalized Banach space setting to approximate a locally unique zero of an operator. Earlier studies such as [ 5 , 6 , 7 , 14 ] require that the operator involved is Fréchet-differentiable. In the present study we assume that the operator is only continuous. This way we extend the applicability of Newton-like methods to include fractional calculus and problems from other areas. Some applications include fractional calculus involving the Riemann-Liouville fractional integral and the Caputo fractional derivative. Fractional calculus is very important for its applications in many applied sciences.

MSC. 65G99, 65H10, 26A33, 47J25, 47J05.

Keywords. Generalized Banach space, Newton-like method, semilocal convergence, Riemann-Liouville fractional integral, Caputo fractional derivative.

1 Introduction

We present a semilocal convergence analysis for Newton-like methods on a generalized Banach space setting to approximate a zero of an operator. The semilocal convergence is, based on the information around an initial point, to give conditions ensuring the convergence of the method. A generalized norm is defined to be an operator from a linear space into a partially order Banach space (to be precised in section 2). Earlier studies such as [ 5 , 6 , 7 , 14 ] for Newton’s method have shown that a more precise convergence analysis is obtained when compared to 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 expand the applicability of these methods.

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-like methods. Finally, in the concluding sections 4-5, we present special cases and applications in 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 there in.

Let X be a linear space. A subset C of X is called a cone if C+CC and αCC for α>0. The cone C is proper if C(C)={0}. The relation ”” defined by

xy \ if and only if \ yxC

is a partial ordering on C which is compatible with the linear structure of this space. Two elements x and y of X are called comparable if either xy or yx holds. The space X endowed with the above relation is called a partially ordered linear space (POL-space). If X has a topology compatible with its linear structure and if the cone C is closed in that topology then X is called a partially ordered topological space (POTL-space).

We remark that in a POTL-space the intervals [a,b]={x:axb} are closed sets. A stronger connection is considered in the following definitions:

Definition 2.1

A POTL-space is called normal if, given a local base V for the topology, there exists a positive number η so that if 0zUV then [0,z]ηU.

Definition 2.2

A POTL-space is called regular if every order bounded increasing sequence has a limit.

If the topology of a POTL-space is given by a norm then this space is called a partially ordered normed space (PON-space). If a PON-space is complete with respect to its topology then it is called a partially ordered Banach space (POB-space). According to Definition 2.1 a PON-space is normal if and only if there exists a positive number α such that

xαy, \quad for all x,yX with 0xy.

Let us note that any regular POB-space is normal. The reverse is not true. For example, the space C[0,1] of all continuous real functions defined on [0,1], ordered by the cone of nonnegative functions, is normal but is not regular. All finite dimensional POTL-spaces are both normal and regular.

Definition 2.3

A generalized Banach space is a triplet (X,(E,K,),//) such that

  • X is a linear space over R(C).

  • E=(E,K,) is a partially ordered Banach space, i.e.

  • (E,) is a real Banach space,

  • E is partially ordered by a closed convex cone K,

  • The norm is monotone on K.

  • The operator //:XK satisfies

    /x/=0x=0, /θx/=|θ|/x/,
    /x+y//x/+/y/,for each x,yX,θR(C).
  • X is a Banach space with respect to the induced norm i:=//.

Remark 2.4

The operator // is called a generalized norm. In view of (iii) and (ii3) i , is a real norm. In the rest of this paper all topological concepts will be understood with respect to this norm. â–¡

Definition 2.5

Let L(Xj,Y) stand for the space of j-linear symmetric and bounded operators from Xj to Y, where X and Y are Banach spaces. For X,Y partially ordered L+(Xj,Y) stands for the subset of monotone operators P such that

0aibiP(a1,...,aj)P(b1,...,bj).
2.1

Definition 2.6

The set of bounds for an operator QL(X,X) on a generalized Banach space (X,E,//) is defined to be:

B(Q):={PL+(E,E)/Qx/P/x/ for each xX}.
2.2

Let DX and T:DD be an operator. If x0D the sequence {xn} given by

xn+1:=T(xn)=Tn+1(x0)
2.3

is well defined. We write in case of convergence

T(x0):=lim(Tn(x0))=limnxn.
2.4

We need some auxiliary results on inequations.

Lemma 2.7

Let (E,K,) be a partially ordered Banach space, ξK and M,NL+(E,E).

  • Suppose there exists rK such that

    R(r):=(M+N)r+ξr
    2.5

    and

    (M+N)kr0 \ as \ k.
    2.6

    Then, b:=R(0) is well defined, satisfies the equation t=R(t) and is smaller than any solution of the inequality R(s)s.

  • Suppose there exists qK and θ(0,1) such that R(q)θq, then there exists rq satisfying (i).

Proof â–¼
(i) Define sequence {bn} by bn=Rn(0). Then, we have by (2.5) that b1=R(0)=ξrb1r. Suppose that bkr for each k=1,2,...,n. Then, we have by (2.5) and the inductive hypothesis that bn+1=Rn+1(0)=R(Rn(0))=R(bn)=(M+N)bn+ξ(M+N)r+ξr bn+1r. Hence, sequence {bn} is bounded above by r. Set Pn=bn+1bn. We shall show that

Pn(M+N)nr \ for each n=1,2,...
2.7

We have by the definition of Pn and (2.6) that

P1=R2(0)R(0)=R(R(0))R(0)=R(ξ)R(0)=01R(tξ)ξdt01R(ξ)ξdt01R(r)rdt(M+N)r,

which shows (2.7) for n=1. Suppose that (2.7) is true for k=1,2,...,n. Then, we have in turn by (2.6) and the inductive hypothesis that

Pk+1=Rk+2(0)Rk+1(0)=Rk+1(R(0))Rk+1(0)=Rk+1(ξ)Rk+1(0)=R(Rk(ξ))R(Rk(0))=01R(Rk(0)+t(Rk(ξ)Rk(0)))(Rk(ξ)Rk(0))dtR(Rk(ξ))(Rk(ξ)Rk(0))=R(Rk(ξ))(Rk+1(0)Rk(0))R(r)(Rk+1(0)Rk(0))(M+N)(M+N)kr=(M+N)k+1r,

which completes the induction for (2.7). It follows that {bn} is a complete sequence in a Banach space and as such it converges to some b. Notice that R(b)=R(limnRn(0))=limnRn+1(0)=b b solves the equation R(t)=t. We have that bnrbr, where r a solution of R(r)r. Hence, b is smaller than any solution of R(s)s.

(ii) Define sequences {vn}, {wn} by v0=0, vn+1=R(vn), w0=q, wn+1=R(wn). Then, we have that

0vnvn+1wn+1wnq,wnvnθn(qvn)

and sequence {vn} is bounded above by q. Hence, it converges to some r with rq. We also get by (2.8) that wnvn0 as n wnr as n.

Proof â–¼

We also need the auxiliary result for computing solutions of fixed point problems.

Lemma 2.8

Let (X,(E,K,),//) be a generalized Banach space, and PB(Q) be a bound for QL(X,X). Suppose there exists yX and qK such that

Pq+/y/q and Pkq0,  as k.
2.9

Then, z=T(0), T(x):=Qx+y is well defined and satisfies: z=Qz+y and /z/P/z/+/y/q. Moreover, z is the unique solution in the subspace {xX| θR:{x}θq}.

The proof can be found in [ 14 , Lemma 3.2 ] .

3 Semilocal convergence

Let (X,(E,K,),//) and Y be generalized Banach spaces, DX an open subset, G:DY a continuous operator and A():DL(X,Y). A zero of operator G is to be determined by a Newton-like method starting at a point x0D. The results are presented for an operator F=JG, where JL(Y,X). The iterates are determined through a fixed point problem:

xn+1=xn+yn, \ A(xn)yn+F(xn)=0yn=T(yn):=(IA(xn))ynF(xn).

Let U(x0,r) stand for the ball defined by

U(x0,r):={xX:/xx0/r}

for some rK.

Next, we present the semilocal convergence analysis of Newton-like method (3.1) using the preceding notation.

Theorem 3.1

Let F:DXX, A():DL(X,X) and x0D be as defined previously. Suppose:

  • There exists an operator MB(IA(x)) for each xD.

  • There exists an operator NL+(E,E) satisfying for each x,yD

    /F(y)F(x)A(x)(yx)/N/yx/.
  • There exists a solution rK of

    R0(t):=(M+N)t+/F(x0)/t.
  • U(x0,r)D.

  • (M+N)kr0 as k.

Then, the following hold:

  • The sequence {xn} defined by

    xn+1=xn+Tn(0),Tn(y):=(IA(xn))yF(xn)

    is well defined, remains in U(x0,r) for each n=0,1,2,... and converges to the unique zero of operator F in U(x0,r).

  • An apriori bound is given by the null-sequence {rn} defined by r0:=r and for each n=1,2,...

    rn=Pn(0), \ Pn(t)=Mt+Nrn1.
  • An a posteriori bound is given by the sequence {sn} defined by

    sn:=Rn(0), \ Rn(t)=(M+N)t+Nan1,bn:=/xnx0/rrnr,

    where

    an1:=/xnxn1/,\quad for each n=1,2,...

Proof â–¼
Let us define for each nN the statement:

(In) xnX and rnK are well defined and satisfy

rn+an1rn1.

We use induction to show (In). The statement (I1) is true: By Lemma 2.7 and (H3), (H5) there exists qr such that:

Mq+/F(x0)/=q \ and \ MkqMkr0 \ as k.

Hence, by Lemma 2.8 x1 is well defined and we have a0q. Then, we get the estimate

P1(rq)=M(rq)+Nr0MrMq+Nr=R0(r)qR0(r)q=rq.


It follows with Lemma 2.7 that r1 is well defined and

r1+a0rq+q=r=r0.

Suppose that (Ij) is true for each j=1,2,...,n. We need to show the existence of xn+1 and to obtain a bound q for an. To achieve this notice that:

Mrn+N(rn1rn)=Mrn+Nrn1Nrn=Pn(rn)Nrnrn.

Then, it follows from Lemma 2.7 that there exists qrn such that

q=Mq+N(rn1rn) \ and \ (M+N)kq0, as k.
3.3

By (Ij) it follows that

bn=/xnx0/j=0n1ajj=0n1(rjrj+1)=rrnr.

Hence, xnU(x0,r)D and by (H1) M is a bound for IA(xn).

We can write by (H2) that

/F(xn)/=/F(xn)F(xn1)A(xn1)(xnxn1)/Nan1N(rn1rn).

It follows from (3.3) and (3.4) that

Mq+/F(xn)/q.

By Lemma 2.8, xn+1 is well defined and anqrn. In view of the definition of rn+1 we have that

Pn+1(rnq)=Pn(rn)q=rnq,

so that by Lemma 2.7, rn+1 is well defined and

rn+1+anrnq+q=rn,

which proves (In+1). The induction for (In) is complete. Let mn, then we obtain in turn that

/xm+1xn/j=nmajj=nm(rjrj+1)=rnrm+1rn.
3.5

Moreover, we get inductively the estimate

rn+1=Pn+1(rn+1)Pn+1(rn)(M+N)rn...(M+N)n+1r.

It follows from (H5) that {rn} is a null-sequence. Hence, {xn} is a complete sequence in a Banach space X by (3.5) and as such it converges to some xX. By letting m in (3.5) we deduce that xU(xn,rn). Furthermore, (3.4) shows that x is a zero of F. Hence, (C1) and (C2) are proved.

In view of the estimate

Rn(rn)Pn(rn)rn

the apriori, bound of (C3) is well defined by Lemma 2.7. That is sn is smaller in general than rn. The conditions of Theorem 3.1 are satisfied for xn replacing x0. A solution of the inequality of (C2) is given by sn (see (3.4)). It follows from (3.5) that the conditions of Theorem 3.1 are easily verified. Then, it follows from (C1) that xU(xn,sn) which proves (C3).

Proof â–¼

In general the a posteriori estimate is of interest. Then, condition (H5) can be avoided as follows:

Proposition 3.2

Suppose: condition (H1) of Theorem 3.1 is true.

  • There exists sK, θ(0,1) such that

    R0(s)=(M+N)s+/F(x0)/θs.
  • U(x0,s)D.

Then, there exists rs satisfying the conditions of Theorem 3.1. Moreover, the zero x of F is unique in U(x0,s).

Remark 3.3

(i) Notice that by Lemma 2.7 Rn(0) is the smallest solution of Rn(s)s. Hence any solution of this inequality yields on upper estimate for Rn(0). Similar inequalities appear in (H2) and (H2).

(ii) The weak assumptions of Theorem 3.1 do not imply the existence of A(xn)1. In practice the computation of Tn(0) as a solution of a linear equation is no problem and the computation of the expensive or impossible to compute in general A(xn)1 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 sK is a solution of Rn(s)s, then q:=sanK and solves Rn+1(q)q. This solution might be improved by Rn+1k(q)q for each k=1,2,... .

4 Special cases and applications

Application 4.1

The results obtained in earlier studies such as [ 5 , 6 , 7 , 14 ] require that 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-like methods to classes of operators that are only continuous. If A(x)=F(x) Newton-like method (3.1) reduces to Newton’s method considered in [ 14 ] . â–¡

Example 4.2

The j-dimensional space Rj is a classical example of a generalized Banach space. The generalized norm is defined by componentwise absolute values. Then, as ordered Banach space we set E=Rj with componentwise 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 E=R. 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 look like. â–¡

Theorem 4.3

Assume:

  • IA(x)M for some M0.

  • F(y)F(x)A(x)(yx)Nyx for some N0.

  • M+N<1,

    r=F(x0)1(M+N).
    4.1
  • U(x0,r)D.

  • (M+N)kr0 as k, where r is given by (4.1).

Then, the conclusions of Theorem 3.1 hold.

5 Application to Fractional Calculus

Our presented earlier semilocal convergence Newton-type general methods, see Theorem 4.3, apply in the next two fractional settings given that the following inequalities are fulfilled:

1A(x)γ0(0,1),
5.1

and

|F(y)F(x)A(x)(yx)|γ1|yx|,
5.2

where γ0,γ1(0,1), furthermore

γ=γ0+γ1(0,1),
5.3

for all x,y[a,b].

Here we consider a<b<b.

The specific functions A(x), F(x) will be described next.

I) Let α>0 and fL([a,b]). The right Riemann-Liouville integral [ 4 , pp. 333–354 ] is given by

(Jbαf)(x):=1Γ(α)xb(tx)α1f(t)dt, \ \ x[a,b].
5.4

Then

|(Jbαf)(x)|1Γ(α)(xb(tx)α1|f(t)|dt)1Γ(α)(xb(tx)α1dt)f=1Γ(α)(bx)ααf=(bx)αΓ(α+1)f=(ξ1).

Clearly

(Jbαf)(b)=0.
5.6

(ξ1)(ba)αΓ(α+1)f.
5.7

That is

Jbαf,[a,b](ba)αΓ(α+1)f<,
5.8

i.e. Jbα is a bounded linear operator.

By [ 3 ] we get that (Jbαf) is a continuous function over [a,b] and in particular over [a,b]. Thus there exist x1,x2[a,b] such that

(Jbαf)(x1)=min(Jbαf)(x),(Jbαf)(x2)=max(Jbαf)(x), \ x[a,b].

We assume that

(Jbαf)(x1)>0.
5.10

Hence

Jbαf,[a,b]=(Jbαf)(x2)>0.
5.11

Here it is

J(x)=mx, \ m0.
5.12

Therefore the equation

Jf(x)=0, \ x[a,b],
5.13

has the same solutions as the equation

F(x):=Jf(x)2(Jbαf)(x2)=0, \ \ x[a,b].
5.14

Notice that

Jbα(f2(Jbαf)(x2))(x)=(Jbαf)(x)2(Jbαf)(x2)12<1, \ x[a,b].
5.15

Call

A(x):=(Jbαf)(x)2(Jbαf)(x2), \ \  x[a,b].
5.16

We notice that

0<(Jbαf)(x1)2(Jbαf)(x2)A(x)12, \  x[a,b].
5.17

Hence the first condition (5.1) is fulfilled

|1A(x)|=1A(x)1(Jbαf)(x1)2(Jbαf)(x2)=:γ0, \  x[a,b].
5.18

Clearly γ0(0,1).

Next we assume that F(x) is a contraction, i.e.

|F(x)F(y)|λ|xy|; \ all x,y[a,b],
5.19

and 0<λ<12.

Equivalently we have

|Jf(x)Jf(y)|2λ(Jbαf)(x2)|xy|, \ all x,y[a,b].
5.20

We observe that

|F(y)F(x)A(x)(yx)||F(y)F(x)|+|A(x)||yx|λ|yx|+|A(x)||yx|=(λ+|A(x)|)|yx|=:(ψ1), \  x,y[a,b].

We have that

|(Jbαf)(x)|(ba)αΓ(α+1)f<, \  x[a,b].
5.22

Hence

|A(x)|=|(Jbαf)(x)|2(Jbαf)(x2)(ba)αf2Γ(α+1)((Jbαf)(x2))<, \  x[a,b].
5.23

Therefore we get

(ψ1)(λ+(ba)af2Γ(α+1)((Jbαf)(x2)))|yx|, \ \  x,y[a,b].
5.24

Call

0<γ1:=λ+(ba)af2Γ(α+1)((Jbαf)(x2)),
5.25

choosing (ba) small enough we can make γ1(0,1), fulfilling (5.2).

Next we call and we need that

0<γ:=γ0+γ1=1(Jbαf)(x1)2(Jbαf)(x2)+λ+(ba)af2Γ(α+1)((Jbαf)(x2))<1,
5.26

equivalently,

λ+(ba)af2Γ(α+1)((Jbαf)(x2))<(Jbαf)(x1)2(Jbαf)(x2),
5.27

equivalently,

2λ(Jbαf)(x2)+(ba)afΓ(α+1)<(Jbαf)(x1),
5.28

which is possible for small λ, (ba). That is γ(0,1), fulfilling (5.3). So our numerical method converges and solves (5.13).

II) Let again a<b<b, α>0, m=α ( ceiling function), αN, GCm1([a,b]), 0G(m)L([a,b]). Here we consider the right Caputo fractional derivative (see [ 4 , p. 337 ] ),

DbαG(x)=(1)mΓ(mα)xb(tx)mα1G(m)(t)dt.
5.29

By [ 3 ] DbαG is a continuous function over [a,b] and in particular continuous over [a,b]. Notice that by [ 4 , p. 358 ] , we have that DbαG(b)=0.

Therefore there exist x1,x2[a,b] such that DbαG(x1)=minDbαG(x), and DbαG(x2)=maxDbαG(x), for x[a,b].

We assume that

DbαG(x1)>0.

(i.e. DbαG(x)>0, x[a,b]).

Furthermore

DbαG,[a,b]=DbαG(x2).

Here it is

J(x)=mxm0.

The equation

JG(x)=0, \ x[a,b],

has the same set of solutions as the equation

F(x):=JG(x)2DbαG(x2)=0, \ \ x[a,b].

Notice that

Dbα(G(x)2DbαG(x2))=DbαG(x)2DbαG(x2)12<1, \  x[a,b].

We call

A(x):=DbαG(x)2DbαG(x2), \ \  x[a,b].

We notice that

0<DbαG(x1)2DbαG(x2)A(x)12.

Hence the first condition (5.1) is fulfilled

|1A(x)|=1A(x)1DbαG(x1)2DbαG(x2)=:γ0, \  x[a,b].

Clearly γ0(0,1).

Next we assume that F(x) is a contraction over [a,b], i.e.

|F(x)F(y)|λ|xy|; \  x,y[a,b],

and 0<λ<12.

Equivalently we have

|JG(x)JG(y)|2λ(DbαG(x2))|xy|, \  x,y[a,b].

We observe that

|F(y)F(x)A(x)(yx)||F(y)F(x)|+|A(x)||yx|λ|yx|+|A(x)||yx|=(λ+|A(x)|)|yx|=:(ξ2), \  x,y[a,b].

We observe that

|DbαG(x)|1Γ(mα)xb(tx)mα1|G(m)(t)|dt1Γ(mα)(xb(tx)mα1dt)G(m)=1Γ(mα)(bx)mα(mα)G(m)=1Γ(mα+1)(bx)mαG(m)(ba)mαΓ(mα+1)G(m).

That is

|DbαG(x)|(ba)mαΓ(mα+1)G(m)<, \  x[a,b].

Hence, x[a,b] we get that

|A(x)|=|DbαG(x)|2DbαG(x2)(ba)mα2Γ(mα+1)G(m)DbαG(x2)<.

Consequently we observe

(ξ2)(λ+(ba)mα2Γ(mα+1)G(m)DbαG(x2))|yx|, \ \  x,y[a,b].

Call

0<γ1:=λ+(ba)mα2Γ(mα+1)G(m)DbαG(x2),

choosing (ba) small enough we can make γ1(0,1). So (5.2) is fulfilled.

Next we call and need

0<γ:=γ0+γ1=1DbαG(x1)2DbαG(x2)+λ+(ba)mα2Γ(mα+1)G(m)DbαG(x2)<1,

equivalently we find,

λ+(ba)mα2Γ(mα+1)G(m)DbαG(x2)<DbαG(x1)2DbαG(x2),

equivalently,

2λDbαG(x2)+(ba)mαΓ(mα+1)G(m)<DbαG(x1),

which is possible for small λ, (ba).

That is γ(0,1), fulfilling (5.3). Hence equation (5.29) can be solved with our presented numerical methods.

Bibliography

1

S. Amat, S. Busquier, S. Plaza, Chaotic dynamics of a third-order Newton-type method, J. Math. Anal. Appl., 366 (2010) 1, pp. 24–32. \includegraphics[scale=0.1]{ext-link.png}

2

G. Anastassiou, Fractional Differentiation Inequalities, Springer, New York, 2009.

3

G.A. Anastassiou, Fractional Representation Formulae and Right Fractional Inequalities, Mathematical and Computer Modelling, 54 (2011) 11–12, pp. 3098–3115. \includegraphics[scale=0.1]{ext-link.png}

4

G. Anastassiou, Intelligent Mathematics: Computational Analysis, Springer, Heidelberg, 2011.

5

I.K. Argyros, Newton-like methods in partially ordered linear spaces, Approx. Theory Appl., 9 (1993) 1, pp. 1–9. \includegraphics[scale=0.1]{ext-link.png}

6

I.K. Argyros, Results on controlling the residuals of perturbed Newton-like methods on Banach spaces with a convergence structure, Southwest J. Pure Appl. Math., 1 (1995), pp. 32–38.

7

I.K. Argyros, Convergence and Applications of Newton-type iterations, Springer-Verlag Publ., New York, 2008.

8

K. Diethelm, The Analysis of Fractional Differential Equations, Lecture Notes in Mathematics, Vol. 2004, 1st edition, Springer, New York, Heidelberg, 2010.

9

J.A. Ezquerro, J.M. Gutierrez, M.Á. Hernández, N. Romero, M.J. Rubio, The Newton method: From Newton to Kantorovich (Spanish), Gac. R. Soc. Mat. Esp., 13 (2010), pp. 53–76.

10

J.A. Ezquerro, M.Á. Hernández, Newton-type methods of high order and domains of semilocal and global convergence, Appl. Math. Comput., 214 (2009) 1, pp. 142–154. \includegraphics[scale=0.1]{ext-link.png}

11

L.V. Kantorovich, G.P. Akilov, Functional Analysis in Normed Spaces, Pergamon Press, New York, 1964.

12

Á. A. Magreñán, Different anomalies in a Jarratt family of iterative root finding methods, Appl. Math. Comput., 233 (2014), pp. 29–38. \includegraphics[scale=0.1]{ext-link.png}

13

Á. A. Magreñán, A new tool to study real dynamics: The convergence plane, Appl. Math. Comput., 248 (2014), pp. 215–224. \includegraphics[scale=0.1]{ext-link.png}

14

P.W. Meyer, Newton’s method in generalized Banach spaces, Numer. Func. Anal. Optimiz., 9 (1987) 3–4, pp. 249–259. \includegraphics[scale=0.1]{ext-link.png}

15

F.A. Potra, V. Ptak, Nondiscrete induction and iterative processes, Pitman Publ., London, 1984.

16

P.D. Proinov, New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems, J. Complexity, 26 (2010), 3–42. \includegraphics[scale=0.1]{ext-link.png}