Singular value decompositions over ∗-algebras with applications to tensor decompositions
Abstract
The singular value decomposition (SVD) provides optimal low-rank approximations of real and complex matrices by the Eckart--Young theorem, and SVD-based tensor decomposition algorithms such as the higher-order singular value decomposition (HOSVD) and the tensor train singular value decomposition (TT-SVD) inherit quasi-optimality guarantees from it. We extend the SVD to matrices over a finite-dimensional ∗-algebra K. Our main contribution is a characterization of the algebras K for which every matrix admits an SVD, and of the inner products on K for which the Eckart-Young theorem holds. We introduce a notion of ordered SVD, show that ordered SVDs reveal the rank of a matrix over K and yield optimal truncations, and give an explicit algorithm that computes an ordered SVD from the structure of the algebra. We then extend the Tucker, tensor train, and tree tensor network (TTN) decompositions and their SVD-based decomposition algorithms to tensors over K, and show that TT-SVD retains a quasi-optimality guarantee over every such K, whereas HOSVD, ST-HOSVD, and TTN-SVD do so when K is commutative. Viewed in real or complex coordinates, these constructions give novel decomposition formats of ordinary tensors. We illustrate our new methods by compressing data from a variety of scientific applications, and show that they can achieve lower approximation error than their classical counterparts at equal storage.
Related
- A Fast Algorithm for Quaternion Tensor Singular Value Decomposition under the QT-Product with Applications to Color Video Processing
- Parabolic Reifenberg Parametrizations and Corona Decompositions, with Applications to Singular Integrals
- A Fast Algorithm for Quaternion Tensor Singular Value Decomposition under the T-product
- Minkowski Decompositions for Generic Infinitesimal Newton-Okounkov Bodies of Arbitrary-Degree External Tensor Products on Products of Curves
- Graded bimodules over split group algebras: stabilizers and Peirce decompositions
BibTeX
@misc{hoyos2026singular,
title = {{Singular value decompositions over $\ast$-algebras with applications to tensor decompositions}},
author = {Paulina Hoyos and Joe Kileel},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.40450},
eprint = {2610.40450},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.40450},
}
RIS
TY - UNPB
TI - Singular value decompositions over ∗-algebras with applications to tensor decompositions
AU - Paulina Hoyos
AU - Joe Kileel
PY - 2026
DA - 2026/10/29
PB - arXiv
DO - 10.48550/arxiv.2610.40450
UR - https://arxiv.org/abs/2610.40450
AB - The singular value decomposition (SVD) provides optimal low-rank approximations of real and complex matrices by the Eckart--Young theorem, and SVD-based tensor decomposition algorithms such as the higher-order singular value decomposition (HOSVD) and the tensor train singular value decomposition (TT-SVD) inherit quasi-optimality guarantees from it. We extend the SVD to matrices over a finite-dimensional ∗-algebra K. Our main contribution is a characterization of the algebras K for which every matrix admits an SVD, and of the inner products on K for which the Eckart-Young theorem holds. We introduce a notion of ordered SVD, show that ordered SVDs reveal the rank of a matrix over K and yield optimal truncations, and give an explicit algorithm that computes an ordered SVD from the structure of the algebra. We then extend the Tucker, tensor train, and tree tensor network (TTN) decompositions and their SVD-based decomposition algorithms to tensors over K, and show that TT-SVD retains a quasi-optimality guarantee over every such K, whereas HOSVD, ST-HOSVD, and TTN-SVD do so when K is commutative. Viewed in real or complex coordinates, these constructions give novel decomposition formats of ordinary tensors. We illustrate our new methods by compressing data from a variety of scientific applications, and show that they can achieve lower approximation error than their classical counterparts at equal storage.
ER -