Sparse high-dimensional FFT based on rank-1 lattice sampling
From MaRDI portal
Publication:326763
DOI10.1016/J.ACHA.2015.05.002zbMath1388.94029OpenAlexW988000559MaRDI QIDQ326763
Publication date: 12 October 2016
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.acha.2015.05.002
FFTtrigonometric polynomialsapproximation of multivariate functionslattice rulerank-1 latticesparse fast Fourier transform
Trigonometric approximation (42A10) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical methods for trigonometric approximation and interpolation (65T40) Sampling theory in information and communication theory (94A20)
Related Items (18)
High-dimensional sparse FFT based on sampling along multiple rank-1 lattices ⋮ Grouped Transformations and Regularization in High-Dimensional Explainable ANOVA Approximation ⋮ Nonlinear approximation in bounded orthonormal product bases ⋮ Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials ⋮ A sparse FFT approach for ODE with random coefficients ⋮ Fast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weights ⋮ Efficient multivariate approximation on the cube ⋮ A framework for FFT-based homogenization on anisotropic lattices ⋮ High-dimensional sparse Fourier algorithms ⋮ Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables ⋮ Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time ⋮ Transformed rank-1 lattices for high-dimensional approximation ⋮ Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables ⋮ Function integration, reconstruction and approximation using rank-$1$ lattices ⋮ Lattice algorithms for multivariate approximation in periodic spaces with general weight parameters ⋮ The uniform sparse FFT with application to PDEs with random coefficients ⋮ A note on the high-dimensional sparse Fourier transform in the continuous setting* ⋮ A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A multiscale sub-linear time Fourier algorithm for noisy data
- A mathematical introduction to compressive sensing
- Parameter estimation for nonincreasing exponential sums by Prony-like methods
- On the stability of the hyperbolic cross discrete Fourier transform
- Multidimensional pseudo-spectral methods on lattice grids
- Random sampling of sparse trigonometric polynomials
- Combinatorial sublinear-time Fourier algorithms
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- Reconstruction of periodic functions of several variables with respect to the values in the nodes of number-theoretic nets
- Fouriertransform on sparse grids with hierarchical bases
- Improved approximation guarantees for sublinear-time Fourier algorithms
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
- Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation
- Constructing lattice rules based on weighted degree of exactness and worst case error
- Parameter estimation for multivariate exponential sums
- Reconstructing Hyperbolic Cross Trigonometric Polynomials by Sampling along Rank-1 Lattices
- Reconstructing Multivariate Trigonometric Polynomials by Sampling Along Generated Sets
- Reconstructing Multivariate Trigonometric Polynomials from Samples Along Rank-1 Lattices
- Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
- Spectral Methods
- Optimized general sparse grid approximation spaces for operator equations
- Decoding by Linear Programming
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Stability Results for Random Sampling of Sparse Trigonometric Polynomials
- Strang Splitting for the Time-Dependent Schrödinger Equation on Sparse Grids
- Atomic Decomposition by Basis Pursuit
- Fast Discrete Fourier Transform on Generalized Sparse Grids
- Computational Methods for the Fourier Analysis of Sparse High-Dimensional Functions
- Nearly optimal sparse fourier transform
- High-dimensional integration: The quasi-Monte Carlo way
- Sparse grids for the Schrödinger equation
- Compressed sensing
This page was built for publication: Sparse high-dimensional FFT based on rank-1 lattice sampling
