Pages that link to "Item:Q521921"
From MaRDI portal
The following pages link to Rapidly computing sparse Legendre expansions via sparse Fourier transforms (Q521921):
Displaying 12 items.
- Reconstruction of sparse Legendre and Gegenbauer expansions (Q329024) (← links)
- Sparse Legendre expansions via \(\ell_1\)-minimization (Q420755) (← links)
- Orthogonal polynomial expansions on sparse grids (Q457562) (← links)
- Representation of sparse Legendre expansions (Q1930163) (← links)
- 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)
- Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables (Q2073139) (← links)
- Sparse fast DCT for vectors with one-block support (Q2274167) (← links)
- A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees (Q2420230) (← links)
- Sparse Evaluation of Compositions of Functions Using Multiscale Expansions (Q4429887) (← links)
- Nonlinear approximation in bounded orthonormal product bases (Q6049829) (← links)
