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

DOI10.1007/BF02239748zbMATH Open0679.65027OpenAlexW1523915914MaRDI QIDQ1822902FDOQ1822902

Authors: E. Spedicato, Elena Bodon 

Publication date: 1989

Published in: Computing (Search for Journal in Brave)

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

Recommendations

• Solution of linear least squares via the ABS algorithm
• scientific article; zbMATH DE number 621943
• A code for linear least squares based upon the ABS procedure
• New interpretation of related Huang's methods
• scientific article; zbMATH DE number 1552866

zbMATH Keywords

algorithmsnumerical examplesMoore-Penrose pseudoinverseQR factorizationlinear least squares problemsHuang algorithmABS class

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Cites Work

• Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
• Title not available (Why is that?)
• Title not available (Why is that?)
• A class of direct methods for linear systems
• Solution of linear least squares via the ABS algorithm
• Title not available (Why is that?)
• Numerical experiments with the symmetric algorithm in the ABS class for linear systems
• Generalized Inverse Computations Using the Gradient Projection Method

Cited In (4)

• A bibliography of the ABS methods
• Solution of sparse rectangular systems using LSQR and Craig
• Title not available (Why is that?)
• Solution of linear least squares via the ABS algorithm

Uses Software

• ESSL

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1822902)