This is a root approximation software I built for a lab during a course of Information Systems Engineer career. Basically the idea was to implement the most common and well known numerical methods that calculate root approximations.

It is pre populated with some data like the f(x) function, to be studied in the lab, plus tolerance and iterations. All the values can be changed and at the bottom there is a link with the supported functions and constants on f(x) field.

The methods that required a derivative calculation (like Newton and Hybrid) were performed with a central derivative calculation. Hybrid method is a custom algorithm that tries to execute Newton method when convergence is guaranteed, to take advantage of Newton’s speed of convergence, so if convergence is not guaranteed, it executes 1 iteration of the picked method (Bisection or False Position) and evaluates whether Newton convergence can be guaranteed, if not it executes another iteration of the selected method and so on.