Algorithms and Data Structures for Sparse Symmetric Gaussian Elimination
Stanley C. Eisenstat, Martin H. Schultz, Andrew H. Sherman · SIAM Journal on Scientific and Statistical Computing · 1981
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.