[ 3 - 3 ] [ N –R ] Newton – Raphson Method for polynomial

The equation from a degree (M) , its coefficients real numbers defined by

f ( x) = a0 Xm + a1 Xm-1 + a2 Xm-2 + … + an-1 X + an .

It is suitable to finding the root of equation f (x) = 0 ?

bm
𝑋𝑛+1 = 𝑋𝑛 − , n=0,12,3 , , ,
Cm −1

Solution Algorithm for application [N –R ]method for polynomial .we start in the
following steps

1) select a prime values for coefficients of equation . 2) Compute bm ,Cm - 1

from the following

C0= b0 = a0

bk = ak + X0 bK-1 , k = o,1,2,…., m

CK = bK + CK-1 , k = 1,2, …, m

Compute
bm
𝑋1 = 𝑋0 − We iteration two step ( 2 , 3 ) . into get on root by
Cm −1
exact a accuracy. that mean

bm
𝑋2 = 𝑋1 − and so on, we find X3 , X4 , Xn even ||Xn − Xn − 1|| ≤ 𝜖
Cm −1

bm
𝑋1 = 𝑋0 − For 𝑋1 we have
Cm −1

B1 = a1 + X0 b0 , C1 = b1 + x0 c0

B2 = a2 + X0 b1 C2 = b2 + x0 c1

B3 = a3 + X0 b2 C3 = b3 + x0 c2

B4 = a4 + X0 b3 .

Bn = an + X0 bn- 1 Cn = bn + x0 cn- 1

bm
𝑋2 = 𝑋1 − and so on, we find X3 , X4 , Xn even ||Xn − Xn − 1|| ≤ 𝜖
Cm −1

1
Example : Find the solution (roots ) of the following equation .

2X3 + 3X 2 – 10 X + 6 = 0 , which close to X0 = 2 , stop upon X2 .

Solution :We show that a0 = 2, a1 = 3 , a2 = - 10 , a3 = 6 , X0 = 2

b1 = a1 + X0 b0 b1 = 3 + 2. 2= 7

b2 = a2 + X0 b1 b2 = -10 + 2. 7 =4

b3 = a3 + X0 b2 b3 = 6 + 2. 4 = 14

C1 = b1 + x0 c0 C1 = 7 + 2 . 2 = 11

C2 = b2 + x0 c1 C2 = 4 + 2. 11 = 26
bm 14
now 𝑋1 = 𝑋0 − = 2− = 1.46153
Cm 26

bm 14
𝑋2 = 𝑋1 − = 1.46 − = 0.92306
Cm − 1 26
Example : Compute the roots value of the following equation .

f(X) = X3 - X 2 + 2 X + 5 = 0 , when X0 = 1 find X1 .

Solution: We show that a0 = 1, a1 = -1 , a2 = 2 , a3 = 5 , X0 = 1

b1 = a1 + X0 b0 =2 C1 = b1 + X0 c0 = -3

b2 = a2 + X0 b1 = 4 C2 = b2 + X0 c1 = 7

bm 1
b3 = a3 + X0 b2 = 1 →X1 =𝑋0 − =1 − = −1 .143
Cm−1 7

Example : Compute the roots value of the following equation . (H.W)

when X0 = 1 , 𝜖 = 0.001
3 2
f(X) = X +5 X -4 X +9 ,