Pages that link to "Item:Q2073139"
From MaRDI portal
The following pages link to Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables (Q2073139):
Displaying 12 items.
- Fast sparse nonlinear Fourier expansions of high dimensional functions (Q488526) (← links)
- Rapidly computing sparse Legendre expansions via sparse Fourier transforms (Q521921) (← links)
- Multidimensional pseudo-spectral methods on lattice grids (Q765263) (← links)
- Superfast Fourier transform using QTT approximation (Q1759431) (← links)
- Improved approximation guarantees for sublinear-time Fourier algorithms (Q1762319) (← 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)
- The uniform sparse FFT with application to PDEs with random coefficients (Q2098298) (← links)
- Transformed rank-1 lattices for high-dimensional approximation (Q2303354) (← links)
- Constructing spatial discretizations for sparse multivariate trigonometric polynomials that allow for a fast discrete Fourier transform (Q2330933) (← links)
- Fast discrete algorithms for sparse Fourier expansions of high dimensional functions (Q2655801) (← links)
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices (Q2659735) (← links)
