Module faer_sparse::cholesky

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

The entry point in this module is SymbolicCholesky and factorize_symbolic_cholesky.

Note

The functions in this module accept unsorted input, producing a sorted decomposition factor (simplicial).

Modules

• simplicial
• supernodal

Structs

• BunchKaufmanRegularization
  Dynamic Bunch-Kaufman regularization.
• CholeskyError
  This error signifies that the LLT decomposition could not be computed due to the matrix not being numerically positive definite.
• CholeskySymbolicParams
• IntranodeBunchKaufmanRef
  Sparse intranodal Bunch-Kaufman factorization wrapper.
• LdltRef
  Sparse LDLT factorization wrapper.
• LdltRegularization
  Dynamic LDLT regularization.
• LltRef
  Sparse LLT factorization wrapper.
• LltRegularization
  Dynamic LLT regularization.
• SymbolicCholesky
  The symbolic structure of a sparse Cholesky decomposition.

Enums

• SymbolicCholeskyRaw
  The inner factorization used for the symbolic Cholesky, either simplicial or symbolic.

Functions

• factorize_symbolic_cholesky
  Computes the symbolic Cholesky factorization of the matrix A, or returns an error if the operation could not be completed.