Thank you for taking the time to make the video. I was able to understand how you were able to derive your update equation to find the midpoint, but one thing I'm still confused about is how the bounds a , b get updated in each iteration. at 0:26 you mentioned that unlike the bisection method one of the bounds will remain fix while the other will start changing. How do you know which one to fix and which one to vary? how would you update the bounds ?
This is the reason that the regula falsi converges linearly. For concave functions one of the endpoints remains fixed Thus, the interval [an, bn] does not get arbitrarily small. See the first example start from 9:08, one end i.e., a =0 remained fixed.
Thank you for taking the time to make the video. I was able to understand how you were able to derive your update equation to find the midpoint, but one thing I'm still confused about is how the bounds a , b get updated in each iteration. at 0:26 you mentioned that unlike the bisection method one of the bounds will remain fix while the other will start changing. How do you know which one to fix and which one to vary? how would you update the bounds ?
This is the reason that the regula falsi converges linearly. For concave functions one of the endpoints remains fixed Thus, the interval [an, bn] does not get arbitrarily small. See the first example start from 9:08, one end i.e., a =0 remained fixed.
Mam can you make video on topic Interpolation.divided difference Runge kutta method ..plss mam
Sure