review of linear algebra - donald bren school of
TRANSCRIPT
Review of Linear Algebra
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
Solving systems of linear equations
xhx
xhx
xhx
xhx
xhx
Elementary row operations
xhx
Row echelon form
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
Complexity of Gaussian elimination: O(n3)
Iterative (approximate) methods
Basic idea: splitting A into M - N where M is invertible. Then
Mx = Nx + b
Iterate: x M-1(Nx+b)
Vector Space
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
Subspace
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
xhx
Rank Theorem
For any m x n matrix A:
rk(A) + dim Null(A) = n
Num of pivot columns + num of nonpivot columns = num of columns
Fundamental theorem of linear mapping