Elimination Structures for Unsymmetric Sparse $LU$ Factors
From MaRDI portal
Publication:5286278
DOI10.1137/0614024zbMath0769.65010MaRDI QIDQ5286278
Joseph W. H. Liu, John R. Gilbert
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
numerical examples; Cholesky factorization; Gaussian elimination; directed acyclic graphs; elimination tree; unsymmetric matrices; sparse LU factorization; sparse symmetric positive definite matrices; elimination dags
65F50: Computational methods for sparse matrices
65F05: Direct numerical methods for linear systems and matrix inversion
05C20: Directed graphs (digraphs), tournaments
Related Items
On Exploiting Sparsity of Multiple Right-Hand Sides in Sparse Direct Solvers, Design and Implementation of a Parallel Markowitz Threshold Algorithm, A survey of direct methods for sparse linear systems, Forbidden directed minors and Kelly-width, Digraph measures: Kelly decompositions, games, and orderings, 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, Fast algorithms for hierarchically semiseparable matrices
Uses Software
