37 double _Complex *slow;
41 M_total=10000;N_total=1;
43 slow=(
double _Complex*)
nfft_malloc(M_total*
sizeof(
double _Complex));
55 nnfft_init_guru(&my_plan, d, N_total, M_total, N, n, m,
57 MALLOC_X| MALLOC_V| MALLOC_F_HAT| MALLOC_F);
66 nnfft_precompute_psi(&my_plan);
82 nnfft_trafo_direct(&my_plan);
90 X(error_l_infty_complex)(slow, my_plan.
f, M_total),
91 X(error_l_infty_1_complex)(slow, my_plan.
f, M_total, my_plan.
f_hat,
95 nnfft_finalize(&my_plan);
int M_total
Total number of samples.
void nfft_vrand_unit_complex(fftw_complex *x, int n)
Inits a vector of random complex numbers in .
fftw_complex * f_hat
Vector of Fourier coefficients, size is N_total * sizeof( fftw_complex )
void nnfft_precompute_full_psi(nnfft_plan *ths_plan)
computes all entries of B explicitly
unsigned nnfft_flags
flags for precomputation, malloc
fftw_complex * f
Vector of samples, size is M_total * sizeof( fftw_complex )
double * v
nodes (in fourier domain)
void nnfft_trafo(nnfft_plan *ths_plan)
user routines
#define NFFT_SWAP_complex(x, y)
Swapping of two vectors.
Header file for utility functions used by the nfft3 library.
void nnfft_precompute_phi_hut(nnfft_plan *ths_plan)
initialisation of direct transform
int N_total
Total number of Fourier coefficients.
double * x
nodes (in time/spatial domain)
void nfft_vrand_shifted_unit_double(double *x, int n)
Inits a vector of random double numbers in .
void * nfft_malloc(size_t n)
void nnfft_precompute_lin_psi(nnfft_plan *ths_plan)
create a lookup table