The Theory of Elimination Trees for Sparse Unsymmetric Matrices
From MaRDI portal
Publication:5317621
DOI10.1137/S089547980240563XzbMath1079.65025MaRDI QIDQ5317621
Joseph W. H. Liu, Stanley C. Eisenstat
Publication date: 19 September 2005
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
65F50: Computational methods for sparse matrices
05C05: Trees
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
On Exploiting Sparsity of Multiple Right-Hand Sides in Sparse Direct Solvers, A survey of direct methods for sparse linear systems, Acoustic inverse scattering via Helmholtz operator factorization and optimization, LIFO-search: a min-max theorem and a searching game for cycle-rank and tree-depth, Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations, LIFO-Search on Digraphs: A Searching Game for Cycle-Rank, Fast algorithms for hierarchically semiseparable matrices