The Evolution of the Minimum Degree Ordering Algorithm
- 1 March 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 31 (1), 1-19
- https://doi.org/10.1137/1031001
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- The Multifrontal Solution of Indefinite Sparse Symmetric LinearACM Transactions on Mathematical Software, 1983
- Yale sparse matrix package I: The symmetric codesInternational Journal for Numerical Methods in Engineering, 1982
- Algorithms and Data Structures for Sparse Symmetric Gaussian EliminationSIAM Journal on Scientific and Statistical Computing, 1981
- Solution of sparse linear least squares problems using givens rotationsLinear Algebra and its Applications, 1980
- A Fast Implementation of the Minimum Degree Algorithm Using Quotient GraphsACM Transactions on Mathematical Software, 1980
- A Minimal Storage Implementation of the Minimum Degree AlgorithmSIAM Journal on Numerical Analysis, 1980
- On George’s Nested Dissection MethodSIAM Journal on Numerical Analysis, 1976
- Applications of an Element Model for Gaussian Elimination11This work was supported in part by NSF Grant GJ-43157 and ONR Grant N00014-67-A-0097-0016.Published by Elsevier ,1976
- A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian EliminationIMA Journal of Applied Mathematics, 1974
- Nested Dissection of a Regular Finite Element MeshSIAM Journal on Numerical Analysis, 1973