lecture10

lecture10 - Lecture 10 Dimensions, Independence, Basis and...

Info iconThis preview shows pages 1–13. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture 10 Dimensions, Independence, Basis and Complete Solution of Linear Systems Shang-Hua Teng
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Linear Independence Linear Combination { } { } i n v ,...,v ,v v = n 1 i i 2 1 is vectors of set a of α Linear Independence { } vectors of set A 2 1 n ,...,v ,v v is linearly independent if only if none of them can be expressed as a linear combination of the others
Background image of page 2
Examples 1 1 0 , 4 2 2 , 1 0 1 1 1 2 2 1 1 0 1 , ,
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Linear Independence and Null Space Theorem/Definition { } vectors of set A 2 1 n ,...,v ,v v is linearly independent if and only α 1 v 1 + 2 v 2 +…+ n v n = 0 only happens when all ’s are zero The columns of a matrix A are linearly independent when only solution to A x=0 is x = 0
Background image of page 4
2D and 3D v w u v
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
How do we determine a set of vectors are independent? Make them the columns of a matrix Elimination Computing their null space
Background image of page 6
Permute Rows and Continuing Elimination (permute columns) - - - - - - = 0 1 1 1 2 1 1 3 1 1 1 1 0 2 1 1 1 1 1 1 0 0 1 1 A
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Theorem If A x = 0 has more have more unknown than equations (m > n: more columns than rows), then it has nonzero solutions. There must be free variables.
Background image of page 8
Echelon Matrices = * * * * 0 0 0 0 0 0 * * 0 0 0 0 * * * * * 0 * * * * * * A Free variables
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Reduced Row Echelon Matrix R = 1 0 0 0 0 0 0 0 0 0 * 1 0 0 0 0 * 0 * * 1 0 * 0 * * 0 1 A Free variables
Background image of page 10
Computing the Reduced Row Echelon Matrix Elimination to Echelon Matrix E 1 PA = U Divide the row of pivots by the pivots Upward Elimination E 2 E 1 PA = R
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Example: Gauss-Jordan Method for Matrix Inverse [ A I ] E 1 [ A I ] = [ U, I ] In its reduced Echelon Matrix A -1 [ A I ] = [ I A -1 ]
Background image of page 12
Image of page 13
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/08/2010 for the course CS 232 taught by Professor Bera during the Spring '09 term at BU.

Page1 / 35

lecture10 - Lecture 10 Dimensions, Independence, Basis and...

This preview shows document pages 1 - 13. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online