scientific article; zbMATH DE number 7053345
From MaRDI portal
Publication:5743468
Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38) Numerical methods for discrete and fast Fourier transforms (65T50) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Recommendations
- The sparse Fourier transform: theory and practice
- Nearly optimal sparse Fourier transform
- Dimension-independent sparse Fourier transform
- Sparse Fourier Transform via Butterfly Algorithm
- scientific article; zbMATH DE number 6796498
- (Nearly) sample-optimal sparse Fourier transform
- Sparse generalized Fourier transforms
- Theoretical and experimental analysis of a randomized algorithm for sparse Fourier transform analysis
- Sparse Fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time
- A sparse data fast fourier transform (SDFFT)
Cites work
- A Sparse Spectral Method for Homogenization Multiscale Problems
- Combinatorial Algorithms for Compressed Sensing
- Combinatorial sublinear-time Fourier algorithms
- Compressed sensing
- Constant depth circuits, Fourier transform, and learnability
- Empirical evaluation of a sub-linear time sparse DFT algorithm
- scientific article; zbMATH DE number 5485570 (Why is no real title available?)
- Improved approximation guarantees for sublinear-time Fourier algorithms
- Learning Decision Trees Using the Fourier Spectrum
- Near-optimal sparse fourier representations via sampling
- Randomized interpolation and approximation of sparse polynomials stPreliminary version
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
Cited in
(35)- Multithreaded implicitly dealiased convolutions
- Sparse interpolation, the FFT algorithm and FIR filters
- Fast Haar transforms for graph neural networks
- High-dimensional sparse Fourier algorithms
- Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables
- Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time
- Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables
- A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
- Sparse fast DCT for vectors with one-block support
- Vibration analysis of cyclic symmetrical systems by quantum algorithms
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
- A sparse fast Fourier algorithm for real non-negative vectors
- Theoretical and experimental analysis of a randomized algorithm for sparse Fourier transform analysis
- A multiscale sub-linear time Fourier algorithm for noisy data
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices
- Sparse high-dimensional FFT based on rank-1 lattice sampling
- Sparse Fourier Transform via Butterfly Algorithm
- Comments on "Split Manageable Efficient Algorithm for Fourier and Hadamard Transforms
- The sparse Fourier transform: theory and practice
- On Performance of Sparse Fast Fourier Transform and Enhancement Algorithm
- An adaptive sublinear-time block sparse Fourier transform
- A note on the high-dimensional sparse Fourier transform in the continuous setting
- Sketching with Kerdock's crayons: fast sparsifying transforms for arbitrary linear maps
- Estimating the frequency of a clustered signal
- Dimension-independent sparse Fourier transform
- scientific article; zbMATH DE number 6796498 (Why is no real title available?)
- (Nearly) sample-optimal sparse Fourier transform
- Nearly optimal sparse Fourier transform
- Performance of the multiscale sparse fast Fourier transform algorithm
- Nonlinear approximation in bounded orthonormal product bases
- Two subspace methods for frequency sparse graph signals
- Deterministic sparse Fourier transform with an _ guarantee
- Sparse spectral methods for solving high-dimensional and multiscale elliptic PDEs
- On Fourier analysis of sparse Boolean functions over certain abelian groups
- Sparse generalized Fourier transforms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743468)
