• Cyberian's Gold

    1. Solve the system of equations by Jacobi’s iteration method.

    10a - 2b - c - d = 3

    • 2a + 10b - c - d = 15
    • a - b + 10c - 2d = 27
    • a - b - 2c + 10d = -9
      a) a = 1, b = 2, c = 3, d = 0
      b) a = 2, b = 1, c = 9, d = 5
      c) a = 2, b = 2, c = 9, d = 0
      d) a = 1, b = 1, c = 3, d = 5
  • Cyberian's Gold

    @zaasmi said in MTH603 Grand Quiz Solution and Discussion:

    1. Solve the system of equations by Jacobi’s iteration method.

    10x = y – x = 11.19
    x + 10y + z = 28.08
    -x + y + 10z = 35.61

    correct to two decimal places.
    a) x = 1.00, y = 2.95, z = 3.85
    b) x = 1.96, y = 2.63, z = 3.99
    c) x = 1.58, y = 2.70, z = 3.00
    d) x = 1.23, y = 2.34, z = 3.45

    Answer: d
    Explanation: Rewriting the equations as,
    x = 110 (11.19 – y + z)
    y = 110 (28.08 – x – z)
    z = 110 (35.61 + x – y)
    We start from an approximation, x = y = z = 0.
    First iteration, x = 1.119, y = 2.808, z = 3.561
    Second iteration,
    x = 110 (11.19 – 2.808 + 3.651) = 1.19
    y = 110 (28.08 – 1.119 – 3.561) = 2.34
    z = 110 (35.61 + 1.119 – 2.808) = 3.39
    Third Iteration:
    x = 1.22, y = 2.35, z = 3.45
    Fourth iteration:
    x = 1.23, y = 2.34, z = 3.45
    Fifth iteration:
    x = 1.23, y = 2.34, z = 3.45
    Hence, x = 1.23, y = 2.34, z = 3.45.

  • Cyberian's Gold

    1. Solve the system of equations by Jacobi’s iteration method.

    10x = y – x = 11.19
    x + 10y + z = 28.08
    -x + y + 10z = 35.61

    correct to two decimal places.
    a) x = 1.00, y = 2.95, z = 3.85
    b) x = 1.96, y = 2.63, z = 3.99
    c) x = 1.58, y = 2.70, z = 3.00
    d) x = 1.23, y = 2.34, z = 3.45

  • Cyberian's Gold

    @zaasmi said in MTH603 Grand Quiz Solution and Discussion:

    1. Solve the system of equations by Jacobi’s iteration method.
      20x + y – 2z = 17
      3x + 20y – z = -18
      2x – 3y + 20z = 25

    a) x = 1, y = -1, z = 1
    b) x = 2, y = 1, z = 0
    c) x = 2, y = 1, z = 0
    d) x = 1, y = 2, z = 1

    Answer: a
    Explanation: We write the equations in the form
    x = 120 (17 – y +2z)
    y = 120 (-18 -3x + z)
    z = 120 (25 -2x +3y)
    We start from an approximation x = y = z = 0.
    Substituting these in the right sides of the equations (i), (ii), (iii), we get
    First iteration:
    x = 0.85, y = -0.9, z = 1.25
    Putting these values again in equations (i), (ii), (iii), we obtain,
    x = [17 – (-0.9) + 2(1.25)] = 1.02
    y = [-18 -3(0.85) + 1.25] = -0.965
    z = [25 – 2(0.85) + 3(-0.9)] = 1.03
    Substituting these values again in equations (i), (ii), (iii), we obtain,
    Second iteration:
    x = 1.00125, y = -1.0015, z = 1.00325
    Proceeding in this way, we get,
    Third iteration:
    x = 1.0004, y = -1.000025, z = 0.9965
    Fourth iteration
    x = 0.999966, y = -1.000078, z = 0.999956
    Fifth iteration
    x = 1.0000, y = -0.999997, z = 0.999992
    The values in the last iterations being practically the same, we can stop.
    Hence the solution is
    x = 1, y = -1, z = 1.

  • Cyberian's Gold

    1. Solve the system of equations by Jacobi’s iteration method.
      20x + y – 2z = 17
      3x + 20y – z = -18
      2x – 3y + 20z = 25

    a) x = 1, y = -1, z = 1
    b) x = 2, y = 1, z = 0
    c) x = 2, y = 1, z = 0
    d) x = 1, y = 2, z = 1

  • Cyberian's Gold

    @zaasmi said in MTH603 Grand Quiz Solution and Discussion:

    1. Which of the following is another name for Jacobi’s method?
      a) Displacement method
      b) Simultaneous displacement method
      c) Simultaneous method
      d) Diagonal method

    Answer: b
    Explanation: Jacobi’s method is also called as simultaneous displacement method because for every iteration we perform, we use the results obtained in the subsequent steps and form new results.

  • Cyberian's Gold

    1. Which of the following is another name for Jacobi’s method?
      a) Displacement method
      b) Simultaneous displacement method
      c) Simultaneous method
      d) Diagonal method
  • Cyberian's Gold

    1. The Jacobi’s method is a method of solving a matrix equation on a matrix that has no zeros along its main diagonal.
      a) True
      b) False

    Answer: a
    Explanation: The Jacobi’s method is a method of solving a matrix equation on a matrix that has no zeros along its main diagonal because the desirable convergence of the answer can be achieved only for a matrix which is diagonally dominant and a matrix that has no zeros along its main diagonal can never be diagonally dominant.

  • Cyberian's Gold

    @zaasmi said in MTH603 Grand Quiz Solution and Discussion:

    1. How many assumptions are there in Jacobi’s method?
      a) 2
      b) 3
      c) 4
      d) 5

    Answer: a
    Explanation: There are two assumptions in Jacobi’s method.

  • Cyberian's Gold

    1. How many assumptions are there in Jacobi’s method?
      a) 2
      b) 3
      c) 4
      d) 5
  • Cyberian's Gold

    @zaasmi said in MTH603 Grand Quiz Solution and Discussion:

    1. Which of the following is an assumption of Jacobi’s method?
      a) The coefficient matrix has no zeros on its main diagonal
      b) The rate of convergence is quite slow compared with other methods
      c) Iteration involved in Jacobi’s method converges
      d) The coefficient matrix has zeroes on its main diagonal

    Answer: a
    Explanation: This is because it is the method employed for solving a matrix such that for every row of the matrix, the magnitude of the diagonal entry in a row is larger than or equal to the sum of the magnitudes of all the other (non-diagonal) entries in that row. This helps in converging the result and hence it is an assumption.

  • Cyberian's Gold

    1. Which of the following is an assumption of Jacobi’s method?
      a) The coefficient matrix has no zeros on its main diagonal
      b) The rate of convergence is quite slow compared with other methods
      c) Iteration involved in Jacobi’s method converges
      d) The coefficient matrix has zeroes on its main diagonal
  • Cyberian's Gold

    @zaasmi said in MTH603 Grand Quiz Solution and Discussion:

    1. The Jacobi iteration converges, if A is strictly dominant.
      a) True
      b) False

    Answer: a
    Explanation: If A is matrix is said to be diagonally dominant if for every row of the matrix, the magnitude of the diagonal entry in a row is larger than or equal to the sum of the magnitudes of all the other (non-diagonal) entries in that row, and for such matrices only Jacobi’s method converges to the accurate answer.

  • Cyberian's Gold

    1. The Jacobi iteration converges, if A is strictly dominant.
      a) True
      b) False
  • Cyberian's Gold

    @zaasmi said in MTH603 Grand Quiz Solution and Discussion:

    1. The Jacobi’s method is a method of solving a matrix equation on a matrix that has no zeroes along ________
      a) Leading diagonal
      b) Last column
      c) Last row
      d) Non-leading diagonal
      View Answer

    Answer: a
    Explanation: The Jacobi’s method is a method of solving a matrix equation on a matrix that has no zeroes along the leading diagonal because convergence can be achieved only through this way.

  • Cyberian's Gold

    1. The Jacobi’s method is a method of solving a matrix equation on a matrix that has no zeroes along ________
      a) Leading diagonal
      b) Last column
      c) Last row
      d) Non-leading diagonal
      View Answer
Insaf Sehat Card Live Cricket Streaming
  • 1
  • 1
  • 5
  • 1
  • 5
  • 2
  • 2
  • 2
Quiz 100% Result Quiz 100% Result
| |