Something went wrong
An error occurred, please try again later.
2. Fast Fourier transforms
From Jeff Erickson 8/25/2022
388 plays
388
0 comments
0
Related Media
- Representing polynomials as coefficients, roots, or sample values
- Converting from coefficients to samples is a linear transformation
- Divide-and-conquer via collapsible points
- Complex roots of unity are collapsible
- FFT = O(n log n) time conversion from coefficients to values at roots of unity
- FFT is almost its own inverse.
- Tags
- Date of creation
- 8/25/2022 12:00 AM
- Appears In
Loading