|
\hat{f}_k = \sum_{0 \le j < N} f_j \exp(2 \pi i k x_j) |
Signature: nfft.nfft_adjoint(x, f, N, sigma=3, tol=1e-08, m=None, kernel='gaussian', use_fft=True, truncated=True)
Docstring:
Compute the adjoint nonuniform fast Fourier transform
\hat{f}k = \sum{0 \le j < N} f_j \exp(2 \pi i k x_j)
SHOULD BE
\hat{f}k = \sum{0 \le j < M} f_j \exp(2 \pi i k x_j) # where len(x)==M
where k = range(-N/2, N/2)
nfft/nfft/core.py
Line 46 in d432385
Signature: nfft.nfft_adjoint(x, f, N, sigma=3, tol=1e-08, m=None, kernel='gaussian', use_fft=True, truncated=True)
Docstring:
Compute the adjoint nonuniform fast Fourier transform
\hat{f}k = \sum{0 \le j < N} f_j \exp(2 \pi i k x_j)
SHOULD BE
\hat{f}k = \sum{0 \le j < M} f_j \exp(2 \pi i k x_j) # where len(x)==M
where k = range(-N/2, N/2)