Numerical Analysis – Root Finding Methods
Root finding methods are typically the first topic in a Numerical Analysis course. They give you a way to solve for roots of an equation without a bunch of tedious hand calculations. In addition, these methods provide a good foundation for figuring out the concept of numerical techniques.
Plus, they can also help you improve your coding skills if you’re a beginner! Talk about a bonus!
There are several methods but these tutorials will cover:
- Bisection Method
- Newton’s Method
MATLAB is used for the coding portion in my course. I just love MATLAB and it really makes implementing these methods super easy!
Numerical Analysis Full Course Info
These tutorials are just a small sampling of what’s covered in my full course. The full course covers:
- Root finding methods: Bisection, Newton’s, Secant
- Solving systems of equations: Gaussian Elimination, Gauss Jordan, Modified Gaussian Elimination
- Curve fitting: Least Squares, Polynomial Regression, Lagrange Interpolating Polynomials, Divided Differences, Splines
- Numerical Differentiation: Finite Differences, Lagrange Polynomials
- Numerical Integration: Rectangle, Midpoint, Trapezoidal, Simpson’s
- ODE Initial Value Problems: Euler’s, Modified Euler’s, 2nd, 3rd & 4th Order Runge Kutta
- Downloadable Resources: Outline of Notes, MATLAB files of ALL covered methods
Click the link below to learn more!