The problem of deleting a row from the QR factorization X = UR by Gram-Schmidt techniques is intimately connected to solving the least squares problem (formula available in paper) by classical iterative methods. Past approaches to this problem have focused upon accurate computation of the residual (formula available in paper), thereby finding a vector (formula available in paper) that is orthogonal to U. This work shows that it is also important to accurately compute the vector f and that it must be used in the downdating process to maintain good backward error in the new factorization. New algorithms are proposed based upon this observation.
[1]
Axel Ruhe.
Numerical aspects of gram-schmidt orthogonalization of vectors
,
1983
.
[2]
Hasan Erbay,et al.
Modified Gram-Schmidt-based downdating technique for ULV decompositions with applications to recursive TLS problems
,
1999,
Optics & Photonics.
[3]
J. Gillis,et al.
Matrix Iterative Analysis
,
1961
.
[4]
Haesun Park,et al.
Accurate downdating of a modified Gram-Schmidt QR decomposition
,
1996
.
[5]
G. Stewart,et al.
Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization
,
1976
.