Fourier Transform#
Sub-package containing Fast Fourier transform routines.
FFT routines include:
centered n-dimensional FFT and iFFT;
n-dimensional sparse uniform FFT/iFFT with embedded low rank subspace projection;
n-dimensional NUFFT with embedded low rank subspace projection.
Centered FFT#
Centered Fast Fourier Transform.  | 
|
Centered inverse Fast Fourier Transform.  | 
Sparse FFT#
N-dimensional sparse Fast Fourier Transform.  | 
|
N-dimensional inverse sparse Fast Fourier Transform.  | 
|
Compute spatio-temporal kernel for fast self-adjoint operation.  | 
|
Apply self-adjoint Fast Fourier Transform via Toeplitz convolution.  | 
Non-Uniform FFT (NUFFT)#
N-dimensional Non-Uniform Fast Fourier Transform.  | 
|
N-dimensional adjoint Non-Uniform Fast Fourier Transform.  | 
|
Compute spatio-temporal kernel for fast self-adjoint operation.  | 
|
Apply self-adjoint Non-Uniform Fast Fourier Transform via Toeplitz Convolution.  |