Electronic Resource
ParAMD: Parallel Approximate Minimum Degree Algorithm
| Τίτλος: | ParAMD: Parallel Approximate Minimum Degree Algorithm |
|---|---|
| Συγγραφείς: | Chang, Yen-Hsiang, Buluc, Aydin, Demmel, James |
| Συνεισφορές: | Chang, Yen-Hsiang, Buluc, Aydin, Demmel, James |
| Στοιχεία εκδότη: | Zenodo |
| Έτος έκδοσης: | 2025 |
| Συλλογή: | Zenodo |
| Θεματικοί όροι: | Sparse Matrix, Approximate Minimum Degree, ParAMD, Fill-in Reduction, Fill-reducing Ordering |
| Περιγραφή: | ParAMD is a shared memory parallel implementation of the approximate minimum degree (AMD) algorithm with multiple elimination via distance-2 independent sets. For more information, please read our preprint paper Parallelizing the Approximate Minimum Degree Ordering Algorithm: Strategies and Evaluation on arXiv and the README file. |
| Τύπος εγγράφου: | software |
| Γλώσσα: | English |
| Relation: | https://zenodo.org/records/15283182; oai:zenodo.org:15283182; https://doi.org/10.5281/zenodo.15283182 |
| DOI: | 10.5281/zenodo.15283182 |
| Διαθεσιμότητα: | https://doi.org/10.5281/zenodo.15283182 https://zenodo.org/records/15283182 |
| Rights: | BSD 3-Clause License |
| Αριθμός Καταχώρησης: | edsbas.4FFC64C4 |
| Βάση Δεδομένων: | BASE |
| DOI: | 10.5281/zenodo.15283182 |
|---|