Sparse Cholesky Elimination Tree
Summary
This article derives the elimination tree for the right-looking sparse Cholesky algorithm and explains how it determines fill-in and the task dependency graph. It presents both symbolic and numeric factorization approaches, shows how to compute the elimination tree from the initial nonzero pattern, and argues that the resulting structure can be represented as a tree, enabling efficient sparse factorization.