On the row merge tree for sparse LU factorization with partial pivoting
From MaRDI portal
Publication:878210
DOI10.1007/s10543-007-0116-1zbMath1116.65036OpenAlexW2064762577MaRDI QIDQ878210
Michel Cosnard, Esmond G. Ng, Laura Grigori
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
partial pivotingcolumn elimination treestructure predictionHall propertyrow merge treesparse LU factorization
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Parallel sparse Gaussian elimination with partial pivoting
- S+: Efficient 2D Sparse LU Factorization on Parallel Machines
- On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
- Exact Prediction of QR Fill-In by Row-Merge Trees
- The Role of Elimination Trees in Sparse Factorization
- Parallel unsymmetric-pattern multifrontal sparse LU with column preordering
- Modification of the minimum-degree algorithm by multiple 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
- Predicting fill for sparse orthogonal factorization
- Efficiency of a Good But Not Linear Set Union Algorithm
- An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
- A Supernodal Approach to Sparse Partial Pivoting
- Strong Hall Matrices
- Computing the block triangular form of a sparse matrix
- An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
- A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
- Computing row and column counts for sparse \(QR\) and \(LU\) factorization
This page was built for publication: On the row merge tree for sparse LU factorization with partial pivoting
