Skip to content
#

sparse-linear-solver

Here are 19 public repositories matching this topic...

Rust + WASM sublinear-time solver for asymmetric diagonally dominant systems. Exposes Neumann series, push, and hybrid random-walk algorithms with npm/npx CLI and Flow-Nexus HTTP streaming for swarm cost propagation and verification.

  • Updated Oct 7, 2025
  • Rust
conjugate-gradient-sparse-cg-solver-course

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

  • Updated Mar 1, 2026
  • Jupyter Notebook
LSQR-solver-course

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

  • Updated Mar 1, 2026
  • Python
AngstromCube

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.

  • Updated Jun 6, 2022
  • C++

Improve this page

Add a description, image, and links to the sparse-linear-solver topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the sparse-linear-solver topic, visit your repo's landing page and select "manage topics."

Learn more