Answers are grounded in this paper and cite their sources.
A simple characterization of fundamental supernodes is given in terms of the row subtrees of sparse Cholesky factors in the elimination tree. Using this characterization, an efficient algorithm is presented that determines the set of such supernodes in time proportional to the number of nonzeros and equations in the original matrix. Experimental results verify the practical efficiency of this algorithm.
No takes yet. Share an insight, caveat, or question.
Liu et al. (1993) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: