This repository contains Java implementations of fundamental numerical methods for solving nonlinear equations.
The project was developed as part of the Numerical Methods (Sayısal Analiz) course during my second year of Computer Engineering.
Each algorithm is implemented in a separate Java file and can be executed independently.
| Algorithm | Description |
|---|---|
| Bisection Method | Root finding by repeatedly dividing an interval in half. |
| False Position Method | Root finding using linear interpolation between interval endpoints. |
| Newton-Raphson Method | Root approximation using derivatives for faster convergence. |
| Fixed Point Iteration | Solves equations through repeated function evaluation. |
- Implemented using Java
- Each algorithm is contained in its own Java file
- Each file includes its own
main()method - Console-based user input
- Supports:
- Initial guess or interval values
- Tolerance (ε)
- Maximum iterations
- Displays the approximated root
- Provides iteration details for convergence analysis
Numerical-Methods/
│
├── Bisection.java
├── FalsePosition.java
├── NewtonRaphson.java
└── FixedPointIteration.java
Example output from the Newton-Raphson Method, showing the iteration process and convergence.
- Open the project using a Java IDE.
- Run the
main()method of the desired algorithm. - Enter the required inputs.
- View the calculated root and iteration results.
- Java
- Object-Oriented Programming (OOP)
- Numerical Analysis Algorithms
Through this project, I gained practical experience in:
- Implementing numerical algorithms in Java
- Understanding iterative methods and convergence
- Working with tolerance and error calculations
- Comparing different root-finding techniques
Mohammed Alansary
Computer Engineering Student
Interested in Cybersecurity, Artificial Intelligence, and Software Development.