Real sparse fast DCT for vectors with short support
DOI10.1016/j.laa.2019.08.006zbMath1464.65296arXiv1807.07397OpenAlexW2968831792MaRDI QIDQ2332391
Sina Bittens, Gerlind Plonka-Hoch
Publication date: 4 November 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.07397
discrete cosine transformsampling complexityreal arithmeticsublinear runtimedeterministic sparse fast algorithminverse DCT of type IIvector with short support
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- A multiscale sub-linear time Fourier algorithm for noisy data
- A deterministic sparse FFT algorithm for vectors with small support
- Combinatorial sublinear-time Fourier algorithms
- Deterministic sparse FFT for \(M\)-sparse vectors
- Improved approximation guarantees for sublinear-time Fourier algorithms
- Fast and numerically stable algorithms for discrete cosine transforms
- A deterministic sparse FFT for functions with structured Fourier sparsity
- Sparse fast DCT for vectors with one-block support
- Real sparse fast DCT for vectors with short support
- A sparse fast Fourier algorithm for real non-negative vectors
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees
- Deterministic Sparse Fourier Approximation Via Approximating Arithmetic Progressions
- Fast algorithms for the discrete W transform and for the discrete Fourier transform
This page was built for publication: Real sparse fast DCT for vectors with short support