PMORSy: parallel sparse matrix ordering software for fill-in minimization
DOI10.1080/10556788.2016.1193177zbMATH Open1365.65132OpenAlexW2473269645WikidataQ58645190 ScholiaQ58645190MaRDI QIDQ5268923FDOQ5268923
Iosif Meyerov, Anna Pirova, Evgeniy Kozinov, Sergey Lebedev
Publication date: 21 June 2017
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2016.1193177
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
Cholesky factorizationparallel computingsparse matrix orderingfill-in minimizationmultilevel nested dissectiontask-based parallel processing
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Packaged methods for numerical algorithms (65Y15) Numerical algorithms for specific classes of architectures (65Y10)
Cites Work
- A column approximate minimum degree ordering algorithm
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Generalized Nested Dissection
- An Efficient Heuristic Procedure for Partitioning Graphs
- Nested Dissection of a Regular Finite Element Mesh
- An Approximate Minimum Degree Ordering Algorithm
- Modification of the minimum-degree algorithm by multiple elimination
- Computing the Minimum Fill-In is NP-Complete
- Improving the Run Time and Quality of Nested Dissection Ordering
- An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
- 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)