I really enjoyed learning the different aspects of Fourier transforms from "The Scientist and Engineer's Guide to Digital Signal Processing", a free online book: https://www.dspguide.com/pdfbook.htm
The matrix approach for calculating the DFT also gives us a nice way to proof that the DFT can always be inverted. We just need to show that matrix F is always (for any positive integer N) invertible.
That can be proved in a number of ways. E.g. showing that det(F)!=0 or showing linear independence of the columns of F is sufficient.
During college, this guy had some banger articles. Had completely forgotten about the blog.
Now I check it and the burning question.. is it full of AI slop/psychosis (i.e. similar to the https://nullprogram.com guy..) Seems to have escaped the scourge.
That can be proved in a number of ways. E.g. showing that det(F)!=0 or showing linear independence of the columns of F is sufficient.
(For DFT there are different scaling conventions which may be taken into account.)
Now I check it and the burning question.. is it full of AI slop/psychosis (i.e. similar to the https://nullprogram.com guy..) Seems to have escaped the scourge.
Likely made enough $ at GOOG to retire.
AI is very useful for brainstorming, checking the math, helping with some of the visualizations etc.