A Tree Model for Sparse Symmetric Indefinite Matrix Factorization

DOI10.1137/0609003MaRDI QIDQ3799554zbMATH OpenOpenAlexFDO

Authors 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

delayed eliminationdiagonal pivoting methodelimination treefactorizationlarge sparse symmetric positive definite matricesstabilitytree modeltree transformations

Mathematics Subject Classification ID

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

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
• New pivot selection for sparse symmetric indefinite factorization

Cited in

(9)

• A graph-theoretic model of symmetric Givens operations and its implications
• Symmetric elimination without pivoting
• scientific article; zbMATH DE number 3844931 (Why is no real title available?)
• scientific article; zbMATH DE number 4202054 (Why is no real title available?)
• Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices
• A node-addition model for symbolic factorization
• The Theory of Elimination Trees for Sparse Unsymmetric Matrices
• Factoring matrices with a tree-structured sparsity pattern
• A survey of direct methods for sparse linear systems

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)