Register

GATE IT 2008 | Question: 30

2,260 views
0 0 votes

Consider the function f(x) = x2 - 2x - 1. Suppose an execution of the Newton-Raphson method to find a zero of f(x) starts with an approximation x0 = 2 of x. What is the value of x2, the approximation of x that algorithm produces after two iterations, rounded to three decimal places?

  1. 2.417
  2. 2.419
  3. 2.423
  4. 2.425

2 Answers

Best answer
2 2 votes

In newton method, if current guess is xcur, then new guess xnew is

xnew = xcur - f(xcur)/f'(xcur)

Now Initially, xcur = 2, so after 1st iteration,

xnew = 2 - (-1)/2 = 2.5

Now xcur becomes 2.5, so after 2nd iteration,

xnew = 2.5 - (0.25)/3 = 2.417

• selected by
Voting & Accepting an answer helps improve the community
Answer:
← Previous · GATE IT 2008 | Quest...Next → · The digital operatio...
← Previous in category · GATE IT 2008 | Quest...Next in category → · GATE IT 2008 | Quest...
Position:
Show:

Related questions

1 1 vote
1 answers 1 answer
6.5k
6.5k views
Kathleen asked Sep 11, 2014
6,475 views
GATE CSE 2008 | Question: 22
The Newton-Raphson iteration $x_{n+1} = \frac{1}{2}\left(x_n+\frac{R}{x_n}\right)$ can be used to compute thesquare of R reciprocal of R square root of R l...
1 1 vote
0 0 answers
1.8k
1.8k views
Kathleen asked Sep 21, 2014
1,762 views
GATE CSE 2007 | Question: 28
Consider the series $x_{n+1} = \frac{x_n}{2}+\frac{9}{8x_n},x_0 = 0.5$ obtained from the Newton-Raphson method. The series converges to1.5$\sqrt{2}$1.61.4
4 4 votes
2 answers 2 answers
2.4k
2.4k views
Kathleen asked Oct 9, 2014
2,444 views
GATE CSE 1996 | Question: 2.5
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_{...