Struct SparseMatrix 

pub struct SparseMatrix<S: Scalar + Entity> { /* private fields */ }

CSC sparse matrix wrapping faer’s SparseColMat.

Trait relationship: SparseMatrix<S> does not currently implement the crate::Matrix trait. Sparse-aware solvers in this crate (crate::iterative, crate::preconditioner) consume &SparseMatrix<S> concretely. Whether sparse should join the crate::Matrix trait is an open foundation question deferred per Foundation Spec §7 #5 — see F-MATRIX-SHAPE in docs/internal-followups.md.

Implementations

impl<S: Scalar + SimpleEntity + Conjugate<Canonical = S> + ComplexField> SparseMatrix<S>

pub fn from_triplets( nrows: usize, ncols: usize, triplets: &[(usize, usize, S)], ) -> Result<Self, LinalgError>

Build from COO (triplet) format.

Duplicate entries at the same (row, col) are summed.

pub fn nrows(&self) -> usize

Number of rows.

pub fn ncols(&self) -> usize

Number of columns.

pub fn nnz(&self) -> usize

Number of structural non-zeros.

pub fn get(&self, row: usize, col: usize) -> S

Element access (returns zero for missing entries).

pub fn to_dense(&self) -> DenseMatrix<S>

Convert to dense matrix.

pub fn col_ptrs(&self) -> Vec<usize>

CSC column pointers.

pub fn row_indices(&self) -> Vec<usize>

CSC row indices.

pub fn values(&self) -> Vec<S>

CSC values.

pub fn mul_vec(&self, x: &[S]) -> Result<Vec<S>, LinalgError>

Sparse matrix-vector product: y = A * x.

pub fn transpose(&self) -> Result<SparseMatrix<S>, LinalgError>

Transpose of the sparse matrix.