A fully portable high performance minimal storage hybrid format Cholesky algorithm

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Bjarne S. Andersen Danish Meteorological Institute, Copenhagen, Denmark
John A. Gunnels IBM T.J. Watson Research Center, Yorktown Heights, NY
Fred G. Gustavson IBM T.J. Watson Research Center, Yorktown Heights, NY
John K. Reid Atlas Centre, Rutherford Appleton Laboratory, Didcot Oxon, UK
Jerzy Waśniewski Technical University of Denmark, Lyngby, Denmark
A fully portable high performance minimal storage hybrid format Cholesky algorithm Published by ACM 2005 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 15
· Downloads (cumulative): 464
· Citation Count: 19

Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 31 Issue 2, June 2005
Pages 201-227
ACM New York, NY, USA
table of contents doi>10.1145/1067967.1067969

Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder