data structure for an NFCT (nonequispaced fast cosine transform) plan with double precision
More...
|
| NFFT_INT | N_total |
| | Total number of Fourier coefficients. More...
|
| |
| NFFT_INT | M_total |
| | Total number of samples. More...
|
| |
| double * | f_hat |
| | Fourier coefficients. More...
|
| |
| double * | f |
| | Samples. More...
|
| |
| void(* | mv_trafo )(void *) |
| | Transform. More...
|
| |
| void(* | mv_adjoint )(void *) |
| | Adjoint transform. More...
|
| |
|
NFFT_INT | d |
| | dimension, rank
|
| |
|
NFFT_INT * | N |
| | cut-off-frequencies (kernel)
|
| |
|
NFFT_INT * | n |
| | length of DCT-I
|
| |
| NFFT_INT | n_total |
| | Combined total length of FFTW transforms. More...
|
| |
|
double * | sigma |
| | oversampling-factor
|
| |
|
NFFT_INT | m |
| | cut-off parameter in time-domain
|
| |
|
double * | b |
| | shape parameters
|
| |
| NFFT_INT | K |
| | Number of equispaced samples of window function. More...
|
| |
|
unsigned | flags |
| | flags for precomputation, malloc
|
| |
|
unsigned | fftw_flags |
| | flags for the fftw
|
| |
|
double * | x |
| | nodes (in time/spatial domain)
|
| |
|
double | MEASURE_TIME_t [3] |
| | measured time for each step
|
| |
|
double ** | c_phi_inv |
| | precomputed data, matrix D
|
| |
|
double * | psi |
| | precomputed data, matrix B
|
| |
|
NFFT_INT | size_psi |
| | only for thin B
|
| |
|
NFFT_INT * | psi_index_g |
| | only for thin B
|
| |
|
NFFT_INT * | psi_index_f |
| | only for thin B
|
| |
|
double * | g |
| |
|
double * | g_hat |
| |
|
double * | g1 |
| | input of fftw
|
| |
|
double * | g2 |
| | output of fftw
|
| |
|
double * | spline_coeffs |
| | input for de Boor algorithm, if B_SPLINE or SINC_2m is defined
|
| |
data structure for an NFCT (nonequispaced fast cosine transform) plan with double precision
NFCT transform plan
Definition at line 284 of file nfft3.h.