The Smallest Perturbation of a Submatrix which Lowers the Rank and Constrained Total Least Squares Problems

DOI10.1137/0724016zbMath0651.15024MaRDI QIDQ3795805

James W. Demmel

Publication date: 1987

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0724016

zbMATH Keywords

singular values; total least squares; rank reduction; rank perturbation; smallest perturbation

Mathematics Subject Classification ID

65F20: Numerical solutions to overdetermined systems, pseudoinverses

15A09: Theory of matrix inversion and generalized inverses

15A60: Norms of matrices, numerical range, applications of functional analysis to matrix theory

15A03: Vector spaces, linear dependence, rank, lineability

15A12: Conditioning of matrices

Related Items

Eigenvalues of graded matrices and the condition numbers of a multiple eigenvalue, Nearest southeast submatrix that makes multiple a prescribed eigenvalue., On perturbations of some constrained subspaces, On a general class of matrix nearness problems, Structured total least squares and \(L_ 2\) approximation problems, Analysis of the generalized total least squares problem \(AX\approx B\) when some columns of \(A\) are free of error, About existence and uniqueness of the restricted total least squares estimation, Geometric multiplicity margin for a submatrix, Connections between the total least squares and the correction of an infeasible system of linear inequalities, Perturbation theory for the Eckart-Young-Mirsky theorem and the constrained total least squares problem, Matrix rigidity