This paper addresses the finest block triangularization of nonsingular skewsymmetric matrices by simultaneous permutations of rows and columns. Hierarchical relations among components are represented in terms of signed posets. The finest block-triangular form can be computed efficiently with the aid
Matrix equations over -symmetric and -skew symmetric matrices
โ Scribed by Mehdi Dehghan; Masoud Hajarian
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 373 KB
- Volume
- 59
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
โฆ Synopsis
Let R โ C mรm and S โ C nรn be nontrivial involution matrices; i.e. R = R -1 = ยฑI and S = S -1 = ยฑI. An m ร n complex matrix A is said to be a (R, S)-symmetric ((R, S)skew symmetric) matrix if RAS = A (RAS = -A). The (R, S)-symmetric and (R, S)-skew symmetric matrices have many special properties and are widely used in engineering and scientific computations. In this paper, we consider the matrix equations
and
over the (R, S)-symmetric ((R, S)-skew symmetric) matrix X . We derive necessary and sufficient conditions for the existence of (R, S)-symmetric ((R, S)-skew symmetric) solutions for these matrix equations. Also we give the expressions for the (R, S)-symmetric ((R, S)-skew symmetric) solutions to the matrix equations.
๐ SIMILAR VOLUMES
Let n be a positive, even integer and let K n (F ) denote the subspace of skew-symmetric matrices of Mn(F ), the full matrix algebra with coefficients in a field F. A theorem of Kostant states that K n (F) satisfies the (2n -2)-fold standard identity s 2n-2 . In this paper we refine this result by s
In this paper, two efficient iterative methods are presented to solve the symmetric and skew symmetric solutions of a linear matrix equation AXB + CYD = E, respectively, with real pair matrices X and Y . By these two iterative methods, the solvability of the symmetric and skew symmetric solutions fo