Many source separation algorithms rely on the approximate simultaneous diagonalization of matrices. While there exist very efficient algorithms for symmetric matrices, the skew-symmetric case turned out to be more difficult. Here we show how the often used whitening/rotation approach for symmetric matrices can be translated to this case. While the former leads to orthogonal transformations in Euclidean space, the latter leads to symplectic transformations in symplectic space. It is demonstrated that the resulting algorithm is more stable than a naïve diagonalization that does not respect the symplectic structure of the problem. © 2012 Springer-Verlag.
CITATION STYLE
Meinecke, F. C. (2012). Simultaneous diagonalization of skew-symmetric matrices in the symplectic group. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7191 LNCS, pp. 147–154). https://doi.org/10.1007/978-3-642-28551-6_19
Mendeley helps you to discover research relevant for your work.