Solving linear least squares by orthogonal factorization and pseudoinverse computation via the modified Huang algorithm in the ABS class
From MaRDI portal
Three algorithms for solving linear least squares problems are described. The first uses an explicit QR factorization, and the other two are based on the Moore-Penrose pseudoinverse. Comparative computational results are given exhibiting the improvement in accuracy when the proposed methods are used.
Recommendations
Cites work
- A class of direct methods for linear systems
- Generalized Inverse Computations Using the Gradient Projection Method
- scientific article; zbMATH DE number 4074331 (Why is no real title available?)
- scientific article; zbMATH DE number 45283 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- Numerical experiments with the symmetric algorithm in the ABS class for linear systems
- Reorthogonalization and Stable Algorithms for Updating the Gram-Schmidt QR Factorization
- Solution of linear least squares via the ABS algorithm
Cited in
(6)- Remarks on a formula for the pseudoinverse by the modified Huang algorithm
- Solution of linear least squares via the ABS algorithm
- Solution of sparse rectangular systems using LSQR and Craig
- scientific article; zbMATH DE number 621943 (Why is no real title available?)
- A bibliography of the ABS methods
- A code for linear least squares based upon the ABS procedure
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)