Advanced search

Sparse linear least squares problems

Download
[thumbnail of scotttuma_ls_acta_centaur.pdf]
Text - Accepted Version
· Restricted to Repository staff only
· The Copyright of this document has not been checked yet. This may affect its availability.
· Available under License Creative Commons Attribution.
Restricted to Repository staff only
Available under license: Creative Commons Attribution
Advice

Please see our End User Agreement.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

Tools
Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email
Lists

Scott, J. orcid id iconORCID: https://orcid.org/0000-0003-2130-1091 and Tuma, M. (2024) Sparse linear least squares problems. Acta Numerica. ISSN 1474-0508 (In Press)

Abstract/Summary

Least squares problems are a cornerstone of computational science and engineering. Over the years, the size of the problems that researchers and practitioners face has constantly increased, making it essential that sparsity is exploited in the solution process. The goal of this article is to present a broad review of key algorithms for solving large-scale linear least squares problems. This includes sparse direct methods and algebraic preconditioners thatare used in combination with iterative solvers. Where software is available, this is highlighted.

Item Type Article
URI https://reading-clone.eprints-hosting.org/id/eprint/118985
Refereed No
Divisions Science > School of Mathematical, Physical and Computational Sciences > Department of Mathematics and Statistics
Publisher Cambridge University Press
Download/View statistics View download statistics for this item
Deposit Details

University Staff: Request a correction | Centaur Editors: Update this record

Search Google Scholar