Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices

DOI10.1137/050643581MaRDI QIDQ3537453zbMATH OpenOpenAlexFDO

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

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

elimination treesparse matrix factorizationsymbolic LU factorizationsymmetric reordering

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) 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
• Elimination Structures for Unsymmetric Sparse LU Factors
• A node-addition model for symbolic factorization
• Finding Exact and Approximate Block Structures for ILU Preconditioning
• scientific article; zbMATH DE number 2087828
• Computing the block triangular form of a sparse matrix
• Sparsity Analysis of the QR Factorization
• A Fast Reordering Algorithm for Parallel Sparse Triangular Solution
• Factoring matrices with a tree-structured sparsity pattern
• A Tree Model for Sparse Symmetric Indefinite Matrix Factorization

Cited in

(14)

• Hypergraph edge elimination -- a symbolic phase for Hermitian eigensolvers based on rank-1 modifications
• Constructing elimination trees for sparse unsymmetric matrices
• scientific article; zbMATH DE number 3843059 (Why is no real title available?)
• The Role of Elimination Trees in Sparse Factorization
• A compact row storage scheme for Cholesky factors using elimination trees
• A Tree Model for Sparse Symmetric Indefinite Matrix Factorization
• A Note on the Column Elimination Tree
• Improved Symbolic and Numerical Factorization Algorithms for Unsymmetric Sparse Matrices
• An Unsymmetrized Multifrontal LU Factorization
• Elimination Structures for Unsymmetric Sparse LU Factors
• The Theory of Elimination Trees for Sparse Unsymmetric Matrices
• A survey of direct methods for sparse linear systems
• Combinatorial generation via permutation languages. IV: Elimination trees
• A tree-based dataflow model for the unsymmetric multifrontal method

This page was built for publication: Algorithmic Aspects of 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 Q3537453)