Consider the Newton-Raphson method applied to approximate the square root of a positive number α\alphaα. A recursion relation for the error&nbs
Question
Consider the Newton-Raphson method applied to approximate the square root of
a positive number α. A recursion relation for the error en=xn−α is given by:
A.
en+1=21(en+enα)
B.
en+1=21(en−enα)
C.
en+1=21(en+αen2)
D.
en+1=en+2αen2
Correct option is C
The Newton-Raphson iteration is given by:
xn+1=xn−f′(xn)f(xn)We have f(xn)=xn2−a and f′(xn)=2xn.Substituting these into the formula, we get:xn+1=xn−2xnxn2−a=21(xn+xna)Now, let en=xn−a, so xn=en+a.Then, xn+1=en+1+a.Substituting xn=en+a into the Newton-Raphson iteration:en+1+a=21(en+a+en+aa)en+1=21(en+en+aa)−aen+1=21(en+en+aa−a(en+a))en+1=21(en+en+aa−aen−a)en+1=21(en+en+a−aen)en+1=21(en+aen2)
Access ‘CSIR NET Mathematical Sciences’ Mock Tests with