Module sparse_solvers 

Direct sparse solvers (LU factorization, triangular solve). Iterative solvers for sparse linear systems.

All solvers operate on CSR matrices and use deterministic floating-point reductions via binned_sum_f64 to guarantee bit-identical results across runs and platforms.

Structs

SolverResult

Result of an iterative sparse linear solver.

Functions

bicgstab_solve

BiCGSTAB solver for general (non-symmetric) systems Ax = b.

cg_solve

Conjugate Gradient solver for symmetric positive-definite systems Ax = b.

gmres_solve

GMRES solver for general (non-symmetric) systems Ax = b with restarts.