data structure for an NSFFT (nonequispaced sparse fast Fourier transform) plan with long double precision
More...
#include <nfft3.h>
|
|
| FFTW_MANGLE_LONG_DOUBLE (plan) *set_fftw_plan1 |
| | fftw plan for the nfft blocks
|
| |
|
| FFTW_MANGLE_LONG_DOUBLE (plan) *set_fftw_plan2 |
| | fftw plan for the nfft blocks
|
| |
|
| NFFT_INT | N_total |
| | Total number of Fourier coefficients.
|
| |
| NFFT_INT | M_total |
| | Total number of samples.
|
| |
| fftwl_complex * | f_hat |
| | Fourier coefficients.
|
| |
| fftwl_complex * | f |
| | Samples.
|
| |
| void(* | mv_trafo )(void *) |
| | Transform.
|
| |
| void(* | mv_adjoint )(void *) |
| | Adjoint transform.
|
| |
| 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
|
| |
| nfftl_plan * | act_nfft_plan |
| | current nfft block
|
| |
| nfftl_plan * | center_nfft_plan |
| | central nfft block
|
| |
| nfftl_plan * | set_nfft_plan_1d |
| | nfft plans for short nffts
|
| |
| nfftl_plan * | set_nfft_plan_2d |
| | nfft plans for short nffts
|
| |
| long double * | x_transposed |
| | coordinate exchanged nodes, d = 2
|
| |
| long double * | x_102 |
| |
| long double * | x_201 |
| |
| long double * | x_120 |
| |
| long double * | x_021 |
| | coordinate exchanged nodes, d=3
|
| |
data structure for an NSFFT (nonequispaced sparse fast Fourier transform) plan with long double precision
Definition at line 479 of file nfft3.h.
◆ N_total
| NFFT_INT nsfftl_plan::N_total |
Total number of Fourier coefficients.
Definition at line 479 of file nfft3.h.
◆ M_total
| NFFT_INT nsfftl_plan::M_total |
Total number of samples.
Definition at line 479 of file nfft3.h.
◆ f_hat
| fftwl_complex* nsfftl_plan::f_hat |
Fourier coefficients.
Definition at line 479 of file nfft3.h.
| fftwl_complex* nsfftl_plan::f |
◆ mv_trafo
| void(* nsfftl_plan::mv_trafo) (void *) |
Transform.
Definition at line 479 of file nfft3.h.
◆ mv_adjoint
| void(* nsfftl_plan::mv_adjoint) (void *) |
Adjoint transform.
Definition at line 479 of file nfft3.h.
dimension, rank; d = 2, 3
Definition at line 479 of file nfft3.h.
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))
Definition at line 479 of file nfft3.h.
◆ sigma
oversampling-factor
Definition at line 479 of file nfft3.h.
◆ flags
| unsigned nsfftl_plan::flags |
flags for precomputation, malloc
Definition at line 479 of file nfft3.h.
◆ index_sparse_to_full
| int* nsfftl_plan::index_sparse_to_full |
index conversation, overflow for d=3, J=9!
Definition at line 479 of file nfft3.h.
◆ r_act_nfft_plan
| int nsfftl_plan::r_act_nfft_plan |
index of current nfft block
Definition at line 479 of file nfft3.h.
◆ act_nfft_plan
| nfftl_plan* nsfftl_plan::act_nfft_plan |
current nfft block
Definition at line 479 of file nfft3.h.
◆ center_nfft_plan
| nfftl_plan* nsfftl_plan::center_nfft_plan |
central nfft block
Definition at line 479 of file nfft3.h.
◆ set_nfft_plan_1d
| nfftl_plan* nsfftl_plan::set_nfft_plan_1d |
nfft plans for short nffts
Definition at line 479 of file nfft3.h.
◆ set_nfft_plan_2d
| nfftl_plan* nsfftl_plan::set_nfft_plan_2d |
nfft plans for short nffts
Definition at line 479 of file nfft3.h.
◆ x_transposed
| long double* nsfftl_plan::x_transposed |
coordinate exchanged nodes, d = 2
Definition at line 479 of file nfft3.h.
◆ x_102
| long double* nsfftl_plan::x_102 |
◆ x_201
| long double * nsfftl_plan::x_201 |
◆ x_120
| long double * nsfftl_plan::x_120 |
◆ x_021
| long double * nsfftl_plan::x_021 |
coordinate exchanged nodes, d=3
Definition at line 479 of file nfft3.h.
The documentation for this struct was generated from the following file: