A Tree Model for Sparse Symmetric Indefinite Matrix Factorization

DOI10.1137/0609003zbMATH Open0653.65021OpenAlexW2049056418MaRDI QIDQ3799554FDOQ3799554

Joseph W. H. Liu

Publication date: 1988

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

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

zbMATH Keywords

stabilityfactorizationelimination treetree transformationstree modeldiagonal pivoting methoddelayed eliminationlarge sparse symmetric positive definite matrices

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Factorization of matrices (15A23)

Cited In (3)

• A survey of direct methods for sparse linear systems
• The Theory of Elimination Trees for Sparse Unsymmetric Matrices
• Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices

   Recommendations

• The Theory of Elimination Trees for Sparse Unsymmetric Matrices 👍 👎
• Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices 👍 👎
• Elimination Structures for Unsymmetric Sparse $LU$ Factors 👍 👎
• A Note on Sparse Factorization in a Paging Environment 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: A Tree Model for Sparse Symmetric Indefinite Matrix Factorization

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