Data Fields |
|
int | N_total |
| | Total number of Fourier coefficients.
|
|
int | M_total |
| | Total number of samples.
|
|
fftw_complex * | f_hat |
| | Vector of Fourier coefficients, size is N_total * sizeof( fftw_complex )
|
|
fftw_complex * | f |
| | Vector of samples, size is M_total * sizeof( fftw_complex )
|
|
void(* | mv_trafo )(void *) |
| | Pointer to the own transform.
|
|
void(* | mv_adjoint )(void *) |
| | Pointer to the own adjoint.
|
|
int | d |
| | dimension, rank; d = 2, 3
|
|
int | J |
| | problem size, i.e., d=2: N_total=(J+4) 2^(J+1) d=3: N_total=2^J 6(2^((J+1)/2+1)-1)+2^(3(J/2+1))
|
|
int | sigma |
| | oversampling-factor
|
|
unsigned | flags |
| | flags for precomputation, malloc
|
|
int * | index_sparse_to_full |
| | index conversation, overflow for d=3, J=9!
|
|
int | r_act_nfft_plan |
| | index of current nfft block
|
|
nfft_plan * | act_nfft_plan |
| | current nfft block
|
|
nfft_plan * | center_nfft_plan |
| | central nfft block
|
|
nfft_plan * | set_nfft_plan_1d |
| | nfft plans for short nffts
|
|
nfft_plan * | set_nfft_plan_2d |
| | nfft plans for short nffts
|
|
double * | x_transposed |
| | coordinate exchanged nodes, d = 2
|
|
double * | x_102 |
|
double * | x_201 |
|
double * | x_120 |
|
double * | x_021 |
| | coordinate exchanged nodes, d=3
|
Detailed Description
Definition at line 451 of file nfft3.h.
The documentation for this struct was generated from the following file:
