27 static void simple_test_nsfft(
int d,
int J,
int M)
39 nsfft_trafo_direct(&p);
47 nsfft_adjoint_direct(&p);
58 int main(
int argc,
char **argv)
63 printf(
"1) computing a two dimensional nsdft, nsfft and adjoints\n\n");
66 M=(J+4)*nfft_exp2i(J+1);
67 simple_test_nsfft(d,J,M);
71 printf(
"2) computing a three dimensional nsdft, nsfft and adjoints\n\n");
74 M=6*nfft_exp2i(J)*(nfft_exp2i((J+1)/2+1)-1)+nfft_exp2i(3*(J/2+1));
75 simple_test_nsfft(d,J,M);
void nsfft_init(nsfft_plan *ths, int d, int J, int M, int m, unsigned flags)
void nfft_vpr_complex(fftw_complex *x, const NFFT_INT n, const char *text)
Print complex vector to standard output.
void nsfft_init_random_nodes_coeffs(nsfft_plan *ths)
void nsfft_adjoint(nsfft_plan *ths)
Header file for the nfft3 library.
void nsfft_finalize(nsfft_plan *ths)
void nsfft_trafo(nsfft_plan *ths)
data structure for an NSFFT (nonequispaced sparse fast Fourier transform) plan with double precision ...
fftw_complex * f_hat
Fourier coefficients.