Bruun's algorithm is a fast Fourier transform (FFT) algorithm based on an unusual recursive polynomial-factorization approach, proposed for powers of...
13 KB (2,211 words) - 21:23, 4 June 2025
Fast Fourier transform (redirect from FFT algorithm)
A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT). A Fourier transform...
67 KB (7,809 words) - 05:39, 1 July 2025
Bluestein's FFT algorithm Bruun's FFT algorithm Cooley–Tukey FFT algorithm Fast Fourier transform Prime-factor FFT algorithm Rader's FFT algorithm Fast folding...
72 KB (7,951 words) - 17:13, 5 June 2025
List of numerical analysis topics (redirect from List of eigenvalue algorithms)
transform (FFT) — a fast method for computing the discrete Fourier transform Bluestein's FFT algorithm Bruun's FFT algorithm Cooley–Tukey FFT algorithm Split-radix...
70 KB (8,327 words) - 09:12, 7 June 2025
1978 – LZ78 algorithm developed from LZ77 by Abraham Lempel and Jacob Ziv 1978 – Bruun's algorithm proposed for powers of two by Georg Bruun 1979 – Khachiyan's...
20 KB (2,080 words) - 00:53, 13 May 2025
Discrete Hartley transform (section Fast algorithms)
Winograd (1985) to Bruun's (1993), has a direct analogue for the discrete Hartley transform. (However, a few of the more exotic FFT algorithms, such as the...
23 KB (4,188 words) - 15:25, 25 February 2025