Course
Guided
250 XP3–4 hours

Root-Finding Toolkit

Implement and compare bisection, Newton, and secant on the same equation.

Build the three workhorse root-finders and see their convergence side by side. You will implement each method, drive them to a tolerance, and count iterations to feel the difference between linear and quadratic convergence.

BisectionNewton–RaphsonSecant methodConvergence & error
Milestones
0/4
Solve f(x)=x²−2 on [0,2] (root √2). Halve the bracket until it is < 1e-8 wide; print the root and the iteration count.
numpy
Root ≈ 1.41421356