Concept:
Newton Raphson Method:
- Converges at a very fast rate and its order, k = 2.
- Its iteration follows this:
\({{x}_{n+1}}={{x}_{n}}-\frac{f\left( {{x}_{n}} \right)}{{f}'\left( {{x}_{n}} \right)~}~\) (Where f(x) is a given polynomial and f’(x) is its derivative)
Its Solution majorly depends on x(n) value and can be obtained in very less iteration if f’(xn) is large.
Calculation:
Given f(x) = x3 – 5x2 + 6x – 8 = 0
Then f’(x) = 3x2 – 10x + 6
Initial guess given is x0 = 5
Then its 1st iteration is:
\({{x}_{1}}={{x}_{0}}-\frac{f\left( 5 \right)}{f'\left( 5 \right)}=5-\frac{22}{31}=4.2903\)