Symmetry decomposition and matrix multiplication
General matrices can be split uniquely into Frobenius-orthogonal components: a constant row and column sum (type S) part, a vertex cross sum (type V) part and a weight part. We show that for square matrices, the type S part can be expressed as a sum of squares of type V matrices. We investigate the properties of such decomposition under matrix multiplication, in particular how the pseudoinverses of a matrix relates to the pseudoinverses of its component parts. For invertible matrices, this yields an expression for the inverse where only the type S part needs to be (pseudo)inverted; in the example of the Wilson matrix, this component is considerably better conditioned than the whole matrix. We also show a relation between matrix determinants and the weight of their matrix inverses and give a simple proof for Frobenius-optimal approximations with the constant row and column sum and the vertex cross sum properties, respectively, to a given matrix.
Authors
- Matthew C. Lettington (ORCID: https://orcid.org/0000-0001-9327-143X)
- Karl Michael Schmidt (ORCID: https://orcid.org/0000-0002-0227-3024)
- Nicholas J. Higham (ORCID: https://orcid.org/0000-0001-5956-4976)
Publication Details
- Journal
- Linear Algebra and its Applications
- Published
- 2025-02-03
- DOI
- https://doi.org/10.1016/j.laa.2025.01.041
- Primary Topic
- Matrix Theory and Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Royal Society