MTH603 Grand Quiz Solution and Discussion
-
@zaasmi said in MTH603 Grand Quiz Solution and Discussion:
Let [A] be a 3x3 real symmetric matrix with
|a12|be numerically the largest off-diagonal element of A, then we can construct orthogonal matrix S1 by Jacobi’s method as
⎡⎣⎢⎢1000cosθsinθ0−cosθ−sinθ⎤⎦⎥⎥
⎡⎣⎢⎢cosθ0sinθ010−sinθ0cosθ⎤⎦⎥⎥
⎡⎣⎢⎢cosθ0sinθ010−sinθ0cosθ⎤⎦⎥⎥
⎡⎣⎢⎢cosθ0sinθ010−sinθ0cosθ⎤⎦⎥⎥ -
In Gauss-Seidel method, each equation of the system is solved for the unknown with -------- coefficient, in terms of remaining unknowns.
smallest
largest
any positive
any negative -
@zaasmi said in MTH603 Grand Quiz Solution and Discussion:
In Gauss-Seidel method, each equation of the system is solved for the unknown with -------- coefficient, in terms of remaining unknowns.
110 Solving each equation of the given system for the unknown with the largest coefficient in terms of the remaining unknowns, we have x = 37. Example 19. Solve the following system by Gauss–Seidel method : by Gauss–Seidel
-
While using power method, the computed vector
u(2)=⎛⎝⎜⎜6.5714289.5714211.21423⎞⎠⎟⎟
will be in normalized form asWhile using power method, the computed vector [{u^{(2)}} = \left( {\begin{array}{*{20}{c}} {6.571428}\{9.57142}\{11.21423} \end{array}} \right)] will be in normalized form as
-
Gauss elimination and Gauss-Jordan methods are popular among many methods for finding the ………of a matrix.
Identity
Transpose
Inverse
None of the given choices -
@zaasmi said in MTH603 Grand Quiz Solution and Discussion:
Gauss elimination and Gauss-Jordan methods are popular among many methods for finding the ………of a matrix.
-
While using Jacobi method for the matrix
A=⎡⎣⎢⎢2−10−120002⎤⎦⎥⎥
and ‘theta θ =pi/4’, the orthogonal matrix S1 -
In Jacobi’s Method, We assume that the …………elements does not vanish.
Diagonal
Off-diagonal
Row
Column -
@zaasmi said in MTH603 Grand Quiz Solution and Discussion:
In Jacobi’s Method, We assume that the …………elements does not vanish.
Mathematical Methods for Numerical Analysis and Optimization … Solution of Linear System of Equationsand Matrix Inversion Jacobi’s Method This is an iterative … We also assume that the diagonal element do not vanish.
-
If one root of the equation is-3-7i, then the other root will be
-3-7i
-3+7i
3-7i
3+7i -
@zaasmi said in MTH603 Grand Quiz Solution and Discussion:
If one root of the equation is-3-7i, then the other root will be
-3-7i
-3+7i
3-7i
3+7i -
Under iterative methods, the initial approximate solution is assumed to be………….
Known
UnKnown
Found
No of the given -
@zaasmi said in MTH603 Grand Quiz Solution and Discussion:
Under iterative methods, the initial approximate solution is assumed to be………….
In computational mathematics, an iterative method is a mathematical procedure that uses an initial guess to generate a sequence of improving approximate …
-
While using the Gauss-Seidel Method for finding the solution of the following system
2x+2y+z=3
x+3y+z=2
x+y+z=2with the initial guess (0,0,0), the next iteration would be