Towards tensor generalizations of TLS & core problem theory

Abstract

AbstractDespite the wide attention, there are still several not well understood parts in the theory of total least squares (TLS) formulation of linear algebraic approximation problems. In particular, in the problems with multiple (matrix) right‐hand sides one can ask about the meaning of the nongeneric solution in the context of the original data, the nonexistence of the TLS solution for the so‐called irreducible core problems, etc. In the single (vector) right‐hand side TLS, these problems can be easily explained through the core problem theory or simply do not appear. Here we summarize, how the existing TLS and core problem theory can be generalized to problems with tensor right‐hand sides. Such generalization also gives a natural and wider context for further analysis of the above mentioned questions.