Crate faer_sparse

source ·

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.

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.

Functions

  • adjoint
    Computes the adjoint of the matrix A and returns a view over it.
  • adjoint_symbolic
    Computes the adjoint of the symbolic matrix A and returns a view over it.
  • permute_hermitian
    Computes the self-adjoint permutation $P A P^\top$ of the matrix A and returns a view over it.