void
memfry(uint8_t *m, size_t nmems)
{
size_t i;
for(i = 0; i < nmems; ++i)
CSWAP(m[0], m[rand()%nmems]);
}
static void simple_test_innfft_1d(void)
{
int j,k,l,N=8; /**< index for nodes, freqencies, iter*/
nnfft_plan my_plan; /**< plan for the nnfft */
solver_plan_complex my_iplan; /**< plan for the inverse nnfft */
/** initialise an one dimensional plan */
nnfft_init(&my_plan,1 ,8 ,8 ,&N);
/** initialise my_iplan */
solver_init_advanced_complex(&my_iplan,(nfft_mv_plan_complex*)(&my_plan),CGNR);
/** init pseudo random nodes */
for(j=0;j<my_plan.M_total;j++)
my_plan.x[j]=((double)rand())/((double)RAND_MAX)-0.5;
/** init pseudo random nodes */
for(k=0;k<my_plan.N_total;k++)
my_plan.v[k]=((double)rand())/((double)RAND_MAX)-0.5;
/** precompute psi, the entries of the matrix B */
if(my_plan.nnfft_flags & PRE_PSI)
nnfft_precompute_psi(&my_plan);
if(my_plan.nnfft_flags & PRE_FULL_PSI)
nnfft_precompute_full_psi(&my_plan);
/** precompute phi_hut, the entries of the matrix D */
if(my_plan.nnfft_flags & PRE_PHI_HUT)
nnfft_precompute_phi_hut(&my_plan);
/** init pseudo random samples (real) and show them */
for(j=0;j<my_plan.M_total;j++)
my_iplan.y[j] = ((double)rand())/((double)RAND_MAX);
nfft_vpr_complex(my_iplan.y,my_plan.M_total,"given data, vector given_f");
/** initialise some guess f_hat_0 */
for(k=0;k<my_plan.N_total;k++)
my_iplan.f_hat_iter[k] = 0.0;
nfft_vpr_complex(my_iplan.f_hat_iter,my_plan.N_total,
"approximate solution, vector f_hat_iter");
/** solve the system */
solver_before_loop_complex(&my_iplan);
for(l=0;l<8;l++)
{
printf("iteration l=%d\n",l);
solver_loop_one_step_complex(&my_iplan);
nfft_vpr_complex(my_iplan.f_hat_iter,my_plan.N_total,
"approximate solution, vector f_hat_iter");
CSWAP(my_iplan.f_hat_iter,my_plan.f_hat);
nnfft_trafo(&my_plan);
nfft_vpr_complex(my_plan.f,my_plan.M_total,"fitting the data, vector f");
CSWAP(my_iplan.f_hat_iter,my_plan.f_hat);
}
solver_finalize_complex(&my_iplan);
nnfft_finalize(&my_plan);
}
