Efficient algorithms for block downdating of least squares solutions

From MaRDI portal





Five computationally efficient algorithms for solving least squares problems, which use block versions of Givens rotations are given. The complexities of the algorithms are derived and analyzed. The performance of the implementations confirms the theoretical results.





Describes a project that uses

Uses Software






This page was built for publication: Efficient algorithms for block downdating of least squares solutions

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