SIGN IN
SIGN UP
Algorithm 837: AMD, an approximate minimum degree ordering algorithm
Full Text:
PDF
Buy this Article
see
source materials
below for
more options
Authors:
Patrick R. Amestoy
Enseeiht-Irit
Timothy A. Davis
University of Florida, Gainesville, FL
Iain S. Duff
CERFACS and Rutherford Appleton Laboratory, Oxon, England
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS)
TOMS Homepage
archive
Volume 30 Issue 3, September 2004
Pages 381-388
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1024074.1024081
2004 Article
Bibliometrics
· Downloads (6 Weeks): 18
· Downloads (12 Months): 162
· Downloads (cumulative): 1,381
· Citation Count: 24
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithm design and analysis
algorithms
efficiency
experimentation
linear equations
linear systems
minimum degree
ordering methods
performance
sparse matrices
sparse, structured, and very large systems
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder