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

Authors:
Jens Keiner;Stefan Kunis;Daniel Potts
Affiliations:
University of Lübeck;Chemnitz University of Technology;Chemnitz University of Technology
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
2009

Citing 19
Cited 5

Computational frameworks for the fast Fourier transform

Computational frameworks for the fast Fourier transform
Fast Fourier transforms for nonequispaced data

SIAM Journal on Scientific Computing
Regular Article: Computing Fourier Transforms and Convolutions on the 2-Sphere

Advances in Applied Mathematics
Efficient numerical methods in non-uniform sampling theory

Numerische Mathematik
Rapid computation of the discrete Fourier transform

SIAM Journal on Scientific Computing
Fast Discrete Polynomial Transforms with Applications to Data Analysis for Distance Transitive Graphs

SIAM Journal on Computing
Fast algorithms for discrete polynomial transforms

Mathematics of Computation
Fast Approximate Fourier Transforms for Irregularly Spaced Data

SIAM Review
The Regular Fourier Matrices and Nonuniform Fast Fourier Transforms

SIAM Journal on Scientific Computing
A fast spherical harmonics transform algorithm

Mathematics of Computation
Fast spherical Fourier algorithms

Journal of Computational and Applied Mathematics
Fast convolution with radial kernels at nonequispaced knots

Numerische Mathematik
The fast Gauss transform with complex parameters

Journal of Computational Physics
Short Note: The type 3 nonuniform FFT and its applications

Journal of Computational Physics
Fast Algorithms for Spherical Harmonic Expansions

SIAM Journal on Scientific Computing
Combined Complex Ridgelet Shrinkage and Total Variation Minimization

SIAM Journal on Scientific Computing
Fast Summation of Radial Functions on the Sphere

Computing
Stability Results for Scattered Data Interpolation by Trigonometric Polynomials

SIAM Journal on Scientific Computing
Nonuniform fast Fourier transforms using min-max interpolation

IEEE Transactions on Signal Processing

Nonequispaced Hyperbolic Cross Fast Fourier Transform

SIAM Journal on Numerical Analysis
Interpolation lattices for hyperbolic cross trigonometric polynomials

Journal of Complexity
Nonlinear Approximation by Sums of Exponentials and Translates

SIAM Journal on Scientific Computing
Efficient Calculations of 3-D FFTs on Spiral Contours

Journal of Scientific Computing
Quadrature nodes meet stippling dots

SSVM'11 Proceedings of the Third international conference on Scale Space and Variational Methods in Computer Vision

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.