Week 1 Linear Algebra Exercises
Week 1 Linear Algebra Exercises
To determine if vectors are orthogonal, compute their inner product. If the result is zero, the vectors are orthogonal. This insight is valuable in simplifying problems since orthogonal vectors are linearly independent and form a basis for vector spaces in which projections and decompositions are efficient .
Computing the inverse of a matrix is significant because it allows us to solve matrix equations of the form Ax = b, where x is the solution. The inverse facilitates finding x by calculating x = A⁻¹b. However, only non-singular matrices with non-zero determinants have inverses .
To calculate the matrix product AᵀB, you multiply the transpose of matrix A by matrix B, resulting in the matrix: AᵀB = [[24, 24, -6], [-16, -20, 6]].
Row operations during Gauss-Jordan elimination systematically convert the given matrix to identity form while applying the same operations to an identity matrix. This dual transformation reveals the inverse, maintaining equivalence at each stage by preserving the linear relationship between the transformed matrices .
The inner product ⟨u, v⟩ is calculated as 0.5*(-1) + 0.4*(-2) + 0.4*1 + 0.5*(-2) + 0.1*3 + 0.4*1 + 0.1*(-5) = -1.7. Vectors u and v are not orthogonal because their inner product is not zero .
The vector u is a unit vector because its magnitude is 1, calculated as ∥u∥= √(0.5² + 0.4² + 0.4² + 0.5² + 0.1² + 0.4² + 0.1²) = 1. On the other hand, vector v is not a unit vector, as its magnitude is ∥v∥ = √((-1)² + (-2)² + 1² + (-2)² + 3² + 1² + (-5)²) = 3√5, which is greater than 1 .
Matrix D is not invertible because its determinant is zero, making it singular. For a matrix to be invertible, it must be square and have a non-zero determinant .
For system (a), after Gaussian elimination, the solution is x = [9, -1, -6]. For system (b), there is no solution because one row reduces to an inconsistency, and for system (c), the system is underdetermined with a solution x = [α, 1, 1], where α is any real number .
The Gauss-Jordan method involves augmenting matrix Q with an identity matrix, then performing row operations to transform Q into the identity matrix. The sequence of operations results in the transformed identity portion becoming the inverse, Q⁻¹ .
The determinant of a matrix acts as an indicator of its invertibility; if the determinant is non-zero, the matrix is invertible, otherwise, it is not. This is because a non-zero determinant implies the matrix is full rank and spans its space .