A note on the scaled total least squares problem
From MaRDI portal
Publication:2465315
DOI10.1016/j.laa.2007.03.015zbMath1130.65057OpenAlexW2034819163MaRDI QIDQ2465315
Sanzheng Qiao, Wei Xu, Yi-Min Wei
Publication date: 3 January 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2007.03.015
numerical experimentsleast squaresperturbation analysisoverdetermined systemsscaled total least squares
Related Items
TLS-EM algorithm of mixture density models for exponential families, Regularized TLS-EM for estimating missing data, Structured perturbations of group inverse and singular linear system with index one
Cites Work
- Algebraic relations between the total least squares and least squares problems with more than one solution
- An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition
- Scaled total least squares fundamentals
- Bounds for the least squares distance using scaled total least squares
- The Analysis for the Total Least Squares Problem with More Than One Solution
- Bounding the Subspaces from Rank Revealing Two-Sided Orthogonal Decompositions
- Unnamed Item
- Unnamed Item
- Unnamed Item