Stability analysis of the G-algorithm and a note on its applications to sparse least squares problems
The G-algorithm of \textit{E.H. Bareiss} [SIAM J. Algebraic Discrete Methods (to appear)] for solving the weighted linear least squares problem is studied. The error analysis of this algorithm presented here is shown to be as stable as any of the standard orthogonal decomposition methods for solving least squares problems.
scientific article; zbMATH DE number 3938448
scientific article