On a general class of matrix nearness problems

DOI10.1007/BF01888159zbMath0736.15017MaRDI QIDQ1176190

G. Alistair Watson

Publication date: 25 June 1992

Published in: Constructive Approximation (Search for Journal in Brave)

zbMATH Keywords

numerical examples; matrix norm; rectangular matrix; structured perturbation; matrix nearness problems; monotone gauge function; nearest rank-deficient matrix; prescribed sparsity

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• An Analysis of the Total Least Squares Problem
• On a class of algorithms for total approximation
• A generalization of the Eckart-Young-Mirsky matrix approximation theorem
• An Analysis of the Total Approximation Problem in Separable Norms, and an Algorithm for the Total $l_1 $ Problem
• Characterization and efficient computation of the structured singular value
• 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
• m-form numerical range and the computation of the structured singular value
• Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
• Analysis of the Effects of Irregular Terrain on Radio Wave Propagation Based on a Three-Dimensional Parabolic Equation