Generalized Rank-Constrained Matrix Approximations

DOI10.1137/06065551zbMath1144.15004arXivmath/0603674OpenAlexW2050580360MaRDI QIDQ5301198

Shmuel Friedland, Anatoli Torokhti

Publication date: 29 April 2008

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0603674

zbMATH Keywords

singular value decompositionFrobenius normgeneralized inverseMoore-Penrose inversegeneralized rank-constrained matrix approximations

Mathematics Subject Classification ID

Theory of matrix inversion and generalized inverses (15A09) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (27)

Efficient compression of distributed information in estimation fusion ⋮ Optimal Low-rank Approximations of Bayesian Linear Inverse Problems ⋮ A regularized alternating least-squares method for minimizing a sum of squared Euclidean norms with rank constraint ⋮ On least squares solutions subject to a rank restriction ⋮ Online Adaptive Model Reduction for Nonlinear Systems via Low-Rank Updates ⋮ Minimum rank positive semidefinite solution to the matrix approximation problem in the spectral norm ⋮ Generalized Matrix Nearness Problems ⋮ Rank constrained matrix best approximation problem ⋮ On generalized matrix approximation problem in the spectral norm ⋮ Fourier spectral factor model for prediction of multidimensional signals ⋮ Optimal CUR Matrix Decompositions ⋮ Goal-Oriented Optimal Approximations of Bayesian Linear Inverse Problems ⋮ Unnamed Item ⋮ Effective implementation to reduce execution time of a low-rank matrix approximation problem ⋮ A general class of arbitrary order iterative methods for computing generalized inverses ⋮ 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 ⋮ Relations between least-squares and least-rank solutions of the matrix equation \(AXB=C\) ⋮ Optimal regularized low rank inverse approximation ⋮ Towards theory of generic principal component analysis ⋮ Filtering and compression for infinite sets of stochastic signals ⋮ HOID: Higher Order Interpolatory Decomposition for Tensors Based on Tucker Representation ⋮ Unnamed Item ⋮ Randomized Approximation of the Gram Matrix: Exact Computation and Probabilistic Bounds ⋮ Optimal Regularized Inverse Matrices for Inverse Problems ⋮ Hybrid CUR-type decomposition of tensors in the Tucker format

This page was built for publication: Generalized Rank-Constrained Matrix Approximations