Back to Search Start Over

Algorithms for the Polar Decomposition in Certain Groups and the Quaternion Tensor Square.

Authors :
ADJEI, FRANCIS
CISNEROS, MARCUS
DESAI, DEEP
KHAN, SAMREEN
RAMAKRISHNA, VISWANATH
WHITELEY, BRANDON
Source :
Journal of Combinatorics, Information & System Sciences. 2019, Vol. 44 Issue 1-4, p1-34. 34p.
Publication Year :
2019

Abstract

Constructive algorithms, not even requiring 2x2 eigencalculations, are provided for finding the entries of the positive definite factor in the polar decomposition of matrices in many groups. These groups include the indefinite orthogonal groups of signature (1, n -- 1) nd (n -- 1, 1) and fifteen groups preserving certain bilinear forms in dimension four. The Lorentz group belongs to both classes. Some of these algorithms extend to the indefinite orthogonal groups of arbitrary signature with nominal additional work. These procedures are then used to find quaternionic representations for the four dimensional groups mentioned above, analogous to the representation of the special orthogonal group via a pair of unit quaternions. A key ingredient is a characterization of positive definite matrices in these groups. Two algorithms are proposed for the Lorentz group. The former also works for the group whose signature is (n -- 1, 1) and (1, n -- 1). The second enables (and is aided by) the inversion of the double covering of the Lorentz group by SL(2, C). A key observation is that the inversion of the covering map, when the target is a positive definite matrix, can be achieved essentially by inspection as we demonstrate. For the group whose signature matrix is I2,2 a completion procedure based on the aforementioned characterization of positivity leads to yet another algorithm for the computation of the polar decomposition. For the other four dimensional groups, explicit isomorphisms provided by quaternion algebra lead to methods for the polar decomposition. As byproducts we give a simple proof of the fact that positive definite matrices in each of these groups belong to the connected component of the identity, find an explicit expression for their logarithm, and provide a characterization of the symmetric matrices in the connected component of the identity of two of these groups in terms of their preimages in the corresponding covering group. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
02509628
Volume :
44
Issue :
1-4
Database :
Academic Search Index
Journal :
Journal of Combinatorics, Information & System Sciences
Publication Type :
Academic Journal
Accession number :
148023675
Full Text :
https://doi.org/10.32381/JCISS.2019.44.1-4.1