The open archive for STFC research publications

Full Record Details

Persistent URL http://purl.org/net/epubs/work/43560
Record Status Checked
Record Id 43560
Title A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows
Abstract Recently a number of variants of the approximate minimum degree algorithm have been proposed that aim to efficiently order symmetric matrices containing some dense rows. We compare the performance of these variants on a range of problems and highlight their limitations. This leads us to propose a new variant that offers both speed and robustness.
Organisation CSE , CSE-NAG , STFC
Keywords graph algorithms , sparse symmetric matrices , approximate minimum degree ordering algorithm , ordering algorithms , dense rows
Funding Information
Related Research Object(s):
Language English (EN)
Type Details URI(s) Local file(s) Year
Report RAL Technical Reports RAL-TR-2007-022. 2008. dsRAL2007022.pdf 2008
Journal Article Numer Linear Algebr 17, no. 1 (2010): 43-55. doi:10.1002/nla.647 2010