Abstract
We present an algorithm for mixed precision iterative refinement on the constrained and weighted linear least squares problem, the CWLSQ problem. The approximate solution is obtained by solving the CWLSQ problem with the weightedQR factorization [6]. With backward errors for the weightedQR decomposition together with perturbation bounds for the CWLSQ problem we analyze the convergence behaviour of the iterative refinement procedure.
In the unweighted case the initial convergence rate of the error of the iteratively refined solution is determined essentially by the condition number. For the CWLSQ problem the initial convergence behaviour is more complicated. The analysis shows that the initial convergence is dependent both on the condition of the problem related to the solution,x, and the vector λ=Wr, whereW is the weight matrix andr is the residual.
We test our algorithm on two examples where the solution is known and the condition number of the problem can be varied. The computational test confirms the theoretical results and verifies that mixed precision iterative refinement, using the system matrix and the weightedQR decomposition, is an effective way of improving an approximate solution to the CWLSQ problem.
Similar content being viewed by others
References
Å. Björck,Iterative refinement of linear least squares solutions I, BIT, 7 (1967), pp. 257–278.
Å. Björck,Comment on the iterative refinement of least squares solutions, J. Amer. Stat. Assoc., 73 (1978), pp. 161–166.
L. Eldén,Perturbation theory for the least squares problem with linear constraints, SIAM J. Numer. Anal., 17 (1980), pp. 338–350.
M. E. Gulliksson,Backward error analysis for the constrained and weighted linear least squares problem when using the modified QR decomposition, Technical Report UMINF 93.01, Inst. of Info. Proc., Univ. of Umeå, S-901 87 Umeå, Sweden, 1993.
M. E. Gulliksson,Iterative refinement for weighted linear least squares using the modified QR decomposition, Technical Report UMINF 93.02, Inst. of Info. Proc., Univ. of Umeå, S-901 87 Umeå, Sweden, 1993. Submitted to BIT.
M. E. Gulliksson and P.-Å. Wedin,Modifying the QR decomposition to weighted and constrained linear least squares, SIAM J. Matrix Anal. Appl., 13(4) (1992), pp. 1298–1313.
P.-Å. Wedin,Perturbation results and condition numbers for outer inverses and especially for projections, Technical Report UMINF 124.85, Inst. of Info. Proc., Univ. of Umeå, S-901 87 Umeå, Sweden, 1985.
P.-Å. Wedin,Perturbation theory and condition numbers for generalized and constrained linear least squares problems, Technical Report UMINF 124.85, Inst. of Info. Proc., Univ. of Umeå, Umeå, Sweden, 1985.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gulliksson, M. Iterative refinement for constrained and weighted linear least squares. BIT 34, 239–253 (1994). https://doi.org/10.1007/BF01955871
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01955871