Register

GATE IT 2006 | Question: 27

• edited by
1,455 views
0 votes
0 votes

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
• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

8 votes
8 votes
3 answers
1
Ishrat Jahan asked Oct 31, 2014
5,073 views
GATE IT 2006 | Question: 28
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$
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$
User Avatar
1 votes
1 votes
1 answer
2
Ishrat Jahan asked Nov 1, 2014
1,696 views
GATE IT 2006 | Question: 77
$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$What can be said about the Gauss-Siedel iterative method for solving the above set of linear equations?it will convergeIt will diverseIt will...
User Avatar
1 votes
1 votes
1 answer
3
Ishrat Jahan asked Nov 1, 2014
1,487 views
GATE IT 2006 | Question: 76
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$
x + y/2 = 93x + y = 10The value of the Frobenius norm for the above system of equations is$0.5$$0.75$$1.5$$2.0$
User Avatar
35 votes
35 votes
6 answers
4
Ishrat Jahan asked Nov 1, 2014
10,059 views
GATE IT 2006 | Question: 65
In the $\text{4B/5B}$ encoding scheme, every $4$ bits of data are encoded in a $5$-bit codeword. It is required that the codewords have at most $1$ leading and at most $1$ trailing zero. How many are such codewords possible? $14$ $16$ $18$ $20$
In the $\text{4B/5B}$ encoding scheme, every $4$ bits of data are encoded in a $5$-bit codeword. It is required that the codewords have at most $1$ leading and at most $1...
User Avatar
Link Copied!