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.