Crate faer_sparse
source ·Modules
- Approximate minimum degree ordering.
- Computes the Cholesky decomposition (either LLT, LDLT, or Bunch-Kaufman) of a given sparse matrix. See
faer_cholesky
for more info. - Approximate minimum degree column ordering.
Structs
Enums
- Errors that can occur in sparse algorithms.
Traits
- Trait for unsigned integers that can be indexed with.
- Trait for signed integers corresponding to the ones satisfying
Index
.
Functions
- Computes the adjoint of the matrix
A
and returns a view over it. - Computes the adjoint of the symbolic matrix
A
and returns a view over it. - Computes the self-adjoint permutation $P A P^\top$ of the matrix
A
and returns a view over it. - Computes the transpose of the matrix
A
and returns a view over it.