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

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Symmetry decomposition and matrix multiplication

Matthew C. Lettington, Karl Michael Schmidt, Nicholas J. Higham
Linear Algebra and its Applications
Matrix Theory and Algorithms
article

Symmetry decomposition and matrix multiplication

Matthew C. Lettington, Karl Michael Schmidt, Nicholas J. Higham
article en

Abstract

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.

Linear Algebra and its ApplicationsVol. 710
Royal Society
Openalex Percentile: Top 97%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.