Constructing elimination trees for sparse unsymmetric matrices

DOI10.1137/110825443MaRDI QIDQ2848615zbMATH OpenOpenAlexFDO

Authors Kamer Kaya, Bora Uçar

Publication date 26 September 2013

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

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

zbMATH Keywords

elimination treesparse matrix factorizationgraphs and matrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50) Trees (05C05)

Recommendations

• Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices
• On constructing the elimination tree
• The Theory of Elimination Trees for Sparse Unsymmetric Matrices
• Elimination Structures for Unsymmetric Sparse $LU$ Factors
• Sparse Partial Pivoting in Time Proportional to Arithmetic Operations

Cited in

(4)

• A Note on the Column Elimination Tree
• A compact row storage scheme for Cholesky factors using elimination trees
• The Theory of Elimination Trees for Sparse Unsymmetric Matrices
• On constructing the elimination tree

This page was built for publication: Constructing elimination trees for sparse unsymmetric matrices

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