Math 2.0

Numerical analysis Concept

Least squares

Builds on Orthogonal projection is the closest pointOrthogonal projectionTranspose

Summary

Let AA be a real m×nm \times n matrix and let b∈ℝmb \in \R^m. A least squares solution of Ax=bAx = b is a vector x^∈ℝn\hat x \in \R^n that minimises ∥Ax−b∥\norm{Ax - b}, for the Euclidean norm. The vectors x^\hat x that do this are exactly the solutions of the normal equations ATAx^=ATb.A^T A \hat x = A^T b. If the columns of AA are linearly independent, then ATAA^T A is invertible, and x^=(ATA)−1ATb\hat x = (A^T A)^{-1} A^T b is unique.

Remarks

The vector Ax^A \hat x is the orthogonal projection of bb onto the column space of AA, see the closest point property. The normal equations say that the residual b−Ax^b - A\hat x is orthogonal to each column of AA. Fitting a line y=c0+c1ty = c_0 + c_1 t to data points (ti,yi)(t_i, y_i) is a least squares problem. In practice, the QR decomposition gives a more stable method than the normal equations.

Reading path

To understand this page from the ground up, read these 19 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Matrix definition
  2. Vector space definition
  3. Transpose definition
  4. Inner product definition
  5. Linear map definition
  6. Linear subspace definition
  7. Norm definition
  8. Inner product space definition
  9. Orthogonal vectors definition
  10. Endomorphism definition
  11. Sum of subspaces definition
  12. Norm induced by an inner product definition
  13. Orthogonal complement definition
  14. Direct sum of subspaces definition
  15. A space is the direct sum of a subspace and its orthogonal complement statement
  16. Projection definition
  17. Orthogonal projection definition
  18. Orthogonal projection is the closest point statement
  19. Least squares concept

Where this leads

19 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Linear_least_squares, Basic formulation
About this page