Sparse linear least squares problems

Scott, J. ORCID: 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
Item Type	Article
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