Implicit scaling of linear least squares problems
From MaRDI portal
The solution of weighted linear least squares problems by Householder transformations with implicit scaling is considered, that is, with the weights stored separately. By holding inverse weights, the constrained case can be accommodated. The error analysis of the weighted and unconstrained case is readily extended and that iterative refinement may be applied is shown.
Recommendations
- On the weighting method for least squares problems with linear equality constraints
- A dynamic method for weighted linear least squares problems
- Iterative refinement for constrained and weighted linear least squares
- Scaled Givens Rotations for the Solution of Linear Least Squares Problems on Systolic Arrays
- scientific article; zbMATH DE number 17429
Cited in
(7)- Iterative refinement for constrained and weighted linear least squares
- A self-scaling G-transformation for weighted least squares problems
- Linear scaling and the DIRECT algorithm
- Scaled Givens Rotations for the Solution of Linear Least Squares Problems on Systolic Arrays
- scientific article; zbMATH DE number 953048 (Why is no real title available?)
- Householder Orthogonalization with a Nonstandard Inner Product
- A dynamic method for weighted linear least squares problems
This page was built for publication: Implicit scaling of linear least squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569893)