Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization

DOI10.1137/0613017MaRDI QIDQ3988986zbMATH OpenOpenAlexFDO

Authors Stanley C. Eisenstat, Joseph W. H. Liu

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 methodselimination directed acyclic graphelimination treeexperimental resultsstructural symmetrysymmetric reductionstransitive reductionunsymmetric sparse symbolic factorization algorithms

Mathematics Subject Classification ID

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

Cited in

(8)

• A review of frontal methods for solving linear systems
• Refining an approximate inverse
• Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations
• scientific article; zbMATH DE number 4168848 (Why is no real title available?)
• scientific article; zbMATH DE number 2098239 (Why is no real title available?)
• A survey of direct methods for sparse linear systems
• Mixed and componentwise condition numbers for matrix decompositions
• Symmetry-based matrix factorization

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

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