Sparse recovery for orthogonal polynomial transforms
From MaRDI portal
Cites work
- (Nearly) sample-optimal sparse Fourier transform
- A generalized Prony method for reconstruction of sparse sums of eigenfunctions of linear operators
- A mathematical introduction to compressive sensing
- A two-pronged progress in structured dense matrix vector multiplication
- An adaptive sublinear-time block sparse Fourier transform
- An Improved Estimate in the Restricted Isometry Problem
- An improved lower bound for sparse reconstruction from subsampled Hadamard matrices
- Dimension-independent sparse Fourier transform
- Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs
- Fourier-sparse interpolation without a frequency gap
- scientific article; zbMATH DE number 3770219 (Why is no real title available?)
- scientific article; zbMATH DE number 3477793 (Why is no real title available?)
- Matrix pencil method for estimating parameters of exponentially damped/undamped sinusoids in noise
- Near-optimal sparse fourier representations via sampling
- Nearly optimal sparse Fourier transform
- On sparse reconstruction from Fourier and Gaussian measurements
- Parameter estimation for exponential sums by approximate prony method
- Rapidly computing sparse Legendre expansions via sparse Fourier transforms
- Reconstruction of sparse Legendre and Gegenbauer expansions
- Sample efficient estimation and recovery in sparse FFT via isolation on average
- Sample-optimal Fourier sampling in any constant dimension
- Sparse Fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time
- Sparse Legendre expansions via _1-minimization
- The restricted isometry property of subsampled Fourier matrices
This page was built for publication: Sparse recovery for orthogonal polynomial transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842515)
