Register

GATE CSE 1987 | Question: 1-xxv
closed

• recategorized by
711 views
0 votes
0 votes
closed with the note: Numerical analysis removed from current gate CS syllabus

Which of the following statements is true in respect of the convergence of the Newton-Rephson procedure?

  1. It converges always under all circumstances.
  2. It does not converge to a tool where the second differential coefficient changes sign.
  3. It does not converge to a root where the second differential coefficient vanishes.
  4. None of the above.
• recategorized by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
makhdoom ghaya asked Nov 9, 2016
750 views
GATE CSE 1987 | Question: 1-xxiv
The simplex method is so named because It is simple. It is based on the theory of algebraic complexes. The simple pendulum works on this method. No one thought of a better name.
The simplex method is so named because It is simple.It is based on the theory of algebraic complexes.The simple pendulum works on this method.No one thought of a better n...
User Avatar
0 votes
0 votes
0 answers
2
makhdoom ghaya asked Nov 15, 2016
709 views
GATE CSE 1987 | Question: 11b
Use Simpson's rule with $h=0.25$ to evaluate $ V= \int_{0}^{1} \frac{1}{1+x} dx$ correct to three decimal places.
Use Simpson's rule with $h=0.25$ to evaluate $ V= \int_{0}^{1} \frac{1}{1+x} dx$ correct to three decimal places.
User Avatar
0 votes
0 votes
0 answers
3
makhdoom ghaya asked Nov 15, 2016
523 views
GATE CSE 1987 | Question: 11a
Given $f(300)=2,4771; f(304) = 2.4829; f(305) = 2.4843$ and $f(307) = 2.4871$ find $f(301)$ using Lagrange's interpolation formula.
Given $f(300)=2,4771; f(304) = 2.4829; f(305) = 2.4843$ and $f(307) = 2.4871$ find $f(301)$ using Lagrange's interpolation formula.
User Avatar
3 votes
3 votes
2 answers
4
Kathleen asked Sep 29, 2014
12,072 views
GATE CSE 1997 | Question: 1.2
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
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 willconverge to -1converge to $\sqrt{2...
User Avatar
Link Copied!