SIGN IN
SIGN UP
A column approximate minimum degree ordering algorithm
Full Text:
PDF
Buy this Article
Authors:
Timothy A. Davis
University of Florida, Gainesville, FL
John R. Gilbert
University of California, Santa Barbara, CA
Stefan I. Larimore
Microsoft, Inc., Redmond, WA
Esmond G. Ng
Lawrence Berkeley National Laboratory, Berkeley, CA
2004 Article
Bibliometrics
· Downloads (6 Weeks): 11
· Downloads (12 Months): 98
· Downloads (cumulative): 1,105
· Citation Count: 25
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS)
TOMS Homepage
archive
Volume 30 Issue 3, September 2004
Pages 353-376
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1024074.1024079
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
ordering methods
performance
sparse nonsymmetric 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