37 static void reconstruct(
char* filename,
int N,
int M,
int Z,
int iteration,
int weight, fftw_complex *mem)
45 double tmp, epsilon=0.0000003;
51 my_N[0]=N;my_n[0]=ceil(N*1.2);
52 my_N[1]=N; my_n[1]=ceil(N*1.2);
56 FFTW_MEASURE| FFTW_DESTROY_INPUT);
72 fin=fopen(
"weights.dat",
"r");
75 fscanf(fin,
"%le ",&my_iplan.
w[j]);
87 double r=sqrt(j2*j2+k2*k2);
89 my_iplan.
w_hat[j*N+k]=0.0;
91 my_iplan.
w_hat[j*N+k]=1.0;
97 fin=fopen(filename,
"r");
105 fscanf(fin,
"%le %le %le %le %le ",&my_plan.
x[2*j+0],&my_plan.
x[2*j+1], &tmp,
107 my_iplan.
y[j] = real + _Complex_I*imag;
123 solver_before_loop_complex(&my_iplan);
124 for(l=0;l<iteration;l++)
129 fprintf(stderr,
"%e, %i of %i\n",sqrt(my_iplan.
dot_r_iter),
130 iteration*z+l+1,iteration*Z);
131 solver_loop_one_step_complex(&my_iplan);
133 for(k=0;k<my_plan.
N_total;k++) {
136 mem[(Z*N*N/2+z*N*N+ k)%(Z*N*N)] = my_iplan.
f_hat_iter[k];
143 solver_finalize_complex(&my_iplan);
153 static void print(
int N,
int M,
int Z, fftw_complex *mem)
158 fout_real=fopen(
"output_real.dat",
"w");
159 fout_imag=fopen(
"output_imag.dat",
"w");
162 for (j=0;j<N*N;j++) {
163 fprintf(fout_real,
"%le ",creal(mem[(Z*N*N/2+i*N*N+ j)%(Z*N*N)]) /Z);
164 fprintf(fout_imag,
"%le ",cimag(mem[(Z*N*N/2+i*N*N+ j)%(Z*N*N)]) /Z);
166 fprintf(fout_real,
"\n");
167 fprintf(fout_imag,
"\n");
174 int main(
int argc,
char **argv)
181 printf(
"usage: ./reconstruct FILENAME N M Z ITER WEIGHTS\n");
191 mem = (fftw_complex*)
nfft_malloc(
sizeof(fftw_complex) * atoi(argv[2]) * atoi(argv[2]) * atoi(argv[4]));
194 plan = fftw_plan_many_dft(1, &Z, N*N,
199 FFTW_BACKWARD, FFTW_MEASURE);
202 reconstruct(argv[1],N,M,Z,atoi(argv[5]),atoi(argv[6]),mem);
212 fftw_destroy_plan(plan);
static void print(int N, int M, int Z, fftw_complex *mem)
print writes the memory back in a file output_real.dat for the real part and output_imag.dat for the imaginary part
#define PRECOMPUTE_WEIGHT
double * w
weighting factors
unsigned flags
iteration type
void nfft_precompute_lin_psi(nfft_plan *ths)
double dot_r_iter
weighted dotproduct of r_iter
void nfft_precompute_full_psi(nfft_plan *ths)
void nfft_precompute_psi(nfft_plan *ths)
data structure for an NFFT (nonequispaced fast Fourier transform) plan with double precision ...
NFFT_INT N_total
Total number of Fourier coefficients.
NFFT_INT M_total
Total number of samples.
void * nfft_malloc(size_t n)
void nfft_finalize(nfft_plan *ths)
static void reconstruct(char *filename, int N, int M, int Z, int iteration, int weight, fftw_complex *mem)
reconstruct makes an inverse 2d-nfft for every slice
fftw_complex * y
right hand side, samples
Header file for the nfft3 library.
double * x
Nodes in time/spatial domain, size is doubles.
unsigned flags
Flags for precomputation, (de)allocation, and FFTW usage, default setting is PRE_PHI_HUT | PRE_PSI | ...
data structure for an inverse NFFT plan with double precision
double * w_hat
damping factors
fftw_complex * f_hat_iter
iterative solution