newton_solver is the standard Newton method. The algorithm starts at an initial value x0, then finds the intersection x1 of the tangent at x0 to the graph of f, with the x axis, the next iteration is done with x1 instead of x0. The xi sequence is defined by
x0=x0, xn+1=xn− |
|
If the Newton method converges, it is a quadratic convergence for roots of multiplicity 1.
Example.
Input:
Output:
0.739085133215 |