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.
Similar content being viewed by others
References
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).
Householder, A. S.: Unitary Triangularization of a Nonsymmetric Matrix. J. Assoc. Comput. Mach.5, 339–342 (1958).
Läuchli, P.: Jordan-Elimination und Ausgleichung nach kleinsten Quadraten. Numer. Math.3, 226–240 (1961).
Linnik, Y.: Method of Least Squares and Principles of the Theory of Observations. Translated from Russian byR. C. Elandt., New York: Pergamon Press 1961.
McKeeman, W. M.: Crout with Equilibration and Iteration. Algorithm 135. Comm. Assoc. Comput. Mach.5, 553–555 (1962).
Osborne, E. E.: On Least Squares Solutions of Linear Equations. J. Assoc. Comput. Mach.8, 628–636 (1961).
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).
Waugh, F. V., andP. S. Dwyer: Compact Computation of the Inverse of a Matrix. Ann. Math. Stat.16, 259–271 (1945).
Wilkinson, J. H.:Householders Method for the Solution of the Algebraic Eigenproblem. Comput. J.3, 23–27 (1960).
—: Error Analysis of Direct Methods of Matrix Inversion. J. Assoc. Comput. Mach.8, 281–330 (1961).
Author information
Authors and Affiliations
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
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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01436075