GPU-accelerated differentiable sparse linear solver library for JAX
-
Updated
Oct 26, 2026 - Python
GPU-accelerated differentiable sparse linear solver library for JAX
MATLAB library of gradient descent algorithms for sparse modeling: Version 1.0.3
SuiteSparse: a suite of sparse matrix packages by @DrTimothyAldenDavis et al. with improved CMake support
Solve sparse linear systems in JAX using the KLU algorithm
Iterative hard thresholding for l0 penalized regression
Algebraic Multigrid (AMG) Solver Library
LSQR is an iterative method for solving large, sparse, linear systems of equations and linear least-squares problems, including under- or over-determined and rank-deficient systems. It uses the Lanczos bidiagonalization process to provide a robust alternative to conjugate gradients, offering better numerical stability. Solver
Pure-Rust sparse direct solver (symmetric LDLᵀ + unsymmetric LU + KLU) and preconditioner. A PARDISO-style, type-agnostic, embeddable replacement with no native dependencies.
The Conjugate Gradient (CG) method is an efficient iterative algorithm for solving large, sparse systems of linear equations where the matrix is symmetric and positive-definite. It finds the minimum of a quadratic function by generating conjugate search directions, ensuring convergence in at most steps for an matrix.Solver
A CUDA implementation of the transpose-free Quasi-Minimal Residual method
A parallel and GPU-accelerated Code for Real-Space All-Electron Linear-Scaling Density Functional Theory
A customized sparse solver wrapper with Numba compatibility
ITerative SOLvers package
Sparse LU factorization with partial pivoting in Rust
In this repository, you will find a serial, shared-memory parallel, distributed-memory parallel and hybrid implementations of the conjugate gradient optimization simulation. This is a sparse linear solver optimized using the second-order poisson equation.
A PyTorch library for differentiable sparse linear system solvers with automatic differentiation support.
Python wrapper for the sparse QR decomposition in SuiteSparseQR.
An Go native implementation of the Map Reduce parallel framework for a sparse linear solver utilizing conjugate gradient to solve the Poisson equation.
Comparison of Sparse Linear Systems solvers via Cholesky Decomposition.
To associate your repository with the sparse-linear-solver topic, visit your repo's landing page and select "manage topics."