Efficient evaluation of oversampled functions

DOI10.1016/0377-0427(86)90068-3zbMath0632.65142OpenAlexW2024707247MaRDI QIDQ1095626

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

sampling theoremband-limited functionsoversampled functionsinc-series

Mathematics Subject Classification ID

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

Related Items (5)

Filter Functions with Exponential Convergence Order ⋮ Gaussian regularized periodic nonuniform sampling series ⋮ Sharp exponential bounds for the Gaussian regularized Whittaker-Kotelnikov-Shannon sampling series ⋮ Fourier reconstruction in tomography ⋮ Data compression in information technology—High speed sampling theorems

Cites Work

• The Shannon sampling theorem—Its various extensions and applications: A tutorial review
• Sampling Theorem for the Fourier Transform of a Distribution with Bounded Support
• Unnamed Item
• Unnamed Item

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