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));
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);
61 if(my_plan.nnfft_flags &
PRE_PSI)
75 nfft_vrand_unit_complex(my_plan.f_hat, my_plan.N_total);
78 nnfft_trafo_direct(&my_plan);
80 CSWAP(my_plan.f,slow);
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,
#define CSWAP(x, y)
Swap two vectors.
void nnfft_precompute_full_psi(nnfft_plan *ths)
computes all entries of B explicitly
void nnfft_finalize(nnfft_plan *ths)
void nnfft_precompute_phi_hut(nnfft_plan *ths)
initialisation of direct transform
void nnfft_precompute_lin_psi(nnfft_plan *ths)
create a lookup table
void nnfft_precompute_psi(nnfft_plan *ths)
void nnfft_init_guru(nnfft_plan *ths, int d, int N_total, int M_total, int *N, int *N1, int m, unsigned nnfft_flags)
void nnfft_trafo(nnfft_plan *ths)
user routines
Header file for the nfft3 library.