A recursive formulation of Cholesky factorization of a matrix in packed storage

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Bjarne Stig Andersen Danish Computing Center for Research and Education, Lyngby, Denmark
Jerzy Waśniewski Danish Computing Center for Research and Education, Lyngby, Denmark
Fred G. Gustavson IBM T. J. Watson Research Center, Yorktown Heights, NY
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 27 Issue 2, June 2001
Pages 214-244
ACM New York, NY, USA
table of contents doi>10.1145/383738.383741
A recursive formulation of Cholesky factorization of a matrix in packed storage Published by ACM 2001 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 31
· Downloads (cumulative): 769
· Citation Count: 26


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