The Fast Fourier Transform (FFT)

The Fast Fourier Transform (FFT)

Steve Brunton

4 года назад

343,190 Просмотров

Ссылки и html тэги не поддерживаются


Комментарии:

Suuraj Roshan
Suuraj Roshan - 29.10.2023 14:21

Concepts simplified to the very core. Thank you for the lecture series!

Ответить
Héctor Maciel Contini
Héctor Maciel Contini - 05.10.2023 12:37

Karl Friedrich Gauss must have been, no doubt, one of the smartest men who ever walked the earth. Absolute genius.

Ответить
Casual Drive
Casual Drive - 10.09.2023 19:32

Amazing explanation! But what I couldn't wrap my head around is how can he write backwards so casually ?!

Ответить
Sacco Belmonte
Sacco Belmonte - 13.08.2023 05:06

T-Pain owes his career to FFT

Ответить
Akash Deep
Akash Deep - 06.08.2023 13:37

please help me with this, why for a 10 sec audio, n=4.4x 1000000. what basically 'n' is?

Ответить
Ceeb
Ceeb - 30.07.2023 22:11

I thought the complexity of FFT was n*log2(n) not with a base of 10?

Ответить
Shayan Korki
Shayan Korki - 17.04.2023 18:27

awesome

Ответить
Beats Basteln :3
Beats Basteln :3 - 21.03.2023 14:23

Gauß was majorly underestimating his own work

Ответить
Shaaou X
Shaaou X - 17.03.2023 07:23

So this is just an introduction of FFT? Well I was hoping for learning the details and implementation.

Ответить
Libo Yan
Libo Yan - 31.01.2023 03:21

Dear Prof. Brunton, is FFT mostly used for simple domains problems? (FEM, FVM, Meshless, etc)

Ответить
R W
R W - 25.01.2023 04:45

awesome video and explanation.... how the heck are you writing backwards??

Ответить
Alex
Alex - 20.01.2023 18:09

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

Ответить
Jakub Lizon
Jakub Lizon - 04.01.2023 02:08

Hardware is the physics. Software is the math.

Ответить
Man ju Manl
Man ju Manl - 11.09.2022 03:30

Steve ,you are the best .

Ответить
YawanathanBaqar144k Ba
YawanathanBaqar144k Ba - 04.09.2022 09:44

Wow did this just make me understand scaling the dow Jones day trading ? Very useful information! I wish this guy was my personal teacher!

Ответить
tjpld
tjpld - 27.08.2022 21:43

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.

Ответить
David Cardin
David Cardin - 09.07.2022 01:12

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!

Ответить
AJ
AJ - 31.05.2022 15:34

Great video! Thank you!

Ответить
Guilherme Hastenreiter
Guilherme Hastenreiter - 22.04.2022 00:31

Isn't it O(n(n+1))?

Ответить
Dinesh Vagicharla
Dinesh Vagicharla - 19.03.2022 13:59

No words to express my gratitude for this awesome content

Ответить
Charith Silva
Charith Silva - 01.03.2022 21:59

Thank you so much for these very clear explanations! They are really helpful

Ответить
DGSEM
DGSEM - 01.02.2022 17:31

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.

Ответить
Spiritman Productions
Spiritman Productions - 11.01.2022 16:07

Are we not going to talk about how well this guy writes backwards? 🖊

Ответить
C King
C King - 16.12.2021 18:56

Did he really write mirrored on glass better than I write normal on paper?

Ответить
Antonis Nic
Antonis Nic - 15.12.2021 22:45

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

Ответить
IbadassI
IbadassI - 15.11.2021 16:49

So he's left handed, can you figure out how I figured it out?

Ответить
Jess Konye
Jess Konye - 31.10.2021 21:00

did my man just casually write on the board backwards for us to see it in the correct orientation? Because that's impressive

Ответить
Alice Wonderland
Alice Wonderland - 20.10.2021 22:33

God bless you!

Ответить
Zookaroo
Zookaroo - 14.10.2021 10:10

I wish I could be your student in my uni life 😭 you explained what I need to grasp

Ответить
Luciano Bittencourt
Luciano Bittencourt - 26.08.2021 00:02

Fantastic! What system did u use to produce the lecture?

Ответить
VO Kieu Anh
VO Kieu Anh - 22.08.2021 12:40

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?

Ответить
InferiorPotassium93
InferiorPotassium93 - 19.08.2021 12:57

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.

Ответить
Kraftrad
Kraftrad - 30.06.2021 22:22

Gauss was a freak

Ответить
Rohit Choudhary
Rohit Choudhary - 09.06.2021 19:03

bkchodi krke chala gayam bataya toh nahi ki compute kaise krte h

Ответить
Deon Mitton
Deon Mitton - 08.05.2021 09:46

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.

Ответить
Vinh Nguyễn
Vinh Nguyễn - 07.05.2021 10:27

Ông này viết ngược luôn ghê vch :)) respect!

Ответить
Dat Meme
Dat Meme - 27.04.2021 07:02

FFT, how about that FHT (Fast Handwriting Transform)??? Can you reveal that algorithm?

Ответить
P S
P S - 16.04.2021 15:09

When we say O(nlog(n)) isn't the log base 2? so in the case where n = 1000, log(n) ~= 10 not 3?

Ответить
Michał Urbański
Michał Urbański - 31.03.2021 01:57

awesome, thanks!

Ответить
William Cross
William Cross - 15.03.2021 11:27

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 🙃

Ответить
Hackathon Goofer
Hackathon Goofer - 06.03.2021 06:09

I was just watching this but I kept being distracted and impressed by the fact that you are writing backwards. :O

Ответить
Max Mercer
Max Mercer - 03.03.2021 01:46

Thank you so much, I am so excited to learn when I watch your videos!

Ответить
No longer a weeb
No longer a weeb - 28.02.2021 01:35

If you can right in reverse, you can explain the Fourier transform.

Ответить
AEMERO AYALSEW
AEMERO AYALSEW - 08.02.2021 18:06

you are too brave keep going!!

Ответить
Iason Sideris
Iason Sideris - 05.02.2021 14:53

8 minutes for NOT describing the FFT

Ответить
Vikas Pandey
Vikas Pandey - 31.01.2021 12:50

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.

Ответить
ansrang
ansrang - 02.01.2021 17:05

if I plot the spectral where the X axis is time, do I have to IFFT first? thank you

Ответить
AMENTALTURK3Y
AMENTALTURK3Y - 18.12.2020 13:16

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?

Ответить