The solvability conditions for the inverse eigenvalue problems of reflexive matrices
Journal of Computational and Applied Mathematics
The reflexive and anti-reflexive solutions of the matrix equation AHXB=C
Journal of Computational and Applied Mathematics
Computers & Mathematics with Applications
Procrustes problems for (P,Q,η)-reflexive matrices
Journal of Computational and Applied Mathematics
The solvability conditions for the inverse eigenvalue problems of reflexive matrices
Journal of Computational and Applied Mathematics
The left and right inverse eigenvalue problems of generalized reflexive and anti-reflexive matrices
Journal of Computational and Applied Mathematics
Dykstra's algorithm for constrained least-squares doubly symmetric matrix problems
Theoretical Computer Science
On the reflexive and anti-reflexive solutions of the generalised coupled Sylvester matrix equations
International Journal of Systems Science
Journal of Computational and Applied Mathematics
Mathematical and Computer Modelling: An International Journal
An efficient algorithm for solving general coupled matrix equations and its application
Mathematical and Computer Modelling: An International Journal
Efficient iterative solutions to general coupled matrix equations
International Journal of Automation and Computing
Hi-index | 0.01 |
The main purpose of this paper is to introduce and exploit special properties of two special classes of rectangular matrices A and B that have the relations A = PAQ {\rm and} B = -PBQ, \qquad A, B \in {\cal C}^{n \times m}, where P and Q are two generalized reflection matrices. The matrices A (B), a generalization of reflexive (antireflexive) matrices and centrosymmetric matrices, are referred to in this paper as generalized reflexive (antireflexive) matrices.After introducing these two classes of matrices and developing general theories associated with them, we then show how to use some of the important properties to decompose linear least-squares problems whose coefficient matrices are generalized reflexive into two smaller and independent subproblems. Numerical examples are presented to demonstrate their usefulness.