Abstract
We present an alternative to the vector ε-algorithm based on vector continued fractions and which is applicable when the sequence to be accelerated is generated by a one-point iteration function. These fractions are constructed in the language of Clifford algebras, which allow three-term recurrence relations. The new algorithm evidently has considerably greater numerical precision than the old one. Results from numerical experiments are reported.
Similar content being viewed by others
References
L.V. Ahlfors and P. Lounesto, Some remarks on Clifford algebras, Complex Variables 12 (1989) 201–209.
G.A. Baker Jr. and P.R. Graves-Morris, Padé Approximants, Encyclopedia of Mathematics and Its Applications, 2nd edn., Vol. 59 (Cambridge Univ. Press, Cambridge, 1996).
W. Gander, E.H. Golub and D. Gruntz, Solving linear equations by extrapolation, in: Supercomputing, Trondheim, 1989, Computer Systems Science, Vol. 62 (Springer, Berlin, 1989) pp. 279–293.
P.R. Graves-Morris, Extrapolation methods for vector sequences, Numer. Math. 61 (1992) 475–487.
P.R. Graves-Morris, A review of Padé methods for the acceleration of convergence of a sequence of vectors, Appl. Numer. Math. 15 (1994) 153–174.
P.R. Graves-Morris, A “Look-around Lanczos” algorithm for solving a system of linear equations, Numer. Algorithms 15 (1997) 247–274.
P.R. Graves-Morris and C.D. Jenkins, Vector-valued rational interpolants III, Constr. Approx. 2 (1986) 263–289.
P.R. Graves-Morris and D.E. Roberts, From matrix to vector Padé approximants, J. Comput. Appl. Math. 51 (1994) 205–236.
P.R. Graves-Morris and D.E. Roberts, Problems and progress in vector Padé approximation, J. Comput. Appl. Math. 77 (1997) 173–200.
P.R. Graves-Morris, D.E. Roberts and A. Salam, The epsilon algorithm and related topics, J. Comput. Appl. Math. 122 (2000) 51–80.
P.R. Graves-Morris and E.B. Saff, Row convergence theorems for generalised inverse vector-valued Padé approximants, J. Comput. Appl. Math. 23 (1988) 63–85.
P.R. Graves-Morris and J. Van Iseghem, Row convergence theorems for vector-valued Padé approximants, J. Approx. Theory 90 (1977) 153–173.
I.R. Porteous, Clifford Algebras and the Classical Groups (Cambridge Univ. Press, Cambridge, 1995).
M. Riesz, Clifford Numbers and Spinors, eds. E.F.Bolinder and P.Lounesto (Kluwer, Dordrecht, 1993).
D.E. Roberts, Clifford algebras and vector-valued rational forms I, Proc. Roy. Soc. London A 431 (1990) 285–300.
D.E. Roberts, Vector-valued rational forms, Found. Phys. 23 (1993) 1521–1533.
D.E. Roberts, On the convergence of rows of vector Padé approximants, J. Comput. Appl. Math. 70 (1996) 95–109.
D.E. Roberts, On a vector q-d algorithm, Adv. Comput. Math. 8 193-219 (1998).
D.E. Roberts, On a representation of vector continued fractions, J. Comput. Appl. Math. 105 (1999) 453-466.
D.E. Roberts, A vector generalisation of de Montessus' theorem for the case of polar singularites on the boundary, to appear in J. Approx. Theory.
Y. Saad, Preconditioning techniques for non-symmetric and indefinite linear systems, J. Comput. Appl. Math. 24 (1988) 89-105.
A. Salam, Vector Padé-type approximants and vector Padé approximants, J. Approx. Theory 97 (1999) 92-112.
A. Sidi, Rational approximations from power series of vector-valued meromorphic functions, J. Approx. Theory 77 (1994) 89-111.
A. Sidi and J. Bridger, Convergence and stability analyses for some vector extrapolation methods in the presence of defective iteration matrices, J. Comput. Appl. Math. 22 (1988) 35-61.
D.A. Smith, W.F. Ford and A. Sidi, Extrapolation methods for vector sequences, SIAMRev. 29 (1987) 199-233.
P. Wynn, Acceleration techniqes for iterated vector and matrix problems, Math. Comp. 16 (1962) 301-322.
P.Wynn, Continued fractions whose coefficients obey a non-commutative law of multiplication, Arch. Rational Mech. Anal. 12 (1963) 273-312.
P. Wynn, Vector continued fractions, Linear Algebra Appl. 1 (1968) 357–395.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Roberts, D. The Vector Epsilon Algorithm – a Residual Approach. Numerical Algorithms 29, 209–227 (2002). https://doi.org/10.1023/A:1014880510928
Issue Date:
DOI: https://doi.org/10.1023/A:1014880510928