Module sparse

Sparsity-aware algorithms for large-scale least squares problems

This module implements algorithms specifically designed for sparse least squares problems, where the Jacobian matrix has many zero entries. These methods are essential for large-scale problems where standard dense methods become computationally prohibitive.

Structs

SparseInfo

Information about sparsity in the problem

SparseMatrix

Sparse matrix representation using compressed sparse row (CSR) format

SparseOptions

Options for sparse least squares algorithms

SparseResult

Result from sparse least squares optimization

Functions

lsqr

LSQR algorithm for sparse least squares

sparse_least_squares

Solve sparse least squares problem using iterative methods