Pages that link to "Item:Q2021766"

The following pages link to High-dimensional sparse Fourier algorithms (Q2021766):

Displaying 9 items.

• Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables (Q2073139) (← links)
• Multiscale high-dimensional sparse Fourier algorithms for noisy data (Q2082838) (← links)
• A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions (Q2118948) (← links)
• Improved sparse Fourier approximation results: Faster implementations and stronger guarantees (Q2376358) (← links)
• High-dimensional sparse FFT based on sampling along multiple rank-1 lattices (Q2659735) (← links)
• Sparse Fourier Transform via Butterfly Algorithm (Q3567001) (← links)
• A note on the high-dimensional sparse Fourier transform in the continuous setting* (Q5030166) (← links)
• Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps (Q5088658) (← links)
• (Q5371885) (← links)