Sparse Cholesky Elimination Tree

Here I derive the elimination tree for the right-looking sparse Cholesky algorithm, computing A = LL^T for a lower triangular L and sparse symmetric positive definite A . Elimination trees also appear throughout sparse LU and QR software, though those factorizations require some additional machinery. For Cholesky, the tree tells us how to recover the structural fill pattern of L and compactly…