8.4, due Nov. 30

Difficult:
I had a hard time following the proof of the fast Fourier Transform algorithm. I did think it was neat that we were able to take advantage of mathematical symmetry to improve performance from O(n^2) to O(nlogn)!

Reflective:
I thought it was pretty cool that because the DFT can be represented as an orthonormal, it is not only invertible, but very easy to invert!

Comments

Popular posts from this blog

8.7, due December 6

8.5, due Dec 3

8.6, due Dec 5