Expand description
sparse linear algebra module. contains low level routines and the implementation of their corresponding high level wrappers
Modules§
- amd
- approximate minimum degree ordering.
- cholesky
- computes the Cholesky decomposition (either $LL^\top$, $LTL^\top$, or $LBL^\top$) of a given
sparse matrix. see
crate::linalg::choleskyfor more info. - colamd
- approximate minimum degree column ordering.
- lu
- computes the $LU$ decomposition of a given sparse matrix. see
faer::linalg::lufor more info - matmul
- sparse matrix multiplication
- qr
- computes the $QR$ decomposition of a given sparse matrix. see
crate::linalg::qrfor more info - solvers
- high-level sparse matrix solvers
- triangular_
solve - sparse matrix triangular solve
Structs§
- Supernodal
Threshold - nonnegative threshold controlling when the supernodal factorization is used
- Symbolic
Supernodal Params - tuning parameters for the supernodal factorizations