Analysis of the generalized total least squares problem \(AX\approx B\) when some columns of \(A\) are free of error
From MaRDI portal
Publication:1326441
DOI10.1007/BF01385747zbMath0803.65049MaRDI QIDQ1326441
Christopher C. Paige, Musheng Wei
Publication date: 2 January 1995
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133730
65F20: Numerical solutions to overdetermined systems, pseudoinverses
Related Items
History and generality of the CS decomposition, Perturbation theory for the Eckart-Young-Mirsky theorem and the constrained total least squares problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An Analysis of the Total Least Squares Problem
- A generalization of the Eckart-Young-Mirsky matrix approximation theorem
- Algebraic relationships between classical regression and total least- squares estimation
- Algebraic relations between the total least squares and least squares problems with more than one solution
- The Restricted Singular Value Decomposition of Matrix Triplets
- The Restricted Total Least Squares Problem: Formulation, Algorithm, and Properties
- Consistency of regression estimates when some variables are subject to error
- Matrix Analysis
- Computing the Generalized Singular Value Decomposition
- The Smallest Perturbation of a Submatrix that Lowers the Rank of the Matrix
- The Smallest Perturbation of a Submatrix which Lowers the Rank and Constrained Total Least Squares Problems
- Towards a Generalized Singular Value Decomposition
- The Restricted Singular Value Decomposition: Properties and Applications
- The Analysis for the Total Least Squares Problem with More Than One Solution
- Generalizing the Singular Value Decomposition
- Analysis and Properties of the Generalized Total Least Squares Problem $AX \approx B$ When Some or All Columns in A are Subject to Error
