Pages that link to "Item:Q2330933"
From MaRDI portal
The following pages link to Constructing spatial discretizations for sparse multivariate trigonometric polynomials that allow for a fast discrete Fourier transform (Q2330933):
Displayed 9 items.
- Efficient multivariate approximation on the cube (Q1996231) (← links)
- A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size (Q2070286) (← 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 sparse FFT approach for ODE with random coefficients (Q2216613) (← links)
- Transformed rank-1 lattices for high-dimensional approximation (Q2303354) (← links)
- Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices (Q2325022) (← links)
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices (Q2659735) (← links)
- Nonlinear approximation in bounded orthonormal product bases (Q6049829) (← links)