Pages that link to "Item:Q2000485"
From MaRDI portal
The following pages link to A deterministic sparse FFT for functions with structured Fourier sparsity (Q2000485):
Displaying 16 items.
- Deterministic sparse FFT for \(M\)-sparse vectors (Q1751061) (← 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)
- The uniform sparse FFT with application to PDEs with random coefficients (Q2098298) (← links)
- A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions (Q2118948) (← links)
- Sparse fast DCT for vectors with one-block support (Q2274167) (← links)
- Real sparse fast DCT for vectors with short support (Q2332391) (← links)
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees (Q2376358) (← links)
- A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees (Q2420230) (← links)
- Theoretical and experimental analysis of a randomized algorithm for sparse Fourier transform analysis (Q2572217) (← links)
- Optimized Spectrum Permutation for the Multidimensional Sparse FFT (Q4620520) (← 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)
