Combinatorial sublinear-time Fourier algorithms
From MaRDI portal
(Redirected from Publication:972615)
Recommendations
- Nearly optimal sparse Fourier transform
- (Nearly) sample-optimal sparse Fourier transform
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees
- Improved approximation guarantees for sublinear-time Fourier algorithms
- What's the frequency, Kenneth?: Sublinear Fourier sampling off the grid
Cites work
- scientific article; zbMATH DE number 996424 (Why is no real title available?)
- scientific article; zbMATH DE number 432614 (Why is no real title available?)
- scientific article; zbMATH DE number 5764870 (Why is no real title available?)
- scientific article; zbMATH DE number 5764871 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 51347 (Why is no real title available?)
- scientific article; zbMATH DE number 1528185 (Why is no real title available?)
- scientific article; zbMATH DE number 2119730 (Why is no real title available?)
- scientific article; zbMATH DE number 774007 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 823957 (Why is no real title available?)
- A Sparse Spectral Method for Homogenization Multiscale Problems
- Algorithms and Data Structures
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Chebyshev and Fourier spectral methods.
- Combinatorial Algorithms for Compressed Sensing
- Combinatorics of random processes and sections of convex bodies
- Compressed sensing
- Compressed sensing and best \(k\)-term approximation
- Data streams: algorithms and applications.
- Deterministic constructions of compressed sensing matrices
- Empirical evaluation of a sub-linear time sparse DFT algorithm
- Fast Fourier Transforms for Nonequispaced Data
- Near-optimal sparse fourier representations via sampling
- Nonuniform fast fourier transforms using min-max interpolation
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- Randomized Interpolation and Approximation of Sparse Polynomials
- Rapid Computation of the Discrete Fourier Transform
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Stable signal recovery from incomplete and inaccurate measurements
- The type 3 nonuniform FFT and its applications
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
Cited in
(47)- A note on the high-dimensional sparse Fourier transform in the continuous setting
- A multiscale sub-linear time Fourier algorithm for noisy data
- scientific article; zbMATH DE number 7053345 (Why is no real title available?)
- Sparse fast DCT for vectors with one-block support
- Nonlinear approximation in bounded orthonormal product bases
- A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size
- A deterministic sparse FFT for functions with structured Fourier sparsity
- A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
- Parameter estimation for nonincreasing exponential sums by Prony-like methods
- Deterministic sparse FFT for M-sparse vectors
- A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees
- Spectral compressive sensing
- Detecting the large entries of a sparse covariance matrix in sub-quadratic time
- Theory and applications of compressed sensing
- High-dimensional sparse Fourier algorithms
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees
- Sparse Fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time
- Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables
- What's the frequency, Kenneth?: Sublinear Fourier sampling off the grid
- Nearly optimal sparse Fourier transform
- Sketching with Kerdock's crayons: fast sparsifying transforms for arbitrary linear maps
- An adaptive sublinear-time block sparse Fourier transform
- A sublinear algorithm for the recovery of signals with sparse Fourier transform when many samples are missing
- Deterministic sparse sublinear FFT with improved numerical stability
- Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time
- Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares
- On the design of deterministic matrices for fast recovery of Fourier compressible functions
- What's the frequency, Kenneth?: sublinear Fourier sampling off the grid
- Sparse high-dimensional FFT based on rank-1 lattice sampling
- Improved approximation guarantees for sublinear-time Fourier algorithms
- Real sparse fast DCT for vectors with short support
- Empirical evaluation of a sub-linear time sparse DFT algorithm
- (Nearly) sample-optimal sparse Fourier transform
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
- A deterministic sparse FFT algorithm for vectors with small support
- System identification in dynamical sampling
- Stochastic Collocation vial1-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification
- Performance of the multiscale sparse fast Fourier transform algorithm
- A sparse fast Fourier algorithm for real non-negative vectors
- Two subspace methods for frequency sparse graph signals
- Superfast Fourier transform using QTT approximation
- Explicit universal sampling sets in finite vector spaces
- Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables
- A hierarchical framework for recovery in compressive sensing
- Strengthening hash families and compressive sensing
- Deterministic sampling of sparse trigonometric polynomials
- Rapidly computing sparse Legendre expansions via sparse Fourier transforms
This page was built for publication: Combinatorial sublinear-time Fourier algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972615)
