data structure for an NFSFT (nonequispaced fast spherical Fourier transform) plan with long double precision More...

#include <nfft3.h>

Data Fields
NFFT_INT	N_total
	Total number of Fourier coefficients. More...

NFFT_INT	M_total
	Total number of samples. More...

fftwl_complex *	f_hat
	Fourier coefficients. More...

fftwl_complex *	f
	Samples. More...

void(*	mv_trafo )(void *)
	Transform. More...

void(*	mv_adjoint )(void *)
	Adjoint transform. More...

int	N
	the bandwidth

long double *	x
	the nodes $\mathbf{x}(m) = \left(x_1,x_2\right) \in [-\frac{1}{2},\frac{1}{2}) \times [0,\frac{1}{2}]$ for $m=0,\ldots, M-1$ , $M \in \mathbb{N},$

int	t
	the logarithm of NPT with respect to the basis 2

unsigned int	flags
	the planner flags

nfftl_plan	plan_nfft
	the internal NFFT plan

fftwl_complex *	f_hat_intern
	Internally used pointer to spherical Fourier coefficients.

double	MEASURE_TIME_t [3]
	Measured time for each step if MEASURE_TIME is set.