Set up the Newton-Raphson iteration
xn+1=xn−3xn2+2xn3+2xn−2 Form the explicit formula from f and f'.
Iterate from x_0 until the value stabilises
x0=1 → x=0.770917 Repeated iteration converges to the root to the required accuracy.
Confirm the root with a sign change
f(0.7709165)=−0.000001880,f(0.7709175)=0.000001903 Opposite signs either side confirm the root rounds to this value.
Write down the function
f(x)=x3+2x−2 This is the function whose root we are approximating.
Differentiate the function
f′(x)=3x2+2 The derivative gives the slope of the tangent used at each step.
Substitute f and f' into the formula
xn+1=xn−3xn2+2xn3+2xn−2 This gives the explicit iterative formula for this function.
Interpret the step geometrically
y−f(xn)=f′(xn)(x−xn) The next estimate is where the tangent at x_n meets the x-axis.
Set y=0 on the tangent
0−f(xn)=f′(xn)(x−xn) The x-intercept of the tangent defines the next approximation.
Rearrange the tangent equation for x
x=xn−f′(xn)f(xn) This rearrangement recovers the Newton-Raphson formula.
Recall the Newton-Raphson iteration
xn+1=xn−f′(xn)f(xn) Each new estimate is the previous one minus f divided by f'.
Note a possible failure condition
f′(xn)=0 A stationary point gives a horizontal tangent, so the method breaks down.
Comment on the starting value
∣x0−α∣ small A poor starting point may diverge or converge to a different root.
Confirm a root by a sign change
f(a)f(b)<0 Opposite signs across an interval show a root lies between a and b.
State the required accuracy
round only the final value Full precision is kept while iterating and rounding is done at the end.
State the root to the required accuracy
x=0.770917 This is the root to 6 decimal places.