![]() |
NFFT 3.5.3alpha
|
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. | |
This module implements fast polynomial transforms.
In the following, we abbreviate the term "fast polynomial transforms" by FPT.
Let
for
Let
into Chebyshev coefficients
#define FPT_NO_FAST_ALGORITHM (1U << 2) |
#define FPT_NO_DIRECT_ALGORITHM (1U << 3) |
#define FPT_NO_STABILIZATION (1U << 0) |
#define FPT_PERSISTENT_DATA (1U << 4) |
#define FPT_FUNCTION_VALUES (1U << 5) |