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));
78 nnfft_trafo_direct(&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,
void nnfft_precompute_psi(nnfft_plan *ths_plan)
fftw_complex * f_hat
Fourier coefficients.
unsigned nnfft_flags
flags for precomputation, malloc
double * v
nodes (in fourier domain)
void nnfft_trafo(nnfft_plan *ths_plan)
user routines
void nfft_vrand_shifted_unit_double(double *x, const NFFT_INT n)
Inits a vector of random double numbers in .
void nnfft_precompute_phi_hut(nnfft_plan *ths_plan)
initialisation of direct transform
void nnfft_precompute_full_psi(nnfft_plan *ths_plan)
computes all entries of B explicitly
void nnfft_precompute_lin_psi(nnfft_plan *ths_plan)
create a lookup table
void nfft_vrand_unit_complex(fftw_complex *x, const NFFT_INT n)
Inits a vector of random complex numbers in .
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)
void * nfft_malloc(size_t n)
NFFT_INT N_total
Total number of Fourier coefficients.
Header file for the nfft3 library.
void nnfft_init_guru(nnfft_plan *ths_plan, int d, int N_total, int M_total, int *N, int *N1, int m, unsigned nnfft_flags)
void nnfft_finalize(nnfft_plan *ths_plan)
#define CSWAP(x, y)
Swap two vectors.