30 void nfsft_benchomp_createdataset(
unsigned int trafo_adjoint,
int N,
int M)
35 int N_total = (2*N+2) * (2*N+2);
47 for (j = 0; j < M; j++)
49 x[2*j]=
X(drand48)() - K(0.5);
50 x[2*j+1]= K(0.5) *
X(drand48)();
55 for (k = 0; k <= N; k++)
56 for (n = -k; n <= k; n++)
64 printf(
"%d %d %d\n", trafo_adjoint, N, M);
69 printf(
"%.16e ", x[2*j+t]);
75 for (k = 0; k <= N; k++)
76 for (n = -k; n <= k; n++)
82 printf(
"%.16e %.16e\n", creal(f[j]), cimag(f[j]));
90 int main(
int argc,
char **argv)
97 fprintf(stderr,
"usage: tr_adj N M\n");
101 trafo_adjoint = atoi(argv[1]);
102 if (trafo_adjoint < 0 && trafo_adjoint > 1)
107 fprintf(stderr,
"tr_adj=%d, N=%d, M=%d\n", trafo_adjoint, N, M);
109 nfsft_benchomp_createdataset(trafo_adjoint, N, M);
#define NFSFT_MALLOC_F_HAT
#define NFSFT_PRESERVE_F_HAT
data structure for an NFSFT (nonequispaced fast spherical Fourier transform) plan with double precisi...
void nfft_vrand_unit_complex(fftw_complex *x, const NFFT_INT n)
Inits a vector of random complex numbers in .
#define X(name)
Include header for C99 complex datatype.
void * nfft_malloc(size_t n)
Header file for the nfft3 library.
#define NFSFT_INDEX(k, n, plan)