The official SuiteSparse library: a suite of sparse matrix algorithms authored or co-authored by Tim Davis, Texas A&M University.
Accelerated Sparse Linear Algebra with Postgres and SuiteSparse
qpSWIFT is a light-weight sparse quadratic programming solver
Algebraic Multigrid (AMG) Solver Library
(Incomplete, In Continuation) Implementation of Data Structures like Stacks, Queues, etc. using C programming language
ITerative SOLvers package
Basic programs written in C using ANSI for GNU-GCC
Improving SpGEMM Performance Through Matrix Reordering and Cluster-wise Computation [SC'25]
Sparse matric-vector multiplication using MPI
Improving SpGEMM Performance Through Matrix Reordering and Cluster-wise Computation [SC'25]
An MPI+OpenMP hybrid implementation of Gustavson's Sparse Matrix Multiplication for Boolean CSR matrices
Sparse matrix visualization tool
A library that can be used to read and write the matrix market format in parallel.
This project aims utilize a sparse matrix as form of matrix or image value compression by basically implementing a special kind of data structure where it omits one continuously recurring value ultimately saving space only for "important" variables.
New Sparse Matrix Storage Format: Contiguous Clustering (CC) A novel storage format for diagonally dominant sparse matrices, designed to minimize memory usage and accelerate SpMV operations.The CC format clusters non-zero elements along matrix diagonals, storing only essential metadata such as start indices and offsets.
Compare preconditioned conjugate gradient algorithm with different sparse matrices, floating point precision levels, and implementations
Bitmap + rank-indexed vault sparse matrix in C — 4,000 bytes → 102. Beats COO by storing zero coordinates.
Add a description, image, and links to the sparse-matrix topic page so that developers can more easily learn about it.
To associate your repository with the sparse-matrix topic, visit your repo's landing page and select "manage topics."