This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Week 3 (continued): Avectorx = vector , homog.; Matrix Inverse. The Rank of a matrix is defined to be the number of nonzero rows in the RREF of the matrix. We do not necessarily need the RREF or even a REF to find the rank; for example, a (square) uppertriagular matrix that is n n with nonzero diagonal entries always has rank n. (why?) We will discuss the results of the qualitative theory more later on the text; but the first main result is that when Avectorx = vector b, with A an m n matrix, has rank( A ) = rank( A # ) = n, the system has a unique solution. (Were using A # = ( A  vector b ) for the augmented matrix.) Next, whenever rank( A ) = rank( A # ) we may readoff a particular solution vectorx p , so that the system is consistent; while rank( A ) negationslash = rank( A # ) occurs only when rank( A # ) = rank( A ) +1, in which case the last equation reads 0 = 1 , which is inconsistent, so the system has no solution. 2 Finally, if r = rank( A ) = rank( A...
View
Full
Document
 Spring '08
 zhang

Click to edit the document details