Abstract
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. © 1974, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
APA
Plemmons, R. J. (1974). Linear Least Squares by Elimination and MGS. Journal of the ACM (JACM), 21(4), 581–585. https://doi.org/10.1145/321850.321855
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free