FFT Example: Unraveling the Recursion
This video is meant as further support to the main video on the FFT https://youtu.be/h7apO7q16V0
We break down how the FFT evaluates a particular polynomial at the roots of unity by unraveling the recursive process completely.
0:00 Introduction
1:13 FFT Example Breakdown
Support: https://www.patreon.com/reducible
This video wouldn't be possible without the open source manim library created by 3blue1brown: https://github.com/3b1b/manim
Here is link to the repository that contains the code used to generate the animations in this video: https://github.com/nipunramk/Reducible
Music:
All music by Aakash Gandhi
Видео FFT Example: Unraveling the Recursion канала Reducible
We break down how the FFT evaluates a particular polynomial at the roots of unity by unraveling the recursive process completely.
0:00 Introduction
1:13 FFT Example Breakdown
Support: https://www.patreon.com/reducible
This video wouldn't be possible without the open source manim library created by 3blue1brown: https://github.com/3b1b/manim
Here is link to the repository that contains the code used to generate the animations in this video: https://github.com/nipunramk/Reducible
Music:
All music by Aakash Gandhi
Видео FFT Example: Unraveling the Recursion канала Reducible
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
A Preview for Data Structures and AlgorithmsWhat Actually Is a Data Structure?Breadth First Search (BFS): Visualized and ExplainedBuilding Collision Simulations: An Introduction to Computer GraphicsDepth First Search (DFS) Explained: Algorithm, Examples, and CodeIntroduction to Graph Theory: A Computer Science PerspectivePageRank: A Trillion Dollar AlgorithmHuffman Codes: An Information Theory PerspectiveThe Unreasonable Effectiveness of JPEG: A Signal Processing ApproachThe Discrete Fourier Transform: Most Important Algorithm Ever?The Traveling Salesman Problem: When Good Enough Beats PerfectWhat Is Big O Notation?How PNG Works: Compromising Speed for Quality5 Simple Steps for Solving Any Recursive ProblemA Strange But Elegant Approach to a Surprisingly Hard Problem (GJK Algorithm)The Simple and Elegant Idea behind Efficient Dynamic ArraysHow Computers Draw Weird Shapes (Marching Squares)The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?Towers of Hanoi: A Complete Recursive Visualization5 Simple Steps for Solving Dynamic Programming Problems