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-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
Publisher Name
Print ISSN
1222-9024
Online ISSN
2457-8126
References
Paper (preprint) in HTML form
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 respectively. We show that the Steffensen, Aitken and Aitken–Steffensen methods have the convergence orders , and respectively.
47J25.
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 be a Banach space and a nonlinear mapping. Consider the equation
(1) |
where is the null element of .
Additionally, consider the equations
(2) | ||||
(3) |
which are assumed to be equivalent to (1), i.e., they have the same solutions.
As usually, stands for the set of linear operators from into itself. For denote by the first order divided difference of at the nodes and and by the second order divided difference of at ([8]–[10]).
For solving (1) we consider the sequences generated by the following methods:
1. The Steffensen method:
(4) |
2. The Aitken method:
(5) |
3. The Aitken–Steffensen method
(6) |
Assume there exists , the common solution for (1), (2) and (3), and that the mappings , are Fréchet differentiable at up to the orders and respectively, with
(7) |
where , are the null -linear mapping. Analogously, assume
(8) |
It is well known that relations (7) and (8) ensure that the iteration processes of the form
(9) |
and
(10) |
have the convergence orders , resp. .
In this note we show that the Steffensen method has the convergence order , the Aitken method , while the Aitken–Steffensen method . We also provide conditions ensuring the local convergence of these sequences.
2. Local convergence
Let be the ball with center at and with radius , and suppose .
The mappings , are assumed to obey the following hypotheses:
-
i)
the mapping admits Fréchet derivatives up to the order on , and
-
ii)
the mapping admits Fréchet derivatives up to the order on , and
The mapping is assumed to obey
-
i1)
the linear mapping is invertible for all , and
-
ii1)
the bilinear mapping is bounded for all :
Regarding the convergence of the Steffensen method, we obtain the following result.
Theorem 2.1.
Assume that obeys i) and (7), obeys i1) and ii1), and the initial approximation is chosen such that
-
a)
-
b)
Then the sequence generated by (4) remains in and converges to satisfying
-
j1)
where
and
-
jj1)
.
Proof.
Since , then by the Taylor formula and by (7) and i) we get
(11) |
whence, by b) it follows that
i.e., . By the Newton identity,
and taking into account i1), ii1) and (4) for , we obtain
whence, using (11), a) and b), it follows that
(12) |
i.e., .
Assume now that and denote
(13) |
Relations a) and b) imply , while (12) attracts
(14) |
Assume now that
(15) |
We prove now that and . Applying the Taylor formula and taking into account the hypotheses,
(16) |
The induction hypotheses also imply
(17) |
The fact that , , implies
whence
(18) |
Denoting , then by (18) we get
(19) |
Relation (19) implies conclusion (jj1). ∎
We obtain the following result regarding the Aitken method.
Theorem 2.2.
Assume that the mappings , obey i) and (7), resp. ii) and (8), the mapping obeys i1), i2) and the initial approximation is chosen such that
-
a′)
-
b′)
-
c′)
Then the sequence generated by (5) remains in , converges to and, moreover, the following relations are true:
-
j2)
where
and
-
jj2)
.
Proof.
From i), ii), (7) and (8) it results
(20) |
whence, by a′) it follows that . Analogously, for we get
(21) |
i.e.,
From a′), b′) and c′) we obtain that and
(25) |
Assume and .
Denote
(27) |
and assume that
(28) |
We show now that . Similarly to (22), one immediately deduces that
(30) |
The Taylor formula leads to the relations
and
By (33), we get and so, from a′) and b′),
and, analogously
i.e.,
Finally, the following result holds for the Aitken–Steffensen method.
Theorem 2.3.
Under the hypotheses of Theorem 2.2, the sequence , generated by (6) remains in the ball , and converge to such that:
-
j3)
,
where , , and -
jj3)
.
Assume that verifies a′)–c′). We show first that , . For we have
(34) |
i.e., . Next, taking into account (34), we get
We prove now that Analogously to (21), we get
(35) | ||||
As it can be easily noticed, the previous relation may also be written as
(36) | ||||
whence, by a′)–c′), it follows that i.e., Further, denote and so inequality (35) becomes
and, for it reads as
(37) |
with
Next, we show that , From (36) we have that
(38) |
Assume now that . Denote and also suppose that
(39) |
which, by (37), becomes
(40) |
We show now that Using the hypotheses of the theorem and the Newton identity, it can be easily shown that
i.e., by denoting
By (40), this leads to
and since we get
Further,
which shows that Now, we show that First, taking into account a′),
and, finally,
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 , resp. 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 , then the three studied methods have the same convergence order:
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]