A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows
H. Sue Dollar, J. A. Scott · Numerical Linear Algebra with Applications · 2009
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 potential limitations. This leads us to propose a new variant that offers both speed and robustness. Copyright © 2009 John Wiley & Sons, Ltd.