Name
Abstract | ||
|---|---|---|
This paper describes a very fast implementation of the m~n~mum degree algorithm, which is an effective heuristm scheme for fmding low-fill ordermgs for sparse positive definite matrices. This implementation has two important features: first, in terms of speed, it is competitive with other unplementations known to the authors, and, second, its storage requirements are independent of the amount of fill suffered by the matrix during its symbolic factorization. Some numerical experiments which compare the performance of this new scheme to some existing minimum degree programs are provided. |
Year | DOI | Venue |
|---|---|---|
1980 | 10.1145/355900.355906 | ACM Trans. Math. Softw. |
Keywords | Field | DocType |
graph algo-,quotient graphs,fast implementation,sparse linear equations,ordering algoritl~ms,minimum degree algorithm,linear equations | Discrete mathematics,Graph,Mathematical optimization,Matrix (mathematics),Positive-definite matrix,Quotient,Minimum degree algorithm,Symbolic factorization,Mathematics | Journal |
Volume | Issue | ISSN |
6 | 3 | 0098-3500 |
Citations | PageRank | References |
16 | 21.30 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alan George | 1 | 120 | 63.94 |
| Joseph W. H. Liu | 2 | 829 | 217.74 |