Total least squares problem with the arbitrary unitarily invariant norms
DOI10.1080/03081087.2016.1189493zbMATH Open1367.15017OpenAlexW2419078306MaRDI QIDQ2961480FDOQ2961480
Authors:
Publication date: 20 February 2017
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2016.1189493
Recommendations
- Extension of the total least square problem using general unitarily invariant norms
- On solution of total least squares problems with multiple right‐hand sides
- The total least squares problem in \(AX \approx B\): A new classification with the relationship to the classical works
- Algebraic relations between the total least squares and least squares problems with more than one solution
- The solvability of the multidimensional total least perturbation problem in spectral norm
Eigenvalues, singular values, and eigenvectors (15A18) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical computation of matrix norms, conditioning, scaling (65F35) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)
Cites Work
- Matrix Analysis
- An Analysis of the Total Least Squares Problem
- Singular value decomposition and least squares solutions
- The total least squares problem in \(AX \approx B\): A new classification with the relationship to the classical works
- A generalization of the Eckart-Young-Mirsky matrix approximation theorem
- Backward perturbation analysis of certain characteristic subspaces
- Principal submatrices. IX: Interlacing inequalities for singular values of submatrices
- SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
- Core Problems in Linear Algebraic Systems
- Cauchy-Schwarz inequalities associated with positive semidefinite matrices
- Eigenvalue inequalities and equalities
- Monotonicity of unitarily invariant norms
- Title not available (Why is that?)
- Band generalization of the Golub-Kahan bidiagonalization, generalized Jacobi matrices, and the core problem
- Extension of the total least square problem using general unitarily invariant norms
- The core problem within a linear approximation problem \(AX\approx B\) with multiple right-hand sides
Cited In (8)
- Randomized core reduction for discrete ill-posed problem
- On TLS formulation and core reduction for data fitting with generalized models
- Solvability classes for core problems in matrix total least squares minimization.
- Title not available (Why is that?)
- TLS formulation and core reduction for problems with structured right-hand sides
- A Unitarily Constrained Total Least Squares Problem in Signal Processing
- Extension of the total least square problem using general unitarily invariant norms
- Krylov Subspace Approach to Core Problems within Multilinear Approximation Problems: A Unifying Framework
This page was built for publication: Total least squares problem with the arbitrary unitarily invariant norms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2961480)