Using NFFT 3-A Software Library for Various Nonequispaced Fast Fourier Transforms

被引：261

作者：

Keiner, Jens ^{[1
]}

Kunis, Stefan ^{[2
]}

Potts, Daniel ^{[2
]}

机构：

[1] Med Univ Lubeck, D-23560 Lubeck, Germany

[2] Tech Univ Chemnitz, D-09107 Chemnitz, Germany

来源：

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE | 2009年 / 36卷 / 04期

关键词：

Algorithms; Documentation; Theory; Fast Fourier transforms; approximative algorithms; FAST ALGORITHMS; FAST SUMMATION; GRIDDING RECONSTRUCTION; INTERPOLATION; CONVOLUTION; COMPUTATION;

D O I：

10.1145/1555386.1555388

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

NFFT 3 is a software library that implements the nonequispaced fast Fourier transform ( NFFT) and a number of related algorithms, for example, nonequispaced fast Fourier transforms on the sphere and iterative schemes for inversion. This article provides a survey on the mathematical concepts behind the NFFT and its variants, as well as a general guideline for using the library. Numerical examples for a number of applications are given.

引用

页数：30

共 69 条

[1]

Abramowitz M., 1972, HDB MATH FUNCTIONS

[2] Rapid computation of the discrete Fourier transform [J].