The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?
Reducible · 4 位 HN 用户推荐 · 2021–2026
There's a great video on this topic: [link]
— nayuki, 2021... in the respective context. If we look at the discrete case, since the operation of convolution is computationally expensive (O(n^3)), people often rely on the Fast Fourier Transform Algorithm (FFT), that runs in O(n log(n)). An excellent and very enjoyable video on the FFT applied to the polynomial multiplication is [link] .
— squaredot, 2022If you haven’t seen it yet, you should watch this video: [link]
— tverbeure, 2024For anyone interested and with 30 minutes to spare, I would recommend the [link] video [1] by Reducible for an intuition on how FFT works. [1]: [link]
— medbar, 2026