Deterministic sparse FFT for M-sparse vectors

No abstract is available for this paper.

• Publication year

  2017

• Venue

  Numerical Algorithms

• Publication date

  2017-07-05

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s11075-017-0370-5
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Sparse FFT for Functions with Short Frequency Support

  2017cited by this paper
• Using Intervention Mapping to develop the Parents as Agents of Change (PAC©) intervention for managing pediatric obesity

  2017cited by this paper
• Sub-string/Pattern Matching in Sub-linear Time Using a Sparse Fourier Transform Approach

  2017cited by this paper
• Efficient Spectral Estimation by MUSIC and ESPRIT with Application to Sparse FFT

  2016cited by this paper
• A sparse fast Fourier algorithm for real non-negative vectors

  2016influential reference
• A deterministic sparse FFT algorithm for vectors with small support

  2015cited by this paper
• Super-resolution, Extremal Functions and the Condition Number of Vandermonde Matrices

  2014cited by this paper
• Deterministic Sparse Fourier Approximation Via Approximating Arithmetic Progressions

  2014cited by this paper
• Recent Developments in the Sparse Fourier Transform: A compressed Fourier transform for big data

  2014cited by this paper
• Adaptive Sub-Linear Time Fourier Algorithms

  2013cited by this paper
• Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(k log k) complexity

  2013cited by this paper
• Improved sparse fourier approximation results: faster implementations and stronger guarantees

  2013cited by this paper
• Faster GPS via the sparse fourier transform

  2012cited by this paper
• Simple and practical algorithm for sparse Fourier transform

  2012cited by this paper
• Diversification improves interpolation

  2011cited by this paper
• Combinatorial Sublinear-Time Fourier Algorithms

  2010cited by this paper
• Improved Approximation Guarantees for Sublinear-Time Fourier Algorithms

  2010cited by this paper
• Super-Resolution

  2009cited by this paper
• On perfect conditioning of Vandermonde matrices on the unit circle

  2007cited by this paper
• Symbolic-numeric sparse interpolation of multivariate polynomials

  2006cited by this paper
• Fast QR factorization of Vandermonde matrices

  1989cited by this paper
• Hilbert’s inequality

  1974cited by this paper

• Selecting Optimal Sampling Rate for Stable Super-Resolution

  2025cites this paper
• Fast interpolation and multiplication of unbalanced polynomials

  2024cites this paper
• Performance of the Multiscale Sparse Fast Fourier Transform Algorithm

  2022cites this paper
• Two Efficient Sparse Fourier Algorithms Using the Matrix Pencil Method

  2022influential citation
• A structured review of sparse fast Fourier transform algorithms

  2022cites this paper
• Iterative Sparse FFT for M‐sparse Vectors: Deterministic versus Random Sampling

  2021cites this paper
• Inversion of band-limited discrete Fourier transforms of binary images: Uniqueness and algorithms

  2021cites this paper
• On Performance of Multiscale Sparse Fast Fourier Transform Algorithm

  2020cites this paper
• Deterministic Sparse Sublinear FFT with Improved Numerical Stability

  2020influential citation
• Parametric spectral analysis: scale and shift

  2020cites this paper
• On Performance of Sparse Fast Fourier Transform Algorithms Using the Aliasing Filter.

  2020cites this paper
• Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables

  2020cites this paper
• Multiscale matrix pencils for separable reconstruction problems

  2020cites this paper
• Sparse Fast Trigonometric Transforms

  2019cites this paper
• Fast Fourier Transforms

  2018cites this paper
• Prony Method for Reconstruction of Structured Functions

  2018cites this paper
• Sparse fast DCT for vectors with one-block support

  2018cites this paper
• Real sparse fast DCT for vectors with short support

  2018cites this paper
• A deterministic sparse FFT for functions with structured Fourier sparsity

  2017cites this paper
• High-dimensional sparse Fourier algorithms

  2016cites this paper
• Deterministic sparse FFT algorithms

  2015cites this paper