Algorithm 740: Fortran subroutines to compute improved incomplete Cholesky factorizations

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Mark T. Jones Argonne National Laboratory
Paul E. Plassmann Argonne National Laboratory
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 21 Issue 1, March 1995
Pages 18-19
ACM New York, NY, USA
table of contents doi>10.1145/200979.200986
Algorithm 740: Fortran subroutines to compute improved incomplete Cholesky factorizations Published by ACM 1995 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 6
· Downloads (12 Months): 74
· Downloads (cumulative): 1,386
· Citation Count: 2


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