Year: 2026
Type: preprint
Abstract: We study how well a single $k$-dimensional subspace can preserve volume from several positive semidefinite matrices at once. Each matrix is compressed to the subspace and scored by the geometric mean of the eigenvalues of that compression; the scores are aggregated by a weighted power mean of order $p \le 1$. For every fixed $k$ and every fixed rational $p$ we determine the optimal approximation factor: it is achieved by a randomized polynomial-time algorithm, and every larger constant is NP-hard. Above a critical power ($p=-k/2$ over the reals and $p=-k$ over the complex numbers) the factor is an explicit product of Gamma functions. At and below the critical power, every positive constant-factor approximation is NP-hard. The factor comes from a concave relaxation over the positive semidefinite matrices of trace one, which agrees with the volume score at every subspace, followed by ordinary Gaussian rounding. For two rank-$k$ matrices the relaxation is exact, giving a closed-form optimum for Martin means of two subspaces.
Source: arXiv (Cornell University)
Author: Peregudin, Alexey
Institution: University of Sheffield
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7224967273