Least-squares adjustment is a model for the solution of an overdetermined system of equations based on the principle of least squares of observation residuals. It is used extensively in the disciplines of surveying, geodesy, and photogrammetry—the field of geomatics, collectively.

There are three forms of least squares adjustment: parametric, conditional, and combined:

• In parametric adjustment, one can find an observation equation h(X) = Y relating observations Y explicitly in terms of parameters X (leading to the A-model below).
• In conditional adjustment, there exists a condition equation which is g(Y) = 0 involving only observations Y (leading to the B-model below) — with no parameters X at all.
• Finally, in a combined adjustment, both parameters X and observations Y are involved implicitly in a mixed-model equation f(X, Y) = 0.

Clearly, parametric and conditional adjustments correspond to the more general combined case when f(X,Y) = h(X) - Y and f(X, Y) = g(Y), respectively. Yet the special cases warrant simpler solutions, as detailed below. Often in the literature, Y may be denoted L.

The equalities above only hold for the estimated parameters and observations , thus . In contrast, measured observations and approximate parameters produce a nonzero misclosure: One can proceed to Taylor series expansion of the equations, which results in the Jacobians or design matrices: the first one, and the second one, The linearized model then reads: where are estimated parameter corrections to the a priori values, and are post-fit observation residuals.

In the parametric adjustment, the second design matrix is an identity, B=-I, and the misclosure vector can be interpreted as the pre-fit residuals, , so the system simplifies to: which is in the form of ordinary least squares. In the conditional adjustment, the first design matrix is null, A = 0. For the more general cases, Lagrange multipliers are introduced to relate the two Jacobian matrices, and transform the constrained least squares problem into an unconstrained one (albeit a larger one). In any case, their manipulation leads to the and vectors as well as the respective parameters and observations a posteriori covariance matrices.

Given the matrices and vectors above, their solution is found via standard least-squares methods; e.g., forming the normal matrix and applying Cholesky decomposition, applying the QR factorization directly to the Jacobian matrix, iterative methods for very large systems, etc.

• Leveling, traverse, and control networks
• Bundle adjustment
• Triangulation, Trilateration, Triangulateration
• GPS/GNSS positioning
• Helmert transformation

• Parametric adjustment is similar to most of regression analysis and coincides with the Gauss–Markov model
• Combined adjustment, also known as the Gauss–Helmert model (named after German mathematicians/geodesists C.F. Gauss and F.R. Helmert),^[1][2] is related to the errors-in-variables models and total least squares.^[3][4]
• The use of a priori parameter covariance matrix is akin to Tikhonov regularization

If rank deficiency is encountered, it can often be rectified by the inclusion of additional equations imposing constraints on the parameters and/or observations, leading to constrained least squares.

Lecture notes and technical reports

Books and chapters