Program for Rank of Matrix
Last Updated :
29 Jul, 2024
What is rank of a matrix?
Rank of a matrix A of size M x N is defined as
- Maximum number of linearly independent column vectors in the matrix or
- Maximum number of linearly independent row vectors in the matrix.
Example:
Input: mat[][] = {{10, 20, 10},
{20, 40, 20},
{30, 50, 0}}
Output: Rank is 2
Explanation: Ist and IInd rows are linearly dependent.
But Ist and 3rd or IInd and IIIrd are
independent.
Input: mat[][] = {{10, 20, 10},
{-20, -30, 10},
{30, 50, 0}}
Output: Rank is 2
Explanation: Ist and IInd rows are linearly independent.
So rank must be atleast 2. But all three rows
are linearly dependent (the first is equal to
the sum of the second and third) so the rank
must be less than 3.
In other words rank of A is the largest order of any non-zero minor in A where order of a minor is the side-length of the square sub-matrix of which it is determinant.
So if M < N then maximum rank of A can be M else it can be N, in general rank of matrix can’t be greater than min(M, N).
The rank of a matrix would be zero only if the matrix had no non-zero elements. If a matrix had even one non-zero element, its minimum rank would be one.
How to find Rank?
The idea is based on conversion to Row echelon form.
1) Let the input matrix be mat[][]. Initialize rank equals
to number of columns
// Before we visit row 'row', traversal of previous
// rows make sure that mat[row][0],....mat[row][row-1]
// are 0.
2) Do following for row = 0 to rank-1.
a) If mat[row][row] is not zero, make all elements of
current column as 0 except the element mat[row][row]
by finding appropriate multiplier and adding a the
multiple of row 'row'
b) Else (mat[row][row] is zero). Two cases arise:
(i) If there is a row below it with non-zero entry in
same column, then swap current 'row' and that row.
(ii) If all elements in current column below mat[r][row]
are 0, then remove this column by swapping it with
last column and reducing number of rank by 1.
Reduce row by 1 so that this row is processed again.
3) Number of remaining columns is rank of matrix.
Example:
Input: mat[][] = {{10, 20, 10},
{-20, -30, 10},
{30, 50, 0}}
row = 0:
Since mat[0][0] is not 0, we are in case 2.a of above algorithm.
We set all entries of 0'th column as 0 (except entry mat[0][0]).
To do this, we subtract R1*(-2) from R2, i.e., R2 --> R2 - R1*(-2)
mat[][] = {{10, 20, 10},
{ 0, 10, 30},
{30, 50, 0}}
And subtract R1*3 from R3, i.e., R3 --> R3 - R1*3
mat[][] = {{10, 20, 10},
{ 0, 10, 30},
{ 0, -10, -30}}
row = 1:
Since mat[1][1] is not 0, we are in case 2.a of above algorithm.
We set all entries of 1st column as 0 (except entry mat[1][1]).
To do this, we subtract R2*2 from R1, i.e., R1 --> R1 - R2*2
mat[][] = {{10, 0, -50},
{ 0, 10, 30},
{ 0, -10, -30}}
And subtract R2*(-1) from R3, i.e., R3 --> R3 - R2*(-1)
mat[][] = {{10, 0, -50},
{ 0, 10, 30},
{ 0, 0, 0}}
row = 2:
Since mat[2][2] is 0, we are in case 2.b of above algorithm.
Since there is no row below it swap. We reduce the rank by 1 and
keep row as 2.
The loop doesn't iterate next time because loop termination condition
row <= rank-1 returns false.Below is the implementation of above idea.
C++
// C++ program to find rank of a matrix
#include <bits/stdc++.h>
using namespace std;
#define R 3
#define C 3
/* function for exchanging two rows of
a matrix */
void swap(int mat[R][C], int row1, int row2,
int col)
{
for (int i = 0; i < col; i++)
{
int temp = mat[row1][i];
mat[row1][i] = mat[row2][i];
mat[row2][i] = temp;
}
}
// Function to display a matrix
void display(int mat[R][C], int row, int col);
/* function for finding rank of matrix */
int rankOfMatrix(int mat[R][C])
{
int rank = C;
for (int row = 0; row < rank; row++)
{
// Before we visit current row 'row', we make
// sure that mat[row][0],....mat[row][row-1]
// are 0.
// Diagonal element is not zero
if (mat[row][row])
{
for (int col = 0; col < R; col++)
{
if (col != row)
{
// This makes all entries of current
// column as 0 except entry 'mat[row][row]'
double mult = (double)mat[col][row] /
mat[row][row];
for (int i = 0; i < rank; i++)
mat[col][i] -= mult * mat[row][i];
}
}
}
// Diagonal element is already zero. Two cases
// arise:
// 1) If there is a row below it with non-zero
// entry, then swap this row with that row
// and process that row
// 2) If all elements in current column below
// mat[r][row] are 0, then remove this column
// by swapping it with last column and
// reducing number of columns by 1.
else
{
bool reduce = true;
/* Find the non-zero element in current
column */
for (int i = row + 1; i < R; i++)
{
// Swap the row with non-zero element
// with this row.
if (mat[i][row])
{
swap(mat, row, i, rank);
reduce = false;
break ;
}
}
// If we did not find any row with non-zero
// element in current column, then all
// values in this column are 0.
if (reduce)
{
// Reduce number of columns
rank--;
// Copy the last column here
for (int i = 0; i < R; i ++)
mat[i][row] = mat[i][rank];
}
// Process this row again
row--;
}
// Uncomment these lines to see intermediate results
// display(mat, R, C);
// printf("\n");
}
return rank;
}
/* function for displaying the matrix */
void display(int mat[R][C], int row, int col)
{
for (int i = 0; i < row; i++)
{
for (int j = 0; j < col; j++)
printf(" %d", mat[i][j]);
printf("\n");
}
}
// Driver program to test above functions
int main()
{
int mat[][3] = {{10, 20, 10},
{-20, -30, 10},
{30, 50, 0}};
printf("Rank of the matrix is : %d",
rankOfMatrix(mat));
return 0;
}
// Java program to find rank of a matrix
import java.util.*;
class GFG {
static final int R = 3;
static final int C = 3;
// function for exchanging two rows
// of a matrix
static void swap(int mat[][],
int row1, int row2, int col)
{
for (int i = 0; i < col; i++)
{
int temp = mat[row1][i];
mat[row1][i] = mat[row2][i];
mat[row2][i] = temp;
}
}
// Function to display a matrix
static void display(int mat[][],
int row, int col)
{
for (int i = 0; i < row; i++)
{
for (int j = 0; j < col; j++)
System.out.print(" "
+ mat[i][j]);
System.out.print("\n");
}
}
// function for finding rank of matrix
static int rankOfMatrix(int mat[][])
{
int rank = C;
for (int row = 0; row < rank; row++)
{
// Before we visit current row
// 'row', we make sure that
// mat[row][0],....mat[row][row-1]
// are 0.
// Diagonal element is not zero
if (mat[row][row] != 0)
{
for (int col = 0; col < R; col++)
{
if (col != row)
{
// This makes all entries
// of current column
// as 0 except entry
// 'mat[row][row]'
double mult =
(double)mat[col][row] /
mat[row][row];
for (int i = 0; i < rank; i++)
mat[col][i] -= mult
* mat[row][i];
}
}
}
// Diagonal element is already zero.
// Two cases arise:
// 1) If there is a row below it
// with non-zero entry, then swap
// this row with that row and process
// that row
// 2) If all elements in current
// column below mat[r][row] are 0,
// then remove this column by
// swapping it with last column and
// reducing number of columns by 1.
else
{
boolean reduce = true;
// Find the non-zero element
// in current column
for (int i = row + 1; i < R; i++)
{
// Swap the row with non-zero
// element with this row.
if (mat[i][row] != 0)
{
swap(mat, row, i, rank);
reduce = false;
break ;
}
}
// If we did not find any row with
// non-zero element in current
// column, then all values in
// this column are 0.
if (reduce)
{
// Reduce number of columns
rank--;
// Copy the last column here
for (int i = 0; i < R; i ++)
mat[i][row] = mat[i][rank];
}
// Process this row again
row--;
}
// Uncomment these lines to see
// intermediate results display(mat, R, C);
// printf("\n");
}
return rank;
}
// Driver code
public static void main (String[] args)
{
int mat[][] = {{10, 20, 10},
{-20, -30, 10},
{30, 50, 0}};
System.out.print("Rank of the matrix is : "
+ rankOfMatrix(mat));
}
}
// This code is contributed by Anant Agarwal.
# Python 3 program to find rank of a matrix
class rankMatrix(object):
def __init__(self, Matrix):
self.R = len(Matrix)
self.C = len(Matrix[0])
# Function for exchanging two rows of a matrix
def swap(self, Matrix, row1, row2, col):
for i in range(col):
temp = Matrix[row1][i]
Matrix[row1][i] = Matrix[row2][i]
Matrix[row2][i] = temp
# Function to Display a matrix
def Display(self, Matrix, row, col):
for i in range(row):
for j in range(col):
print (" " + str(Matrix[i][j]))
print ('\n')
# Find rank of a matrix
def rankOfMatrix(self, Matrix):
rank = self.C
for row in range(0, rank, 1):
# Before we visit current row
# 'row', we make sure that
# mat[row][0],....mat[row][row-1]
# are 0.
# Diagonal element is not zero
if Matrix[row][row] != 0:
for col in range(0, self.R, 1):
if col != row:
# This makes all entries of current
# column as 0 except entry 'mat[row][row]'
multiplier = (Matrix[col][row] /
Matrix[row][row])
for i in range(rank):
Matrix[col][i] -= (multiplier *
Matrix[row][i])
# Diagonal element is already zero.
# Two cases arise:
# 1) If there is a row below it
# with non-zero entry, then swap
# this row with that row and process
# that row
# 2) If all elements in current
# column below mat[r][row] are 0,
# then remove this column by
# swapping it with last column and
# reducing number of columns by 1.
else:
reduce = True
# Find the non-zero element
# in current column
for i in range(row + 1, self.R, 1):
# Swap the row with non-zero
# element with this row.
if Matrix[i][row] != 0:
self.swap(Matrix, row, i, rank)
reduce = False
break
# If we did not find any row with
# non-zero element in current
# column, then all values in
# this column are 0.
if reduce:
# Reduce number of columns
rank -= 1
# copy the last column here
for i in range(0, self.R, 1):
Matrix[i][row] = Matrix[i][rank]
# process this row again
row -= 1
# self.Display(Matrix, self.R,self.C)
return (rank)
# Driver Code
if __name__ == '__main__':
Matrix = [[10, 20, 10],
[-20, -30, 10],
[30, 50, 0]]
RankMatrix = rankMatrix(Matrix)
print ("Rank of the matrix is:",
(RankMatrix.rankOfMatrix(Matrix)))
# This code is contributed by Vikas Chitturi
// C# program to find rank of a matrix
using System;
class GFG {
static int R = 3;
static int C = 3;
// function for exchanging two rows
// of a matrix
static void swap(int [,]mat,
int row1, int row2, int col)
{
for (int i = 0; i < col; i++)
{
int temp = mat[row1,i];
mat[row1,i] = mat[row2,i];
mat[row2,i] = temp;
}
}
// Function to display a matrix
static void display(int [,]mat,
int row, int col)
{
for (int i = 0; i < row; i++)
{
for (int j = 0; j < col; j++)
Console.Write(" "
+ mat[i,j]);
Console.Write("\n");
}
}
// function for finding rank of matrix
static int rankOfMatrix(int [,]mat)
{
int rank = C;
for (int row = 0; row < rank; row++)
{
// Before we visit current row
// 'row', we make sure that
// mat[row][0],....mat[row][row-1]
// are 0.
// Diagonal element is not zero
if (mat[row,row] != 0)
{
for (int col = 0; col < R; col++)
{
if (col != row)
{
// This makes all entries
// of current column
// as 0 except entry
// 'mat[row][row]'
double mult =
(double)mat[col,row] /
mat[row,row];
for (int i = 0; i < rank; i++)
mat[col,i] -= (int) mult
* mat[row,i];
}
}
}
// Diagonal element is already zero.
// Two cases arise:
// 1) If there is a row below it
// with non-zero entry, then swap
// this row with that row and process
// that row
// 2) If all elements in current
// column below mat[r][row] are 0,
// then remove this column by
// swapping it with last column and
// reducing number of columns by 1.
else
{
bool reduce = true;
// Find the non-zero element
// in current column
for (int i = row + 1; i < R; i++)
{
// Swap the row with non-zero
// element with this row.
if (mat[i,row] != 0)
{
swap(mat, row, i, rank);
reduce = false;
break ;
}
}
// If we did not find any row with
// non-zero element in current
// column, then all values in
// this column are 0.
if (reduce)
{
// Reduce number of columns
rank--;
// Copy the last column here
for (int i = 0; i < R; i ++)
mat[i,row] = mat[i,rank];
}
// Process this row again
row--;
}
// Uncomment these lines to see
// intermediate results display(mat, R, C);
// printf("\n");
}
return rank;
}
// Driver code
public static void Main ()
{
int [,]mat = {{10, 20, 10},
{-20, -30, 10},
{30, 50, 0}};
Console.Write("Rank of the matrix is : "
+ rankOfMatrix(mat));
}
}
// This code is contributed by nitin mittal
<script>
// javascript program to find rank of a matrix
var R = 3;
var C = 3;
// function for exchanging two rows
// of a matrix
function swap(mat, row1 , row2 , col)
{
for (i = 0; i < col; i++)
{
var temp = mat[row1][i];
mat[row1][i] = mat[row2][i];
mat[row2][i] = temp;
}
}
// Function to display a matrix
function display(mat,row , col)
{
for (i = 0; i < row; i++)
{
for (j = 0; j < col; j++)
document.write(" "
+ mat[i][j]);
document.write('<br>');
}
}
// function for finding rank of matrix
function rankOfMatrix(mat)
{
var rank = C;
for (row = 0; row < rank; row++)
{
// Before we visit current row
// 'row', we make sure that
// mat[row][0],....mat[row][row-1]
// are 0.
// Diagonal element is not zero
if (mat[row][row] != 0)
{
for (col = 0; col < R; col++)
{
if (col != row)
{
// This makes all entries
// of current column
// as 0 except entry
// 'mat[row][row]'
var mult =
mat[col][row] /
mat[row][row];
for (i = 0; i < rank; i++)
mat[col][i] -= mult
* mat[row][i];
}
}
}
// Diagonal element is already zero.
// Two cases arise:
// 1) If there is a row below it
// with non-zero entry, then swap
// this row with that row and process
// that row
// 2) If all elements in current
// column below mat[r][row] are 0,
// then remove this column by
// swapping it with last column and
// reducing number of columns by 1.
else
{
reduce = true;
// Find the non-zero element
// in current column
for (var i = row + 1; i < R; i++)
{
// Swap the row with non-zero
// element with this row.
if (mat[i][row] != 0)
{
swap(mat, row, i, rank);
reduce = false;
break ;
}
}
// If we did not find any row with
// non-zero element in current
// column, then all values in
// this column are 0.
if (reduce)
{
// Reduce number of columns
rank--;
// Copy the last column here
for (i = 0; i < R; i ++)
mat[i][row] = mat[i][rank];
}
// Process this row again
row--;
}
// Uncomment these lines to see
// intermediate results display(mat, R, C);
// printf(<br>);
}
return rank;
}
// Driver code
var mat = [[10, 20, 10],
[-20, -30, 10],
[30, 50, 0]];
document.write("Rank of the matrix is : "
+ rankOfMatrix(mat));
// This code is contributed by Amit Katiyar
</script>
<?php
// PHP program to find rank of a matrix
$R = 3;
$C = 3;
/* function for exchanging two rows of
a matrix */
function swap(&$mat, $row1, $row2, $col)
{
for ($i = 0; $i < $col; $i++)
{
$temp = $mat[$row1][$i];
$mat[$row1][$i] = $mat[$row2][$i];
$mat[$row2][$i] = $temp;
}
}
/* function for finding rank of matrix */
function rankOfMatrix($mat)
{
global $R, $C;
$rank = $C;
for ($row = 0; $row < $rank; $row++)
{
// Before we visit current row 'row', we make
// sure that mat[row][0],....mat[row][row-1]
// are 0.
// Diagonal element is not zero
if ($mat[$row][$row])
{
for ($col = 0; $col < $R; $col++)
{
if ($col != $row)
{
// This makes all entries of current
// column as 0 except entry 'mat[row][row]'
$mult = $mat[$col][$row] / $mat[$row][$row];
for ($i = 0; $i < $rank; $i++)
$mat[$col][$i] -= $mult * $mat[$row][$i];
}
}
}
// Diagonal element is already zero. Two cases
// arise:
// 1) If there is a row below it with non-zero
// entry, then swap this row with that row
// and process that row
// 2) If all elements in current column below
// mat[r][row] are 0, then remove this column
// by swapping it with last column and
// reducing number of columns by 1.
else
{
$reduce = true;
/* Find the non-zero element in current
column */
for ($i = $row + 1; $i < $R; $i++)
{
// Swap the row with non-zero element
// with this row.
if ($mat[$i][$row])
{
swap($mat, $row, $i, $rank);
$reduce = false;
break ;
}
}
// If we did not find any row with non-zero
// element in current column, then all
// values in this column are 0.
if ($reduce)
{
// Reduce number of columns
$rank--;
// Copy the last column here
for ($i = 0; $i < $R; $i++)
$mat[$i][$row] = $mat[$i][$rank];
}
// Process this row again
$row--;
}
// Uncomment these lines to see intermediate results
// display(mat, R, C);
// printf("\n");
}
return $rank;
}
/* function for displaying the matrix */
function display($mat, $row, $col)
{
for ($i = 0; $i < $row; $i++)
{
for ($j = 0; $j < $col; $j++)
print(" $mat[$i][$j]");
print("\n");
}
}
// Driver code
$mat = array(array(10, 20, 10),
array(-20, -30, 10),
array(30, 50, 0));
print("Rank of the matrix is : ".rankOfMatrix($mat));
// This code is contributed by mits
?>
OutputRank of the matrix is : 2
Time complexity: O(row x col x rank).
Auxiliary Space: O(1)
Since above rank calculation method involves floating point arithmetic, it may produce incorrect results if the division goes beyond precision. There are other methods to handle.
Similar Reads
Program for subtraction of matrices
Given two m x n matrices m1 and m2, the task is to subtract m2 from m1 and return res. Input: m1 = {{1, 2}, {3, 4}}, m2 = {{4, 3}, {2, 1}}Output: {{-3, -1}, {1, 3}}Input: m1 = {{3, 3, 3}, {3, 3, 3}}, m1 = {{2, 2, 2}, {1, 1, 1}},Output: {{1, 1, 1}, {2, 2, 2}}, We traverse both matrices element by ele
5 min read
Program to find transpose of a matrix
Given a matrix of size n X m, find the transpose of the matrix. Transpose of a matrix is obtained by changing rows to columns and columns to rows. In other words, transpose of mat[n][m] is obtained by changing mat[i][j] to mat[j][i]. Example: Approach using (N^2) space for Square MatrixRun a nested
9 min read
Program for Identity Matrix
Given a square matrix mat[][] of order n*n, the task is to check if it is an Identity Matrix. Identity Matrix: A square matrix is said to be an identity matrix if the elements of main diagonal are one and all other elements are zero. The identity Matrix is also known as the Unit Matrix. Examples: In
5 min read
Program to Print Matrix in Z form
Given a square matrix of order n*n, we need to print elements of the matrix in Z form Input: [[4, 5, 6, 8], [1, 2, 3, 1], [7, 8, 9, 4], [1, 8, 7, 5]] Output: 4 5 6 8 3 8 1 8 7 5 Input: [[4, 5, 6, 8, 5], [1, 2, 3, 1, 4], [7, 8, 9, 4, 7], [1, 8, 7, 5, 2], [7, 9, 5, 6, 9], [9, 4, 5, 6, 6]] Output: 4 5
12 min read
Program for addition of two matrices
Given two N x M matrices. Find a N x M matrix as the sum of given matrices each value at the sum of values of corresponding elements of the given two matrices. Approach: Below is the idea to solve the problem. Iterate over every cell of matrix (i, j), add the corresponding values of the two matrices
5 min read
Program to find all types of Matrix
Given the dimension of the matrix R(rows) * C(column) the task is to find which type of matrix is represented by the given dimension. Examples: Input : R = 1 C = 0Output : Row Matrix Input : R = 4 C = 5Output : Horizontal Matrix Row Matrix : When R = 1 and C = 0 then the matrix represent Row Matrix
5 min read
C Program to sort rows of the Matrix
Given a matrix arr[][] of dimensions N * M, the task is to sort the matrix such that each row is sorted and the first element of each row is greater than or equal to the last element of the previous row. Examples: Input: N = 3, M = 3, arr[][] = {{7, 8, 9}, {5, 6, 4}, {3, 1, 2}}Output:1 2 34 5 67 8 9
3 min read
Program for scalar multiplication of a matrix
Given a 2D matrix mat[][] with n rows and m columns and a scalar element k, the task is to find out the scalar product of the given matrix. Examples: Input: mat[][] = [[2, 3], [5, 4]]k = 5Output: [[10, 15], [25, 20]] Input:mat[][] = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]k = 4Output: [[4, 8, 12], [16, 20,
4 min read
Program to check if matrix is lower triangular
Given a square matrix and the task is to check the matrix is in lower triangular form or not. A square matrix is called lower triangular if all the entries above the main diagonal are zero. Examples: Input : mat[4][4] = {{1, 0, 0, 0}, {1, 4, 0, 0}, {4, 6, 2, 0}, {0, 4, 7, 6}}; Output : Matrix is in
4 min read
Javascript Program for Sort the given matrix
Given a n x n matrix. The problem is to sort the given matrix in strict order. Here strict order means that matrix is sorted in a way such that all elements in a row are sorted in increasing order and for row ‘i’, where 1 <= i <= n-1, first element of row 'i' is greater than or equal to the la
2 min read