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
python optimization solver least-squares scientific-computing iterative-methods sparse-linear-solver lsqr large-scale-optimizations numerical-linear-algebra large-scale-optimization matrix-computation senatorov lsqr-python-implementation lsqr-algorithm
-
Updated
Mar 1, 2026 - Python