Efficient evaluation of oversampled functions
From MaRDI portal
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
(7)- Sharp exponential bounds for the Gaussian regularized Whittaker-Kotelnikov-Shannon sampling series
- Efficient computation of the overpartition function and applications
- On numerical realizations of Shannon's sampling theorem
- Data compression in information technology—High speed sampling theorems
- Filter Functions with Exponential Convergence Order
- Gaussian regularized periodic nonuniform sampling series
- Fourier reconstruction in tomography
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)
