Algorithm 844: Computing sparse reduced-rank approximations to sparse matrices

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Michael W. Berry University of Tennessee, Knoxville, Knoxville, TN
Shakhina A. Pulatova University of Tennessee, Knoxville, Knoxville, TN
G. W. Stewart University of Maryland, College Park, College Park, MD
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 31 Issue 2, June 2005
Pages 252-269
ACM New York, NY, USA
table of contents doi>10.1145/1067967.1067972
Algorithm 844: Computing sparse reduced-rank approximations to sparse matrices Published by ACM 2005 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 50
· Downloads (cumulative): 861
· Citation Count: 6


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