Sparse fast trigonometric transforms

MaRDI QIDQ5107548zbMATH OpenFDO

Authors Sina Bittens

Publication date 28 April 2020

Full work available at URL http://d-nb.info/1191479706/34

zbMATH Keywords

approximation algorithmsdiscrete Fourier transformdiscrete cosine transformsublinear sparse FFTstructured sparsitysparse Fourier transformdeterministic sparse fast DCTdeterministic sparse FFTsublinear sparse DCT

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Sparse fast DCT for vectors with one-block support
• Real sparse fast DCT for vectors with short support
• A deterministic sparse FFT algorithm for vectors with small support
• (Nearly) sample-optimal sparse Fourier transform
• A deterministic sparse FFT for functions with structured Fourier sparsity

Cited in

(5)

• Sparse fast DCT for vectors with one-block support
• A deterministic sparse FFT for functions with structured Fourier sparsity
• Constructing spatial discretizations for sparse multivariate trigonometric polynomials that allow for a fast discrete Fourier transform
• Real sparse fast DCT for vectors with short support
• A deterministic sparse FFT algorithm for vectors with small support

This page was built for publication: Sparse fast trigonometric transforms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5107548)