Full-rank: Difference between revisions
Cmloegcmluin (talk | contribs) see also, and categories |
Cmloegcmluin (talk | contribs) No edit summary |
||
| Line 4: | Line 4: | ||
In Wolfram Language, an even quicker check for full-rank is possible, using <code>MatrixRank[]</code>, which will give you the count of linearly independent rows of a matrix. If this is less than the count of rows, the matrix is rank-deficient. | In Wolfram Language, an even quicker check for full-rank is possible, using <code>MatrixRank[]</code>, which will give you the count of linearly independent rows of a matrix. If this is less than the count of rows, the matrix is rank-deficient. | ||
You can guarantee a full-rank result by putting a matrix into [[canonical form]]. | |||
One could generalize this notion to full-nullity and nullity-deficient when speaking of the linear independence of columns of a [[comma basis]]. | One could generalize this notion to full-nullity and nullity-deficient when speaking of the linear independence of columns of a [[comma basis]]. | ||