The Fast Fourier Transform | How does it (actually) work?

🤝 Want your team maximizing Claude? I run 1:1 and team AI workshops for companies doing $1M+ per year: https://aibuilder.academy/yt/rPUytg38b6Q The second video in a 3-part series on Fourier and Wavelet Transforms. This video dives a little deeper into the Fast Fourier Transform (FFT). Series Playlist: https://www.youtube.com/playlist?list=PLz-ep5RbHosUonv5PYA7ENqkjLHMk2Sdg 📰 Read more: https://medium.com/swlh/the-fast-fourier-transform-fft-5e96cf637c38?sk=36410c8fde91b0ecc3d0c2d8bf2220cf 💻 Example code: https://github.com/ShawhinT/YouTube/tree/main/FFT Data Smoothing with FFT: https://youtu.be/-5c1KO-JF_s Videos I found helpful: - https://www.youtube.com/watch?v=toj_IoCQE-4&list=PL8ujJMJICf9mC9eF2-JUKyqjinEZL5f0s&index=17&t=342s&ab_channel=SteveBrunton - https://www.youtube.com/watch?v=M0Sa8fLOajA&list=PL8ujJMJICf9mC9eF2-JUKyqjinEZL5f0s&index=18&t=2396s&ab_channel=MITOpenCourseWare Introduction - 0:00 Discrete Fourier Transform (DFT) - 0:23 DFT in Matrix Form - 1:16 DFT Matrix Example - 2:48 More Fourier Matrices - 4:05 Fast Fourier Transform (FFT) - 4:39 FFT Example - 8:41 Example: The harmonic series - 9:50 Closing Remarks - 11:44