Equivalent Sparse Matrix Reordering by Elimination Tree Rotations

DOI10.1137/0909029zbMath0651.65016OpenAlexW1980629456MaRDI QIDQ3796624

Joseph W. H. Liu

Publication date: 1988

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0909029

zbMATH Keywords

Cholesky factorizationsparse matrixelimination treeout-of-coretree rotationequivalent reorderingsmultifrontal numerical examples

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (10)

Minimal triangulations of graphs: a survey ⋮ Logarithmic barriers for sparse matrix cones ⋮ A parallel graph partitioning algorithm for a message-passing multiprocessor ⋮ Solution of sparse positive definite systems on a hypercube ⋮ A fast algorithm for sparse matrix computations related to inversion ⋮ A survey of direct methods for sparse linear systems ⋮ The complexity of bicriteria tree-depth ⋮ The complexity of bicriteria tree-depth ⋮ Parallel sparse Gaussian elimination with partial pivoting ⋮ A practical algorithm for making filled graphs minimal

This page was built for publication: Equivalent Sparse Matrix Reordering by Elimination Tree Rotations