You are here
Home ›least squares
Primary tabs
least squares
The general problem to be solved by the least squares method is this: given some direct measurements of random variables, and knowing a set of equations which have to be satisfied by these measurements (possibly involving unknown parameters ), find the set of which comes closest to satisfying
where “closest” is defined by a such that
The assumption has been made here that the elements of are statistically uncorrelated and have equal variance. For this case, the above solution results in the most efficent estimators for , . If the are correlated, correlations and variances are defined by a covariance matrix , and the above minimum condition becomes
Least squares solutions can be more or less simple, depending on the constraint equations . If there is exactly one equation for each measurement, and the functions are linear in the elements of and , the solution is discussed under linear regression. For other linear models, see Linear Least Squares. Least squares methods applied to few parameters can lend themselves to very efficient algorithms (e.g. in real-time image processing), as they reduce to simple matrix operations.
If the constraint equations are non-linear, one typically solves by linearization and in iterations, using approximate values of , in every step, and linearizing by forming the matrix of derivatives , (the Jacobian matrix) and possibly also at the last point of approximation.
Note that as the iterative improvements tend towards zero (if the process converges), converges towards a final value which enters the minimum equation above.
Algorithms avoiding the explicit calculation of and have also been investigated, e.g. [1]; for a discussion, see [2]. Where convergence (or control over convergence) is problematic, use of a general package for minimization may be indicated.
References
- 1 M.L. Ralston and R.I. Jennrich, Dud, a Derivative-free Algorithm for Non-linear Least Squares, Technometrics 20-1 (1978) 7.
- 2 W.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery, Numerical Recipes in C, Second edition, Cambridge University Press, 1995.
Note: This entry is based on content from the The Data Analysis Briefbook
Mathematics Subject Classification
15-00 General reference works (handbooks, dictionaries, bibliographies, etc.)- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)
- Other useful stuff
Recent Activity
new question: Sorry to steal a few minutes of your time for this question, but i honestly don't know what else to do. by Whrazithar
new question: equality of the determinants of submatrices of an orthogonal matrix by ismayli
Jun 11
new correction: Typo by suitangi
Jun 2
new question: Creating another set with same cardinality. by hkkass
Jun 1
new image: ProblemOneRevised by unlord
new Education: Chapter II by rspuzio
May 31
new collection: The Calculus by Davis and Brenke by rspuzio
new question: Proofs by weixifan
new question: Summation Integration Question by trevor.nickle
May 27
new correction: typo+finite measure hypothesis by Filipe


