Matrix equation AXB = E with PX = sXP constraint

  • Qiu Yuyang 
  • Qiu Chunhan 
Article

Abstract

The matrix equation AXB = E with the constraint PX = sXP is considered, where P is a given Hermitian matrix satisfying P 2 = I and s = ±1. By an eignvalue decomposition of P, the constrained problem can be equivalently transformed to a well-known unconstrained problem of matrix equation whose coefficient matrices contain the corresponding eigenvector, and hence the constrained problem can be solved in terms of the eigenvectors of P. A simple and eigenvector-free formula of the general solutions to the constrained problem by generalized inverses of the coefficient matrices A and B is presented. Moreover, a similar problem of the matrix equation with generalized constraint is discussed.

Keywords

eigenvalue decomposition constrained problem existence condition form of the solution 

MR Subject Classification

15A06 15A18 15A23 15A24 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baksalary J K, Kala R. The matrix equation AXB + CYD = E, Linear Algebra Appl, 1980, 30: 141–147.MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Chu D, Moor B D. On a varitional formulation of the QSVD and RSVD, Linear Algebra Appl, 2000, 311: 61–78.MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Chu K E. Singular value and generalized singular value decompositions and solutions of linear matix equations, Linear Algebra Appl, 1987, 88/89: 83–98.CrossRefGoogle Scholar
  4. 4.
    Chu K E. Symmetric solutions of linear matrix equations by matrix decompositions, Linear Algebra Appl, 1989, 119: 35–50.MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Dai H. On the symmetric solutions of linear matrix equations, Linear Algebra Appl, 1990, 131: 1–7.MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Deng Y B, Hu X Y, Zhang L. Least squares solutions of BXA T = T over symmetric, skewsymmetric, and positive semidefinite X*, SIAM J Matrix Anal Appl, 2003, 25: 486–494.MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Liao A P, Bai Z Z, Lei Y. Best approximate solution of matrix equation AXB + CY D = E, SIAM J Matrix Anal Appl, 2005, 27: 675–688.MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Moor B D, Golub G H. Generalized singular value decompositions:a proposal for a standardized nomenclature, Zaterual Report, 89-10, ESAT-SISTA, Leuven, Belgium, 1989.Google Scholar
  9. 9.
    Özgüler A B. The equation AXB + CYD = E over a principle ideal domain, SIAM J Matrix Anal Appl, 1991, 12: 581–591.MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Paige C C, Saunders M A. Towards a generalized singular value decomposition, SIAM J Numer Anal, 1981, 18: 398–405.MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Paige C C. Computing the generalized singular value decomposition, SIAM J Sci Comput, 1986, 7: 1126–1146.MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Xu G P, Wei M S, Zheng D S. On solutions of matrix equation AXB + CYD = F, Linear Algebra Appl, 1998, 279: 93–109.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Editorial Committee of Applied Mathematics 2007

Authors and Affiliations

  • Qiu Yuyang 
    • 1
    • 2
  • Qiu Chunhan 
    • 2
  1. 1.Dept. of Math.Zhejiang Univ.HangzhouChina
  2. 2.College of Statist. and Math.Zhejiang Gongshang Univ.HangzhouChina

Personalised recommendations