On the convergence order of some Aitken-Steffensen type methods

Abstract

In this note we make a comparative study of the convergence orders for the Steffensen, Aitken and Aitken-Steffensen methods. We provide some conditions ensuring their local convergence. We study the case when the auxiliary operators used have convergence orders \(r_1,r_2 \in \mathbb {N}\) respectively. We show that the Steffensen, Aitken and Aitken-Steffensen methods have the convergence orders \(r_1+1\), \(r_1+r_2\) and \(r_1r_2+r_1\) respectively.

Author

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

Keywords

nonlinear equations in R; Steffensen, Aitken and Aitken-Steffensen methods.

PDF

PDF-LaTeX file (on the journal website).

Cite this paper as:

I. Păvăloiu, On the convergence order of some Aitken-Steffensen type methods, Rev. Anal. Numér. Théor. Approx., 32(2003) no. 2, pp. 193-202. https://doi.org/10.33993/jnaat322-748

About this paper

Print ISSN

1222-9024

Online ISSN

2457-8126

References

[1] ARGYROS, I. K., On the solution of nonlinear equotions with a nonilifferentiable term, Revue d’analyse numerique et de theorie de l’approximation,22,no.2, pp.  125-135,  1993.
[2] ARGYROS, I. K., An error analysis for the Steffensen method under generalized, Zabrejlco-Nguen-type assumptions, Revue d’analyse numerique et de theorie de L’approximatìon, 25, nos. 7-2, pp.11-22, 1996.
[3] ARGYROS, I. K., Polynomial Operator Equations in Abstract Spaces and Applications, CRC PressLLC, Boca Raton, Florida, 1998.
[4] ARGYROS, L K. and SZIDAROVZKY, F., The theory and Applications of lteration Methods, C.R.C. Press, Boca Raton, Florida, 1993.
[5] BALAzs, M. and GOLDNER, G., On the approrimate solution of equations in Hilbert space by a Steffensen-type method, Revue d’analyse numerique et de theorie de l’aproximation, L7, no. 1, pp. 19-23,1gB8
[6] CATINAS, E., On Some Steffensen-type iterative methods for a class of nonlinear equations, Revue d’analyse numerique et de theorie de l’approximation, 24, nos. 1-2, pp.37-43, 1995.
[7] GRAVES, L, M., Riemann integration and Taylor’s theorem in general analysis, Trans. Amer. Math. Soc., 29, pp. 163-1 77, 1927.
[8] KANTOROVICH, L. V. and AKILOV, G. P., Functional Analysis, Pergamon Press, Oxford, 1982.
[9] PAVALOIU, I.,  Sur Ia méthode de Steffensen pour la résolution des équations-opérationnelles non lineaires, Rev. Roum. Math. Pure et Appl., XIII, no. 6, pp. 857-861, 1968.
[10] PAVALOIU, I., Sur une généralisation de la methode de Steffensen, Revue d’analyse numerique et de theorie de l’approximation, 21, no. 1, pp. 59-65, 1992.
[11] PAVALOIU, I., Bilateral approx mations for the solutions of scalar equations, Revue d’analyse numerique et de theorie de l’approximation, 23, no. 1, pp. 95-100, 1994.

Paper (preprint) in HTML form

On the convergence order of some Aitken–Steffensen type methods∗

On the convergence order
of some Aitken–Steffensen type methods∗

Ion Păvăloiu†
(Date: April 13, 2003.)
Abstract.

In this note we make a comparative study of the convergence orders for the Steffensen, Aitken and Aitken–Steffensen methods. We provide some conditions ensuring their local convergence. We study the case when the auxiliary operators used have convergence orders r1,r2∈ℕ respectively. We show that the Steffensen, Aitken and Aitken–Steffensen methods have the convergence orders r1+1, r1+r2 and r1⁢r2+r1 respectively.

∗This work has been supported by the Romanian Academy under grant GAR 19/2003.
†“T. Popoviciu” Institute of Numerical Analysis, P.O. Box 68-1, 3400 Cluj-Napoca, Romania, e-mail: pavaloiu@ictp.acad.ro.
{amssubject}

47J25.

{keyword}

Steffensen, Aitken and Aitken–Steffensen iterations.

1. Introduction

It is well known that the Aitken–Steffensen type methods are meant to accelerate the convergence of some sequences converging to the solutions of operational equations [2], [3], [7]–[10], [13], [14] and [17].

Let X be a Banach space and F:D⊆X→X a nonlinear mapping. Consider the equation

(1) F⁢(x)=θ,

where θ is the null element of X.

Additionally, consider the equations

(2) x =φ1⁢(x),
(3) x =φ2⁢(x),

which are assumed to be equivalent to (1), i.e., they have the same solutions.

As usually, ℒ⁢(X) stands for the set of linear operators from X into itself. For x,y,z∈X denote by [x,y;F]∈ℒ⁢(X) the first order divided difference of F at the nodes x and y and by [x,y,z;F] the second order divided difference of F at x,y,z ([8]–[10]).

For solving (1) we consider the sequences (xn)n≥0 generated by the following methods:

1. The Steffensen method:

(4) xn+1=xn−[xn,φ1⁢(xn);F]−1⁢F⁢(xn),

n=0,1,…,x0∈D;

2. The Aitken method:

(5) xn+1=φ1⁢(xn)−[φ1⁢(xn),φ2⁢(xn);F]−1⁢F⁢(φ1⁢(xn)),

n=0,1,…,x0∈D;

3. The Aitken–Steffensen method

(6) xn+1=φ1⁢(xn)−[φ1⁢(xn),φ2⁢(φ1⁢(xn));F]−1⁢F⁢(φ1⁢(xn)),

n=0,1,…,x0∈D;

Assume there exists x∗∈D, the common solution for (1), (2) and (3), and that the mappings φ1, φ2 are Fréchet differentiable at x∗ up to the orders r1 and r2 respectively, with

(7) φ1(i)⁢(x∗)=θi,i=1,…,r1−1,φ1(r1)⁢(x∗)≠θr1,

where θi, i=1,…,r1 are the null i-linear mapping. Analogously, assume

(8) φ2(i)⁢(x∗)=θi,i=1,…,r2−1,φ2(r2)⁢(x∗)≠θr2.

It is well known that relations (7) and (8) ensure that the iteration processes of the form

(9) xn+1=φ1⁢(xn),n=0,1,…,x0∈X,

and

(10) xn+1=φ2⁢(xn),n=0,1,…,x0∈X,

have the convergence orders r1, resp. r2.

In this note we show that the Steffensen method has the convergence order r1+1, the Aitken method r1+r2, while the Aitken–Steffensen method r1⁢(r2+1). We also provide conditions ensuring the local convergence of these sequences.

2. Local convergence

Let S={x∈X:‖x−x∗‖≤r} be the ball with center at x∗ and with radius r, and suppose S⊆D.

The mappings φ1, φ2 are assumed to obey the following hypotheses:

  • i)

    the mapping φ1 admits Fréchet derivatives up to the order r1≥1 on S, and

    supx∈S‖φ1(r1)⁢(x)‖=L1<+∞,
  • ii)

    the mapping φ2 admits Fréchet derivatives up to the order r2≥1 on S, and

    supx∈S‖φ2(r2)⁢(x)‖=L2<+∞.

The mapping F is assumed to obey

  • i1)

    the linear mapping [x,y;F] is invertible for all x,y∈S, and

    supx,y∈S‖[x,y;F]−1‖=m<+∞;
  • ii1)

    the bilinear mapping [x,y,z;F] is bounded for all  x,y,z∈S:

    supx,y,z∈S‖[x,y,z;F]‖=M<+∞.

Regarding the convergence of the Steffensen method, we obtain the following result.

Theorem 2.1.

Assume that φ1 obeys i) and (7), F obeys i1) and ii1), and the initial approximation x0∈S is chosen such that

  • a)

    m⁢M⁢|x∗−x0|<1;

  • b)

    L1r1!⁢‖x∗−x0‖r1−1≤1.

Then the sequence (xn)n≥1 generated by (4) remains in S and converges to x∗, satisfying

  • j1)

    ‖x∗−xn‖≤(M⁢m⁢L1r1!)−1r1⁢ρ0pn,n=0,1,…, where

    ρ0=(M⁢m⁢L1r1!)1r1⁢‖x∗−x0‖<1

    and p=r1+1;

  • jj1)

    limn→∞xn=x∗.

Proof.

Since x0∈S, then by the Taylor formula and by (7) and i) we get

(11) ‖φ1⁢(x0)−x∗‖=‖φ1⁢(x0)−φ⁢(x∗)‖≤L1r1!⁢‖x0−x∗‖r1,

whence, by b) it follows that

‖φ1⁢(x0)−x∗‖≤‖x∗−x0‖≤r,

i.e., φ1⁢(x0)∈S. By the Newton identity,

θ=F⁢(x∗)= F⁢(x0)+[x0,φ⁢(x0);F]⁢(x∗−x0)
+[x∗,x0,φ⁢(x0);F]⁢(x∗−φ⁢(x0))⁢(x∗−x0),

and taking into account i1), ii1) and (4) for n=0, we obtain

x∗−x1=−[x0,φ⁢(x0);F]−1⁢[x∗,x0,φ⁢(x0);F]⁢(x∗−φ⁢(x0))⁢(x∗−x0)

whence, using (11), a) and b), it follows that

(12) ‖x∗−x1‖≤M⁢m⁢L1r1!⁢‖x∗−x0‖r1+1≤‖x∗−x0‖≤r,

i.e., x1∈S.

Assume now that x1,…,xn∈S and denote

(13) ρi=(M⁢m⁢L1r1!)1r1⁢‖x∗−xi‖,i=0,1,…,n.

Relations a) and b) imply ρ0<1, while (12) attracts

(14) ρ1≤ρ0p.

Assume now that

(15) ρi+1≤ρip,i=0,…,n−1.

From (14) and (15) we get

ρi≤ρ0pi,i=1,…,n.

We prove now that xn+1∈S and ρn+1≤ρnp. Applying the Taylor formula and taking into account the hypotheses,

(16) ‖φ1⁢(xn)−φ1⁢(x∗)‖≤L1r1!⁢‖xn−x∗‖r1.

The induction hypotheses also imply

(17) ‖xn−x∗‖=ρn(M⁢m⁢L1r1!)1r1≤ρ0pn(M⁢m⁢L1(r1!))1r1=‖x∗−x0‖.

Replacing (17) in (16) and taking into account b) leads to

‖φ1⁢(xn)−x∗‖≤L1r1!⁢‖x∗−x0‖r1≤r,

which shows that φ1⁢(xn)∈S.

The fact that xn, φ1⁢(xn), x∗∈S implies

θ=F⁢(x∗)= F⁢(xn)+[xn,φ1⁢(xn);F]⁢(x∗−xn)
+[x∗,xn,φ1⁢(xn);F]⁢(x∗−φ1⁢(xn))⁢(x∗−xn)

whence

(18) ‖x∗−xn+1‖≤M⁢m⁢L1r1!⁢‖x∗−xn‖p.

Denoting ρn+1=(M⁢m⁢L1r1!)1r1⁢‖x∗−xn+1‖, then by (18) we get

(19) ρn+1≤ρnp≤ρ0pn+1.

It remains to show that xn+1∈S, which follows by (19) and (18):

‖x∗−xn+1‖≤ρ0pn+1(M⁢m⁢L1r1!)1r1<ρ0(M⁢m⁢L1r1)1r1≤‖x∗−x0‖≤r.

Relation (19) implies conclusion (jj1). ∎

We obtain the following result regarding the Aitken method.

Theorem 2.2.

Assume that the mappings φ1, φ2 obey i) and (7), resp. ii) and (8), the mapping F obeys i1), i2) and the initial approximation x0∈S is chosen such that

  • a′)

    L1r1!⁢‖x∗−x0‖r1−1≤1;

  • b′)

    L2r2!⁢‖x∗−x0‖r2−1≤1;

  • c′)

    M⁢m⁢‖x∗−x0‖<1.

Then the sequence generated by (5) remains in S, converges to x∗ and, moreover, the following relations are true:

  • j2)

    ‖xn−x∗‖≤(M⁢m⁢L1⁢L2r1!⁢r2!)11−q⁢ρ0qn,n=1,2,…, where

    ρ0=(M⁢m⁢L1⁢L2r1!⁢r2!)1q−1⁢‖x∗−x0‖<1

    and q=r1+r2;

  • jj2)

    limn→∞xn=x∗.

Proof.

From i), ii), (7) and (8) it results

(20) ‖x∗−φ1⁢(x0)‖≤L1r2!⁢‖x∗−x0‖r1,

whence, by a′) it follows that φ1⁢(x0)∈S. Analogously, for φ2 we get

(21) ‖x∗−φ2⁢(x0)‖≤L2r2!⁢‖x∗−x0‖r2,

i.e., φ2⁢(x0)∈S.

The Newton identity for F,

θ=F⁢(x∗)= F⁢(φ1⁢(x0))+[φ1⁢(x0),φ2⁢(x0);F]⁢(x∗−φ1⁢(x0))
+[x∗,φ1⁢(x0),φ2⁢(x0);F]⁢(x∗−φ2⁢(x0))⁢(x∗−φ1⁢(x0))

by (5) for n=0, (20), (21), implies

(22) ‖x1−x∗‖≤ M⁢m⁢‖x∗−φ2⁢(x0)‖⁢‖x∗−φ1⁢(x0)‖
≤ M⁢m⁢L1⁢L2r1!⁢r2!⁢‖x∗−x0‖r1+r2.

Denoting r1+r2=q and

(23) ρk=(M⁢m⁢L1⁢L2r1!⁢r2!)1q−1⁢‖x∗−xk‖,k=0,1,

then, by (22) we get

(24) ρ1≤ρ0q.

From a′), b′) and c′) we obtain that x1∈S and

(25) ρ0<1.

The fact that x1∈S is implied by relations (24) and (25):

(26) ‖x1−x∗‖≤ρ0q(M⁢m⁢L1⁢L2r1!⁢r2!)1q−1<ρ0(M⁢m⁢L1⁢L2r1!⁢r2!)1q−1=‖x0−x∗‖≤r.

It remains to show that φ1⁢(x1), φ2⁢(x1)∈S. Using a′) and (26), we have

‖x∗−φ1⁢(x1)‖≤ L1r1!⁢‖x∗−x1‖r1
≤ L1r1!⁢‖x∗−x0‖r1
≤ L1r1!⁢‖x∗−x0‖r1−1⁢‖x∗−x0‖
≤ r

and, analogously, (26) and b′) imply

‖x∗−φ2⁢(x1)‖≤L2r2!⁢‖x∗−x1‖r2≤L2r2!⁢‖x∗−x0‖r2≤r.

Assume x0,x1,…,xk∈S and φi⁢(xs)∈S,i=1,2, s=0,…,k.

Denote

(27) ρi=(M⁢m⁢L1⁢L2r1!⁢r2!)1q−1⁢‖x∗−xi‖,i=1,…,k

and assume that

(28) ρi+1≤ρiq,i=1,…,k−1.

Relations (28), together with (24) show that the following inequalities are verified:

(29) ρi≤ρ0qi,i=1,…,k.

We show now that xk+1∈S. Similarly to (22), one immediately deduces that

(30) ‖xk+1−x∗‖≤M⁢m⁢L1⁢L2r1!⁢r2!⁢‖x∗−xk‖q.

Denoting

(31) ρk+1=(M⁢m⁢L1⁢L2r1!⁢r2!)1q−1⁢‖x∗−xk‖,

then by (30) and (29) we deduce

(32) ρk+1≤ρ0qk+1,

i.e., (29) holds also for i=k+1.

From (30), (31) and (32) we get

(33) ‖xk+1−x∗‖≤ρ0qk+1(M⁢m⁢L1⁢L2r1!⁢r2!)1q−1≤ρ0(M⁢m⁢L1⁢L2r1!⁢r2!)1q−1≤‖x∗−x0‖≤r,

i.e., xk+1∈S. It remains to prove that φ1⁢(xk+1), φ2⁢(xk+1)∈S.

The Taylor formula leads to the relations

‖x∗−φ1⁢(xk+1)‖≤L1r1!⁢‖x∗−xk+1‖r1

and

‖x∗−φ2⁢(xk+1)‖≤L2r2!⁢‖x∗−xk+1‖r2.

By (33), we get ‖x∗−xk+1‖≤‖x∗−x0‖ and so, from a′) and b′),

‖x∗−φ1⁢(xk+1)‖≤L1r1!⁢‖x∗−x0‖r1≤r

and, analogously

‖x∗−φ2⁢(xk+1)‖≤L2r2!⁢‖x∗−x0‖r1≤r

i.e., φ1⁢(xk+1), φ2⁢(xk+1)∈S.

According to the induction principle, relations (29) are true for all i∈ℕ, so

‖xn−x∗‖≤1(M⁢m⁢L1⁢L2r1!⁢r2!)1q−1⁢ρ0qn

whence, since ρ0<1, limn→∞‖xn−x∗‖=0, i.e., limn→∞xn=x∗. ∎

Finally, the following result holds for the Aitken–Steffensen method.

Theorem 2.3.

Under the hypotheses of Theorem 2.2, the sequence (xn)n≥0, generated by (6) remains in the ball S, and converge to x∗ such that:

  • j3)

    ‖x∗−xn‖≤L11−s⁢ρ0sn,
    where ρ0=L1s−1⁢‖x∗−x0‖, L=m⁢M⁢(L1r1!)r2+1⁢L2r2!, n=0,1,…, and s=r1⁢r2+r1;

  • jj3)

    limn→∞xn=x∗.

{proof*}

Assume that x0∈S verifies a′)–c′). We show first that φ1⁢(x0), φ2⁢(φ1⁢(x0))∈S. For φ1 we have

(34) ‖x∗−φ1⁢(x0)‖≤L1r1!⁢‖x∗−x0‖r1≤‖x∗−x0‖≤r

i.e., φ1⁢(x0)∈S. Next, taking into account (34), we get

‖x∗−φ2⁢(φ1⁢(x0))‖≤ L2r2!⁢‖x∗−φ1⁢(x0)‖
≤ L2r2!⁢L1r2(r1!)r2⁢‖x∗−x0‖r1⁢r2
= L2r2!⁢[L1r1!⁢‖x∗−x0‖r1−1]r2⁢‖x∗−x0‖r2
≤ L2r2!⁢‖x∗−x0‖r2
≤ ‖x∗−x0‖
≤ r.

We prove now that x1∈S. Analogously to (21), we get

(35) ‖x1−x∗‖≤ M⁢m⁢‖x∗−φ1⁢(x0)‖⁢‖x∗−φ2⁢(φ1⁢(x0))‖
≤ M⁢m⁢(L1r1!)r2+1⁢L2r2!⁢‖x∗−x0‖r1⁢r2+r1.

As it can be easily noticed, the previous relation may also be written as

(36) ‖x1−x∗‖≤ M⁢m⁢‖x∗−x0‖⁢[L1r1!⁢‖x∗−x0‖r1−1]r2
⋅L1r1!⁢‖x∗−x0‖r1−1⁢L2r2!⁢‖x∗−x0‖r2−1⁢‖x∗−x0‖,

whence, by a′)–c′), it follows that ‖x1−x∗‖≤r, i.e., x1∈S. Further, denote s=r1⁢r2+r1, L=M⁢m⁢(L1r1!)r2+1⁢L2r2!, and so inequality (35) becomes

‖x1−x∗‖≤L⁢‖x∗−x0‖s,

and, for L1s−1⁢‖x∗−x0‖=ρ0, it reads as

(37) ρ1≤ρ0s,

with ρ1=L1s−1⁢‖x∗−x1‖.

Next, we show that φ1⁢(x1), φ2⁢(φ1⁢(x1))∈S. From (36) we have that

(38) ‖x∗−x1‖≤‖x∗−x0‖.

For φ1⁢(x1) we obtain

‖x∗−φ1⁢(x1)‖≤L1r1!⁢‖x∗−x1‖r1≤L1r1!⁢‖x∗−x0‖r1≤r,

while for φ2⁢(φ1⁢(x1)) we deduce

‖x∗−φ2⁢(φ1⁢(x1))‖≤ L2r2!⁢(L1r1!)r2⁢‖x∗−x1‖r1⁢r2
= L2r2!⁢‖x∗−x1‖r2−1⁢[L1r1!⁢‖x∗−x1‖r1−1]r2⁢‖x∗−x1‖

whence, taking into account (38) and a′), b′), it follows

‖x∗−φ2⁢(φ1⁢(x1))‖≤r

i.e., φ2⁢(φ1⁢(x1))∈S.

Assume now that x0,…,xk∈S, φ1⁢(x0),…,φ1⁢(xk)∈S, φ2⁢(φ1⁢(x0)),…, φ2⁢(φ1⁢(xk))∈S. Denote ρi=L1s−1⁢‖x∗−xi‖, i=0,…,k and also suppose that

(39) ρi+1≤ρis,i=0,…,k−1

which, by (37), becomes

(40) ρi≤ρ0si,i=1,…,k.

We show now that xk+1∈S. Using the hypotheses of the theorem and the Newton identity, it can be easily shown that

‖x∗−xk+1‖≤ M⁢m⁢‖x∗−φ1⁢(xk)‖⁢‖x∗−φ2⁢(φ1⁢(xk))‖
≤ M⁢m⁢(L1r1!)r2+1⁢L2r2!⁢‖x∗−x0‖r1⁢r2+r1

i.e., by denoting ρk+1⁢L1s−1⁢‖x∗−xk+1‖,

ρk+1≤ρks.

By (40), this leads to

ρk+1≤ρ0sk+1,

and since ρ0<1, we get

ρk+1≤ρ0.

Further,

‖xk+1−x∗‖≤‖x0−x∗‖≤r,

which shows that xk+1∈S. Now, we show that φ1⁢(xk+1),φ2⁢(φ1⁢(xk+1))∈S. First, taking into account a′),

‖x∗−φ1⁢(xk+1)‖≤L1r1!⁢‖x∗−xk‖r1≤L1r1!⁢‖x∗−x0‖r1≤r,

and, finally,

‖x∗−φ2⁢(φ1⁢(xk+1))‖≤ L2r2!⁢(L1r1!)r2⁢‖x∗−xk+1‖r1⁢r2
≤ L2r2!⁢(L1r1!)r2⁢‖x∗−x0‖r1⁢r2
≤ r.\alignqed

Inequalities j1), j2), j3) from this conclusions of Theorems 2.1, 2.2, resp. 2.3 characterize the convergence orders of the methods (4), (5), resp. (6).

The numbers r1, resp. r2 represent as we have already specified, the convergence orders of the iteration methods given by (9), resp. (10).

We also notice the following facts.

Remark 2.1.

If r1=r2=1, then the three studied methods have the same convergence order: p=q=s=2.

Remark 2.2.

Regarding method (6), we may also consider the following iterations instead:

(41) xn+1=φ2⁢(xn)−[φ2⁢(xn),φ1⁢(φ2⁢(xn));F]−1⁢F⁢(φ2⁢(xn))

having the same convergence order r1⁢r2+r2. Consequently, if r2>r1, then (41) is preferred instead of (6).

References

  • [1]
  • [2] Argyros, I. K., A new convergence theorem for the Steffensen method in Banach space and applications, Rev. Anal. Numér. Théor. Approx., 29, no. 2, pp. 119–127, 2000.
  • [3] Argyros, I. K., An error analysis for the Steffensen method under generalized Zabrejko–Nguen-type assumptions, Rev. Anal. Numér. Théor. Approx., 25, nos. 1–2, pp. 11–22, 1996.
  • [4] Argyros, I. K., Polynomial Operator Equations in Abstract Spaces and Applications, CRC Press LLC, Boca Raton, Florida, 1998.
  • [5] Argyros, I. K. and Szidarovszky, F., The theory and Applications of Iteration Methods, C.R.C. Press, Boca Raton, Florida, 1993.
  • [6] Balǎzs, M. and Goldner, G., On the approximate solutions of equations in Hilbert space by a Steffensen-type method, Rev. Anal. Numér. Théor. Approx., 17, no. 1, pp. 19–23, 1998.
  • [7] Cătinaş, E., On some Steffensen-type iterative methods for a class of nonlinear equations, Rev. Anal. Numér. Théor. Approx., 24, nos. 1–2, pp. 37–43, 1995.
  • [8] Cătinaş, E. and Păvăloiu, I., On some interpolatory iterative methods for the second degree polynomial operators (I), Rev. Anal. Numér. Théor. Approx., 27, no. 1, pp. 33–45, 1998.
  • [9] Cătinaş, E. and Păvăloiu, I., On some interpolatory iterative methods for the second degree polynomial operators (II), Rev. Anal. Numér. Théor. Approx., 28, no. 2, pp. 133–144, 1999.
  • [10] Păvăloiu, I., Introduction to the Theory of Approximating the Solutions of Equations, Ed. Dacia, Cluj, 1986 (in Romanian).
  • [11] Păvăloiu, I., Optimal efficiency index for iterative methods of interpolatory type, Computer Science Journal of Moldova, 5, 1 (13), pp. 20–43, 1997.
  • [12] Păvăloiu, I., Approximation of the roots of equations by Aitken–Steffensen-type monotonic sequence, Calcolo, 32, nos. 1–2, pp. 69–82, 1995.
  • [13] Păvăloiu, I., Sur la méthode de Steffensen pour la résolution des équations opèrationnelles non linéaires, Rev. Roum. Math. Pure et Appl., XIII, no. 6, pp. 857–861, 1968.
  • [14] Păvăloiu, I., Sur une généralisation de la methode de Steffensen, Rev. Anal. Numér. Théor. Approx., 21, no. 1, pp. 56–65, 1992.
  • [15] Păvăloiu, I., Bilateral approximations for the solutions of scalar equations, Rev. Anal. Numér. Théor. Approx., 23, no. 1, pp. 95–100, 1994.
  • [16] Păvăloiu, I., On the monotonicity of the sequence of approximations obtained by Steffensen method, Mathematica (Cluj), 35 (58), pp. 171–176, 1993.
  • [17] Păvăloiu, I., On a Halley–Steffensen method for approximating the solutions of scalar equations, Rev. Anal. Numér. Théor. Approx., 30, no. 1, pp. 69–74, 2001.
  • [18] Popoviciu, T., Sur la délimitation de l’erreur dans l’approximation des racines d’une équation par interpolation linéaire ou quadratique, Rev. Roumaine Math. Pures Appl., 13, pp. 75–78, 1968.
  • [19]
2003

Related Posts