Fast Fourier transform (FFT)

Layer 0 — Mathematicsin the numerical-analysis subtree

Cooley-Tukey divide-and-conquer algorithm computing the discrete Fourier transform in O(N log N) instead of O(N²). Single most widely used algorithm in signal processing and PDE spectral methods.

Related concepts

Explore Fast Fourier transform (FFT) on the interactive knowledge graph →