LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Christopher C. Paige School of Computer Science, McGill University, Montreal, P.Q., Canada H3C 3G1
Michael A. Saunders Department of Operations Research, Stanford University, Stanford, CA
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 8 Issue 1, March 1982
Pages 43-71
ACM New York, NY, USA
table of contents doi>10.1145/355984.355989
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares Published by ACM 1982 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 41
· Downloads (12 Months): 318
· Downloads (cumulative): 3,319
· Citation Count: 114


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