GR_DFT_ALG_AUTO, GR_DFT_ALG_NAIVE, GR_DFT_ALG_CT, GR_DFT_ALG_BAILEY, GR_DFT_ALG_SPLIT, GR_DFT_ALG_PFA, GR_DFT_ALG_MIXED, GR_DFT_ALG_BLUESTEIN
#include <flint/gr_dft.h>GR_DFT_ALG_AUTOsourceGR_DFT_ALG_NAIVEsourceGR_DFT_ALG_CTsourceGR_DFT_ALG_BAILEYsourceGR_DFT_ALG_SPLITsourceGR_DFT_ALG_PFAsourceGR_DFT_ALG_MIXEDsourceGR_DFT_ALG_BLUESTEINsourceValues 0 to 7 of the alg argument of the plan constructors: automatic choice, the O(n^2) definition, radix-2 Cooley–Tukey, the four-step algorithm and split-radix (these three for powers of two), the Good–Thomas prime factor algorithm (for lengths with at least two distinct prime factors), mixed-radix Cooley–Tukey (any n \ge 2) and Bluestein's algorithm (odd n \ge 3).
GR_DFT_ALG_AUTO chooses split-radix for powers of two in complex mode (see gr_dft_precomp_init_karatsuba) and radix-2 Cooley–Tukey otherwise, the prime factor algorithm when n has at least two distinct prime factors, and mixed-radix for powers of an odd prime p. For p > 19, mixed-radix computes the transforms of length p with a Bluestein sub-plan when the ring allows it; see Algorithms, complex mode and threads.
Guides#
The FLINT team, “GR_DFT_ALG_AUTO, GR_DFT_ALG_NAIVE, GR_DFT_ALG_CT, GR_DFT_ALG_BAILEY, GR_DFT_ALG_SPLIT, GR_DFT_ALG_PFA, GR_DFT_ALG_MIXED, GR_DFT_ALG_BLUESTEIN (gr_dft.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/gr_dft/GR_DFT_ALG_AUTO.html (generated 2026-10-20).
@misc{flint-doc-gr-dft-GR-DFT-ALG-AUTO,
author = {{The FLINT team}},
title = {{GR\_DFT\_ALG\_AUTO, GR\_DFT\_ALG\_NAIVE, GR\_DFT\_ALG\_CT, GR\_DFT\_ALG\_BAILEY, GR\_DFT\_ALG\_SPLIT, GR\_DFT\_ALG\_PFA, GR\_DFT\_ALG\_MIXED, GR\_DFT\_ALG\_BLUESTEIN (gr\_dft.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/gr_dft/GR_DFT_ALG_AUTO.html},
note = {Generated 2026-10-20}
}