Efficient evaluation of oversampled functions

DOI10.1016/0377-0427(86)90068-3MaRDI QIDQ1095626zbMATH OpenOpenAlexFDO

Authors Frank Natterer

Publication date 1986

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-0427(86)90068-3

zbMATH Keywords

band-limited functionsoversampled functionsampling theoremsinc-series

Mathematics Subject Classification ID

Fourier coefficients, Fourier series of functions with special properties, special Fourier series (42A16) Algorithms for approximation of functions (65D15) Numerical methods for trigonometric approximation and interpolation (65T40)

Review text

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.

Recommendations

• Efficient computation of the overpartition function and applications
• Efficient Multiple-Precision Evaluation of Elementary Functions
• Scalable Optimization-Based Sampling on Function Space
• Efficient computation of the iteration of functions
• Optimized Regression for Efficient Function Evaluation
• Efficient numerical methods in non-uniform sampling theory
• Efficient representation and accurate evaluation of oscillatory integrals and functions
• Oversampling and reconstruction functions with compact support
• Fast multipole methods for approximating a function from sampling values
• Efficient resampling methods for nonsmooth estimating functions

Cites work

• scientific article; zbMATH DE number 3814037 (Why is no real title available?)
• scientific article; zbMATH DE number 3075026 (Why is no real title available?)
• Sampling Theorem for the Fourier Transform of a Distribution with Bounded Support
• The Shannon sampling theorem—Its various extensions and applications: A tutorial review

Cited in

(8)

• Fourier reconstruction in tomography
• Gaussian regularized periodic nonuniform sampling series
• Sharp exponential bounds for the Gaussian regularized Whittaker-Kotelnikov-Shannon sampling series
• Filter Functions with Exponential Convergence Order
• Data compression in information technology—High speed sampling theorems
• Efficient computation of the overpartition function and applications
• On numerical realizations of Shannon's sampling theorem
• Some remarks on regularized Shannon sampling formulas

This page was built for publication: Efficient evaluation of oversampled functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095626)