On generalized matrix approximation problem in the spectral norm

DOI10.1016/j.laa.2011.10.009zbMath1236.15051OpenAlexW2087644270MaRDI QIDQ2427920

Kin Cheong Sou, Anders Rantzer

Publication date: 19 April 2012

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2011.10.009

zbMATH Keywords

singular value decompositionrank minimizationmatrix approximation

Mathematics Subject Classification ID

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

Related Items (8)

Minimum rank positive semidefinite solution to the matrix approximation problem in the spectral norm ⋮ Rank constrained matrix best approximation problem ⋮ Optimal CUR Matrix Decompositions ⋮ On extremal ranks and least squares solutions subject to a rank restriction ⋮ Rank constrained matrix best approximation problem with respect to (skew) Hermitian matrices ⋮ Minimum rank Hermitian solution to the matrix approximation problem in the spectral norm and its application ⋮ Least squares solutions to the rank-constrained matrix approximation problem in the Frobenius norm ⋮ Minimum rank (skew) Hermitian solutions to the matrix approximation problem in the spectral norm

Uses Software

• mctoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• A generalization of the Eckart-Young-Mirsky matrix approximation theorem
• A numerical algorithm for computing the restricted singular value decomposition of matrix triplets
• Schmidt-Mirsky matrix approximation with linearly constrained singular values
• The Smallest Perturbation of a Submatrix which Lowers the Rank and Constrained Total Least Squares Problems
• Norm-Preserving Dilations and Their Applications to Optimal Error Bounds
• Accuracy and Stability of Numerical Algorithms
• Generalized Rank-Constrained Matrix Approximations

This page was built for publication: On generalized matrix approximation problem in the spectral norm