scientific article; zbMATH DE number 554767
From MaRDI portal
Publication:4288583
sparse matricespathsfactorizationbipartite graphsmatchingspartial pivotingstrong Hall propertystrong Hall graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
- Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting
- On the row merge tree for sparse LU factorization with partial pivoting
- Predicting Structure in Sparse Matrix Computations
- Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
- Predicting fill for sparse orthogonal factorization
Cited in
(11)- Separators and structure prediction in sparse orthogonal factorization
- Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers
- Predicting fill for sparse orthogonal factorization
- Design and implementation of a parallel Markowitz threshold algorithm
- Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting
- On the row merge tree for sparse LU factorization with partial pivoting
- Predicting the structure of sparse orthogonal factors
- Partitioning mathematical programs for parallel solution
- On optimizing multiplications of sparse matrices
- Computing row and column counts for sparse \(QR\) and \(LU\) factorization
- Combinatorial Aspects in Sparse Elimination Methods
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4288583)
