Summary

Edited Journals

ICCK Contributions


Open Access | Research Article | 14 December 2025
From Theory to Code: Transforming Classical Root-Finding Methods into Efficient Python Implementations
ICCK Journal of Applied Mathematics | Volume 1, Issue 3: 154-189, 2025 | DOI: 10.62762/JAM.2025.840767
Abstract
This study conducts a comparative evaluation of seven numerical methods for finding roots of nonlinear equations: Bisection, Regula-Falsi, Fixed-Point Iteration, Newton-Raphson, Secant, Aitken's \(\Delta^2\), and Steffensen. The aim is to analyze the effectiveness of each method based on convergence speed, numerical accuracy, stability, and computational time efficiency. Algorithm implementation was carried out in the Python programming language using NumPy, SymPy, Pandas, and Matplotlib libraries. Test functions included polynomial, trigonometric, exponential, and mixed functions to represent diverse functional characteristics. The results indicate that Steffensen and Newton-Raphson achieve... More >

Graphical Abstract
From Theory to Code: Transforming Classical Root-Finding Methods into Efficient Python Implementations