Improving parallel ordering of sparse matrices using genetic algorithms
From MaRDI portal
Publication:2576753
Recommendations
- On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
- Independent set orderings for parallel matrix factorization by Gaussian elimination
- Reordering sparse matrices for parallel elimination
- Finding optimal ordering of sparse matrices for column-oriented parallel Cholesky factorization
- Parallel ordering using edge contraction
Cites work
- A compact row storage scheme for Cholesky factors using elimination trees
- A Data Structure for Parallel L/U Decomposition
- A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
- A New Implementation of Sparse Gaussian Elimination
- scientific article; zbMATH DE number 1131224 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Modification of the minimum-degree algorithm by multiple elimination
- Nested Dissection of a Regular Finite Element Mesh
- Parallel Algorithms for Sparse Linear Systems
- Reordering sparse matrices for parallel elimination
- The Evolution of the Minimum Degree Ordering Algorithm
Cited in
(1)
This page was built for publication: Improving parallel ordering of sparse matrices using genetic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2576753)