# GATE1997-1.2

1 vote
1.2k views

The Newton-Raphson method is used to find the root of the equation $X^2-2=0$. If the iterations are started from -1, the iterations will

1. converge to -1

2. converge to $\sqrt{2}$

3. converge to $\sqrt{-2}$

4. not converge

$x_{n+1} = x_n - \frac{f(x_n)}{f'(x_n)} = x_n - \frac{(x_n^2 - 2)}{2x_n} = \frac{2x_n^2 - x_n^2 + 2}{2x_n} = \frac{x_n^2 + 2}{2x_n}$

First iteration:

$x_{n+1} = \frac{x_n^2 + 2}{2x_n} = \frac{(-1)^2+2}{2(-1)} = \frac{-3}{2} = -1.5$

Second iteration:

$x_{n+1} = \frac{x_n^2 + 2}{2x_n} = \frac{(-1.5)^2+2}{2(-1.5)} = \frac{-4.25}{3} = -1.417$

Third iteration:

$x_{n+1} = \frac{x_n^2 + 2}{2x_n} = \frac{(-1.417)^2+2}{2(-1.417)} = -1.414$

Answer is B. General application of the formula will do.

## Related questions

1
643 views
Newton-Raphson iteration formula for finding $\sqrt[3]{c}$, where $c > 0$ is $x_{n+1}=\frac{2x_n^3 + \sqrt[3]{c}}{3x_n^2}$ $x_{n+1}=\frac{2x_n^3 - \sqrt[3]{c}}{3x_n^2}$ $x_{n+1}=\frac{2x_n^3 + c}{3x_n^2}$ $x_{n+1}=\frac{2x_n^3 - c}{3x_n^2}$
The iteration formula to find the square root of a positive real number $b$ using the Newton Raphson method is $x_{k+1} = 3(x_k+b)/2x_k$ $x_{k+1} = (x_{k}^2+b)/2x_k$ $x_{k+1} = x_k-2x_k/\left(x^2_k+b\right)$ None of the above
In the Newton-Raphson method, an initial guess of $x_0= 2$ is made and the sequence $x_0,x_1,x_2\:\dots$ is obtained for the function $0.75x^3-2x^2-2x+4=0$ Consider the statements $x_3\:=\:0$ The method converges to a solution in a finite number of iterations. Which of the following is TRUE? Only I Only II Both I and II Neither I nor II
The Newton-Raphson method is to be used to find the root of the equation $f(x)=0$ where $x_o$ is the initial approximation and $f’$ is the derivative of $f$. The method converges always only if $f$ is a polynomial only if $f(x_o) <0$ none of the above