Answers are grounded in this paper and cite their sources.
In this paper we present algorithms and data structures that may be used in the efficient implementation of symmetric Gaussian elimination for sparse systems of linear equations with positive definite coefficient matrices. The techniques described here serve as the basis for the symmetric codes in the Yale Sparse Matrix Package.
No takes yet. Share an insight, caveat, or question.
Eisenstat et al. (1981) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: