High-dimensional sparse Fourier algorithms
From MaRDI portal
Publication:2021766
DOI10.1007/s11075-020-00962-1zbMath1470.65226arXiv1606.07407OpenAlexW3042864998MaRDI QIDQ2021766
Bosu Choi, Yang Wang, Andrew J. Christlieb
Publication date: 27 April 2021
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.07407
Related Items (4)
Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps ⋮ Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables ⋮ A note on the high-dimensional sparse Fourier transform in the continuous setting* ⋮ A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
Uses Software
Cites Work
- Unnamed Item
- A multiscale sub-linear time Fourier algorithm for noisy data
- A deterministic sparse FFT algorithm for vectors with small support
- Sparse high-dimensional FFT based on rank-1 lattice sampling
- Combinatorial sublinear-time Fourier algorithms
- Deterministic sparse FFT for \(M\)-sparse vectors
- Improved approximation guarantees for sublinear-time Fourier algorithms
- A deterministic sparse FFT for functions with structured Fourier sparsity
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
- A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees
- Parameter estimation for multivariate exponential sums
- How many Fourier samples are needed for real function reconstruction?
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices
- Near-optimal sparse fourier representations via sampling
- Nearly optimal sparse fourier transform
This page was built for publication: High-dimensional sparse Fourier algorithms
