Extrapolation methods and derivatives

of limits of sequences

Author:
Avram Sidi

Journal:
Math. Comp. **69** (2000), 305-323

MSC (1991):
Primary 40A25, 41A60, 65B05, 65B10, 65D30

DOI:
https://doi.org/10.1090/S0025-5718-99-01169-2

Published electronically:
August 17, 1999

MathSciNet review:
1665967

Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Let be an infinite sequence whose limit or antilimit can be approximated very efficiently by applying a suitable extrapolation method E to . Assume that the and hence also are differentiable functions of some parameter , being the limit or antilimit of , and that we need to approximate . A direct way of achieving this would be by applying again a suitable extrapolation method E to the sequence , and this approach has often been used efficiently in various problems of practical importance. Unfortunately, as has been observed at least in some important cases, when and have essentially different asymptotic behaviors as , the approximations to produced by this approach, despite the fact that they are good, do not converge as quickly as those obtained for , and this is puzzling. In this paper we first give a rigorous mathematical explanation of this phenomenon for the cases in which E is the Richardson extrapolation process and E is a generalization of it, thus showing that the phenomenon has very little to do with numerics. Following that, we propose a procedure that amounts to first applying the extrapolation method E to and then differentiating the resulting approximations to , and we provide a thorough convergence and stability analysis in conjunction with the Richardson extrapolation process. It follows from this analysis that the new procedure for has practically the same convergence properties as E for . We show that a very efficient way of implementing the new procedure is by actually differentiating the recursion relations satisfied by the extrapolation method used, and we derive the necessary algorithm for the Richardson extrapolation process. We demonstrate the effectiveness of the new approach with numerical examples that also support the theory. We discuss the application of this approach to numerical integration in the presence of endpoint singularities. We also discuss briefly its application in conjunction with other extrapolation methods.

**[BRS]**F. L. Bauer, H. Rutishauser, and E. Stiefel,*New aspects in numerical quadrature*, Proc. Sympos. Appl. Math., Vol. XV, Amer. Math. Soc., Providence, R.I., 1963, pp. 199–218. MR**0174177****[B1]**Claude Brezinski,*Accélération de suites à convergence logarithmique*, C. R. Acad. Sci. Paris Sér. A-B**273**(1971), A727–A730 (French). MR**0305544****[B2]**C. Brezinski,*A general extrapolation algorithm*, Numer. Math.**35**(1980), no. 2, 175–187. MR**585245**, https://doi.org/10.1007/BF01396314**[BS]**Roland Bulirsch and Josef Stoer,*Fehlerabschätzungen und Extrapolation mit rationalen Funktionen bei Verfahren vom Richardson-Typus*, Numer. Math.**6**(1964), 413–427. MR**0176589**, https://doi.org/10.1007/BF01386092**[DR]**Philip J. Davis and Philip Rabinowitz,*Methods of numerical integration*, 2nd ed., Computer Science and Applied Mathematics, Academic Press, Inc., Orlando, FL, 1984. MR**760629****[FS]**William F. Ford and Avram Sidi,*An algorithm for a generalization of the Richardson extrapolation process*, SIAM J. Numer. Anal.**24**(1987), no. 5, 1212–1232. MR**909075**, https://doi.org/10.1137/0724080**[H]**T. HÈ§vie,*Generalized Neville type extrapolation schemes*, BIT**19**(1979), no. 2, 204–213. MR**537780**, https://doi.org/10.1007/BF01930850**[L]**J. N. Lyness,*An error functional expansion for 𝑁-dimensional quadrature with an integrand function singular at a point*, Math. Comp.**30**(1976), no. 133, 1–23. MR**0408211**, https://doi.org/10.1090/S0025-5718-1976-0408211-0**[LM]**J. N. Lyness and G. Monegato,*Quadrature error functional expansions for the simplex when the integrand function has singularities at vertices*, Math. Comp.**34**(1980), no. 149, 213–225. MR**551299**, https://doi.org/10.1090/S0025-5718-1980-0551299-8**[LN]**J. N. Lyness and B. W. Ninham,*Numerical quadrature and asymptotic expansions*, Math. Comp.**21**(1967), 162–178. MR**0225488**, https://doi.org/10.1090/S0025-5718-1967-0225488-X**[N1]**Israel Navot,*An extension of the Euler-Maclaurin summation formula to functions with a branch singularity*, J. Math. and Phys.**40**(1961), 271–276. MR**0140876****[N2]**I. Navot, A further extension of the Euler-Maclaurin summation formula,*J. Math. and Phys.*,**41**(1962), pp. 305-323.**[Sc]**Claus Schneider,*Vereinfachte Rekursionen zur Richardson-Extrapolation in Spezialfällen*, Numer. Math.**24**(1975), no. 2, 177–184 (German, with English summary). MR**0378342**, https://doi.org/10.1007/BF01400966**[Sh]**D. Shanks, Non-linear transformations of divergent and slowly convergent sequences,*J. Math. and Phys.*,**34**(1955), pp. 305-323. MR**16:961c****[Si1]**Avram Sidi,*Euler-Maclaurin expansions for integrals over triangles and squares of functions having algebraic/logarithmic singularities along an edge*, J. Approx. Theory**39**(1983), no. 1, 39–53. MR**713360**, https://doi.org/10.1016/0021-9045(83)90067-9**[Si2]**Avram Sidi,*Generalizations of Richardson extrapolation with applications to numerical integration*, Numerical integration, III (Oberwolfach, 1987) Internat. Schriftenreihe Numer. Math., vol. 85, Birkhäuser, Basel, 1988, pp. 237–250. MR**1021539****[Si3]**Avram Sidi,*A complete convergence and stability theory for a generalized Richardson extrapolation process*, SIAM J. Numer. Anal.**34**(1997), no. 5, 1761–1778. MR**1472195**, https://doi.org/10.1137/S0036142994278589**[W]**P. Wynn, On a device for computing the transformation,*Math. Comp.*,**10**(1956), pp. 305-323. MR**18:801e**

Retrieve articles in *Mathematics of Computation of the American Mathematical Society*
with MSC (1991):
40A25,
41A60,
65B05,
65B10,
65D30

Retrieve articles in all journals with MSC (1991): 40A25, 41A60, 65B05, 65B10, 65D30

Additional Information

**Avram Sidi**

Affiliation:
Computer Science Department, Technion—Israel Institute of Technology, Haifa 32000, Israel

Email:
asidi@cs.technion.ac.il

DOI:
https://doi.org/10.1090/S0025-5718-99-01169-2

Received by editor(s):
March 26, 1998

Published electronically:
August 17, 1999

Article copyright:
© Copyright 1999
American Mathematical Society