Modified Gram-Schmidt-based downdating technique for ULV decompositions with applications to recursive TLS problems
Jesse L. Barlow, Hasan Erbay, Zhenyue Zhang · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1999
The ULV decomposition (ULVD) is an important member of a class of rank-revealing two-sided orthogonal decompositions used to approximate the singular value decomposition (SVD). The ULVD can be updated and downdated much faster than the SVD, hence its utility in the solution of recursive total least squares (TLS) problems. However, the robust implementation of ULVD after the addition and deletion of rows (called updating and downdating respectively) is not altogether straightforward. When updating or downdating the ULVD, the accurate computation of the subspaces necessary to solve the TLS problem is of great importance. In this paper, algorithms are given to compute simple parameters that can often show when good subspaces have been computed.