Revision #787 → #1213 · back to history
addedDiscrete Fourier transform (DFT)51de51fe8f97
addedFast Fourier transform (FFT)5fa4b07565a6
addedDirect DFT evaluation cost861703d55365
addedCooley–Tukey algorithmc95d698be950
addedPrime-factor (Good–Thomas) algorithm7a99f4ab48e4
addedRader–Brenner algorithm02fd0af08054
addedBruun's algorithmeb46d163c5e7
addedWinograd FFT algorithme2f1b6c5fb91
addedWinograd minimal-multiplication bound99352f31423f
addedRader's algorithm18bf44c9bff1
addedBluestein's chirp-z algorithm0d74fea89425
addedHexagonal FFT (HFFT)ee79e49a7224
addedReal-input DFT symmetry11c5f1336f6a
addedWinograd lower bound on real multiplicationsdda9380d2571
addedMorgenstern lower bound on additionsa86ed2e6c729
addedPan asynchronicity lower boundbd70a258bb72
addedPapadimitriou optimality of Cooley–Tukey additionsf5d3fa8450eb
addedSplit-radix arithmetic complexitye84634bd77ae
addedSparse-input FFT complexity32a586f727d7
addedCooley–Tukey relative error boundc6e8e0a988ef
addedFixed-point Cooley–Tukey error growthf9de5046eed1
addedRandomized FFT correctness verification6861e9ea5dc8
addedMultidimensional DFT3c4711562d2e
addedRow-column algorithm70bc1f7eb7c2
addedVector-radix FFT algorithmd4a777eba563
addedSpherical harmonic FFT on S²d15885cfcfa0
addedFast folding algorithm0a2653d172d7
addedQuantum FFT9a45e229fab5