Perturbation Analysis of Singular Values in Concatenated Matrices
By: Maksym Shamrai
Potential Business Impact:
Makes data compression more accurate and stable.
Concatenating matrices is a common technique for uncovering shared structures in data through singular value decomposition (SVD) and low-rank approximations. The fundamental question arises: How does the singular value spectrum of the concatenated matrix relate to the spectra of its individual components? In the present work, we develop a perturbation technique that extends classical results such as Weyl's inequality to concatenated matrices. We setup analytical bounds that quantify stability of singular values under small perturbations in submatrices. The results demonstrate that if submatrices are close in a norm, dominant singular values of the concatenated matrix remain stable enabling controlled trade-offs between accuracy and compression. These provide a theoretical basis for improved matrix clustering and compression strategies with applications in the numerical linear algebra, signal processing, and data-driven modeling.
Similar Papers
Combined perturbation bounds for eigenstructure of Hermitian matrices and singular structure of general matrices
Numerical Analysis
Finds how matrix changes affect important numbers.
Matrix nearness problems and eigenvalue optimization
Numerical Analysis
Makes computer math problems easier to solve.
Asymptotic behavior of eigenvalues of large rank perturbations of large random matrices
Mathematical Physics
Makes smart computer programs learn better.