ePubs
The open archive for STFC research publications
Home
About ePubs
Content Policies
News
Help
Privacy/Cookies
Suggest an Enhancement
Contact ePubs
Full Record Details
DOI
10.5286/raltr.2007022
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
Contributors
HS Dollar (STFC Rutherford Appleton Lab.)
,
JA Scott (STFC Rutherford Appleton Lab.)
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
sparse symmetric matrices
,
dense rows
,
approximate minimum degree ordering algorithm
,
ordering algorithms
,
graph algorithms
Funding Information
Related Research Object(s):
49215316
Licence Information:
Language
English (EN)
Type
Details
URI(s)
Local file(s)
Year
Report
RAL Technical Reports
RAL-TR-2007-022. STFC, 2008.
dsRAL2007022.pdf
2008
Showing record 1 of 1
Recent Additions
Browse Organisations
Browse Journals/Series
Login to add & manage publications and access information for OA publishing
Username:
Password:
Useful Links
Chadwick & RAL Libraries
SHERPA FACT
SHERPA RoMEO
SHERPA JULIET
Journal Checker Tool
Google Scholar