Modifying the QR-Decomposition to Constrained and Weighted Linear Least Squares
- 1 October 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 13 (4) , 1298-1313
- https://doi.org/10.1137/0613079
Abstract
A new way of looking at a class of methods for the weighted linear least squares problem $\min _x \| M^{ - ( 1/2 )} ( b - Ax ) \|_2 $ where $M = {\operatorname{diag}}(\mu _i )$ is presented by introducing a modified QR-decomposition with QM-invariant, i.e., $QMQ^T = M$. One of the main advantages with this approach is that linear constraints are easily incorporated by letting the corresponding diagonal elements in M become zero. Householder reflections are generalized to M-invariant reflections, and an algorithm for solving the constrained and weighted linear least squares problem is described. The system equations (or the augmented system equations) are used to derive condition numbers, and the connection between these condition numbers and the rounding error in the solution is investigated.
Keywords
This publication has 10 references indexed in Scilit:
- Perturbation Theory for the Rank-Deficient Equality Constrained Least Squares ProblemSIAM Journal on Numerical Analysis, 1992
- On the augmented system approach to sparse least-squares problemsNumerische Mathematik, 1989
- The Direct Solution of Weighted and Equality Constrained Least-Squares ProblemsSIAM Journal on Scientific and Statistical Computing, 1988
- Perturbation Theory for the Least Squares Problem with Linear Equality ConstraintsSIAM Journal on Numerical Analysis, 1980
- Fast Numerically Stable Computations for Generalized Linear Least Squares ProblemsSIAM Journal on Numerical Analysis, 1979
- Computer solution and perturbation analysis of generalized linear least squares problemsMathematics of Computation, 1979
- Perturbation theory for pseudo-inversesBIT Numerical Mathematics, 1973
- Algol programmingBIT Numerical Mathematics, 1967
- Note on the iterative refinement of least squares solutionNumerische Mathematik, 1966
- Numerical methods for solving linear least squares problemsNumerische Mathematik, 1965