A matrix is a two-dimensional data structure, where we can store data in rows and columns format. In data structures, a matrix is a two-dimensional array of elements, with the same data type. All values in a matrix must have the same data type. The matrix can have a fixed number of rows and columns, or it can be dynamically allocated based on the requirement.
Matrices can be used in various applications, such as image processing, data analysis, and machine learning. In this chapter, we will learn about matrices in data structures, how to create and access elements in a matrix, and various operations that can be performed on matrices.
If the matrix has m rows and n columns, there are m n elements. The matrix is represented by uppercase letters (in this case, “A“), and the elements in the matrix are represented by lowercase letters and two subscripts that represent the positions of the elements in the same order. In the case of, ‘‘, where i is the number of rows and j is the number of columns.
Types of Matrices in Data Structure
There are many types of matrices, which are basically categorized based on element values, order, number of rows and columns, and so on. There are different types of matrices in linear algebra. All types of matrices are distinguished based on their elements, order, and specific conditions.
Special types of matrices are square, diagonal, identity, translocations, and symmetric matrices. This is a square matrix with the same number of rows and columns. Currently, using different terms, different matrix types are categorized below, along with their definitions and examples.
- Null Matrix : If all specified elements in a matrix are 0, then the matrix is called a null matrix and is usually represented by zero.
A = [ [0, 0], [0, 0] ]
Row Matrix: If a matrix has only one row, it is called a row matrix.
A = [ [1, 2, 3] ]
Column Matrix: If a matrix has only one column, it is called a column matrix.
A = [ [1], [2], [3] ]
Square Matrix: If the number of rows and columns in a matrix is the same, it is called a square matrix.
A = [ [1, 2], [3, 4] ]
Triangular Matrix : It is a rectangular matrix with all the 0 factors below and/or above the diagonal. There are two principal types of triangular matrices – lower triangular matrix and upper triangular matrix.
A = [ [1, 0, 0], [2, 3, 0], [4, 5, 6] ]
Identity Matrix : If the diagonal elements of a square matrix are 1 and all other elements are 0, it is called an identity matrix.
A = [ [1, 0, 0], [0, 1, 0], [0, 0, 1] ]
Diagonal Matrix : If all elements of a square matrix are 0, except the diagonal elements, it is called a diagonal matrix.
A = [ [1, 0, 0], [0, 2, 0], [0, 0, 3] ]
Scalar Matrix : If all diagonal elements of a square matrix are the same, it is called a scalar matrix.
A = [ [2, 0, 0], [0, 2, 0], [0, 0, 2] ]
Symmetric Matrix : If a matrix is equal to its transpose, it is called a symmetric matrix.
A = [ [1, 2, 3], [2, 4, 5], [3, 5, 6] ]
Transpose of a Matrix : The transpose of a matrix is obtained by interchanging rows and columns. If A = [aij] m n, then the transpose of A is represented by AT = [bij] n m, where bij = aji.
A = [ [1, 2], [3, 4] ]
AT = [ [1, 3], [2, 4] ]
Components of a Matrix
- Size – The size of a matrix is the number of rows and columns in the matrix. If a matrix has m rows and n columns, the size of the matrix is m n.
- Element – An element in a matrix is a value stored at a specific position in the matrix. The element is represented by aij, where i is the row number and j is the column number.
- Row – A row in a matrix is a horizontal sequence of elements. A matrix has m rows, numbered from 1 to m.
- Column – A column in a matrix is a vertical sequence of elements. A matrix has n columns, numbered from 1 to n.
- Transpose – We can get transpose of a matrix by interchanging it’s row and column. If A = [aij] m n, then the transpose of A is represented by AT = [bij] n m, where bij = aji.
- Rank – The rank of a matrix is the maximum number of linearly independent rows or columns in the matrix. The rank of a matrix is denoted by rank(A).
Operations on Matrices
There are various opereations that can be performed on matrices. Some of the common operations are:
- Traversal – Traversing a matrix means visiting each element in the matrix exactly once. This can be done using nested loops to iterate over each row and column in the matrix.
- Search – Searching for an element in a matrix involves finding the position of a specific element in the matrix. This can be done by traversing the matrix and comparing each element with the target element.
- Row-wise Traversal – Traversing a matrix row-wise means visiting each element in each row of the matrix. This can be done by iterating over each row and then iterating over each column in the row.
- Column-wise Traversal – Traversing a matrix column-wise means visiting each element in each column of the matrix. This can be done by iterating over each column and then iterating over each row in the column.
- Accessing Elements – Accessing an element in a matrix means retrieving the value stored at a specific position in the matrix. This can be done by specifying the row and column index of the element to be accessed.
Traversal of a Matrix
Following code demonstrates how to traverse a matrix using nested loops:
CC++JavaPython
#include<stdio.h>intmain(){int rows =2, cols =2;int matrix[10][10];
matrix[0][0]=1;
matrix[0][1]=2;
matrix[1][0]=3;
matrix[1][1]=4;printf("The matrix is:\n");for(int i=0; i<rows; i++){for(int j=0; j<cols; j++){printf("%d ", matrix[i][j]);}printf("\n");}return0;}
Output
The output obtained is as follows −
The matrix is:
1 2
3 4
Search in a Matrix
Following code demonstrates how to search an element in a matrix:
CC++JavaPython
//C Program to search an element in a matrix#include<stdio.h>intmain(){int rows =2, cols =2, i, j, key;int matrix[10][10];
matrix[0][0]=1;
matrix[0][1]=2;
matrix[1][0]=3;
matrix[1][1]=4;
key =3;for(i=0; i<rows; i++){for(j=0; j<cols; j++){if(matrix[i][j]== key){printf("Element found at position (%d, %d)\n", i, j);return0;}}}printf("Element not found\n");return0;}
Output
The output obtained is as follows −
Element found at position (1, 0)
Row-wise Traversal of a Matrix
Following code demonstrates how to traverse a matrix row-wise:
CC++JavaPython
//C Program to traverse a matrix row-wise#include<stdio.h>intmain(){int rows =2, cols =2, i, j;int matrix[10][10];
matrix[0][0]=1;
matrix[0][1]=2;
matrix[1][0]=3;
matrix[1][1]=4;printf("The matrix is:\n");for(i=0; i<rows; i++){for(j=0; j<cols; j++){printf("%d ", matrix[i][j]);}printf("\n");}return0;}
Output
The output obtained is as follows −
The matrix is:
1 2
3 4
Column-wise Traversal of a Matrix
Following code demonstrates how to traverse a matrix column-wise:
CC++JavaPython
//C Program to traverse a matrix column-wise#include<stdio.h>intmain(){int rows =2, cols =2, i, j;int matrix[10][10];
matrix[0][0]=1;
matrix[0][1]=2;
matrix[1][0]=3;
matrix[1][1]=4;printf("The matrix is:\n");for(i=0; i<cols; i++){for(j=0; j<rows; j++){printf("%d ", matrix[j][i]);}printf("\n");}return0;}
Output
The output obtained is as follows −
The matrix is:
1 3
2 4
Accessing Elements of a Matrix
Following code demonstrates how to access elements of a matrix:
CC++JavaPython
//C Program to access elements of a matrix#include<stdio.h>intmain(){int rows =2, cols =, i, j;int matrix[10][10];
matrix[0][0]=1;
matrix[0][1]=2;
matrix[1][0]=3;
matrix[1][1]=4;printf("The element at position (1, 1) is %d\n", matrix[0][0]);printf("The element at position (1, 2) is %d\n", matrix[0][1]);printf("The element at position (2, 1) is %d\n", matrix[1][0]);printf("The element at position (2, 2) is %d\n", matrix[1][1]);return0;}
Output
The output obtained is as follows −
The element at position (1, 1) is 1
The element at position (1, 2) is 2
The element at position (2, 1) is 3
The element at position (2, 2) is 4
Application of Matrices
Following are some of the applications of matrices:
- Image processing –Matrices are used for images. let’s say we have an image of 100×100 pixels, then the image can be represented as a 100×100 matrix where each element represents the color of a pixel.Matrices can be used to perform operations such as scaling, rotation, and filtering on images.
- Data analysis –It is also used for data analysis. Imagine we have a data set with multiple features, then the data set can be represented as a matrix where each row represents a data point and each column represents a feature.Matrices can be used to perform operations such as normalization, standardization, and dimensionality reduction on data sets.
- Machine learning –In machine learning, matrices are used for representing data sets and models. input data, output data, and parameters of a model.Matrices can be used for performing operations such as forward propagation, backward propagation, and optimization in machine learning algorithms.
- Computer graphics –Matrices are used in computer graphics for representing objects in 3D space, to store the position, rotation, and scale of objects, and perform operations such as translation, rotation, and scaling.
- Scientific computing –They are also used in scientific computing to represent physical systems and perform simulations.Matrices can be used to store the state of a physical system, and perform operations such as integration, differentiation, and solving differential equations.
Conclusion
In this chapter, we learned about matrices in data structures, different types of matrices, components of a matrix, operations that can be performed on matrices, and applications of matrices in various fields. Matrices are a fundamental data structure used in various applications such as image processing, data analysis, machine learning, computer graphics, and scientific computing.