Real Hamiltonian Polar Decompositions 1265
نویسنده
چکیده
For a given real invertible skew-symmetric matrix H, we characterize the real 2n×2n matrices X that allow an H-Hamiltonian polar decomposition of the type X = UA, where U is a real H-symplectic matrix (UTHU = H) and A is a real H-Hamiltonian matrix (HA = −ATH).
منابع مشابه
Stability of Polar Decompositions
Certain continuity properties of the factors in generalized polar decompositions of real and complex matrices are studied. A complete characterization is given of those generalized polar decompositions that persist under small perturbations in the matrix and in the scalar product. Connections are made with quadratic matrix equations, and with stability properties of certain invariant subspaces.
متن کاملPolar Decompositions in Finite Dimensional Indefinite Scalar Product Spaces: Special Cases and Applications
Polar decompositions X = U A of real and complex matrices X with respect to the scalar product generated by a given indefinite nonsingular matrix Hare studied in the following special cases: (1) X is an H-contraction, (2) X is an H-plus matrix, (3) H has only one positive eigenvalue, and (4) U belongs to the connected component of the identity in the group of H-unitary matrices. Applications to...
متن کاملTheorem (in any field of Characteristic 2):
In Graph Theory a number of results were devoted to studying the computational complexity of the number modulo 2 of a graph’s edge set decompositions of various kinds, first of all including its Hamiltonian decompositions, as well as the number modulo 2 of, say, Hamiltonian cycles/paths etc. While the problems of finding a Hamiltonian decomposition and Hamiltonian cycle are NP-complete, countin...
متن کاملHamiltonian decompositions of complete k-uniform hypergraphs
Using a generalisation of Hamiltonian cycles to uniform hypergraphs due to Katona and Kierstead, we define a new notion of a Hamiltonian decomposition of a uniform hypergraph. We then consider the problem of constructing such decompositions for complete uniform hypergraphs, and describe its relationship with other topics, such as design theory.
متن کاملAdjoints, absolute values and polar decompositions
Various questions about adjoints, absolute values and polar decompositions of operators are addressed from a constructive point of view. The focus is on bilinear forms. Conditions are given for the existence of an adjoint, and a general notion of a polar decomposition is developed. The Riesz representation theorem is proved without countable choice.
متن کامل