SIGN IN
SIGN UP
Distributed SBP Cholesky factorization algorithms with near-optimal scheduling
Full Text:
PDF
Buy this Article
Authors:
Fred G. Gustavson
IBM T.J. Watson Research Center, Yorktown Heights, NY and Umeå University, Umeå, Sweden
Lars Karlsson
Umeå University, Umeå, Sweden
Bo Kågström
Umeå University, Umeå, Sweden
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS)
TOMS Homepage
archive
Volume 36 Issue 2, March 2009
Article No. 11
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1499096.1499100
2009 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 23
· Downloads (cumulative): 201
· Citation Count: 3
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
cholesky factorization
computations on matrices
distributed square block format
linear systems
packed storage
parallel algorithms
parallel computing
performance
positive definite matrices
real symmetric matrices
reliability and robustness
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