| |
|
Item: REP-1994-160
|
| |
Item:REP-1994-160
|
Title:An approximate minimum degree ordering algorithm
Patrick Amestoy
Timothy A. Davis
Iain S. Duff
Abstract:
An Approximate Minimum Degree ordering algorithm (AMD) 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 on the minimum degree. We show that these bounds are often equal to the actual degree. The resulting algorithm is typically much faster than previous minimum degree ordering algorithms, and produces results that are comparable in quality with the best orderings from other minimum degree algorithms. AMD is often faster and produces better orderings than general nested dissection for a wide range of matrices. (Submitted to SIAM J. Matrix Analysis and Applications, also Tech. Report TR/PA/95/09, CERFACS, Toulouse, France).
Supporting File:here
|
|
| |
|
Select Departmental Reports
|
| |
|
|
| |
|
Departmental Report Categories
|
| |
|
|
To submit items for this page, please log in on the
CISE submit page.
|
|