Equivalent Sparse Matrix Reordering by Elimination Tree Rotations
Joseph W. H. Liu · SIAM Journal on Scientific and Statistical Computing · 1988
In this paper, we introduce a class of fill-preserving equivalent reorderings for sparse Cholesky factorization. This class is based on performing a special form of tree rotation on the elimination tree of the given sparse matrix. Some applications on the use of such elimination tree rotation are described: core storage reduction in a sparse out-of-core scheme, working storage reduction in the multifrontal method, and solution of a subset of unknowns. Some experimental results are also provided to demonstrate its effectiveness in some of these applications.