Halving the size of skew-symmetric eigenvalue problems via the polar decomposition

This paper introduces a novel algorithm for computing eigenvalues and eigenvectors of a dense real skew-symmetric matrix $A$. Its main ingredient is the computation of a polar factor of $A$ that is both skew-symmetric and orthogonal. This polar factor is then used to transform the original problem into a Hermitian eigenvalue problem of half the size, which can be solved accurately and efficiently with standard software such as LAPACK. Numerical experiments demonstrate the stability of the method and show that its running time is competitive with existing approaches for skew-symmetric eigenvalue problems. Finally, we show that the same principle can be used to reduce an orthogonal eigenvalue problem to a unitary eigenvalue problem of half the size.

Source: arXiv:2608.12153v1 - http://arxiv.org/abs/2608.12153v1 PDF: https://arxiv.org/pdf/2608.12153v1 Original Link: http://arxiv.org/abs/2608.12153v1