Solvability classes for core problems in matrix total least squares minimization.
DOI10.21136/AM.2019.0252-18OpenAlexW2915840881WikidataQ128340554 ScholiaQ128340554MaRDI QIDQ2315455
Martin Plešinger, Jana Žáková, Iveta Hnetynkova
Publication date: 5 August 2019
Published in: Applications of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.21136/am.2019.0252-18
classificationtotal least squareslinear approximation problemcore problem theoryirreducible problemreducible problem
Factorization of matrices (15A23) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09) Eigenvalues, singular values, and eigenvectors (15A18) Linear equations (linear algebraic aspects) (15A06)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- An Analysis of the Total Least Squares Problem
- Overview of total least-squares methods
- Algebraic relations between the total least squares and least squares problems with more than one solution
- The Core Problem within a Linear Approximation Problem $AX\approx B$ with Multiple Right-Hand Sides
- Total least squares problem with the arbitrary unitarily invariant norms
- The Total Least Squares Problem in AX≈B: A New Classification with the Relationship to the Classical Works
- Solvability of the Core Problem with Multiple Right-Hand Sides in the TLS Sense
- The Analysis for the Total Least Squares Problem with More Than One Solution
- The original tls solution sets of the multidimensional TLS problem∗
- Band Generalization of the Golub--Kahan Bidiagonalization, Generalized Jacobi Matrices, and the Core Problem
- Generalized Vectorization, Cross-Products, and Matrix Calculus
- Core Problems in Linear Algebraic Systems
This page was built for publication: Solvability classes for core problems in matrix total least squares minimization.
