Next:
Introduction
NFFT2.0
September 3, 2004
Stefan Kunis and Daniel Potts
University of Lübeck
Institute of Mathematics
D-23560 Lübeck, Germany
{kunis,potts}@math.uni-luebeck.de
Introduction
Notation, the NDFT and the NFFT
NDFT
Direct NDFT
Equispaced knots
Inverse NDFT
NFFT
The ansatz
The window function
The first approximation - cutting off in frequency domain
The second approximation - cutting off in time/spatial domain
The case
The algorithm
Window functions
Further NFFT papers
Inverse NFFT
Library
Installation
Download and make
Options
NFFT - General procedure
Initialisation
Setting knots
Precompute
Doing the transform
Finalisation
Example
NFFT - Parameter
Flags
NFFT - Data
Data layout
Exchanging data
NFFT - Plan
iNFFT - General procedure
iNFFT - Parameter
iNFFT - Plan
User functions
Examples
Accuracy &
CPU-time &
Reconstruction of functions
Bibliography
About this document ...
Stefan Kunis 2004-09-03
![\includegraphics[width=7.5cm]{eps/front_pic1.eps}](img34.png)
![\includegraphics[width=7.5cm]{eps/front_pic2.eps}](img35.png)
