Answers are grounded in this paper and cite their sources.
A tree model is presented to study the sparse factorization of large symmetric indefinite matrices by the diagonal pivoting method. The basic structure uses the elimination tree of symmetric matrices and the notion of delayed elimination. The factorization process for indefinite systems can be viewed as a sequence of tree transformations based on both the structural information and numerical data values. This provides a model as a common basis to study various numerical aspects of sparse symmetric indefinite decomposition.
No takes yet. Share an insight, caveat, or question.
Joseph W. H. Liu (1988) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: