Least squares
Builds on Orthogonal projection is the closest pointOrthogonal projectionTranspose
Summary
Let be a real matrix and let . A least squares solution of is a vector that minimises , for the Euclidean norm. The vectors that do this are exactly the solutions of the normal equations If the columns of are linearly independent, then is invertible, and is unique.
Remarks
The vector is the orthogonal projection of onto the column space of , see the closest point property. The normal equations say that the residual is orthogonal to each column of . Fitting a line to data points 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
- no evidence level
- Matrix definition
- Vector space definition
- Transpose definition
- Inner product definition
- Linear map definition
- Linear subspace definition
- Norm definition
- Inner product space definition
- Orthogonal vectors definition
- Endomorphism definition
- Sum of subspaces definition
- Norm induced by an inner product definition
- Orthogonal complement definition
- Direct sum of subspaces definition
- A space is the direct sum of a subspace and its orthogonal complement statement
- Projection definition
- Orthogonal projection definition
- Orthogonal projection is the closest point statement
- Least squares concept
Where this leads
19 pages build on this one.
- Non-negative least squares
- Conjugate residual method
- Local regression
- Minimal residual method
- Ordinary least squares
- Smoothing spline
- Response surface methodology
- Nonlinear regression
- Generalized minimal residual method
- Gauss–Newton algorithm
- Ridge regression
- L-curve
- Biconjugate gradient stabilized method
- Empirical risk minimization
- Isotonic regression
- Levenberg–Marquardt algorithm
- Box–Jenkins method
- Lasso
- Numerical methods for linear least squares
Further reading
- Web https://en.wikipedia.org/wiki/Linear_least_squares, Basic formulation
About this page
| Tag | 0BYTQ4X1HC |
|---|---|
| URI | m2://0BYTQ4X1HC |
| Kind | concept |
| Writing | W0 stub |
| MSC | 65F20, 15A06 |
| Uses | Orthogonal projection is the closest point, Orthogonal projection, Transpose |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
Results about this
Used by
- Non-negative least squares
- Local regression
- Ordinary least squares
- Smoothing spline
- Response surface methodology
- Nonlinear regression
- Generalized minimal residual method
- Gauss–Newton algorithm
- Ridge regression
- L-curve
- Empirical risk minimization
- Isotonic regression
- Levenberg–Marquardt algorithm
- Box–Jenkins method
- Lasso
- Numerical methods for linear least squares