Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class

DOI10.1007/BF02239748zbMath0679.65027OpenAlexW1523915914MaRDI QIDQ1822902

Elena Bodon, Emilio Spedicato

Publication date: 1989

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02239748

zbMATH Keywords

algorithmsnumerical examplesQR factorizationMoore-Penrose pseudoinverselinear least squares problemsHuang algorithmABS class

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Related Items (2)

A bibliography of the ABS methods ⋮ Solution of linear least squares via the ABS algorithm

Uses Software

• ESSL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of direct methods for linear systems
• Solution of linear least squares via the ABS algorithm
• Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
• Numerical experiments with the symmetric algorithm in the ABS class for linear systems
• Generalized Inverse Computations Using the Gradient Projection Method

This page was built for publication: Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class