Fast Fourier transform

Layer 0 — Mathematicsin the numerical-analysis subtree

Cooley-Tukey 1965: DFT in O(n log n) via divide-and-conquer. Bluestein, Rader for non-power-of-two. Convolution theorem → O(n log n) multiplication.

Related concepts

Explore Fast Fourier transform on the interactive knowledge graph →