PMORSy: parallel sparse matrix ordering software for fill-in minimization
From MaRDI portal
Publication:5268923
Recommendations
- On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
- Parallel ordering using edge contraction
- scientific article; zbMATH DE number 554763
- Reordering sparse matrices for parallel elimination
- Finding optimal ordering of sparse matrices for column-oriented parallel Cholesky factorization
Cites Work
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A column approximate minimum degree ordering algorithm
- An Approximate Minimum Degree Ordering Algorithm
- An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
- An Efficient Heuristic Procedure for Partitioning Graphs
- Computing the Minimum Fill-In is NP-Complete
- Generalized Nested Dissection
- Improving the Run Time and Quality of Nested Dissection Ordering
- Modification of the minimum-degree algorithm by multiple elimination
- Nested Dissection of a Regular Finite Element Mesh
- Sparse Cholesky Factorization on a Local-Memory Multiprocessor
Cited In (1)
Uses Software
This page was built for publication: PMORSy: parallel sparse matrix ordering software for fill-in minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268923)