A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs

From MaRDI portal

Revision as of 16:22, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3834951

Jump to:navigation, search

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 computation chordal graphs reordering sparse elimination sparse symmetric positive definite matrix parallel elimination parallel pivoting strategy zero-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 (5)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3834951&oldid=17431130"