What is Newton's Method?
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. It is one example of a root-finding algorithm.
The Newton|Raphson method in one variable is implemented as follows:
The method starts with a function ƒ defined over the real numbers x, the function's derivative ƒŒ, and an initial guess x0 for a root of the function ƒ. If the function satisfies the assumptions made in the derivation of the formula and the initial guess is close, then a better approximation x1 is
Geometrically, (x1, 0) is the intersection of the x-axis and the tangent of the graph of ƒ at (x0, ƒ (x0)). The process is repeated as
until a sufficiently accurate value is reached.
This algorithm is first in the class of Householder's methods, succeeded by Halley's method. The method can also be extended to complex functions and to systems of equations.1
Maple is powerful math software that makes it easy to learn about Newton's Method, and to analyze, explore, visualize, and solve mathematical problems from virtually every branch of mathematics. Student pricing available.
Learn more about Maple
