On the row merge tree for sparse LU factorization with partial pivoting
DOI10.1007/S10543-007-0116-1zbMATH Open1116.65036OpenAlexW2064762577MaRDI QIDQ878210FDOQ878210
Authors: Michel Cosnard, Laura Grigori, Esmond G. Ng 
Publication date: 26 April 2007
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10543-007-0116-1
Recommendations
- Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting
- scientific article; zbMATH DE number 554767
- Elimination Structures for Unsymmetric Sparse $LU$ Factors
- A Note on the Column Elimination Tree
- Computing row and column counts for sparse \(QR\) and \(LU\) factorization
partial pivotingstructure predictioncolumn elimination treeHall propertyrow merge treesparse LU factorization
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)
Cites Work
- A Supernodal Approach to Sparse Partial Pivoting
- On algorithms for permuting large entries to the diagonal of a sparse matrix
- Efficiency of a Good But Not Linear Set Union Algorithm
- A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
- Modification of the minimum-degree algorithm by multiple elimination
- The Role of Elimination Trees in Sparse Factorization
- Title not available (Why is that?)
- Computing the block triangular form of a sparse matrix
- An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
- An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
- A compact row storage scheme for Cholesky factors using elimination trees
- On General Row Merging Schemes for Sparse Givens Transformations
- Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
- Parallel sparse Gaussian elimination with partial pivoting
- \(S^+\): Efficient 2D sparse LU factorization on parallel machines
- Exact prediction of QR fill-in by row-merge trees
- Parallel unsymmetric-pattern multifrontal sparse LU with column preordering
- Predicting fill for sparse orthogonal factorization
- Title not available (Why is that?)
- Strong Hall Matrices
- Computing row and column counts for sparse \(QR\) and \(LU\) factorization
Cited In (5)
- A survey of direct methods for sparse linear systems
- Predicting fill for sparse orthogonal factorization
- Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
- Title not available (Why is that?)
- Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting
Uses Software
This page was built for publication: On the row merge tree for sparse LU factorization with partial pivoting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878210)
