News for hackers. Stuff that matters.
Re:History and Derivation of the Fast Fourier Transform by btilly on Monday March 20, 2017 @03:09PM (#13916800)
I remember a math professor retiring in the late 1980s, who was giving away all of his books. Looking through them I saw one from the early 1960s that was on numerical methods for certain classes of problems.

Several chapters started off by describing a problem, explaining that ideally you'd do a Fourier transform, and then coming up with a special case hack that worked well enough and performed well enough to actually be done.

The FFT made all of this knowledge obsolete.

Re:History and Derivation of the Fast Fourier Transform by jjoonathan on Monday March 20, 2017 @05:08PM (#13917685)
Especially in math, a distinction is often drawn between

    FT   f(real) -> F(real)
    DFS  f(real) -> F(int)
    DTFT f(int)  -> F(real)
    DFT  f(int)  -> F(int)
Only one of these, the DFT, is easily handled by a computer, but they all have an important role in both theory and practice. For example, why does JPEG use a Discrete Cosine Transform rather than a Discrete Fourier Transform? What are the pitfalls of approximating a continuous domain with discrete samples? Why are engineers obsessed with window functions? A continuous domain will lead you to the right answer. You can't easily understand the DFT (or FFT) without the FT and DFT. DFS has its own uses.

To many (applied) mathematicians, the fact that a computer uses the FFT algorithm to compute a DFT is largely immaterial and not particularly worth mentioning, because they are more interested in the questions in the preceding paragraph than questions like "how many points can I take on X hardware while maintaining Y performance?"