Computational techniques based on the Lanczos representation

Author:
J. N. Lyness

Journal:
Math. Comp. **28** (1974), 81-123

MSC:
Primary 65D15; Secondary 42A08

DOI:
https://doi.org/10.1090/S0025-5718-1974-0334458-6

MathSciNet review:
0334458

Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: In his book *Discourse on Fourier Series*, Lanczos deals in some detail with representations of of the type where is a polynomial of degree and has the property that its full range Fourier coefficients converge at the rate .

In Part I, some properties of and of the series are described. These properties are used here to provide criteria for the convergence or divergence of the Euler-Maclaurin series, in the case when is an analytic function. The similarities and differences between this series and the Lidstone and other two-point series are briefly mentioned.

In Part II, the Lanczos representation is employed to derive an approximate representation for an analytic function on the interval [0, 1] is derived. This has the form

This representation is a powerful one. The drawback is that it requires derivatives. Most of Part II is devoted to the effect of using only approximate derivatives. It is shown that when these are successively less accurate with increasing order (the sort of behaviour encountered using finite difference formula), then the representation is still powerful and reliable. In a computational context the only penalty for using inaccurate derivatives is that a larger value of *m* may--or may not--be required to attain a specific accuracy.

**[1]**Milton Abramowitz and Irene A. Stegun,*Handbook of mathematical functions with formulas, graphs, and mathematical tables*, National Bureau of Standards Applied Mathematics Series, vol. 55, For sale by the Superintendent of Documents, U.S. Government Printing Office, Washington, D.C., 1964. MR**0167642****[2]**Ralph Philip Boas Jr.,*Entire functions*, Academic Press Inc., New York, 1954. MR**0068627****[3]**William B. Jones and G. Hardy,*Accelerating convergence of trigonometric approximations*, Math. Comp.**24**(1970), 547–560. MR**0277086**, https://doi.org/10.1090/S0025-5718-1970-0277086-X**[4]**Cornelius Lanczos,*Discourse on Fourier series*, Hafner Publishing Co., New York, 1966. MR**0199629****[5]**G. J. Lidstone, "Notes on the extension of Aitken's theorem (for polynomial interpolation) to the Everett types,"*Proc. Edinburgh Math. Soc.*(2), v. 2, 1929, pp. 16-19.**[6]**D. V. Widder,*Completely convex functions and Lidstone series*, Trans. Amer. Math. Soc.**51**(1942), 387–398. MR**0006356**, https://doi.org/10.1090/S0002-9947-1942-0006356-4**[7]**P. C. Chakravarti,*Integrals and Sums*, Univ. of London, The Athlone Press, 1970.**[8]**W. M. Gentleman & G. Sande,*Fast Fourier Transforms--For Fun and Profit*, Proc. AF1PS 1966 FJCC, v. 29, Spartan Books, New York, pp. 563-578.**[9]**J. N. Lyness & G. Sande, "ENTCAF and ENTCRE: Evaluation of normalised Taylor coefficients of an analytic function, algorithm 413,"*Comm. ACM*, v. 14, 1971, pp. 669-675.

Retrieve articles in *Mathematics of Computation*
with MSC:
65D15,
42A08

Retrieve articles in all journals with MSC: 65D15, 42A08

Additional Information

DOI:
https://doi.org/10.1090/S0025-5718-1974-0334458-6

Article copyright:
© Copyright 1974
American Mathematical Society