GATE2006-IT-27

356 views

Match the following iterative methods for solving algebraic equations and their orders of convergence.

Method   Order of Convergence
1. Bisection P. 2 or more
2. Newton-Raphson Q. 1.62
3. Secant R. 1
4. Regula falsi S. 1 bit per iteration
1. I-R, II-S, III-P, IV-Q
2. I-S, II-R, III-Q, IV-P
3. I-S, II-Q, III-R, IV-P
4. I-S, II-P, III-Q, IV-R

1 vote
Ans D
1 vote

Related questions

1
1.5k views
The following definite integral evaluates to $\int_{-\infty}^{0} e^ {-\left(\frac{x^2}{20} \right )}dx$ $\frac{1}{2}$ $\pi \sqrt{10}$ $\sqrt{10}$ $\pi$
$x + y/2 = 9$ $3x + y = 10$ What can be said about the Gauss-Siedel iterative method for solving the above set of linear equations? it will converge It will diverse It will neither converge nor diverse It is not applicable
x + y/2 = 9 3x + y = 10 The value of the Frobenius norm for the above system of equations is $0.5$ $0.75$ $1.5$ $2.0$
Consider the polynomial $p(x) = a_0 + a_1x + a_2x^2 + a_3x^3$ , where $a_i \neq 0$, $\forall i$. The minimum number of multiplications needed to evaluate $p$ on an input $x$ is: 3 4 6 9