Rapid computation of the discrete Fourier transform

被引：41

作者：

Anderson, C ^{[1
]}

Dahleh, MD ^{[1
]}

机构：

[1] UNIV CALIF LOS ANGELES,DEPT MATH,LOS ANGELES,CA 90024

来源：

SIAM JOURNAL ON SCIENTIFIC COMPUTING | 1996年 / 17卷 / 04期

关键词：

iterative methods; nonuniform-fast Fourier transform;

D O I：

10.1137/0917059

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Algorithms for the rapid computation of the forward and inverse discrete Fourier transform for points which are nonequispaced or whose number is unrestricted are presented. The computational procedure is based on approximation using a local Taylor series expansion and the fast Fourier transform (FFT). The forward transform for nonequispaced points is computed as the solution of a linear system involving the inverse Fourier transform. This latter system is solved using the iterative method GMRES with preconditioning. Numerical results are given to confirm the efficiency of the algorithms.

引用

页码：913 / 919

页数：7