Computer solution and perturbation analysis of generalized linear least squares problems
Christopher C. Paige · Mathematics of Computation · 1979
A new formulation of the generalized linear least squares problem is given. This is based on some ideas in estimation and allows complete generality in that there are no restrictions on the matrices involved. The formulation leads directly to a numerical algorithm involving orthogonal decompositions for solving the problem. A perturbation analysis of the problem is obtained by using the new formulation and some of the decompositions used in the solution. A rounding error analysis is given to show that the algorithm is numerically stable.