Step-wise Methods and Error Propagation

[@2TheAbbeyClinic]

Thank you, each of your vids teaches me something new and important. Great work!

[@skankhunt-zw6gg]

@16:27, I don't think you have proved that Local Truncation Error does accumulate. I mean @06:00, you have proved that as we decrease step size (h- from 0.01 to 0.001), error decreases. Even at @11:45, we have seen how error varies with the step size. So where was LTE shown?

[@gaming4life25]

I was also thinking the same thing...

[@shubhanand3791]

If I'm not wrong LTE is basically from Maclaurin Series Exp Error calculated where as no. of terms increases slope increases with factor of n+1 i.e explained in Lec 2.2

[@jeetendrakumarpanda8874]

idk if i am going to get a reply here but i am still going to ask a doubt . You said that if we decrease the step size (h) for a factor of x then the error also decreases . Is it valid for numerical methods like Trapezoidal method and Simpsons methods ?.

[@skankhunt-zw6gg]

Sir, @03:19, don't you think the trueVal=exp(a) is not actually 'trueVal'?

[@sayanjitb]

Then what is it, you think? That is, the computer calculated value without approximations involved.

[@jagangorlakunta1919]

the computer(matlab) would have an e value possibly with a roundoff error