DocumentCode :
1432571
Title :
On the equivalence of constrained total least squares and structured total least squares
Author :
Lemmerling, Philippe ; Moor, Bart De ; Huffel, Sabine Van
Author_Institution :
ESAT-SISTA, Katholieke Univ., Leuven, Heverlee, Belgium
Volume :
44
Issue :
11
fYear :
1996
fDate :
11/1/1996 12:00:00 AM
Firstpage :
2908
Lastpage :
2911
Abstract :
Several extensions of the total least squares (TLS) method that are able to calculate a structured rank deficient approximation of a data matrix have been developed. The main result of this article is the demonstration of the equivalence of two of these approaches, namely, the constrained total least squares (CTLS) approach and the structured total least squares (STLS) approach. We also present a numerical comparison of both methods
Keywords :
convergence of numerical methods; least squares approximations; matrix algebra; parameter estimation; constrained total least squares; convergence rate; data matrix; linear parameter estimation; numerical comparison; structured rank deficient approximation; structured total least squares; Adaptive signal processing; Artificial intelligence; Geometry; Least squares approximation; Least squares methods; Matrix decomposition; Parameter estimation; Signal processing algorithms; Singular value decomposition; Sparse matrices;
fLanguage :
English
Journal_Title :
Signal Processing, IEEE Transactions on
Publisher :
ieee
ISSN :
1053-587X
Type :
jour
DOI :
10.1109/78.542454
Filename :
542454
Link To Document :
بازگشت