The Total Least Squares Problem in AX approximate to B: A New Classification with the Relationship to the Classical Works
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F11%3A00375603" target="_blank" >RIV/67985807:_____/11:00375603 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1137/100813348" target="_blank" >http://dx.doi.org/10.1137/100813348</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1137/100813348" target="_blank" >10.1137/100813348</a>
Alternative languages
Result language
angličtina
Original language name
The Total Least Squares Problem in AX approximate to B: A New Classification with the Relationship to the Classical Works
Original language description
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 theclassical 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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/IAA100300802" target="_blank" >IAA100300802: Theory of Krylov subspace methods and its relationship to other mathematical disciplines</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
SIAM Journal on Matrix Analysis and Applications
ISSN
0895-4798
e-ISSN
—
Volume of the periodical
32
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
23
Pages from-to
748-770
UT code for WoS article
000295399200005
EID of the result in the Scopus database
—