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
6 votes
680 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

  1. $x_3\:=\:0$
  2. The method converges to a solution in a finite number of iterations.

Which of the following is TRUE?

  1. Only I
  2. Only II
  3. Both I and II
  4. Neither I nor II
in Numerical Methods 680 views
0
Now out of syllabus.

1 Answer

9 votes
 
Best answer

$x_{n+1}  = x_n - \frac{f(x_n)}{f'(x_n)}$ for Newton-Raphson method (See the link below)

$f(x) = 0.75 x^3 -2x^2-2x + 4$

$ \implies f(2) = -2$

$f'(x) = 2.25x^2 - 4x -2$

$\implies f'(2) = 9 - 8 - 2 = -1$

So, $x_1 = 2 - \frac{-2}{-1} =2-2 = 0$

$x_2 = x_1 - \frac{f(x_1)}{f'(x_1)} = 0 - \frac{4}{-2} = 2$

Since $x_2 = x_0$, we will get $x_3 = x_1 = 0$. 

So, $x_3 = 0$, and the method never converges. A choice. 

https://www.math.ubc.ca/~anstee/math104/104newtonmethod.pdf


selected by
0
Sir, What is mean by convergence of a function. Please suggest some books / online resources for learning such terminology and concepts
1
Say $f(1) = 1.9, f(2) = 1.95, f(3) = 1.97, \ldots f(100) = 1.999, f(10000) = 1.999999, f(1000000) = 2$, here we say $f$ converges to the value 2. These things you have to think a lot as it is mathematics. But the above question is from Numerical Methods -- now not in GATE syllabus.
Answer:

Related questions

2 votes
1 answer
1
1.2k views
Newton-Raphson method is used to compute a root of the equation $x^2 - 13 = 0$ with 3.5 as the initial value. The approximation after one iteration is 3.575 3.676 3.667 3.607
asked Sep 21, 2014 in Numerical Methods gatecse 1.2k views
0 votes
0 answers
2
275 views
Which of the following statements is true in respect of the convergence of the Newton-Rephson procedure? It converges always under all circumstances. It does not converge to a tool where the second differential coefficient changes sign. It does not converge to a root where the second differential coefficient vanishes. None of the above.
asked Nov 9, 2016 in Numerical Methods makhdoom ghaya 275 views
4 votes
2 answers
3
606 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 606 views
0 votes
3 answers
4
725 views
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
asked Oct 8, 2014 in Numerical Methods Kathleen 725 views
...