Equivalent Sparse Matrix Reordering by Elimination Tree Rotations

DOI10.1137/0909029MaRDI QIDQ3796624zbMATH OpenOpenAlexFDO

Authors 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 factorizationelimination treeequivalent reorderingsmultifrontal numerical examplesout-of-coresparse matrixtree rotation

Mathematics Subject Classification ID

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

Recommendations

• Reordering sparse matrices for parallel elimination
• On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
• The Theory of Elimination Trees for Sparse Unsymmetric Matrices
• Finding optimal ordering of sparse matrices for column-oriented parallel Cholesky factorization
• A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization

Cited in

(12)

• A parallel graph partitioning algorithm for a message-passing multiprocessor
• Reordering sparse matrices for parallel elimination
• Solution of sparse positive definite systems on a hypercube
• A practical algorithm for making filled graphs minimal
• A fast algorithm for sparse matrix computations related to inversion
• Logarithmic barriers for sparse matrix cones
• A survey of direct methods for sparse linear systems
• The complexity of bicriteria tree-depth
• The complexity of bicriteria tree-depth
• Combinatorial generation via permutation languages. IV: Elimination trees
• Parallel sparse Gaussian elimination with partial pivoting
• Minimal triangulations of graphs: a survey

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3796624)