I really appreciate how you explained each step, makes it very easy to follow. Thank you so much!
@benmc9584
3 жыл бұрын
Thanks for that. Time to implement this for my time-dependent Ginzburg-Landau simulations coupled to the ODE I need to solve! Boomdey!!
@jawadasif8130
Жыл бұрын
amazing
@bloom1898
3 жыл бұрын
this was really good and instructive, thank you very much for the video! ive been studying with quarteroni's numerical mathematics book and sometimes its too raw and i cant visualize how to do the code, this helped me a lot!
@GregWintherArtist
2 жыл бұрын
Thanks for you nice comment! I am not familiar with that book, but looking at the contents it seems very abstract :/
@patrickkormendy8166
3 жыл бұрын
lifesaver
@GregWintherArtist
3 жыл бұрын
@taqikhan5418
3 жыл бұрын
what is the function f doing here?
@es9466
3 жыл бұрын
i like this ;0
@GregWintherArtist
3 жыл бұрын
@girishtripathy3354
3 жыл бұрын
Sir, if we take n = 10000 (very large!) will it give nearest to exact or it overshoots? (if thats possible).
@GregWintherArtist
3 жыл бұрын
Thanks for your question. If we increase n, we would theoretically get a better result, but after a certain point we can get numerical errors. Computers are not able to operate using real numbers expressed with more than a fixed number of digits. When using ForwardEuler we will encounter time constraints before we encounter numerical precision errors, though. I just ran it with n=100000000. No problems, but it took a while: around six minutes on my computer (2.3 GHz Core i9).
@girishtripathy275
3 жыл бұрын
@@GregWintherArtist Okay. I am gonna test it for higher n's (10^10). I am pretty sure my laptop can handle it, have done before for Monte Carlo Methods (got my plot in like 10-15mins).
Пікірлер: 14