Algorithm 837: {AMD}, an approximate minimum degree ordering algorithm
| Type of publication: | Article |
| Citation: | Amestoy:2004:AAA:1024074.1024081 |
| Journal: | ACM Trans. Math. Softw. |
| Volume: | 30 |
| Number: | 3 |
| Year: | 2004 |
| Month: | sep |
| Pages: | 381--388 |
| Publisher: | ACM |
| Address: | New York, NY, USA |
| ISSN: | 0098-3500 |
| DOI: | 10.1145/1024074.1024081 |
| Userfields: | acmid={1024081}, bdsk-url-1={http://doi.acm.org/10.1145/1024074.1024081}, bdsk-url-2={http://dx.doi.org/10.1145/1024074.1024081}, date-added={2012-09-25 09:54:31 +0200}, date-modified={2012-09-25 09:54:31 +0200}, issue_date={September 2004}, numpages={8}, project={fremdliteratur}, |
| Keywords: | Linear equations, minimum degree, ordering methods, sparse matrices |
| Authors | |
|
Attachments
|
|
|
Notes
|
|
|
|
|
|
Topics
|
|
|
|
|