网站大量收购独家精品文档,联系QQ:2885784924

关于矩阵方程AX=B的广义对称Procrustes问题.pdfVIP

关于矩阵方程AX=B的广义对称Procrustes问题.pdf

  1. 1、本文档共9页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
关于矩阵方程AX=B的广义对称Procrustes问题

The generalized symmetric procrustes problems associated with matrix equation AX = B Li-fang Dai1,2 , Mao-lin Liang2 ∗ † 1. School of Mathematics and Statistics, Lanzhou University Lanzhou, Gansu 730000, P. R. China 2. College of Mathematics and Statistics, Tianshui Normal University Tianshui, Gansu 741001, P. R. China Abstract For projective matrix R, i.e., R2 = R, we say that a matrix A is generalized projective symmetric (generalized projective Hermitian symmetric), if RAR = A (RAR = A∗). Denote by Ψ be the one of the two classes of matrix sets. In this paper, we establish the sufficient and necessary conditions for the consistence of matrix equation AX = B with unknown A∈ Ψ. Meanwhile, the inverse eigenvalue problem for the generalized projective symmetric matrices is solved as a special case. Moreover, when the solvability conditions does not hold, we consider the associated least-square problem of matrix equation AX = B , and derive the general expression of the solution. In addition, we also obtain the optimal approximation solution for given matrix in the solution set of the above matrix equation. AMS Classification : 15A24; 15A57; 65F35 Keywords : Matrix equation; Generalize projective (Hermitian) symmetric matrix; Least- squares problem; Inverse eigenvalue problem; Optimal approximation 1 Introduction We first introduce some symbols and notations to be used. Let Cm ×n be the set of all r m × n complex matrices with rank r , HCn ×n be the set of all n × n hermitian matrices. D

您可能关注的文档

文档评论(0)

wannian118 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档