All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Solvability Classes for Core Problems in Matrix Total Least Squares Minimization

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F19%3A00504412" target="_blank" >RIV/67985807:_____/19:00504412 - isvavai.cz</a>

  • Alternative codes found

    RIV/00216208:11320/19:10404453 RIV/46747885:24510/19:00006147

  • Result on the web

    <a href="http://hdl.handle.net/11104/0296053" target="_blank" >http://hdl.handle.net/11104/0296053</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.21136/AM.2019.0252-18" target="_blank" >10.21136/AM.2019.0252-18</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Solvability Classes for Core Problems in Matrix Total Least Squares Minimization

  • Original language description

    Linear matrix approximation problems AX ≈ B are often solved by the total least squares minimization (TLS). Unfortunately, the TLS solution may not exist in general. The so-called core problem theory brought an insight into this effect. Moreover, it simplified the solvability analysis if B is of column rank one by extracting a core problem having always a unique TLS solution. However, if the rank of B is larger, the core problem may stay unsolvable in the TLS sense, as shown for the first time by Hnětynková, Plešinger, and Sima (2016). Full classification of core problems with respect to their solvability is still missing. Here we fill this gap. Then we concentrate on the so-called composed (or reducible) core problems that can be represented by a composition of several smaller core problems. We analyze how the solvability class of the components influences the solvability class of the composed problem. We also show on an example that the TLS solvability class of a core problem may be in some sense improved by its composition with a suitably chosen component. The existence of irreducible problems in various solvability classes is discussed.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10102 - Applied mathematics

Result continuities

  • Project

    <a href="/en/project/GC17-04150J" target="_blank" >GC17-04150J: Reliable two-scale Fourier/finite element-based simulations: Error-control, model reduction, and stochastics</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2019

  • 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

    Applications of Mathematics

  • ISSN

    0862-7940

  • e-ISSN

  • Volume of the periodical

    64

  • Issue of the periodical within the volume

    2

  • Country of publishing house

    CZ - CZECH REPUBLIC

  • Number of pages

    26

  • Pages from-to

    103-128

  • UT code for WoS article

    000463984700002

  • EID of the result in the Scopus database

    2-s2.0-85064195522