pub fn camd<I, Iptr>(mat: CsStructureViewI<'_, I, Iptr>) -> PermOwnedI<I> where
    I: SpIndex,
    Iptr: SpIndex
Expand description

Find a permutation matrix P which reduces the fill-in of the square sparse matrix mat in Cholesky factorization (ie, the number of nonzeros of the Cholesky factorization of P A P^T is less than for the Cholesky factorization of A).

If A is not symmetric, the ordering will be computed for A + A^T

Panics

This function will panic if the passed matrix is not square.