The purpose of this program, made in Java, is to do computational root determination in an algebric expression using Newton's Approximation. Newton's Approximation is an algorithm that uses calculus and tangency of curves to quickly find roots. The program allows the user to input expressions using a GUI, and error traps input as it is being inputted (for example invalid bracket proportions). To evaluate expressions I chose to use my own expression parser, which uses tokens and Dijkstra's Shunting-Yard algorithm. Feel free to view the project on GitHub.
This is the main screen of the program, with the solution window.
The following features are present as of version 1.2:
Simple demonstration of the application and how it works.