https://github.com/sumukus/sparse-matrix-addition
Sparse Matrix Addition in C++
https://github.com/sumukus/sparse-matrix-addition
matrix-addition sparse-matrix-addition
Last synced: 3 months ago
JSON representation
Sparse Matrix Addition in C++
- Host: GitHub
- URL: https://github.com/sumukus/sparse-matrix-addition
- Owner: sumukus
- Created: 2021-09-05T18:35:56.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2021-09-05T19:11:02.000Z (over 3 years ago)
- Last Synced: 2025-01-14T09:35:35.077Z (4 months ago)
- Topics: matrix-addition, sparse-matrix-addition
- Language: C++
- Homepage:
- Size: 21.5 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Spares Matrix Addition
I have used the triplet representation for sparse matrix. It will have row, col and value.
In our code the sparsity value represents the total number of non zero elements.
If sparsity value is 0.1 and total matrix size is 10, then 0.1 *10 = 1. There will be 1 non zero elements present in the matrix.
I have used struct type to represent a matrix value. Then I have uesed vector of type struct to store all the matrix elements.
type struct{
int row;
int col;
int value;
};
vector < struct > matrix;
## Sparse Matrix Addition Result
The table given below shows the run time required to add two matrix of dimension 200*200 with different sparsity value. The same data will be stored in **runtime.txt** file when you execute the sparseMatrixAddition.cpp code file.
| Sparsity Value(sp)|Runtime(seconds)|
------------------------|-----------------|
0.1 | 0.00047 |
0.2 | 0.00095 |
0.3 | 0.001555 |
0.4 | 0.002 |
0.5 | 0.002589 |
0.6 | 0.002999 |
0.7 | 0.003481 |
0.8 | 0.003996 |
0.9 | 0.004717 |
The normal matrix addition of same dimension(200*200) took **0.001687 seconds** to complete its execution.
## Conclusions
we can see that the matrix with less number of sparsity value takes less amount of time to complete its execution. As the sparsity increases the execution time also increases. So it is good to use the triplet representation of matrix to do the addition when the sparsity value is less and matrix size is big. As it takes less amount of time to complete its execution.
It is not a good idea to use the triplet representation of martix to do addition when the sparsity value is high or matrix size is less. As it might take more time to complete its execution as compared to normal/usual way of martix addition.
## Drawbacks of the Above Code
* When we use builtin rand() functions, there are chances to overlap the rows and columns values. So I have use custom method to check. It makes the code slow to generate the random matrix.
* Improvements can be done on the logic/algorithm.