2. Newton’s Method:
◦ Newton’s method also called the Newton-Raphson method is a
recursive algorithm for approximating the root of a differentiable
function.
◦ The Newton-Raphson method is a method for approximation the roots
of polynomial equation of any order.
◦ In fact the method works for any equation, polynomial or not, as long
as the function is differentiable in a desired interval.
3. In order to explain Newton’s
method, imagine that x0 is already
very close to a 0 of f(x). We know
that if we only look at points very
close xo then f(x) looks like its
tangent line. If x0 was already close
to the place where f(x) was 0, and
near x0 we know that f(x) looks like
tangent line, then we hope the 0 of
the tangent line at x0 is a better
approximation then x0 itself.
4. For the value of x where f(x)=0, we choose to call this value of x1
Now, we call x2