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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Foundations of computational mathematics Ročník 10; číslo 3; s. 303 - 338
Hlavný autor:	Iwen, M. A.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer-Verlag 01.06.2010 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!