![]() |
NFFT
3.4.0alpha
|
This module implements fast polynomial transforms. More...
Macros | |
#define | FPT_NO_FAST_ALGORITHM (1U << 2) |
If set, TODO complete comment. | |
#define | FPT_NO_DIRECT_ALGORITHM (1U << 3) |
If set, TODO complete comment. | |
#define | FPT_NO_STABILIZATION (1U << 0) |
If set, no stabilization will be used. | |
#define | FPT_PERSISTENT_DATA (1U << 4) |
If set, TODO complete comment. | |
#define | FPT_FUNCTION_VALUES (1U << 5) |
If set, the output are function values at Chebyshev nodes rather than Chebyshev coefficients. | |
#define | FPT_AL_SYMMETRY (1U << 6) |
If set, TODO complete comment. | |
Functions | |
fpt_set | fpt_init (const int M, const int t, const unsigned int flags) |
void | fpt_precompute (fpt_set set, const int m, double *alpha, double *beta, double *gam, int k_start, const double threshold) |
void | fpt_transposed (fpt_set set, const int m, double _Complex *x, double _Complex *y, const int k_end, const unsigned int flags) |
This module implements fast polynomial transforms.
In the following, we abbreviate the term "fast polynomial transforms" by FPT.
fpt_set fpt_init | ( | const int | M, |
const int | t, | ||
const unsigned int | flags | ||
) |
Initializes a set of precomputed data for DPT transforms of equal length.
Definition at line 755 of file fpt.c.
References nfft_malloc(), and X.
Referenced by nfsft_precompute().
void fpt_precompute | ( | fpt_set | set, |
const int | m, | ||
double * | alpha, | ||
double * | beta, | ||
double * | gam, | ||
int | k_start, | ||
const double | threshold | ||
) |
Computes the data required for a single DPT transform.
alpha[k]
beta[k]
gamma[k]
Definition at line 881 of file fpt.c.
References fpt_step_::a22, fpt_data_::alpha_0, fpt_data_::alphaN, fpt_data_::beta_0, fpt_data_::betaN, FPT_NO_FAST_ALGORITHM, fpt_data_::gamma_m1, fpt_data_::gammaN, fpt_data_::k_start, K_START_TILDE, nfft_malloc(), fpt_data_::steps, and X.
Referenced by nfsft_precompute().