Combinatorial Sublinear-Time Fourier Algorithms

We study the problem of estimating the best k term Fourier representation for a given frequency sparse signal (i.e., vector) A of length N ≫ k . More explicitly, we investigate how to deterministically identify k of the largest magnitude frequencies of , and estimate their coefficients, in polynomia...

Full description

Saved in:

Bibliographic Details
Published in:	Foundations of computational mathematics Vol. 10; no. 3; pp. 303 - 338
Main Author:	Iwen, M. A.
Format:	Journal Article
Language:	English
Published:	New York Springer-Verlag 01.06.2010 Springer Nature B.V
Subjects:	Applications of Mathematics Computer Science Economics Linear and Multilinear Algebras Math Applications in Computer Science Mathematics Mathematics and Statistics Matrix Theory Numerical Analysis 05-04 65T50 42A15 65T40 42A10 42A32 Trigonometric approximation and interpolation Approximation algorithms Discrete and fast Fourier transforms 68W25 94A12
ISSN:	1615-3375, 1615-3383
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!