Numerical methods for solving linear least squares problems

560Citations
Citations of this article
131Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A common problem in a Computer Laboratory is that of finding linear least squares solutions. These problems arise in a variety of areas and in a variety of contexts. Linear least squares problems are particularly difficult to solve because they frequently involve large quantities of data, and they are ill-conditioned by their very nature. In this paper, we shall consider stable numerical methods for handling these problems. Our basic tool is a matrix decomposition based on orthogonal Householder transformations. © 1965 Springer-Verlag.

Cite

CITATION STYLE

APA

Golub, G. (1965). Numerical methods for solving linear least squares problems. Numerische Mathematik, 7(3), 206–216. https://doi.org/10.1007/BF01436075

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free