| Index: > A B C D E F G H I J K L M N O P Q R S T U V W X Y Z |
|
|||||
It is commonly used in curve fitting. Many other optimization problems can also be expressed in a least squares form, either minimizing energy or maximizing entropy.
See linear regression and Gauss-Markov theorem. The Gauss-Markov theorem says that least-squares estimators are in a certain sense optimal.
To use the method of least squares we use a function f(x), containing some number of unknown constants (for instance f(x) = mx + b, where m and b are not yet known), and find the values of m and b that minimize the sum of the squares of the residuals (that is, the sum of terms of the form (yi − f(xi))2). We then have the equation for the curve, y = f(x), of the required form, that best fits the data points (xi, yi).
For linear functions f see linear least squares.
For nonlinear functions see optimization, Gauss-Newton algorithm, Levenberg-Marquardt algorithm.