Abstract
article Free AccessArtifacts AvailableArtifacts Evaluated & Reusable Share on Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems Authors: Christopher C. Paige School of Computer Science, McGill University, Montreal, Quebec, Canada H3A 2K6 School of Computer Science, McGill University, Montreal, Quebec, Canada H3A 2K6View Profile , Michael A. Saunders Department of Operations Research, Stanford University, Stanford, CA Department of Operations Research, Stanford University, Stanford, CAView Profile Authors Info & Claims ACM Transactions on Mathematical SoftwareVolume 8Issue 2June 1982 pp 195–209https://doi.org/10.1145/355993.356000Published:01 June 1982Publication History 548citation2,133DownloadsMetricsTotal Citations548Total Downloads2,133Last 12 Months125Last 6 weeks24 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Keywords
Computer scienceCitationLeast-squares function approximationAlgorithmLibrary scienceOperations researchMathematicsStatistics
Affiliated Institutions
Related Publications
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
article Free AccessLSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares Authors: Christopher C. Paige School of Computer Science, McGill University, Montreal,...
Algorithm 630
article Free AccessArtifacts AvailableArtifacts Evaluated & Reusable Share on Algorithm 630: BBVSCG–a variable-storage algorithm for function minimization Authors: A. Buckley De...
An Algorithm for Finding Best Matches in Logarithmic Expected Time
article Free Access Share on An Algorithm for Finding Best Matches in Logarithmic Expected Time Authors: Jerome H. Friedman Stanford Linear Accelerator Center, Stanford Universi...
Fab
article Free AccessFab: content-based, collaborative recommendation Authors: Marko Balabanović Computer Science Department, Stanford University, Stanford, Calif. Computer Scienc...
Remark on “Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]”
article Remark on "Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]" Share on Authors: D. F. Shanno Department of Management Information Systems, College...
Publication Info
- Year
- 1982
- Type
- article
- Volume
- 8
- Issue
- 2
- Pages
- 195-209
- Citations
- 771
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
771
OpenAlex
35
Influential
Cite This
Christopher C. Paige,
Michael A. Saunders
(1982).
Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems.
ACM Transactions on Mathematical Software
, 8
(2)
, 195-209.
https://doi.org/10.1145/355993.356000
Identifiers
- DOI
- 10.1145/355993.356000