Journal
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
Volume 36, Issue 4, Pages -Publisher
ASSOC COMPUTING MACHINERY
DOI: 10.1145/1555386.1555388
Keywords
Algorithms; Documentation; Theory; Fast Fourier transforms; approximative algorithms
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
