90 static void simple_test_solver_nfft_1d(
int N,
int M,
int iter)
97 nfft_init_1d(&p, N, M);
104 nfft_precompute_one_psi(&p);
124 solver_before_loop_complex(&ip);
129 printf(
"\n********** Iteration l=%d **********\n",l);
132 "Approximate solution, vector f_hat_iter");
149 printf(
"\n Computing a one dimensional inverse nfft\n");
151 simple_test_solver_nfft_1d(8,4,5);
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 )
double dot_r_iter
weighted dotproduct of r_iter
fftw_complex * f
Vector of samples, size is M_total * sizeof( fftw_complex )
#define NFFT_SWAP_complex(x, y)
Swapping of two vectors.
void nfft_trafo(nfft_plan *ths)
user routines
int M_total
Total number of samples.
Header file for utility functions used by the nfft3 library.
void nfft_vpr_complex(fftw_complex *x, int n, const char *text)
Prints a vector of complex numbers.
void nfft_vrand_shifted_unit_double(double *x, int n)
Inits a vector of random double numbers in .
unsigned nfft_flags
Flags for precomputation, (de)allocation, and FFTW usage, default setting is PRE_PHI_HUT | PRE_PSI | ...
fftw_complex * y
right hand side, samples
double * x
Nodes in time/spatial domain, size is doubles.
void solver_loop_one_step_complex(solver_plan_complex *ths)
void solver_loop_one_step
void solver_finalize_complex(solver_plan_complex *ths)
void solver_finalize
int N_total
Total number of Fourier coefficients.
fftw_complex * f_hat_iter
iterative solution