Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Added Sparse Matrix multiplication implementation (#2903) #2910

Open
wants to merge 1 commit into
base: master
Choose a base branch
from

Conversation

vrtarimala
Copy link

Description of Change

This PR implements the Sparse Matrix Compression and Decompression functionality using C++ with support for:

  1. Row-Major Order Compression: Compressing non-zero elements row by row.
  2. Column-Major Order Compression: Compressing non-zero elements column by column.
  3. Efficient retrieval of non-zero elements using std::map

The program includes:

  • Compression: Storing non-zero elements with their indices in row-major and column-major orders.
  • Decompression: Reconstructing the original matrix from the compressed form.
  • Efficient retrieval: Allows direct access to matrix elements via coordinates.

Checklist

  • Added description of change
  • Added file name matches File name guidelines
  • Added tests and example, test must pass
  • Relevant documentation/comments are added
  • PR title follows semantic commit guidelines
  • I acknowledge that all my contributions will be made under the project's license.

Notes

  • The implementation includes multiple test cases to validate the correctness of both compression and decompression methods.
  • The program uses std::map to store and retrieve matrix elements efficiently, making it scalable for larger matrices.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant