Premium
A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows
Author(s) -
Dollar H. S.,
Scott J. A.
Publication year - 2010
Publication title -
numerical linear algebra with applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.02
H-Index - 53
eISSN - 1099-1506
pISSN - 1070-5325
DOI - 10.1002/nla.647
Subject(s) - row , mathematics , robustness (evolution) , degree (music) , row and column spaces , combinatorics , algorithm , computer science , database , acoustics , biochemistry , chemistry , physics , gene
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 potential limitations. This leads us to propose a new variant that offers both speed and robustness. Copyright © 2009 John Wiley & Sons, Ltd.