Pages that link to "Item:Q2659735"

The following pages link to High-dimensional sparse FFT based on sampling along multiple rank-1 lattices (Q2659735):

Displaying 11 items.

• Efficient multivariate approximation on the cube (Q1996231) (← 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)
• 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 note on the high-dimensional sparse Fourier transform in the continuous setting* (Q5030166) (← links)
• Nonlinear approximation in bounded orthonormal product bases (Q6049829) (← links)
• On the reconstruction of functions from values at subsampled quadrature points (Q6140848) (← links)