MTH603 Grand Quiz Solution and Discussion

The GaussSeidel method is applicable to strictly diagonally dominant or symmetric positive definite matrices A.

@zaasmi
If λk is the eigenvalue that is closest to the number q, then µk is the dominant eigenvalue for B and so it can be determined using the power method. Moreover, to find the eigenvalue of A that is smallest in magnitude is equivalent to find the dominant eigenvalue of the matrix B = A−1. 
@zaasmi said in MTH603 Grand Quiz Solution and Discussion:
Power method is applicable if the eigen values are ______________.
The Jacobi’s method is a method of solving a matrix equation on a matrix that has no zeros along its main diagonal. Power method is applicable if the eigen vectors corresponding to eigen values are linearly independent.
The Power Method is used to find a dominant eigenvalue (one having the largest absolute value), if one exists, and a corresponding eigenvector. To apply the Power Method to a square matrix A, begin with an initial guess u0 for the eigenvector of the dominant eigenvalue.

Power method is applicable if the eigen values are ______________.

@zaasmi said in MTH603 Grand Quiz Solution and Discussion:
While solving a system of linear equations by Gauss Jordon Method, after all the elementary row operations if there lefts also zeros on the main diagonal then which of the is true about the system?

While solving a system of linear equations by Gauss Jordon Method, after all the elementary row operations if there lefts also zeros on the main diagonal then which of the is true about the system?

@zaasmi said in MTH603 Grand Quiz Solution and Discussion:
Eigenvectors of a symmetric matrix are orthogonal, but only for distinct eigenvalues.
The eigenvectors of a symmetric matrix A corresponding to different eigenvalues are orthogonal to each other.

Eigenvectors of a symmetric matrix are orthogonal, but only for distinct eigenvalues.

@zaasmi said in MTH603 Grand Quiz Solution and Discussion:
If n x n matrices A and B are similar, then they have the different eigenvalues (with the same multiplicities).
Since similar matrices A and B have the same characteristic polynomial, they also have the same eigenvalues. If B = PAP−1 and v = 0 is an eigenvector of A (say Av = λv) then B(Pv) = PAP−1(Pv) = PA(P−1P)v = PAv = λPv. Thus Pv (which is nonzero since P is invertible) is an eigenvector for B with eigenvalue λ.

If n x n matrices A and B are similar, then they have the different eigenvalues (with the same multiplicities).

@zaasmi said in MTH603 Grand Quiz Solution and Discussion:
Eigenvalues of a _________ matrix are all real.
If each entry of an n×n matrix A is a real number, then the eigenvalues of A are all real numbers. False. In general, a real matrix can have a complex number eigenvalue. In fact, the part (b) gives an example of such a matrix.

Eigenvalues of a _________ matrix are all real.

@zaasmi said in MTH603 Grand Quiz Solution and Discussion:
The Jacobi iteration converges, if A is strictly diagonally dominant.
If A is strictly row diagonally dominant, then the Jacobi iteration converges for any choice of the initial approximation x(0). However, the Jacobi iteration may converge for a matrix that is not strictly row diagonally dominant.

The Jacobi iteration converges, if A is strictly diagonally dominant.

The linear equation 2x+0y2=0 has solution(s).
