The open archive for STFC research publications

Full Record Details

DOI 10.5286/raltr.2007020
Persistent URL http://purl.org/net/epubs/work/43559
Record Status Checked
Record Id 43559
Title An approximate minimum degree algorithm for matrices with dense rows
Abstract We present a modified version of the approximate minimum degree algorithms for preordering a matrix with a symmetric sparsity pattern prior to the numerical factorization. The modification is designed to improve the efficiency of the algorithm when some of the rows and columns have significantly more entries than the average for the matrix. Numerical results are presented for problems arising from practical applications and comparisons are made with other implementations of variants of the minimum degree algorithm.
Organisation CSE , CSE-NAG , STFC
Keywords approximate minimum degree ordering algorithm , quotient graph , ordering algorithms , sparse matrices , graph algorithms
Funding Information
Related Research Object(s):
Licence Information:
Language English (EN)
Type Details URI(s) Local file(s) Year
Report RAL Technical Reports RAL-TR-2007-020. STFC, 2008. adrsRAL2007020.pdf 2008