An n × n complex matrix P is said to be a generalized reflection matrix if P H = P and P 2 = I . An n × n complex matrix A is said to be a reflexive (or anti-reflexive) matrix with respect to the generalized reflection matrix P if A = P AP (or A = -P AP ). This paper establishes the necessary and su
Comments on “Finite iterative algorithms for the reflexive and anti-reflexive solutions of the matrix equation ”
✍ Scribed by Ai-Guo Wu; Ming-Zhe Hou
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 194 KB
- Volume
- 53
- Category
- Article
- ISSN
- 0895-7177
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
C n×n be nontrivial unitary involutions, i.e.,
In this paper, an iterative algorithm is constructed to solve the minimum Frobenius norm residual problem: min over bisymmetric matrices. By this algorithm, for any initial bisymmetric matrix X 0 , a solution X \* can be obtained in finite iteration steps in the absence of roundoff errors, and the
## Abstract In this note, a technical error is pointed out in the proof of a lemma in the above paper. A correct proof of this lemma is given. In addition, a further result on the algorithm in the above paper is also given. Copyright © 2009 John Wiley & Sons, Ltd.
In this paper, an iterative method is constructed to solve the linear matrix equation AXB = C over skew-symmetric matrix X. By the iterative method, the solvability of the equation AXB = C over skew-symmetric matrix can be determined automatically. When the equation AXB = C is consistent over skew-s