Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices

DOI10.1137/050643581zbMath1156.65022OpenAlexW2148847183MaRDI QIDQ3537453

Joseph W. H. Liu, Stanley C. Eisenstat

Publication date: 6 November 2008

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

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

zbMATH Keywords

sparse matrix factorizationelimination treesymbolic LU factorizationsymmetric reordering

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (1)

A survey of direct methods for sparse linear systems

This page was built for publication: Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices