{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T07:41:16Z","timestamp":1787384476731,"version":"3.56.0"},"reference-count":31,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Matrix Anal. Appl."],"published-print":{"date-parts":[[1996,10]]},"abstract":"<jats:p>Abstract. An approximate minimum degree (AMD), ordering algorithm 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 for 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.<\/jats:p>","DOI":"10.1137\/s0895479894278952","type":"journal-article","created":{"date-parts":[[2005,2,27]],"date-time":"2005-02-27T07:15:07Z","timestamp":1109488507000},"page":"886-905","source":"Crossref","is-referenced-by-count":456,"title":["An Approximate Minimum Degree Ordering Algorithm"],"prefix":"10.1137","volume":"17","author":[{"given":"Patrick R.","family":"Amestoy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Timothy A.","family":"Davis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Iain S.","family":"Duff","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","unstructured":"P. R. Amestoy, Ph.D. Thesis,  Factorization of Large Sparse Matrices Based on a Multifrontal Approach in a Multiprocessor Environment, CERFACS, Toulouse, France,  1991, INPT TH\/PA\/91\/2"},{"key":"R2","unstructured":"P. R. Amestoy, M. Dayd\u00e9, I. S. Duff,  Use of level 3 BLAS in the solution of full and sparse linear equations,  High Performance Computing: Proc. of the International Symposium on High Performance Computing, Montpellier, France, North-Holland, Amsterdam,  1989,  19\u201331"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1137\/0916081"},{"key":"R4","unstructured":"C. Ashcraft, S. C. Eisenstat, R. F. Lucas, personal communication"},{"key":"R5","unstructured":"A. Berger, J. Mulvey, E. Rothberg, R. Vanderbei,  Solving Multistage Stochastic Programs Using Tree Dissection, Tech. report, SOR-97-07, Program in Statistics and Operations Research, Princeton University, Princeton, NJ,  1995"},{"key":"R6","volume-title":"Introduction to algorithms","author":"Cormen Thomas H.","year":"1990"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479894246905"},{"key":"R8","unstructured":"T. A. Davis, I. S. Duff,  Unsymmetric-Pattern Multifrontal Methods for Parallel Sparse  $LU$ Factorization, Tech. report, TR-91-023, CISE Department, University of Florida, Gainesville, FL,  1991"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1145\/355958.355963"},{"key":"R10","volume-title":"Direct methods for sparse matrices","author":"Duff I. S.","year":"1986"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1145\/62038.62043"},{"key":"R12","unstructured":"I. S. Duff, R. G. Grimes, J. G. Lewis,  Users' Guide for the Harwell-Boeing Sparse Matrix Collection (Release 1), Tech. report, RAL-92-086, Rutherford Appleton Laboratory, Didcot, Oxon, UK,  1992"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1093\/imamat\/14.3.281"},{"key":"R14","unstructured":"I. S. Duff, J. K. Reid,  MA27\u2014A Set of Fortran Subroutines for Solving Sparse Symmetric Sets of Linear Equations, Tech. report, AERE R10533, HMSO, London, UK,  1982"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1145\/356044.356047"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1137\/0905045"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1002\/nme.1620180804"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1137\/0902019"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1145\/355900.355906"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1137\/0717024"},{"key":"R21","volume-title":"Computer solution of large sparse positive definite systems","author":"George Alan","year":"1981"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1137\/1031001"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1137\/0715006"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1137\/0613024"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1145\/214392.214398"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.3.3.255"},{"key":"R27","unstructured":"D. J. Rose, Ph.D. Thesis,  Symmetric Elimination on Sparse Positive Definite Systems and the Potential Flow Network Problem, Applied Mathematics Department, Harvard University,  1970"},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-4832-3187-7.50018-0"},{"key":"R29","unstructured":"B. Speelpenning,  The Generalized Element Method, Tech. report, UIUCDCS-R-78-946, Department of Computer Science, University of Illinois, Urbana, IL,  1978"},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1967.6011"},{"key":"R31","doi-asserted-by":"publisher","DOI":"10.1137\/0602010"}],"container-title":["SIAM Journal on Matrix Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S0895479894278952","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:35:41Z","timestamp":1787319341000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S0895479894278952"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["10.1137\/S0895479894278952"],"URL":"https:\/\/doi.org\/10.1137\/s0895479894278952","relation":{},"ISSN":["0895-4798","1095-7162"],"issn-type":[{"value":"0895-4798","type":"print"},{"value":"1095-7162","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}