Newton's method is an iterative method used to find successively better approximations to the roots, or zeroes, of a real-valued function. It works by taking an initial guess, calculating the tangent line to the function at that point, and using the x-intercept of the tangent line as the next guess. The process is repeated by calculating new tangent lines until an accurate value is reached. Newton's method can also be extended to complex functions and systems of equations.

1. By: Love Leoann Duran 

2. In numerical analysis, Newton's method (also
known as the Newton–Raphson method),
named after Isaac Newton and Joseph
Raphson, is a method for finding successively
better approximations to the roots (or zeroes)
of a real-valued function. The method can also
be extended to complex functions and to
systems of equations.

3. The Newton-Raphson method in one variable
is implemented as follows:
Given a function ƒ defined over the reals x, and
its derivative ƒ ', we begin with a first
guess x0 for a root of the function f. Provided
the function is reasonably well-behaved a
better approximation x1 is

4. Geometrically, (x1, 0) is the intersection with
the x-axis of a line tangent to f at (x0, f (x0)).
The process is repeated as
until a sufficiently accurate value is reached.