Newton-Raphson Method
xn+1 = xn - f(xn) / f'(xn)
For f(x) = ax² + bx + c: f'(x) = 2ax + b
Convergence
- Newton's method converges quadratically near a root
- May fail if f'(x) = 0 at an iteration point
- Choice of initial guess affects which root is found
Find roots of a quadratic function using Newton-Raphson iteration with step-by-step convergence.
What would make it better?
xn+1 = xn - f(xn) / f'(xn)
For f(x) = ax² + bx + c: f'(x) = 2ax + b