A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes
暂无分享,去创建一个
SummaryIn this paper we describe how to use Gram-Schmidt factorizations of Daniel et al. [1] to realize the method of [8] for solving linearly constrained linear least squares problems. The main advantage of using these factorizations is that it is relatively easy to take data changes into account, if necessary.The algorithm is compared numerically with two other codes, one of them published by Lawson and Hanson [3]. Further computational tests show the efficiency of the proposed methods, if a few data of the original problem are changed subsequently.
[1] Roy H. Wampler. An evaluation of linear least squares computer programs , 1969 .
[2] J. Stoer. On the Numerical Solution of Constrained Least-Squares Problems , 1971 .
[3] C. Lawson,et al. Solving least squares problems , 1976, Classics in applied mathematics.
[4] G. Stewart,et al. Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization , 1976 .