Nakudin uses cookies to serve ads, including personalized ads based on your visits to this and other sites. See our Privacy Policy for details.
Mathematics — 2025, Undergraduate
This study evaluated the performance of root-finding methods for nonlinear equations. Bisection, regula falsi, secant, and Newton-type methods were implemented for representative equations, and convergence speed, accuracy, and robustness were compared. The findings revealed that derivative-based methods converged fastest for smooth roots, while bracket methods remained robust where derivatives were problematic. The study observed trade-offs between speed and reliability. It recommends method selection informed by function behaviour and starting conditions.
For reference and learning only. Do not submit this work as your own.
Report a problem with this project
Too time-strapped to build it yourself?
Our team writes final-year projects and builds software on request — source, materials and support included. Get a quote.