On the row merge tree for sparse LU factorization with partial pivoting

DOI10.1007/S10543-007-0116-1MaRDI QIDQ878210zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

partial pivotingstructure predictioncolumn elimination treeHall propertyrow merge treesparse LU factorization

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

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

Cites work

• scientific article; zbMATH DE number 3976197 (Why is no real title available?)
• scientific article; zbMATH DE number 554767 (Why is no real title available?)
• A Supernodal Approach to Sparse Partial Pivoting
• A column pre-ordering strategy for the unsymmetric-pattern multifrontal method
• A compact row storage scheme for Cholesky factors using elimination trees
• An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
• An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
• Computing row and column counts for sparse \(QR\) and \(LU\) factorization
• Computing the block triangular form of a sparse matrix
• Efficiency of a Good But Not Linear Set Union Algorithm
• Exact prediction of QR fill-in by row-merge trees
• Modification of the minimum-degree algorithm by multiple elimination
• On General Row Merging Schemes for Sparse Givens Transformations
• On algorithms for permuting large entries to the diagonal of a sparse matrix
• Parallel sparse Gaussian elimination with partial pivoting
• Parallel unsymmetric-pattern multifrontal sparse LU with column preordering
• Predicting fill for sparse orthogonal factorization
• Strong Hall Matrices
• Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
• The Role of Elimination Trees in Sparse Factorization
• \(S^+\): Efficient 2D sparse LU factorization on parallel machines

Cited in

(5)

• Predicting fill for sparse orthogonal factorization
• A survey of direct methods for sparse linear systems
• Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
• scientific article; zbMATH DE number 554767 (Why is no real title available?)
• Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting

Describes a project that uses

Uses Software

• MC21A
• SuperLU

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)