An interactive, high-performance benchmarking suite for root-finding algorithms. This tool allows users to visualize and compare the convergence speeds, computational costs, and stability of different numerical methods in real-time.
- Custom GUI Framework: A sleek, dark-mode dashboard built from scratch over standard Tkinter, featuring hover states, dynamic color coding, and tabbed data visualization.
- No-Library Math Engine: Core solvers (Bisection, Newton, Secant, Fixed-Point) are implemented from first principles, ensuring complete transparency of the underlying algorithmic logic.
- Live Benchmarking: Tracks iteration counts and microsecond execution times (
time.perf_counter()) to compare true computational efficiency. - Algorithmic Consultant: A built-in heuristic engine that analyzes function smoothness and convergence behavior to recommend the optimal numerical method.
- Bisection: The ultimate fallback. Guaranteed linear convergence.
- Newton-Raphson: The quadratic sprinter. Requires a differentiable function.
- Secant Method: Super-linear convergence without the need for manual derivatives.
- Fixed-Point Iteration: Transformative approach sensitive to contraction mapping parameters.
Ensure you have Python 3.8+ installed, then run:
pip install numpy matplotlib
python interface.py