SIGN IN
SIGN UP
Algorithms for sparse Gaussian elimination with partial pivoting
Full Text:
PDF
Buy this Article
Author:
Andrew H Sherman
Department of Computer Sciences, Painter 328, The University of Texas at Austin, Austin, TX
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS)
TOMS Homepage
archive
Volume 4 Issue 4, December 1978
ACM
New York, NY
, USA
table of contents
doi>
10.1145/356502.356494
1978 Article
Bibliometrics
· Downloads (6 Weeks): 9
· Downloads (12 Months): 54
· Citation Count: 2
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
analysis of algorithms
linear equations
linear systems
pivoting algorithms
sparse gaussian elimination
sparse linear systems
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