Abstract
AbstractIn this paper, we study the nonuniform fast Fourier transform with nonequispaced spatial and frequency data (NNFFT) and the fast sinc transform as its application. The computation of NNFFT is mainly based on the nonuniform fast Fourier transform with nonequispaced spatial nodes and equispaced frequencies (NFFT). The NNFFT employs two compactly supported, continuous window functions. For fixed nonharmonic bandwidth, we show that the error of the NNFFT with two $$\sinh$$
sinh
-type window functions has an exponential decay with respect to the truncation parameters of the used window functions. As an important application of the NNFFT, we present the fast sinc transform. The error of the fast sinc transform is estimated as well.
Funder
Deutsche Forschungsgemeinschaft
European Union
Technische Universität Chemnitz
Publisher
Springer Science and Business Media LLC
Reference19 articles.
1. Abramowitz, M, Stegun, I.A. (eds.): Handbook of Mathematical Functions. National Bureau of Standards, Washington (1972)
2. Alouges, F., Aussal, M.: The sparse cardinal sine decomposition and its application for fast numerical convolution. Numer. Algor. 70(2), 427–448 (2015)
3. Beylkin, G., Monzón, L.: On generalized Gaussian quadratures for exponentials and their applications. Appl. Comput. Harmon. Anal. 12, 332–373 (2002)
4. Dutt, A., Rokhlin, V.: Fast Fourier transforms for nonequispaced data. SIAM J. Sci. Statist. Comput. 14, 1368–1393 (1993)
5. Dutt, A., Rokhlin, V.: Fast Fourier transforms for nonequispaced data II. Appl. Comput. Harmon. Anal. 2, 85–100 (1995)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献