Root Finding
Overview
Root finding is the process of finding the inputs at which an algebraic function is zero.
That is, given a function {% f(x) %}, find the value of x such that
{% f(x) = 0 %}
Root finding does not necessarily apply to functions of a single variable.
Algorithms
- Bisection:
The bisection method is a fast method to find the roots of a function through quick narrowing of the search space
- Newton Raphson
- utilizes the derivative of the function in question to quickly estimate the location of the zero, and then proceeds
iteratively to narrow down the value.
