Numerical Root Finding: Bisection, Fixed Point and Newton-Raphson Methods

Welcome back! Today we look at how we can find roots of functions that cannot be found analytically (also known as root finding). We do this by deriving the Bisection method, Fixed Point method and Newton-Raphson method. After this, we look at the convergence criterium for each of these. This is just one part of numerical analysis, one of my favourite areas whilst studying a degree in mathematics. I’m planning on doing a few more of these numerical themed videos, ranging from numerical time-stepping to gradient decent! Chapters: 0:00 Bisection Method 2:33 Fixed Point Method 5:00 Newton-Raphson Method 7:20 Convergence Conditions If you find this video useful, please like and share! If you have any questions then ask in the comments! Don't forget to subscribe: https://www.youtube.com/c/Infinium/?s... Infinium ❤️ P.S: I've recently purchased a new microphone to help improve the quality of these videos, so I hope this makes a noticeable improvement!