A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs

DOI10.1137/0402011zbMath0678.65026OpenAlexW2027140916MaRDI QIDQ3834951

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

parallel computationchordal graphsreorderingsparse eliminationsparse symmetric positive definite matrixparallel eliminationparallel pivoting strategyzero-deficiency

Mathematics Subject Classification ID

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

Related Items

Design and Implementation of a Parallel Markowitz Threshold Algorithm, Reordering for parallelism, A survey of direct methods for sparse linear systems, A practical algorithm for making filled graphs minimal, Partitioning a chordal graph into transitive subgraphs for parallel sparse triangular solution