数学季刊 ›› 2018, Vol. 33 ›› Issue (1): 32-42.doi: 10.13371/j.cnki.chin.q.j.m.2018.01.004

• • 上一篇    下一篇

矩阵方程组AX=C;XB=D{P;k+1}-反射解的研究

  

  1. 1. Collage of Mathematics and Information Science, Hebei Normal University2. School of Mathematics and Science, Hebei GEO University

The {P; k + 1}-reflexive Solution to System of Matrix Equations AX = C; XB = D

  1. 1. Collage of Mathematics and Information Science, Hebei Normal University2. School of Mathematics and Science, Hebei GEO University

摘要: Let P ∈ Cn×n be a Hermitian and {k + 1}-potent matrix, i.e., Pk+1= P = P*,where(·)*stands for the conjugate transpose of a matrix. A matrix X ∈ Cn×nis called{P, k + 1}-reflexive(anti-reflexive) if PXP = X(P XP =-X). The system of matrix equations AX = C, XB = D subject to {P, k + 1}-reflexive and anti-reflexive constraints are studied by converting into two simpler cases: k = 1 and k = 2, the least squares solution and the associated optimal approximation problem are also considered.

关键词: system of matrix equations, potent matrix, {P, k+1}-reflexive (anti-reflexive), approximation problem, least squares solution

Abstract: Let P ∈ Cn×n be a Hermitian and {k + 1}-potent matrix, i.e., Pk+1= P = P*,where(·)*stands for the conjugate transpose of a matrix. A matrix X ∈ Cn×nis called{P, k + 1}-reflexive(anti-reflexive) if PXP = X(P XP =-X). The system of matrix equations AX = C, XB = D subject to {P, k + 1}-reflexive and anti-reflexive constraints are studied by converting into two simpler cases: k = 1 and k = 2, the least squares solution and the associated optimal approximation problem are also considered.

Key words: system of matrix equations, potent matrix, {P, k+1}-reflexive (anti-reflexive), approximation problem, least squares solution

中图分类号: