Sparse Cholesky Elimination Tree, Part 2: From Symbolic Fill to Parent Links

In a recent post I gave intuition for the sparse Cholesky elimination tree by appealing to the task DAG and showed how it could be compressed into a tree in the sparse case. That post also showed how to use and compute the tree. Here I take a narrower and more conventional route: I start from a naive symbolic translation of right-looking Cholesky, identify the structural work it repeats, and show…