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 the adjoint of the matrix [[1, 2], [3, 4]]?
-
[[4, -2], [-3, 1]]
-
[[4, -3], [-2, 1]]
-
[[4, -1], [-3, 2]]
-
[[4, -2], [-1, 3]]
A
Correct answer
Explanation
The adjoint of a matrix is the transpose of its cofactor matrix. The cofactor matrix of a matrix is obtained by replacing each element of the matrix with the determinant of the submatrix formed by deleting the row and column containing that element. The adjoint of the matrix [[1, 2], [3, 4]] is [[4, -2], [-3, 1]].
What is the process of finding a matrix that is similar to a given matrix called?
-
Diagonalization
-
Triangularization
-
Orthogonalization
-
Jordanization
A
Correct answer
Explanation
Diagonalization is the process of finding a matrix that is similar to a given matrix, meaning that they have the same eigenvalues and eigenvectors.
What is an eigenvalue of a matrix?
-
A scalar that, when multiplied by the matrix, produces the matrix itself
-
A scalar that, when multiplied by the matrix, produces the zero matrix
-
A scalar that, when multiplied by the matrix, produces a diagonal matrix
-
A scalar that, when multiplied by the matrix, produces an orthogonal matrix
C
Correct answer
Explanation
An eigenvalue of a matrix is a scalar that, when multiplied by the matrix, produces a diagonal matrix.
What is an eigenvector of a matrix?
-
A vector that, when multiplied by the matrix, produces the eigenvalue of the matrix
-
A vector that, when multiplied by the matrix, produces the zero vector
-
A vector that, when multiplied by the matrix, produces a diagonal matrix
-
A vector that, when multiplied by the matrix, produces an orthogonal matrix
A
Correct answer
Explanation
An eigenvector of a matrix is a vector that, when multiplied by the matrix, produces the eigenvalue of the matrix.
What is the diagonalization theorem?
-
A theorem that states that every square matrix can be diagonalized
-
A theorem that states that every square matrix has at least one eigenvalue
-
A theorem that states that every square matrix has at least one eigenvector
-
A theorem that states that every square matrix is similar to a diagonal matrix
D
Correct answer
Explanation
The diagonalization theorem states that every square matrix is similar to a diagonal matrix.
What is the Jordan canonical form of a matrix?
-
A matrix that is similar to a given matrix and has all of its eigenvalues on the diagonal
-
A matrix that is similar to a given matrix and has all of its eigenvectors as its columns
-
A matrix that is similar to a given matrix and has all of its eigenvalues on the diagonal and all of its eigenvectors as its columns
-
A matrix that is similar to a given matrix and has all of its eigenvalues on the diagonal and all of its eigenvectors as its rows
A
Correct answer
Explanation
The Jordan canonical form of a matrix is a matrix that is similar to a given matrix and has all of its eigenvalues on the diagonal.
What is the characteristic polynomial of a matrix?
-
A polynomial whose roots are the eigenvalues of the matrix
-
A polynomial whose roots are the eigenvectors of the matrix
-
A polynomial whose roots are the diagonal elements of the matrix
-
A polynomial whose roots are the off-diagonal elements of the matrix
A
Correct answer
Explanation
The characteristic polynomial of a matrix is a polynomial whose roots are the eigenvalues of the matrix.
What is the Cayley-Hamilton theorem?
-
A theorem that states that every square matrix satisfies its own characteristic polynomial
-
A theorem that states that every square matrix satisfies its own minimal polynomial
-
A theorem that states that every square matrix is similar to a diagonal matrix
-
A theorem that states that every square matrix has at least one eigenvalue
A
Correct answer
Explanation
The Cayley-Hamilton theorem states that every square matrix satisfies its own characteristic polynomial.
What is the Schur decomposition of a matrix?
-
A decomposition of a matrix into a product of two unitary matrices
-
A decomposition of a matrix into a product of two orthogonal matrices
-
A decomposition of a matrix into a product of two diagonal matrices
-
A decomposition of a matrix into a product of two triangular matrices
A
Correct answer
Explanation
The Schur decomposition of a matrix is a decomposition of a matrix into a product of two unitary matrices.
What is the singular value decomposition of a matrix?
-
A decomposition of a matrix into a product of three matrices
-
A decomposition of a matrix into a product of four matrices
-
A decomposition of a matrix into a product of five matrices
-
A decomposition of a matrix into a product of six matrices
A
Correct answer
Explanation
The singular value decomposition of a matrix is a decomposition of a matrix into a product of three matrices.
What is the QR decomposition of a matrix?
-
A decomposition of a matrix into a product of two matrices
-
A decomposition of a matrix into a product of three matrices
-
A decomposition of a matrix into a product of four matrices
-
A decomposition of a matrix into a product of five matrices
A
Correct answer
Explanation
The QR decomposition of a matrix is a decomposition of a matrix into a product of two matrices.
What is the LU decomposition of a matrix?
-
A decomposition of a matrix into a product of two matrices
-
A decomposition of a matrix into a product of three matrices
-
A decomposition of a matrix into a product of four matrices
-
A decomposition of a matrix into a product of five matrices
A
Correct answer
Explanation
The LU decomposition of a matrix is a decomposition of a matrix into a product of two matrices.
What is the Cholesky decomposition of a matrix?
-
A decomposition of a positive-definite matrix into a product of two triangular matrices
-
A decomposition of a positive-definite matrix into a product of three triangular matrices
-
A decomposition of a positive-definite matrix into a product of four triangular matrices
-
A decomposition of a positive-definite matrix into a product of five triangular matrices
A
Correct answer
Explanation
The Cholesky decomposition of a matrix is a decomposition of a positive-definite matrix into a product of two triangular matrices.
What is the eigenvalue-eigenvector method for solving a system of linear differential equations?
-
A method for solving a system of linear differential equations by finding the eigenvalues and eigenvectors of the coefficient matrix
-
A method for solving a system of linear differential equations by finding the characteristic polynomial of the coefficient matrix
-
A method for solving a system of linear differential equations by finding the minimal polynomial of the coefficient matrix
-
A method for solving a system of linear differential equations by finding the Cayley-Hamilton theorem of the coefficient matrix
A
Correct answer
Explanation
The eigenvalue-eigenvector method for solving a system of linear differential equations is a method for solving a system of linear differential equations by finding the eigenvalues and eigenvectors of the coefficient matrix.
What is the power method for finding the largest eigenvalue and corresponding eigenvector of a matrix?
-
A method for finding the largest eigenvalue and corresponding eigenvector of a matrix by repeatedly multiplying the matrix by a random vector
-
A method for finding the largest eigenvalue and corresponding eigenvector of a matrix by repeatedly multiplying the matrix by a vector that is orthogonal to the previous vector
-
A method for finding the largest eigenvalue and corresponding eigenvector of a matrix by repeatedly multiplying the matrix by a vector that is parallel to the previous vector
-
A method for finding the largest eigenvalue and corresponding eigenvector of a matrix by repeatedly multiplying the matrix by a vector that is equal to the previous vector
A
Correct answer
Explanation
The power method for finding the largest eigenvalue and corresponding eigenvector of a matrix is a method for finding the largest eigenvalue and corresponding eigenvector of a matrix by repeatedly multiplying the matrix by a random vector.