Skip to main content
Log in

Numerical methods for solving linear least squares problems

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Golub, G. H., andR. S. Varga: Chebyshev Semi-Iterative Methods, Successive Over-Relaxation Iterative Methods, and Second Order Richardson Iterative Method. Numer. Math.3, 147–168 (1961).

    Article  Google Scholar 

  2. Householder, A. S.: Unitary Triangularization of a Nonsymmetric Matrix. J. Assoc. Comput. Mach.5, 339–342 (1958).

    Google Scholar 

  3. Läuchli, P.: Jordan-Elimination und Ausgleichung nach kleinsten Quadraten. Numer. Math.3, 226–240 (1961).

    Article  Google Scholar 

  4. Linnik, Y.: Method of Least Squares and Principles of the Theory of Observations. Translated from Russian byR. C. Elandt., New York: Pergamon Press 1961.

    Google Scholar 

  5. McKeeman, W. M.: Crout with Equilibration and Iteration. Algorithm 135. Comm. Assoc. Comput. Mach.5, 553–555 (1962).

    Google Scholar 

  6. Osborne, E. E.: On Least Squares Solutions of Linear Equations. J. Assoc. Comput. Mach.8, 628–636 (1961).

    Google Scholar 

  7. Riley, J. D.: Solving Systems of Linear Equations with a Positive Definite, Symmetric, but Possibly Ill-Conditioned Matrix. Math. Tables Aids Comput.9, 96–101 (1956).

    Google Scholar 

  8. Waugh, F. V., andP. S. Dwyer: Compact Computation of the Inverse of a Matrix. Ann. Math. Stat.16, 259–271 (1945).

    Google Scholar 

  9. Wilkinson, J. H.:Householders Method for the Solution of the Algebraic Eigenproblem. Comput. J.3, 23–27 (1960).

    Google Scholar 

  10. —: Error Analysis of Direct Methods of Matrix Inversion. J. Assoc. Comput. Mach.8, 281–330 (1961).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Reproduction in Whole or in Part is permitted for any Purpose of the United States government. This report was supported in part by Office of Naval Research Contract Nonr-225(37) (NR 044-11) at Stanford University.

Rights and permissions

Reprints and permissions

About this article

Cite this article

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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01436075

Keywords

Navigation