New classes of matrix decompositions
From MaRDI portal
Abstract: The idea of decomposing a matrix into a product of structured matrices such as triangular, orthogonal, diagonal matrices is a milestone of numerical computations. In this paper, we describe six new classes of matrix decompositions, extending our work in arXiv:1307.5132. We prove that every matrix is a product of finitely many bidiagonal, skew symmetric (when n is even), generic, companion matrices and generalized Vandermonde matrices, respectively. We also prove that a generic centrosymmetric matrix is a product of finitely many symmetric Toeplitz (resp. persymmetric Hankel) matrices. We determine an upper bound of the number of structured matrices needed to decompose a matrix for each case.
Recommendations
Cites work
- scientific article; zbMATH DE number 4105108 (Why is no real title available?)
- scientific article; zbMATH DE number 50185 (Why is no real title available?)
- scientific article; zbMATH DE number 51906 (Why is no real title available?)
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 1983902 (Why is no real title available?)
- scientific article; zbMATH DE number 1774902 (Why is no real title available?)
- scientific article; zbMATH DE number 790015 (Why is no real title available?)
- Algebraic Geometry. I: Complex projective varieties.
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Lie groups beyond an introduction
- Matrix Analysis
- Rank-Sparsity Incoherence for Matrix Decomposition
- The Factorization of a Square Matrix Into Two Symmetric Matrices
- Uncertainty principles and ideal atomic decomposition
Cited in
(3)
This page was built for publication: New classes of matrix decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q347485)