Pages that link to "Item:Q2399652"
From MaRDI portal
The following pages link to Explicit universal sampling sets in finite vector spaces (Q2399652):
Displayed 10 items.
- A deterministic sparse FFT for functions with structured Fourier sparsity (Q2000485) (← 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)
- 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)
- 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)
- A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees (Q2420230) (← links)
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices (Q2659735) (← links)
- Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps (Q5088658) (← links)