Elimination Structures for Unsymmetric Sparse LU Factors

DOI10.1137/0614024MaRDI QIDQ5286278zbMATH OpenOpenAlexFDO

Authors J. R. Gilbert, Joseph W. H. Liu

Publication date 29 June 1993

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

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

zbMATH Keywords

Cholesky factorizationdirected acyclic graphselimination dagselimination treeGaussian eliminationnumerical examplessparse LU factorizationsparse symmetric positive definite matricesunsymmetric matrices

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

Recommendations

• Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices
• The Theory of Elimination Trees for Sparse Unsymmetric Matrices
• Constructing elimination trees for sparse unsymmetric matrices

Cited in

(25)

• Refining an approximate inverse
• The impact of high-performance computing in the solution of linear systems: Trends and problems
• Efficient use of sparsity by direct solvers applied to 3D controlled-source EM problems
• Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations
• Constructing elimination trees for sparse unsymmetric matrices
• Fast algorithms for hierarchically semiseparable matrices
• scientific article; zbMATH DE number 3844931 (Why is no real title available?)
• scientific article; zbMATH DE number 4202054 (Why is no real title available?)
• The Role of Elimination Trees in Sparse Factorization
• Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices
• Combinatorial Aspects in Sparse Elimination Methods
• The role of graph structures in the theory of local elimination algorithms
• A Tree Model for Sparse Symmetric Indefinite Matrix Factorization
• On the Complexity of Sparse QR and LU Factorization of Finite-Element Matrices
• scientific article; zbMATH DE number 4109938 (Why is no real title available?)
• An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization
• On exploiting sparsity of multiple right-hand sides in sparse direct solvers
• An Unsymmetrized Multifrontal LU Factorization
• Forbidden directed minors and Kelly-width
• Design and implementation of a parallel Markowitz threshold algorithm
• The Theory of Elimination Trees for Sparse Unsymmetric Matrices
• A survey of direct methods for sparse linear systems
• Sparse direct factorizations through unassembled hyper-matrices
• On the row merge tree for sparse LU factorization with partial pivoting
• Digraph measures: Kelly decompositions, games, and orderings

Describes a project that uses

Uses Software

• Harwell-Boeing sparse matrix collection

This page was built for publication: Elimination Structures for Unsymmetric Sparse $LU$ Factors

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