Linear Least Squares by Elimination and MGS
Robert J. Plemmons · Journal of the ACM · 1974
An algorithm combining Gaussian elimination with the modified Gram-Schmidt (MGS) procedure is given for solving the linear least squares problem. The method is based on the operational efficiency of Gaussian elimination for LU decompositions and the numerical stability of MGS for unitary decompositions and is designed for slightly overdetermined linear systems.