pub fn order<I>(
perm: &mut [I],
perm_inv: &mut [I],
A: SymbolicSparseColMatRef<'_, I>,
control: Control,
stack: PodStack<'_>,
) -> Result<FlopCount, FaerError>where
I: Index,
Expand description
Computes the approximate minimum degree ordering for reducing the fill-in during the sparse
Cholesky factorization of a matrix with the sparsity pattern of A + A.T
.