A note on fast Fourier transforms for nonequispaced grids
A note on fast Fourier transforms for nonequispaced grids
复制标题
DOI：
10.1023/a:1018901926283
复制
发表时间：
1998-01-01
影响因子：
1.7
通讯作者：
Steidl, G
中科院分区：
文献类型：
--
作者：
Steidl, G
本文研究非等间距网格的快速傅立叶变换。我们提出了一个通用的有效的方法快速评估的三角多项式在非等间距节点的多项式的近似的基础上，通过特殊的线性组合的适当的功能CP的翻译。我们得到近似误差的估计。特别地，我们改进了Dutt和Rokhlin [7]给出的估计。作为一个实际的结果，我们得到一个标准的快速变换中所涉及的参数的选择。
In this paper, we are concerned with fast Fourier transforms for nonequispaced grids. We propose a general efficient method for the fast evaluation of trigonometric polynomials at nonequispaced nodes based on the approximation of the polynomials by special linear combinations of translates of suitable functions cp. We derive estimates for the approximation error. In particular, we improve the estimates given by Dutt and Rokhlin [7]. As a practical consequence, we obtain a criterion for the choice of the parameters involved in the fast transforms.