Fast and effective reordering of columns within supernodes using partition refinement

DOI10.1137/1.9781611975215.8MaRDI QIDQ6539157zbMATH OpenFDO

Authors Mathias Jacquelin, Esmond G. Ng, Barry W. Peyton

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611975215.8

Mathematics Subject Classification ID

Numerical linear algebra (65Fxx)

Recommendations

• On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
• A column approximate minimum degree ordering algorithm
• Finding optimal ordering of sparse matrices for column-oriented parallel Cholesky factorization
• A Fast Reordering Algorithm for Parallel Sparse Triangular Solution
• Node Selection Strategies for Bottom-Up Sparse Matrix Ordering

This page was built for publication: Fast and effective reordering of columns within supernodes using partition refinement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6539157)