Skip to content
#

matrix-computation

Here are 4 public repositories matching this topic...

Language: All
Filter by language
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 17, 2026
  • Python

High-performance C++ implementations of iterative methods for solving large sparse linear systems and computing eigenvalues, including Conjugate Gradient, Preconditioned CG, Jacobi, Arnoldi, and QR-based solvers, optimized for memory efficiency and numerical stability.

  • Updated Mar 8, 2026
  • C++

Improve this page

Add a description, image, and links to the matrix-computation 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 matrix-computation topic, visit your repo's landing page and select "manage topics."

Learn more