Compute the elimination tree for a quasidefinite matrix
in compressed sparse column form, where the input matrix is
assumed to contain data for the upper triangular part of A only,
and there are no duplicate indices.
Compute an LDL decomposition for a quasidefinite matrix
in compressed sparse column form, where the input matrix is
assumed to contain data for the upper triangular part of A only,
and there are no duplicate indices.