| |
|
Item: REP-2000-397
|
| |
Item:REP-2000-397
|
Title:A column approximate minimum degree ordering algorithm
Timothy A. Davis
John R. Gilbert
Stefan I. Larimore
Esmond G. Ng
Abstract:
Sparse Gaussian elimination with partial pivoting computes the factorization PAQ=LU of a sparse matrix A, where the row ordering P is selected during factorization using standard partial pivoting with row interchanges. The goal is to select a column preordering, Q, based solely on the nonzero pattern of A such that the factorization remains as sparse as possible, regardless of the subsequent choice of P. The choice of Q can have a dramatic impact on the number of nonzeros in L and U. One scheme for determining a good column ordering for A is to compute a symmetric ordering that reduces fill-in in the Cholesky factorization of A'A (A transpose times A). This approach, which requires the sparsity structure of A'A to be computed, can be expensive both in terms of space and time since A'A may be much denser than A. An alternative is to compute Q directly from the sparsity structure of A; this strategy is is used by Matlab's colmmd preordering algorithm. A new ordering algorithm, colamd, is presented. It is based on the same strategy but uses a better ordering heuristic. Colamd is faster and computes better orderings, with fewer nonzeros in the factors of the matrix.
Supporting File:here
|
|
| |
|
Select Departmental Reports
|
| |
|
|
| |
|
Departmental Report Categories
|
| |
|
|
To submit items for this page, please log in on the
CISE submit page.
|
|