- Karnaugh Map
- Synthetic Division
- Colorimetric Analysis
- Newton Raphson
- Strava Wind Impact
- Slope Field Generator
- Atomic Smasher
- Basilisk 3D
- Tower of Hanoi
- Additional Projects

- Karnaugh Map
- Synthetic Division
- Colorimetric Analysis
- Newton Raphson
- Strava Wind Impact
- Slope Field Generator
- Atomic Smasher
- Basilisk 3D
- Tower of Hanoi
- Additional Projects

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:

Nice interface to input equation (inspired by Apple's calculator design)
All input is error trapped right when entered by the user
Expressions evaluated from infix form and later converted
User's estimate is error-trapped to prevent guessing when the tangent is equal to zero
Can compute over 1,000 iterations of Newton's method
Supports various different trignometric functions
Uses OOP (Object Oriented Programming) principles
Easy to use graphical user interface
Program Documentation

Simple demonstration of the application and how it works.