The Total Least Squares Problem in AX approximate to B: A New Classification with the Relationship to the Classical Works

0375603 - ÚI 2012 RIV US eng J - Článek v odborném periodiku
Hnětynková, I. - Plešinger, Martin - Sima, D.M. - Strakoš, Z. - Huffel van, S.
The Total Least Squares Problem in AX approximate to B: A New Classification with the Relationship to the Classical Works.
SIAM Journal on Matrix Analysis and Applications. Roč. 32, č. 3 (2011), s. 748-770. ISSN 0895-4798. E-ISSN 1095-7162
Grant CEP: GA AV ČR IAA100300802
Grant ostatní: GA ČR(CZ) GA201/09/0917
Program: GA
Výzkumný záměr: CEZ:AV0Z10300504
Klíčová slova: total least squares * multiple right-hand sides * linear approximation problems * orthogonally invariant problems * orthogonal regression * errors-in-variables modeling
Kód oboru RIV: BA - Obecná matematika
Impakt faktor: 1.368, rok: 2011

This paper revisits the analysis of the total least squares (TLS) problem AX approximate to B with multiple right-hand sides given by Van Huffel and Vandewalle in the monograph, The Total Least Squares Problem: Computational Aspects and Analysis, SIAM, Philadelphia, 1991. The newly proposed classification is based on properties of the singular value decomposition of the extended matrix [B|A]. It aims at identifying the cases when a TLS solution does or does not exist and when the output computed by the classical TLS algorithm, given by Van Huffel and Vandewalle, is actually a TLS solution. The presented results on existence and uniqueness of the TLS solution reveal subtleties that were not captured in the known literature.
Trvalý link: http://hdl.handle.net/11104/0208210