کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4605177 | 1337552 | 2013 | 26 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Improved approximation guarantees for sublinear-time Fourier algorithms
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
آنالیز ریاضی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
In this paper modified variants of the sparse Fourier transform algorithms from Iwen (2010) [32] are presented which improve on the approximation error bounds of the original algorithms. In addition, simple methods for extending the improved sparse Fourier transforms to higher dimensional settings are developed. As a consequence, approximate Fourier transforms are obtained which will identify a near-optimal k-term Fourier series for any given input function, f:[0,2π]D→C, in O(k2⋅D4) time (neglecting logarithmic factors). Faster randomized Fourier algorithm variants with runtime complexities that scale linearly in the sparsity parameter k are also presented.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied and Computational Harmonic Analysis - Volume 34, Issue 1, January 2013, Pages 57-82
Journal: Applied and Computational Harmonic Analysis - Volume 34, Issue 1, January 2013, Pages 57-82