Комментарии:
Concepts simplified to the very core. Thank you for the lecture series!
ОтветитьKarl Friedrich Gauss must have been, no doubt, one of the smartest men who ever walked the earth. Absolute genius.
ОтветитьAmazing explanation! But what I couldn't wrap my head around is how can he write backwards so casually ?!
ОтветитьT-Pain owes his career to FFT
Ответитьplease help me with this, why for a 10 sec audio, n=4.4x 1000000. what basically 'n' is?
ОтветитьI thought the complexity of FFT was n*log2(n) not with a base of 10?
ОтветитьGauß was majorly underestimating his own work
ОтветитьSo this is just an introduction of FFT? Well I was hoping for learning the details and implementation.
ОтветитьDear Prof. Brunton, is FFT mostly used for simple domains problems? (FEM, FVM, Meshless, etc)
Ответитьawesome video and explanation.... how the heck are you writing backwards??
ОтветитьIt is so crazy that Steve wrote every notes from the back, which means every characters and graphs he is writing should be flipped along y axis by 180 degrees
ОтветитьHardware is the physics. Software is the math.
ОтветитьSteve ,you are the best .
ОтветитьWow did this just make me understand scaling the dow Jones day trading ? Very useful information! I wish this guy was my personal teacher!
ОтветитьI just recently read a paper that it's actually faster to just compute the DFT if you're using GPU acceleration, since matrix multiplication is inherently more parallel despite vendors actually providing their own optimized FFT libraries. The performance benefit of DFT is even greater the larger the input compared to the optimized FFT library.
The paper is:
Davuluru, Venkata Salini Priyamvada; Hettiarachchi, Don Lahiru Nirmal; Balster, Eric (2022): Performance Analysis of DFT and FFT Algorithms on Modern GPUs. TechRxiv.
Wow! This is an awesome explanation! Down to earth, straight forward, excellent! BTW - you are quickly, and legibly writing backwards like some kind of Leonardo DaVinci !! What the heck! Incredible!
ОтветитьGreat video! Thank you!
ОтветитьIsn't it O(n(n+1))?
ОтветитьNo words to express my gratitude for this awesome content
ОтветитьThank you so much for these very clear explanations! They are really helpful
ОтветитьAn important point I missed in the video is the Kronecker property for the multivariate case. This enables the use of many 1-dimensional operations instead of one N-dimensional operation. Also called "vec-trick" on tensorproduct elements.
ОтветитьAre we not going to talk about how well this guy writes backwards? 🖊
ОтветитьDid he really write mirrored on glass better than I write normal on paper?
ОтветитьI never understand how you do your videos. How the heck do you write in the air, and how you this invisible board trick. Please explain
ОтветитьSo he's left handed, can you figure out how I figured it out?
Ответитьdid my man just casually write on the board backwards for us to see it in the correct orientation? Because that's impressive
ОтветитьGod bless you!
ОтветитьI wish I could be your student in my uni life 😭 you explained what I need to grasp
ОтветитьFantastic! What system did u use to produce the lecture?
Ответитьa) What is this FFT image called in general? (b) What kind of information can you obtain from the FFT image? (c) Is this same as an electron diffraction pattern?
ОтветитьThis content is amazing, thank you so much for posting this. I knew how to compute a fourier transform of on a defined function but was incredibly confused how computers did it on the sample data they create from analog signals. I had no idea you could do it to discrete data.
ОтветитьGauss was a freak
Ответитьbkchodi krke chala gayam bataya toh nahi ki compute kaise krte h
ОтветитьVery well produced - thank you Steve for this excellent lecture ! FFT is truly what drives the World today... and into the future - with endless applications, in the physical sciences astro, aviation, and medical world.
ОтветитьÔng này viết ngược luôn ghê vch :)) respect!
ОтветитьFFT, how about that FHT (Fast Handwriting Transform)??? Can you reveal that algorithm?
ОтветитьWhen we say O(nlog(n)) isn't the log base 2? so in the case where n = 1000, log(n) ~= 10 not 3?
Ответитьawesome, thanks!
ОтветитьI was wondering who invented FFT so I went to wikipedia, letting the video continue to play while I tuned it out to read. When I tuned back into the video, you were just finishing explaining exactly that. Oops 🙃
ОтветитьI was just watching this but I kept being distracted and impressed by the fact that you are writing backwards. :O
ОтветитьThank you so much, I am so excited to learn when I watch your videos!
ОтветитьIf you can right in reverse, you can explain the Fourier transform.
Ответитьyou are too brave keep going!!
Ответить8 minutes for NOT describing the FFT
ОтветитьThis is what online lectures should be like. Thank you very much Dr. Brunton for sharing these lectures. I can't emphasise enough how amazingly done these are.
Ответитьif I plot the spectral where the X axis is time, do I have to IFFT first? thank you
ОтветитьI was watching a video of a kid drinking a bottle of Gatorade through a toilet paper roll straw. How did I end up here?
Ответить