Elimination Structures for Unsymmetric Sparse $LU$ Factors
From MaRDI portal
Publication:5286278
DOI10.1137/0614024zbMath0769.65010OpenAlexW2055791798MaRDI 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 examplesCholesky factorizationGaussian eliminationdirected acyclic graphselimination treeunsymmetric matricessparse LU factorizationsparse symmetric positive definite matriceselimination dags
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05) Directed graphs (digraphs), tournaments (05C20)
Related Items
Design and Implementation of a Parallel Markowitz Threshold Algorithm, On Exploiting Sparsity of Multiple Right-Hand Sides in Sparse Direct Solvers, Digraph measures: Kelly decompositions, games, and orderings, Forbidden directed minors and Kelly-width, A survey of direct methods for sparse linear systems, Efficient use of sparsity by direct solvers applied to 3D controlled-source EM problems, Fast algorithms for hierarchically semiseparable matrices, Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations, Refining an approximate inverse, The impact of high-performance computing in the solution of linear systems: Trends and problems
Uses Software