Pages that link to "Item:Q326763"

The following pages link to Sparse high-dimensional FFT based on rank-1 lattice sampling (Q326763):

Displaying 17 items.

• Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials (Q1704862) (← links)
• Efficient multivariate approximation on the cube (Q1996231) (← links)
• A framework for FFT-based homogenization on anisotropic lattices (Q2001661) (← 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)
• 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 sparse FFT approach for ODE with random coefficients (Q2216613) (← links)
• Transformed rank-1 lattices for high-dimensional approximation (Q2303354) (← links)
• High-dimensional sparse FFT based on sampling along multiple rank-1 lattices (Q2659735) (← links)
• Function integration, reconstruction and approximation using rank-$1$ lattices (Q4992235) (← links)
• Lattice algorithms for multivariate approximation in periodic spaces with general weight parameters (Q4998633) (← links)
• A note on the high-dimensional sparse Fourier transform in the continuous setting* (Q5030166) (← links)
• Fast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weights (Q5145098) (← links)
• Nonlinear approximation in bounded orthonormal product bases (Q6049829) (← links)