5. EASE OF NUMERICAL METHODS
REG FORMULA
‘R’ stands for remember the formulae
‘E’ execute the operation
‘G’ get the result
6. BISECTION METHOD
Find F(n) where n=0,1,2,3……n stop after
consecutive opposite sign[f(cn)]
Find x1=[f(cn1)]+[f(cn2)]/2=smthng
Find F(x1)=…..smthng > or<0
If f(x1)<0 x1=a+x1;x1=b+x1/2 changes
are done inn accordance of the value
attained
7. SECANT METHOD
Find F(n) where n=0,1,2,3……n stop after
consecutive opposite sign[f(cn)]
Find x2=x0.f(x1)-x1.f(x0)/f(x1)-f(x0)
Substitute all the values till the decimal
places and get the result in your finger
tips.
8. NEWTON RAPHSON METHOD
Find F(n) where n=0,1,2,3……n stop after
consecutive opposite sign[f(cn)].
X1=x0-[f(x0)/f’(x0)];similarly procced till
the decimal places are achieved
9. FALSE POSITION METHOD
Find F(n) where n=0,1,2,3……n stop after
consecutive opposite sign[f(cn)].
Formula is x2={x0.f(x1)-x1.f(x0)/f(x1)-
f(x0)}
Similarly for x3,x4,x5 and so on…
Get the desired result under the deimal
places