PMORSy: parallel sparse matrix ordering software for fill-in minimization

DOI10.1080/10556788.2016.1193177zbMath1365.65132OpenAlexW2473269645WikidataQ58645190 ScholiaQ58645190MaRDI QIDQ5268923

Iosif Meyerov, Anna Pirova, Sergey Lebedev, Evgeniy Kozinov

Publication date: 21 June 2017

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2016.1193177

zbMATH Keywords

Cholesky factorizationparallel computingsparse matrix orderingfill-in minimizationmultilevel nested dissectiontask-based parallel processing

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Packaged methods for numerical algorithms (65Y15) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (1)

PMORSy

Uses Software

• SparseMatrix
• ParMETIS
• PT-Scotch
• MORSy

Cites Work

• Modification of the minimum-degree algorithm by multiple elimination
• Sparse Cholesky Factorization on a Local-Memory Multiprocessor
• Generalized Nested Dissection
• Computing the Minimum Fill-In is NP-Complete
• An Efficient Heuristic Procedure for Partitioning Graphs
• An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Improving the Run Time and Quality of Nested Dissection Ordering
• An Approximate Minimum Degree Ordering Algorithm
• A column approximate minimum degree ordering algorithm
• Nested Dissection of a Regular Finite Element Mesh

This page was built for publication: PMORSy: parallel sparse matrix ordering software for fill-in minimization