Crate faer_sparse

Modules

amd

Approximate minimum degree ordering.

cholesky

Computes the Cholesky decomposition (either LLT, LDLT, or Bunch-Kaufman) of a given sparse matrix. See faer_cholesky for more info.

colamd

Approximate minimum degree column ordering.

triangular_solve

Structs

SupernodalThreshold

SymbolicSupernodalParams

Enums

FaerError

Errors that can occur in sparse algorithms.

Traits

Index

Trait for unsigned integers that can be indexed with.

SignedIndex

Trait for signed integers corresponding to the ones satisfying Index.