GATE | GATE-IT-2004 | Question 39
Consider the following iterative root finding methods and convergence properties: Iterative root finding Convergence properties methods
(Q) False Position (I) Order of convergence = 1.62
Attention reader! Don’t stop learning now. Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.
Learn all GATE CS concepts with Free Live Classes on our youtube channel.
(R) Newton Raphson (II) Order of convergence = 2
(S) Secant (III) Order of convergence = 1 with guarantee of convergence
(T) Successive Approximation (IV) Order of convergence = 1 with no guarantee of convergence
(A) Q-II R-IV S-lIlT-I
(B) Q-IIIR-II S-I T-IV
(C) Q-IIR-I S-IVT-III
(D) Q-I R-IV S-Il T-III
These type of questions are standard type. You can answer these if you have strong command on the subjects.
a) False Position – Order of convergence = 1 with guarantee of convergence
b) Newton Raphson – Order of convergence = 2
c) Secant – Order of convergence = 1.62
d) Successive Approximation – Order of convergence = 1 with no guarantee of convergence
This solution is contributed by Anil Saikrishna Devarasetty.
Quiz of this Question