Statistics – Computation
Scientific paper
Nov 1999
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1999spie.3807..247b&link_type=abstract
Proc. SPIE Vol. 3807, p. 247-257, Advanced Signal Processing Algorithms, Architectures, and Implementations IX, Franklin T. Luk;
Statistics
Computation
Scientific paper
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.
Barlow Jesse L.
Erbay Hasan
Zhang Zhenyue
No associations
LandOfFree
Modified Gram-Schmidt-based downdating technique for ULV decompositions with applications to recursive TLS problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Modified Gram-Schmidt-based downdating technique for ULV decompositions with applications to recursive TLS problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modified Gram-Schmidt-based downdating technique for ULV decompositions with applications to recursive TLS problems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-1513780