Stability analysis of the G-algorithm and a note on its applications to sparse least squares problems
type: Item
instance of: scholarly article
title: Stability analysis of the G-algorithm and a note on its applications to sparse least squares problems
zbMATH Open document ID: 0585.65033
DOI: 10.1007/BF01935371
published in: BIT
publication date: 1985-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65F20
Mathematics Subject Classification ID: 65D10
zbMATH DE Number: 3938448
zbMATH Keywords: G-algorithm
zbMATH Keywords: weighted linear least squares problem
zbMATH Keywords: error analysis
zbMATH Keywords: orthogonal decomposition methods
author: Jesse L. Barlow
reviewed by: H. P. Dikshit
MaRDI profile type: Publication
cites work: Handbook series linear algebra. Linear least squares solutions by Householder transformations
cites work: Least Squares Computations by Givens Transformations Without Square Roots
cites work: Error analysis of QR decompositions by Givens transformations
cites work: On Row and Column Orderings for Sparse Least Squares Problems
cites work: Methods for Computing and Modifying the LDV Factors of a Matrix
cites work: Q4404310
cites work: Application of Dense Householder Transformation to a Sparse Matrix
cites work: Q4879581
cites work: Q3866965
cites work: Computer Solution and Perturbation Analysis of Generalized Linear Least Squares Problems
cites work: Fast Numerically Stable Computations for Generalized Linear Least Squares Problems
cites work: Error Analysis of Direct Methods of Matrix Inversion
cites work: Q5674306
description: scientific article; zbMATH DE number 3938448