Mathematics
Linear Algebra
449 Questions
Linear algebra involves the study of matrices, vectors, and linear transformations. Common topics include finding the rank of a matrix, calculating eigenvalues and eigenvectors, and performing LU decomposition. These advanced mathematical concepts are frequently tested in engineering, statistics, and civil service examinations.
Matrix rank calculationLU decompositionEigenvalues and eigenvectorsMatrix invertibilityDeterminant properties
Linear Algebra Questions
What is an eigenvalue of a square matrix?
-
A scalar value associated with a corresponding eigenvector
-
A vector that is parallel to the column space of the matrix
-
The determinant of the matrix
-
The trace of the matrix
A
Correct answer
Explanation
An eigenvalue of a square matrix is a scalar value that, when substituted for the variable in the characteristic equation of the matrix, results in a nontrivial solution.
What is an eigenvector of a square matrix?
-
A nonzero vector that, when multiplied by the matrix, is scaled by the corresponding eigenvalue
-
A vector that is orthogonal to the row space of the matrix
-
The vector that corresponds to the largest eigenvalue of the matrix
-
The vector that corresponds to the smallest eigenvalue of the matrix
A
Correct answer
Explanation
An eigenvector of a square matrix is a nonzero vector that, when multiplied by the matrix, is scaled by the corresponding eigenvalue.
What is the characteristic equation of a square matrix?
-
An equation that is obtained by subtracting the identity matrix from the given matrix
-
An equation that is obtained by adding the identity matrix to the given matrix
-
An equation that is obtained by multiplying the given matrix by its transpose
-
An equation that is obtained by subtracting the transpose of the given matrix from the identity matrix
A
Correct answer
Explanation
The characteristic equation of a square matrix is an equation that is obtained by subtracting the identity matrix from the given matrix and setting the determinant of the resulting matrix equal to zero.
What is the relationship between the eigenvalues and eigenvectors of a square matrix?
-
Eigenvalues are the roots of the characteristic equation, and eigenvectors are the corresponding solutions to the homogeneous system of equations
-
Eigenvalues are the roots of the characteristic equation, and eigenvectors are the corresponding solutions to the nonhomogeneous system of equations
-
Eigenvalues are the solutions to the characteristic equation, and eigenvectors are the corresponding roots of the homogeneous system of equations
-
Eigenvalues are the solutions to the characteristic equation, and eigenvectors are the corresponding roots of the nonhomogeneous system of equations
A
Correct answer
Explanation
The eigenvalues of a square matrix are the roots of the characteristic equation, and the eigenvectors are the corresponding solutions to the homogeneous system of equations obtained by subtracting the eigenvalue from each diagonal entry of the matrix.
What is the algebraic interpretation of an eigenvalue?
-
It is the value that the matrix is multiplied by to obtain the identity matrix
-
It is the value that the matrix is added to to obtain the identity matrix
-
It is the value that the matrix is subtracted from to obtain the identity matrix
-
It is the value that the matrix is divided by to obtain the identity matrix
C
Correct answer
Explanation
The algebraic interpretation of an eigenvalue is that it is the value that the matrix is subtracted from to obtain the identity matrix.
What is the relationship between the eigenvalues and eigenvectors of a symmetric matrix?
-
Eigenvalues are real and eigenvectors are orthogonal
-
Eigenvalues are complex and eigenvectors are orthogonal
-
Eigenvalues are real and eigenvectors are not orthogonal
-
Eigenvalues are complex and eigenvectors are not orthogonal
A
Correct answer
Explanation
For a symmetric matrix, the eigenvalues are real and the eigenvectors are orthogonal.
What is the relationship between the eigenvalues and eigenvectors of a Hermitian matrix?
-
Eigenvalues are real and eigenvectors are orthogonal
-
Eigenvalues are complex and eigenvectors are orthogonal
-
Eigenvalues are real and eigenvectors are not orthogonal
-
Eigenvalues are complex and eigenvectors are not orthogonal
A
Correct answer
Explanation
For a Hermitian matrix, the eigenvalues are real and the eigenvectors are orthogonal.
What is the relationship between the eigenvalues and eigenvectors of a unitary matrix?
-
Eigenvalues are complex and eigenvectors are orthogonal
-
Eigenvalues are real and eigenvectors are orthogonal
-
Eigenvalues are complex and eigenvectors are not orthogonal
-
Eigenvalues are real and eigenvectors are not orthogonal
A
Correct answer
Explanation
For a unitary matrix, the eigenvalues are complex and the eigenvectors are orthogonal.
What is the relationship between the eigenvalues and eigenvectors of a normal matrix?
-
Eigenvalues are real and eigenvectors are orthogonal
-
Eigenvalues are complex and eigenvectors are orthogonal
-
Eigenvalues are real and eigenvectors are not orthogonal
-
Eigenvalues are complex and eigenvectors are not orthogonal
B
Correct answer
Explanation
For a normal matrix, the eigenvalues are complex and the eigenvectors are orthogonal.
What is the power method for finding the largest eigenvalue and corresponding eigenvector of a matrix?
-
It is an iterative method that starts with an initial guess for the eigenvector and repeatedly multiplies the matrix by the eigenvector until convergence
-
It is an iterative method that starts with an initial guess for the eigenvalue and repeatedly multiplies the matrix by the eigenvalue until convergence
-
It is a direct method that involves solving the characteristic equation of the matrix
-
It is a direct method that involves finding the determinant of the matrix
A
Correct answer
Explanation
The power method is an iterative method for finding the largest eigenvalue and corresponding eigenvector of a matrix. It starts with an initial guess for the eigenvector and repeatedly multiplies the matrix by the eigenvector until convergence.
What is the QR algorithm for finding all the eigenvalues and eigenvectors of a matrix?
-
It is an iterative method that starts with an initial guess for the eigenvalues and eigenvectors and repeatedly applies QR factorization until convergence
-
It is an iterative method that starts with an initial guess for the eigenvalues and eigenvectors and repeatedly applies LU factorization until convergence
-
It is a direct method that involves solving the characteristic equation of the matrix
-
It is a direct method that involves finding the determinant of the matrix
A
Correct answer
Explanation
The QR algorithm is an iterative method for finding all the eigenvalues and eigenvectors of a matrix. It starts with an initial guess for the eigenvalues and eigenvectors and repeatedly applies QR factorization until convergence.
Which of the following is an eigenvalue of the linear transformation f(x) = 3x - 2?
C
Correct answer
Explanation
An eigenvalue of a linear transformation is a scalar λ such that there exists a nonzero vector x such that f(x) = λx. In this case, f(3) = 3(3) - 2 = 7 and 3 is a nonzero scalar, so 3 is an eigenvalue of f(x) = 3x - 2.
What is the kernel of the linear transformation f(x) = Ax, where A is a 3x3 matrix?
-
The set of all vectors x such that f(x) = 0
-
The set of all vectors x such that Ax = 0
-
The set of all vectors x such that f(x) = x
-
The set of all vectors x such that Ax = x
B
Correct answer
Explanation
The kernel of a linear transformation is the set of all vectors that are mapped to the zero vector. In this case, the kernel of f(x) = Ax is the set of all vectors x such that Ax = 0.
What is the matrix representation of the linear transformation f(x) = [x1, x2, x3]?
-
[[1, 0, 0], [0, 1, 0], [0, 0, 1]]
-
[[1, 0, 0], [0, 0, 1], [0, 1, 0]]
-
[[0, 1, 0], [0, 0, 1], [1, 0, 0]]
-
[[0, 0, 1], [1, 0, 0], [0, 1, 0]]
A
Correct answer
Explanation
The matrix representation of a linear transformation is the matrix that performs the same transformation when multiplied by a column vector. In this case, the matrix representation of f(x) = [x1, x2, x3] is [[1, 0, 0], [0, 1, 0], [0, 0, 1]] because [[1, 0, 0], [0, 1, 0], [0, 0, 1]][x1, x2, x3]^T = [x1, x2, x3]^T for any vector [x1, x2, x3]^T.
What is the determinant of the matrix representation of the linear transformation f(x) = [x1 + x2, x2 + x3, x3 + x1]?
B
Correct answer
Explanation
The determinant of the matrix representation of a linear transformation is equal to the determinant of the matrix that performs the same transformation when multiplied by a column vector. In this case, the matrix representation of f(x) = [x1 + x2, x2 + x3, x3 + x1] is [[1, 1, 0], [0, 1, 1], [1, 0, 1]], and the determinant of this matrix is 2.