The total least squares problem and reduction of data in AX - B

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F46747885%3A24510%2F11%3A%230000374" target="_blank" >RIV/46747885:24510/11:#0000374 - isvavai.cz</a>
Result on the web
<a href="http://epubs.siam.org/sima/resource/1/sjmael/v32/i3/p748_s1" target="_blank" >http://epubs.siam.org/sima/resource/1/sjmael/v32/i3/p748_s1</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1137/100813348" target="_blank" >10.1137/100813348</a>

Result language
angličtina
Original language name
The total least squares problem and reduction of data in AX - B
Original language description
This paper revisits the analysis of the total least squares (TLS) problem AX - 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 TLSalgorithm, 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.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)