On the convergency of a Steffensen-type method

Abstract

Let \(X_{1},X_{2}\) be two Banach spaces, \(f:X_{1}\rightarrow X_{2}\) a nonlinear mapping. We study the convergence of the Steffensen method for solving \(f\left( x\right) =0\): \[x_{n+1}=x_n-[x_{n},g(x_{n});f]^{-1}f(x_n), \quad n=1,…\] Under some simple Holder type conditions on the divided differences of order one of \(f\), of the form \[\|[y, u; f] − [x, y; f]\| ≤ l_1 \|x − u\| ^p + l_2 \|x − y\|^p + l_3 \|y − u\|^p\] we give some error estimations and we determine the convergence order.

Authors

Ion Păvăloiu
(Tiberiu Popoviciu Institute of Numerical Analysis)

Keywords

Steffensen type method; Holder conditions on divided differences; nonlinear equations in Banach spaces; iterative methods

PDF

Cite this paper as:

I. Păvăloiu, On the convergency of a Steffensen-type method, Research Seminars, Seminar of Mathematical Analysis, Preprint no. 7 (1991), pp. 121-126.

About this paper

Journal

Seminar on mathematical analysis,
Preprint

Publisher Name

“Babes-Bolyai” University,
Faculty of Mathematics,
Research Seminars

DOI

Not available yet.

References

[1] Argyros, I.K., The secant method and fixed points of nonlinear operators, Mh. Math. 106, 85–94 (1988).

[2] Pavaloiu, I., Sur la methode de Steffensen pour la resolution des equations operationnelles non lineaires, Revue Roumaine des Mathematiques pures et appliquees, 1, XIII, 149–158 (1968).

[3] Pavaloiu, I., Introduction in the Theory of Approximation of Equations Solutions, Dacia Ed., Cluj-Napoca 1976 (in Romanian).

[4] Pavaloiu, I., Remarks on the secant method for the solution of nonlinear operatorial equations, Research Seminars, Seminar on Mathematical Analysis, Preprint no. 7, (1991), pp. 127 132.

[5] Ul’m, S., Ob obobscenie metod Steffensen dlea resenia nelineinih operatornih urnavnenii, Journal Vicisl., mat. i mat.-fiz. 4, 6 (1964).

Paper (preprint) in HTML form

On the Convergency of a Steffensen-type Method

"BABEŞ-BOLYAI" UNIVERSITY

Faculty of Mathematics

Research Seminars

Seminar on Mathematical Analysis

Preprint nr.7, 1991, pp.121-126

On the Convergency of a Steffensen-type Method

Ion Păvăloiu

1. In the paper [2] I.K. Argyros adopts for the divided difference of the mapping f:X1→X2, where X1 and X2 are Banach spaces, the following definition:

Definition 1.

One calls divided difference of the application f at the points x,y,∈X1 a linear application [x,y;f]∈ℒ⁢(X1,X2) which fulfils the following conditions:

  • (a)

    [x,y;f]⁢(y−x)=f⁢(y)−f⁢(x) for every x,y∈D⊆X1;

  • (b)

    there exist the real constants l1>0,l2>0, l3>0,p∈(0,1] such that for every x,y,u∈D the following inequality holds:

    ‖[y,u;f]−[x,y;f]‖≤l1⁢‖x−u‖p+l2⁢‖x−y‖p+l3⁢‖u−y‖p.

In [5] there are obtained refinements of Argyros results concerning the secant method applied to the solution of the equation:

(1) f⁢(x)=0

where f:X1→X2

2. We shall study further down the convergence of Steffensen’s method for the solution of equation (1), namely the convergence of the sequence (xn)n≥0 generated by means of the following procedure:

(2) xn+1=xn−[xn,g⁢(xn);f]−1⁢f⁢(xn),x0∈x1,n=0,1,…,

where g:X1→X1 is an operator having at least one fixed point which coincides with the solution of equation (1).

Obviously, the sequence (xn)n≥0 can be generated by means of the procedure (2) if at each iteration step there exists the mapping [xn,g⁢(xn);f]−1.

For our purpose observe firstly that the following identities:

(3) xn−[xn,g⁢(xn);f]−1⁢f⁢(xn)=
(4) =g⁢(xn)−[xn,g⁢(xn);f]−1⁢f⁢(g⁢(xn))⁢f⁢(xn+1)
=f⁢(g⁢(xn))+[xn,g⁢(xn);f]⁢(xn+1−g⁢(xn))
+([g⁢(xn),xn+1;f]−[xn,g⁢(xn);f])⁢(xn+1−g⁢(xn))

hold for every n=0,1,…

Let x0∈X1 be an element, and consider the nonnegative real numbers: B,ε0,ρ0,p∈(0,1],α,β,q≥1,l1,l2 and l3, where

ρ0=β⁢α⁢(l1⁢Bp+l2⁢Bp+l3⁢Bp⁢αp⁢‖f⁢(x0)‖p⁢(q−1))

and

ε0=ρ1/(p+q−1)⁢‖f⁢(x0)‖.

Denote r=max⁡{B,β} and suppose that S⊆D, where:

S={x∈X1:‖x−x0‖≤r⁢ε0ρ01/(p+q−1)⁢(1−ε0p+q−1)}.

The following theorem holds:

Theorem 1.

If the constants B, ε0, ρ0,p,α,β,q,l1,l2,l3, the mapping f and g, and the initial element x0∈X1, as well, fulfil the conditions:

  • (I)

    for every x,y∈S there exists [x,y;f]−1, and ‖[x,y;f]−1‖≤B

  • (II)

    for every x∈S, ‖f⁢(g⁢(x))‖≤α⁢‖f⁢(x)‖q;

  • (III)

    for every x∈S,‖x−g⁢(x)‖≤β⁢‖f⁢(x)‖;

  • (IV)

    the divided difference of the mapping f fulfils the conditions (a) and (b) specified in the definition given in Section 1;

  • (V)

    ε0<1,

then the sequence (xn)n≥0 generated by the procedure (2) is convergent, and, if we denote x¯=limxn, then f⁢(x¯)=0 and the following delimitation holds:

‖x−xn‖≤r⁢ρ0(p+q)nρ01/(p+q−1)⁢(1−ε0p+q−1).
Proof.

Consider x0∈X1 for which the condition (V) is fulfilled. Taking into account the condition (b) and the procedure (2), from the identities (3) and (4) it results:

‖x1−x0‖≤B⁢‖f⁢(x0)‖≤B⁢ε01/(p+q−1)ρ01/(p+q−1)⁢‖f⁢(x0)‖≤r⁢ε0ρ01/(p+q−1)⁢(1−ε0p+q−1),

from which follows x1∈S.

Here was used the inequality:

‖g⁢(x0)−x0‖≤β⁢‖f⁢(x0)‖≤r⁢ε0ρ01/(p+q−1)⁢(1−ε0p+q−1),

from which follows that g⁢(x0)∈S.

Now, considering the above results, we have:

‖f⁢(x1)‖ ≤‖[g⁢(x0),x1;f]−[x0,g⁢(x0);f]‖⋅‖x1−g⁢(x0)‖
≤β⁢α⁢[l1⁢Bp+l2⁢Bp+l3⁢Bp⁢αp⁢‖f⁢(x0)‖p⁢(q−1)]⁢‖f⁢(x0)‖p+q
=ρ0⁢‖f⁢(x0)‖p+q

This inequality leads to:

ρ01/(p+q−1)⁢‖f⁢(x1)‖≤ρ01/(p+q−1)⁢‖f⁢(x0)‖p+q

or, using the notation ε1=ρ01/(p+q−1)⁢‖f⁢(x1)‖:

ε1≤ε0p+q

From this inequality follows that ‖f⁢(x1)‖≤‖f⁢(x0)‖, and if

ρ1=β⁢α⁢(l1⁢Bp+l2⁢Bp+l3⁢Bp⁢αp⁢‖f⁢(x1)‖p⁢(q−1))

then ρ1≤ρ0.

Suppose now that the following properties hold:

  • (α)

    xp∈S;

  • (β)

    ‖f⁢(xp)‖≤‖f⁢(xp−1)‖;

  • (γ)

    εp≤ε0(p+q)p,εp=ρ01/(p+q−1)⁢‖f⁢(xp)‖,p=1,2,…,k

From (2) for n=k we obtain:

‖xk+1−xk‖≤B⁢‖f⁢(xk)‖≤r⁢εkρ01/(p+q−1)≤r⁢ε0(p+q)kρ01/(p+q−1),

which leads to:

‖xk+1−x0‖ ≤rρ01/(p+q−1)⁢(ε0+ε0p+q+ε0(p+q)2+…+ε0(p+q)k)
≤r⁢ε0ρ01/(p+q−1)⁢(1−ε0p+q−1),

namely xk+1∈S.

Here was used the inequality:

‖g⁢(xk)−xk‖≤B⁢‖f⁢(xk)‖≤r⁢ρ01/(p+q−1)ρ01/(p+q−1)⁢‖f⁢(xk)‖≤r⁢ε0(p+q)kρ01/(p+q−1),

from which follows immediately:

‖g⁢(xk)−x0‖≤r⁢ε0ρ01/(p+q−1)⁢(1−ε0p+q−1),

that is, g⁢(xk)∈S.

As to ‖f⁢(xk+1)‖ we have:

‖f⁢(xk+1)‖≤β⁢α⁢(l1⁢Bp+l2⁢Bp+l3⁢αp⁢Bp⁢‖f⁢(xk)‖p⁢(q−1))⁢‖f⁢(xk)‖p+q

namely

‖f⁢(xk+1)‖≤ρ0⁢‖f⁢(xk)‖p+q,

which yields:

εk+1≤εkp+q≤ε0(p+q)k+1.

By virtue of the above proved results follows that the properties (α)–(γ) hold for every p∈ℕ.

We prove further down that the sequence (xn)n≥0 is a fundamental sequence. Indeed, we have:

‖xn+s−xn‖ ≤‖xn+s−xn+s−1‖+‖xn+s−1−xn+s−2‖+…+‖xn+1−xn‖
≤B⁢(‖f⁢(xn)‖+‖f⁢(xn+1)‖+…+‖f⁢(xn+s−1)‖)
≤Bρ01/(p+q−1)⁢(ε0(p+q)n+ε0(p+q)n+1+…+ε0(p+q)n+s−1)
≤B⁢ε0(p+q)nρ01/(p+q−1)⁢(1+εp+q−1+ε(p+q)2−1+ε(p+q)s−1−1)
≤B⁢ε0(p+q)nρ01/(p+q−1)⁢(1−ε0p+q−1),

that is, for every s,n∈ℕ the following inequality holds:

‖xn+s−xn‖≤B⁢ε0(p+q)nρ01/(p+q−1)⁢(1−ε0p+q−1),

from which, since ε0<1, it results that the sequence (xn)n≥0 is fundamental. Since X1 is a Banach space, there exists limn→∞xn=x¯,

and

‖x¯−xn‖≤B⁢ε0(p+q)nρ01/(p+q−1)⁢(1−ε0p+q−1),

which leads, for n=0, to x¯∈S.

From the inequality εn≤ε0(p+q)n, for n→∞, we obtain:

f⁢(x¯)=limn→∞f⁢(xn)=0,

and one sees that x¯ is the solution of the equation (1). ∎

References


Institutul de Calcul

Oficiul Poştal 1

C.P. 68

3400 Cluj-Napoca

Romania


This paper is in final form and no version of it is or will be sumitted for publication elsewhere.

1991

Related Posts