search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
0 votes
726 views

The iteration formula to find the square root of a positive real number $b$ using the Newton Raphson method is

  1. $x_{k+1} = 3(x_k+b)/2x_k$

  2. $x_{k+1} = (x_{k}^2+b)/2x_k$

  3. $x_{k+1} = x_k-2x_k/\left(x^2_k+b\right)$

  4. None of the above

in Numerical Methods 726 views

3 Answers

3 votes
 
Best answer
Answer: B

$x_{k+1} = x_k - \frac{f(x_k)}{f'(x)} = x_k - \frac{(x_k^2 - b)}{2x_k} = \frac{2x^2_k - x^2_k + b}{2x_k} = \frac{x^2_k + b}{2x_k}$
0 votes
Answer is D. F(x)=x^2-b. Applying the general formula we can find the answer.
0
No answer is only B...
0 votes

take x= root b

x2=b

f(x)=x2-b

xn+1 = (x2+b) / 2x

Related questions

4 votes
2 answers
1
610 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}$
asked Oct 9, 2014 in Numerical Methods Kathleen 610 views
1 vote
2 answers
2
1.1k 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 converge to -1 converge to $\sqrt{2}$ converge to $\sqrt{-2}$ not converge
asked Sep 29, 2014 in Numerical Methods Kathleen 1.1k views
6 votes
1 answer
3
682 views
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
asked Sep 28, 2014 in Numerical Methods jothee 682 views
5 votes
2 answers
4
586 views
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
asked Sep 23, 2014 in Numerical Methods Kathleen 586 views
...