 |
|
|
|
|
|
||||||||||||
|
|||||||||||||||||
 |
 |
|
|
||||||||||||||
 |
 |
 |
|
|
|||||||||||||
 |
|
||||||||||||||||
Matrix Size & Validation
Vector Algebra What is Vector? Vector Norm Unit Vector Vector Addition Vector Subtraction Vector Scalar Multiple Vector Multiplication Vector Inner Product Vector Outer Product Vector Cross Product Vector Triple Cross Product Vector Triple Dot Product Scalar Triple Product Orthogonal & Orthonormal Vector Cos Angle of Vectors Scalar and Vector Projection Matrix Algebra What is a matrix? Special Matrices Matrix One Null Matrix Matrix Diagonal Is Diagonal Matrix? Identity Matrix Matrix Determinant Matrix Sum Matrix Trace Matrix Basic Operation Is Equal Matrix? Matrix Transpose Matrix Addition Matrix Subtraction Matrix Multiplication Matrix Scalar Multiple Hadamard Product Horizontal Concatenation Vertical Concatenation Elementary Row Operations Matrix RREF Finding inverse using RREF (Gauss-Jordan) Finding Matrix Rank using RREF Matrix Inverse Is Singular Matrix? Linear Transformation Matrix Generalized Inverse Solving System of Linear Equations Linear combination, Span & Basis Vector Linearly Dependent & Linearly Independent Change of basis Matrix Rank Matrix Range Matrix Nullity & Null Space Eigen System Matrix Eigen Value & Eigen Vector Symmetric Matrix Matrix Eigen Value & Eigen Vector for Symmetric Matrix Similarity Transformation and Matrix Diagonalization Matrix Power Orthogonal Matrix Spectral Decomposition Singular Value Decomposition Resources on Linear Algebra |
Matrix Rank Recalled in the previous topics when we have a set of basis vectors, we can concatenate these vectors into a matrix. Using this matrix, we can also change the basis or the coordinate system. In this page, you will learn more about that augmented matrix. Suppose we have a matrix Similarly, we can imagine the matrix The dimension of row space of a matrix is equal to the dimension of the column space of that matrix. The common dimension of the row space and column space of matrix Performing elementary row operation does not change the row space. To compute the rank of a matrix, we reduce the matrix into reduced row echelon form (RREF) and non-zero rows of the RREF matrix will form the basis for the row space. The interactive program below produces matrix rank. The computation is based on numerical method of Singular Value Decomposition (SVD). The input is rectangular matrix. Random Example button will provide you with many examples. PropertiesSome important properties of matrix rank are:
See also: rank through RREF, matrix range, matrix nullity and null space, solving system linear equations Rate this tutorial or give your comments about this tutorial Preferable reference for this tutorial is Teknomo, Kardi (2011) Linear Algebra tutorial. http:\\people.revoledu.com\kardi\ tutorial\LinearAlgebra\ |
|||||||||||||
|
||||||||||||||
|
||||||||||||||
size 
by
. We can imagine this matrix is actually a 
is actually a 
is called the rank of matrix
, denoted by
. The rank of 
is the number of 
is the number of 
.
.
.
by
is always less or equal to the minimum 
.
and 
both are matrices of the same size 
by
, not necessarily of full rank, then we have the following
and 
are not necessarily the same size, then we have the following
. 
has a solution if and only if the rank of the coefficient matrix is equal to the rank of the augmented matrix
. When non-homogeneous system is not full rank or when the rank of the matrix coefficients is less than the rank of the augmented matrix coefficients and the vector constants 
then the system is usually inconsistent with no possible solution. It is still possible to find the approximate solution using generalized inverse
.
has a 
if and only if its rank equals its number of columns
. If matrix 
has more columns than rows (
), it cannot have a left inverse.
has a 
if and only if its rank equals its number of rows
. If matrix 
has more rows than columns (
), it cannot have a right inverse.
has an
(
. If matrix 
is not square (
), it cannot have a two-sided inverse. Equivalently, the 
.