Recently, a number of variants of the approximateminimumdegreealgorithm have been proposed that aim to efficiently order symmetric matrices containing some dense rows. We compare the peformance of these variants on...
详细信息
Recently, a number of variants of the approximateminimumdegreealgorithm have been proposed that aim to efficiently order symmetric matrices containing some dense rows. We compare the peformance 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 (C) 2009 John Wiley & Sons, Ltd.
An approximateminimumdegree (AMD) orderingalgorithm for preordering a symmetric sparse matrix prior to numerical factorization is presented, We use techniques based on the quotient graph for matrix factorization th...
详细信息
An approximateminimumdegree (AMD) orderingalgorithm for preordering a symmetric sparse matrix prior to numerical factorization is presented, We use techniques based on the quotient graph for matrix factorization that allow us to obtain computationally cheap bounds for the minimumdegree. We show that these bounds are often equal to the actual degree. The resulting algorithm is typically much faster than previous minimumdegreeorderingalgorithms and produces results that are comparable in quality with the best orderings from other minimumdegreealgorithms.
暂无评论