Stability analysis of the G-algorithm and a note on its applications to sparse least squares problems

DOI10.1007/BF01935371zbMath0585.65033MaRDI QIDQ1070768

Jesse L. Barlow

Publication date: 1985

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

error analysisG-algorithmorthogonal decomposition methodsweighted linear least squares problem

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items (3)

An algorithm and stability theory for downdating the ULV decomposition ⋮ Accurate solutions of weighted least squares problems associated with rank-structured matrices ⋮ A self-scaling G-transformation for weighted least squares problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Error analysis of QR decompositions by Givens transformations
• Handbook series linear algebra. Linear least squares solutions by Householder transformations
• On Row and Column Orderings for Sparse Least Squares Problems
• Error Analysis of Direct Methods of Matrix Inversion
• Application of Dense Householder Transformation to a Sparse Matrix
• Methods for Computing and Modifying the LDV Factors of a Matrix
• Fast Numerically Stable Computations for Generalized Linear Least Squares Problems
• Computer Solution and Perturbation Analysis of Generalized Linear Least Squares Problems
• Least Squares Computations by Givens Transformations Without Square Roots

This page was built for publication: Stability analysis of the G-algorithm and a note on its applications to sparse least squares problems