Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization

DOI10.1137/0613017zbMath0746.65023OpenAlexW2021108117MaRDI QIDQ3988986

Joseph W. H. Liu, Stanley C. Eisenstat

Publication date: 28 June 1992

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

comparison of methodsexperimental resultselimination treetransitive reductionstructural symmetryelimination directed acyclic graphsymmetric reductionsunsymmetric sparse symbolic factorization algorithms

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Graph theory (including graph drawing) in computer science (68R10) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (6)

A survey of direct methods for sparse linear systems ⋮ Unnamed Item ⋮ Mixed and componentwise condition numbers for matrix decompositions ⋮ Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations ⋮ A review of frontal methods for solving linear systems ⋮ Refining an approximate inverse

This page was built for publication: Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization