The aim of this app is to apply different root finding algorithms, compare and analyse their behaviour. It supports the following root finding algorithms:-
- Bisection
- False-Position
- Newton-Raphson
- Secant
- Fixed-Point
- Birge-Vieta
The user can choose to solve an equation using one or multiple methods, and also provide each method with its required parameters.
In addition to the previous methods, the app supports root finding using a general method where no parameters are required. The general method works as follows:
- It starts by first generating a random number as an initial guess
- It proceeds by testing the fixed-point convergence criteria, and applies it if true
- If the latter was a false condition, a solution is generated using the modified-Newton-Raphson method
- If no solution found, repeat
And for the method not to get stuck in an infinite loop in the case of no solution after several unsuccessful trials, another stopping criteria was added which is a one-minute time limit for the algorithm to find the most accurate answer possible or else raise an error flag.
- Saving and loading in JSON file formats
- Plotting equations, boundaries for all iterations, errors and roots.
- Displaying the input equation in LaTeX
- Specifying max number of iterations and epsilon as stopping criterias
- Displaying results of each iteration in a table (root, abs error, etc)
- Calculation of precision, execution time and error bound for some methods
- SymPy
- NumPy
- PyQt4
- MatPlotLib
