26 #define CSWAP(x,y) {double _Complex * NFFT_SWAP_temp__; \ 27 NFFT_SWAP_temp__=(x); (x)=(y); (y)=NFFT_SWAP_temp__;} 33 double _Complex *slow;
37 M_total=10000;N_total=1;
39 slow=(
double _Complex*)nfft_malloc(M_total*
sizeof(
double _Complex));
51 nnfft_init_guru(&my_plan, d, N_total, M_total, N, n, m,
53 MALLOC_X| MALLOC_V| MALLOC_F_HAT| MALLOC_F);
57 nfft_vrand_shifted_unit_double(my_plan.
x, d*my_plan.
M_total);
58 nfft_vrand_shifted_unit_double(my_plan.
v, d*my_plan.
N_total);
62 nnfft_precompute_psi(&my_plan);
65 nnfft_precompute_lin_psi(&my_plan);
68 nnfft_precompute_full_psi(&my_plan);
72 nnfft_precompute_phi_hut(&my_plan);
78 nnfft_trafo_direct(&my_plan);
83 nnfft_trafo(&my_plan);
86 nfft_error_l_infty_complex(slow, my_plan.
f, M_total),
87 nfft_error_l_infty_1_complex(slow, my_plan.
f, M_total, my_plan.
f_hat,
91 nnfft_finalize(&my_plan);
fftw_complex * f_hat
Fourier coefficients.
unsigned nnfft_flags
flags for precomputation, malloc
double * v
nodes (in fourier domain)
NFFT_INT M_total
Total number of samples.
data structure for an NNFFT (nonequispaced in time and frequency fast Fourier transform) plan with do...
double * x
nodes (in time/spatial domain)
NFFT_INT N_total
Total number of Fourier coefficients.
#define CSWAP(x, y)
Swap two vectors.