On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions

DOI10.1137/110835864zbMath1286.68495OpenAlexW2039757206MaRDI QIDQ2903122

No author found.

Publication date: 23 August 2012

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/110835864

zbMATH Keywords

approximation algorithmscombinatorial codesspecial matricesdiscrete and fast Fourier transformstrigonometric approximation and interpolation

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Numerical methods for trigonometric approximation and interpolation (65T40) Approximation algorithms (68W25) Combinatorial codes (94B25) Special matrices (15B99)

Related Items (8)

Improved sparse Fourier approximation results: Faster implementations and stronger guarantees ⋮ Explicit universal sampling sets in finite vector spaces ⋮ A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees ⋮ Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms ⋮ Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time ⋮ A deterministic sparse FFT for functions with structured Fourier sparsity ⋮ Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables ⋮ Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time

This page was built for publication: On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions