# Difference between revisions of "What is matrix rank and how do i calculate it?"

From Murray Wiki

Jump to navigationJump to search
Line 5: | Line 5: | ||

is near or equal to zero the matrix is likely to be not full rank ("singular"). | is near or equal to zero the matrix is likely to be not full rank ("singular"). | ||

--[[User:Fuller|Fuller]] 16:22, 29 October 2007 (PDT) | --[[User:Fuller|Sawyer Fuller]] 16:22, 29 October 2007 (PDT) |

## Revision as of 23:23, 29 October 2007

The rank of a matrix is the number of independent columns of . A square matrix is full rank if all of its columns are independent. That is, a full rank matrix has no column vector of that can be expressed as a linear combination of the other column vectors .

A simple test for determining if a matrix is full rank is to calculate its determinant. If the determinant is zero, there are linearly dependent columns and the matrix is not full rank. Prof. John Doyle also mentioned during lecture that one can perform the singular value decomposition of a matrix, and if the lowest singular value
is near or equal to zero the matrix is likely to be not full rank ("singular").

--Sawyer Fuller 16:22, 29 October 2007 (PDT)