Pages that link to "Item:Q2420230"
From MaRDI portal
The following pages link to A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees (Q2420230):
Displaying 15 items.
- A deterministic sparse FFT for functions with structured Fourier sparsity (Q2000485) (← links)
- High-dimensional sparse Fourier algorithms (Q2021766) (← links)
- Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables (Q2031058) (← links)
- Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time (Q2038427) (← links)
- Deterministic sparse sublinear FFT with improved numerical stability (Q2038594) (← links)
- A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size (Q2070286) (← links)
- Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables (Q2073139) (← links)
- Constructing spatial discretizations for sparse multivariate trigonometric polynomials that allow for a fast discrete Fourier transform (Q2330933) (← links)
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees (Q2376358) (← links)
- Theoretical and experimental analysis of a randomized algorithm for sparse Fourier transform analysis (Q2572217) (← links)
- Sparse Discrete Fractional Fourier Transform and Its Applications (Q4579646) (← links)
- Upper and Lower Bounds on Time-Space Tradeoffs for Computations with Embedded Fast Fourier Transforms (Q4729344) (← links)
- A note on the high-dimensional sparse Fourier transform in the continuous setting* (Q5030166) (← links)
- Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares (Q5857850) (← links)
- Performance of the multiscale sparse fast Fourier transform algorithm (Q6045575) (← links)
