scientific article; zbMATH DE number 554767
From MaRDI portal
Publication:4288583
zbMath0792.05098MaRDI QIDQ4288583
Publication date: 26 May 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
pathssparse matricesfactorizationbipartite graphsmatchingspartial pivotingstrong Hall propertystrong Hall graphs
Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Separators and structure prediction in sparse orthogonal factorization ⋮ On the row merge tree for sparse LU factorization with partial pivoting ⋮ Partitioning mathematical programs for parallel solution ⋮ Design and Implementation of a Parallel Markowitz Threshold Algorithm ⋮ On optimizing multiplications of sparse matrices ⋮ Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers ⋮ Combinatorial Aspects in Sparse Elimination Methods
