A smaller step size will result in a smaller error (difference between computed solution and exact solution), but will require more computational time. A larger time step has a larger error, but runs faster. So, the optimal step size is the one that gives you a small enough error for the amount of time you have available.
Actually truncation error's components are local and propagated error, summation of these two gives the global truncation error as far as I know. Am ı wrong?
This is a superb video, how do I get other videos relating to Numerical methods? Thanks for this wonderful work.
Superb video, great for learning or refreshing memory on error analysis for ODE's :)
Much helpful
These other videos are so unhelpful when it comes to error. Thanks for the help sir
+Tebello Mokilane What is unhelpful about the video?
no i think its very helpful compared to the other unhelpful videos ive been watching online. I like it a lot and ive since downloaded it.
Superb...
Very helpful!!! Thank you so much!!!
You are awesome thank you sir ❤🙏
great video, thank you sir.
Great video!
can you provide a few examples for the same
Thanks
Thank you
very helpfull!
hi please i have a qst how to find the optimal step h for euler method ?
A smaller step size will result in a smaller error (difference between computed solution and exact solution), but will require more computational time. A larger time step has a larger error, but runs faster. So, the optimal step size is the one that gives you a small enough error for the amount of time you have available.
Actually truncation error's components are local and propagated error, summation of these two gives the global truncation error as far as I know. Am ı wrong?
I should pay you money instead of my school