Conditions
1. Consider the function using Newton's method. Take for the starting value.
using Newton's method. Take for the starting value.
For each method, present the results in the form of table:
- Column 1: n (step)
- Column 2: xn (approximation)
- Column 3: ( ) n f x
- Column 4: | xn - xn-1 | (error)
Solution
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 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.
The Newton-Raphson method in one variable is implemented as follows:
Given a function defined over the reals , and its derivative , we begin with a first guess for a root of the function . Provided the function satisfies all the assumptions made in the derivation of the formula, a better approximation is
Geometrically, is the intersection with the -axis of a line tangent to at .
The process is repeated as
until a sufficiently accurate value is reached.
For our example:
Answer:
As we see, after iteration the root has been found, and it's approximately equal to: