Octave Programming Lesson 18 - Bisection Method

In an earlier video, I talked about solving LINEAR equations. Solving linear equations is relatively straightforward, as long as the number of independent equations is the same as the number of unknowns, the equations will have only one solution.
Nonlinear equations, on the other hand, are more difficult to solve. Usually, the solution of nonlinear equations is ITERATIVE. This means means that you have to guess a solution, check whether the solution is correct, and then make another guess. You keep guessing and checking until you get a solution to the equations that’s good enough. This process is tedious if performed by hand, but as usual, computers are good at the repetitive processes involved.
There are lots of ways to solve nonlinear equations. In this video, I’ll introduce one of the simplest, the bisection method.
Support us on Patreon: / hvu

[@andrewthebladethrower8371]

If this is the last video on Octave, I would like to thank you sir for such great course. I am truly amazed at how much have been covered, in such clear and well paced manner.

[@amandatartarotti3993]

This class was excelent!

[@biplink9648]

Very concise. Loved it

[@sleepwalker1803]

nice video thanks