A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs

DOI10.1137/0402011MaRDI QIDQ3834951zbMATH OpenOpenAlexFDO

Authors Joseph W. H. Liu, Andranik Mirzaian

Publication date 1989

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

chordal graphsparallel computationparallel eliminationparallel pivoting strategyreorderingsparse eliminationsparse symmetric positive definite matrixzero-deficiency

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)

Recommendations

• Reordering sparse matrices for parallel elimination
• A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
• On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
• Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution
• Finding optimal ordering of sparse matrices for column-oriented parallel Cholesky factorization

Cited in

(7)

• Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution
• Parallel ordering using edge contraction
• A practical algorithm for making filled graphs minimal
• A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
• Reordering for parallelism
• Design and implementation of a parallel Markowitz threshold algorithm
• A survey of direct methods for sparse linear systems

This page was built for publication: A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs

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