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.





Describes a project that uses

Uses Software






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)