Abstract de la publi numéro 9478
We present a modified version of the approximate minimum degree algorithm
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.