×

Efficient evaluation of oversampled functions. (English) Zbl 0632.65142

It has long been known that an oversampled function can be represented by a generalized sinc series which converges much faster than the usual one. We show that the speed of convergence is exponential and give numerical approximations to the kernel function involved in the generalized series. The practical consequence is that a bandlimited function which is oversampled can be evaluated at any point with accurary \(O(Le^{- \sqrt{L}})\) using O(L) operations.

MSC:

65T40 Numerical methods for trigonometric approximation and interpolation
65D15 Algorithms for approximation of functions
42A16 Fourier coefficients, Fourier series of functions with special properties, special Fourier series
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Abramowitz, M.; Stegun, I. A., Handbook of Mathematical Functions (1972), Dover: Dover New York · Zbl 0515.33001
[2] Campbell, L. L., Sampling theorem for the Fourier transform of a distribution with bounded support, SIAM J. Appl. Math., 16, 626-636 (1968) · Zbl 0184.43802
[3] Jerri, A. J., The shannon sampling theorem—its various extensions and applications: A tutorial review, Proc. IEEE, 65, 1565-1596 (1977) · Zbl 0442.94002
[4] Löw, K. H.; Natterer, F., An ultra-fast algorithm in computerized tomography, Fachbereich 10 der Universität des Saarlandes, 6600 Saarbrücken, Germany (1981), Tech. Rep. A81/03
[5] Mandelbrojt, S., Séries adhérentes, Regularisation des Suites, Applications (1952), Gauthier-Villars: Gauthier-Villars Paris · Zbl 0048.05203
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.